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.r417-tall-171690555700073.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 gold2023
Input is StigmergyCommit-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690555700073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 17:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:44 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 359K 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-03b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717110976240

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-30 23:16:17] [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-30 23:16:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 23:16:18] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-30 23:16:18] [INFO ] Transformed 1231 places.
[2024-05-30 23:16:18] [INFO ] Transformed 1476 transitions.
[2024-05-30 23:16:18] [INFO ] Found NUPN structural information;
[2024-05-30 23:16:18] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA StigmergyCommit-PT-03b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 1231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 97 place count 1134 transition count 1379
Iterating global reduction 0 with 97 rules applied. Total rules applied 194 place count 1134 transition count 1379
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 254 place count 1074 transition count 1319
Iterating global reduction 0 with 60 rules applied. Total rules applied 314 place count 1074 transition count 1319
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 347 place count 1041 transition count 1286
Iterating global reduction 0 with 33 rules applied. Total rules applied 380 place count 1041 transition count 1286
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 407 place count 1014 transition count 1259
Iterating global reduction 0 with 27 rules applied. Total rules applied 434 place count 1014 transition count 1259
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 456 place count 992 transition count 1237
Iterating global reduction 0 with 22 rules applied. Total rules applied 478 place count 992 transition count 1237
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 500 place count 970 transition count 1215
Iterating global reduction 0 with 22 rules applied. Total rules applied 522 place count 970 transition count 1215
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 544 place count 948 transition count 1193
Iterating global reduction 0 with 22 rules applied. Total rules applied 566 place count 948 transition count 1193
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 588 place count 926 transition count 1171
Iterating global reduction 0 with 22 rules applied. Total rules applied 610 place count 926 transition count 1171
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 629 place count 907 transition count 1152
Iterating global reduction 0 with 19 rules applied. Total rules applied 648 place count 907 transition count 1152
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 663 place count 892 transition count 1137
Iterating global reduction 0 with 15 rules applied. Total rules applied 678 place count 892 transition count 1137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 680 place count 892 transition count 1135
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 687 place count 885 transition count 1128
Iterating global reduction 1 with 7 rules applied. Total rules applied 694 place count 885 transition count 1128
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 700 place count 879 transition count 1122
Iterating global reduction 1 with 6 rules applied. Total rules applied 706 place count 879 transition count 1122
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 709 place count 876 transition count 1119
Iterating global reduction 1 with 3 rules applied. Total rules applied 712 place count 876 transition count 1119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 714 place count 874 transition count 1117
Iterating global reduction 1 with 2 rules applied. Total rules applied 716 place count 874 transition count 1117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 718 place count 872 transition count 1115
Iterating global reduction 1 with 2 rules applied. Total rules applied 720 place count 872 transition count 1115
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 722 place count 870 transition count 1113
Iterating global reduction 1 with 2 rules applied. Total rules applied 724 place count 870 transition count 1113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 726 place count 868 transition count 1111
Iterating global reduction 1 with 2 rules applied. Total rules applied 728 place count 868 transition count 1111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 730 place count 866 transition count 1109
Iterating global reduction 1 with 2 rules applied. Total rules applied 732 place count 866 transition count 1109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 734 place count 864 transition count 1107
Iterating global reduction 1 with 2 rules applied. Total rules applied 736 place count 864 transition count 1107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 738 place count 862 transition count 1105
Iterating global reduction 1 with 2 rules applied. Total rules applied 740 place count 862 transition count 1105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 742 place count 860 transition count 1103
Iterating global reduction 1 with 2 rules applied. Total rules applied 744 place count 860 transition count 1103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 746 place count 858 transition count 1101
Iterating global reduction 1 with 2 rules applied. Total rules applied 748 place count 858 transition count 1101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 750 place count 858 transition count 1099
Applied a total of 750 rules in 1088 ms. Remains 858 /1231 variables (removed 373) and now considering 1099/1476 (removed 377) transitions.
// Phase 1: matrix 1099 rows 858 cols
[2024-05-30 23:16:19] [INFO ] Computed 5 invariants in 34 ms
[2024-05-30 23:16:19] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-30 23:16:19] [INFO ] Invariant cache hit.
[2024-05-30 23:16:20] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
[2024-05-30 23:16:20] [INFO ] Invariant cache hit.
[2024-05-30 23:16:20] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 858/1231 places, 1099/1476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2456 ms. Remains : 858/1231 places, 1099/1476 transitions.
Support contains 33 out of 858 places after structural reductions.
[2024-05-30 23:16:20] [INFO ] Flatten gal took : 89 ms
[2024-05-30 23:16:20] [INFO ] Flatten gal took : 49 ms
[2024-05-30 23:16:21] [INFO ] Input system was already deterministic with 1099 transitions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 26) seen :8
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-30 23:16:21] [INFO ] Invariant cache hit.
[2024-05-30 23:16:22] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-30 23:16:22] [INFO ] After 454ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:14
[2024-05-30 23:16:22] [INFO ] After 784ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4 real:14
Attempting to minimize the solution found.
Minimization took 178 ms.
[2024-05-30 23:16:23] [INFO ] After 1410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4 real:14
[2024-05-30 23:16:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-30 23:16:24] [INFO ] After 955ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-30 23:16:25] [INFO ] Deduced a trap composed of 297 places in 176 ms of which 1 ms to minimize.
[2024-05-30 23:16:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2024-05-30 23:16:25] [INFO ] Deduced a trap composed of 292 places in 182 ms of which 1 ms to minimize.
[2024-05-30 23:16:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2024-05-30 23:16:26] [INFO ] After 2598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 661 ms.
[2024-05-30 23:16:26] [INFO ] After 3846ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 8 properties in 167 ms.
Support contains 14 out of 858 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Graph (trivial) has 810 edges and 858 vertex of which 47 / 858 are part of one of the 9 SCC in 5 ms
Free SCC test removed 38 places
Drop transitions removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Graph (complete) has 1284 edges and 820 vertex of which 816 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 589 rules applied. Total rules applied 591 place count 816 transition count 458
Reduce places removed 585 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 600 rules applied. Total rules applied 1191 place count 231 transition count 443
Reduce places removed 6 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 2 with 28 rules applied. Total rules applied 1219 place count 225 transition count 421
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 24 rules applied. Total rules applied 1243 place count 203 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1244 place count 202 transition count 419
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 45 Pre rules applied. Total rules applied 1244 place count 202 transition count 374
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1334 place count 157 transition count 374
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1335 place count 156 transition count 373
Iterating global reduction 5 with 1 rules applied. Total rules applied 1336 place count 156 transition count 373
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1336 place count 156 transition count 372
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1338 place count 155 transition count 372
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 1398 place count 125 transition count 342
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1404 place count 125 transition count 336
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 1427 place count 102 transition count 184
Iterating global reduction 6 with 23 rules applied. Total rules applied 1450 place count 102 transition count 184
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1461 place count 102 transition count 173
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1471 place count 92 transition count 163
Iterating global reduction 7 with 10 rules applied. Total rules applied 1481 place count 92 transition count 163
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1489 place count 84 transition count 155
Iterating global reduction 7 with 8 rules applied. Total rules applied 1497 place count 84 transition count 155
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1501 place count 84 transition count 151
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 8 with 12 rules applied. Total rules applied 1513 place count 78 transition count 145
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1521 place count 74 transition count 166
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1522 place count 74 transition count 165
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 1533 place count 74 transition count 154
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1544 place count 63 transition count 154
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1547 place count 60 transition count 151
Iterating global reduction 9 with 3 rules applied. Total rules applied 1550 place count 60 transition count 151
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1558 place count 60 transition count 151
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1560 place count 60 transition count 149
Applied a total of 1560 rules in 114 ms. Remains 60 /858 variables (removed 798) and now considering 149/1099 (removed 950) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 60/858 places, 149/1099 transitions.
Incomplete random walk after 10000 steps, including 627 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 149 rows 60 cols
[2024-05-30 23:16:27] [INFO ] Computed 5 invariants in 5 ms
[2024-05-30 23:16:27] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-30 23:16:27] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-30 23:16:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-30 23:16:27] [INFO ] After 10ms SMT Verify possible using 57 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 23:16:27] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 23:16:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-30 23:16:27] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 23:16:27] [INFO ] After 12ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-30 23:16:27] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-30 23:16:27] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 21 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 165 stabilizing places and 173 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p1)&&p0) U X(p2)))'
Support contains 3 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 852 transition count 1093
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 852 transition count 1093
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 846 transition count 1087
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 846 transition count 1087
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 840 transition count 1081
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 840 transition count 1081
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 834 transition count 1075
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 834 transition count 1075
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 829 transition count 1070
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 829 transition count 1070
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 824 transition count 1065
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 824 transition count 1065
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 819 transition count 1060
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 819 transition count 1060
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 79 place count 819 transition count 1059
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 816 transition count 1056
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 816 transition count 1056
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 814 transition count 1054
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 814 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 814 transition count 1053
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 813 transition count 1052
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 813 transition count 1052
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 812 transition count 1051
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 812 transition count 1051
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 811 transition count 1050
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 811 transition count 1050
Applied a total of 96 rules in 519 ms. Remains 811 /858 variables (removed 47) and now considering 1050/1099 (removed 49) transitions.
// Phase 1: matrix 1050 rows 811 cols
[2024-05-30 23:16:28] [INFO ] Computed 5 invariants in 12 ms
[2024-05-30 23:16:28] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-30 23:16:28] [INFO ] Invariant cache hit.
[2024-05-30 23:16:29] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2024-05-30 23:16:29] [INFO ] Invariant cache hit.
[2024-05-30 23:16:29] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 811/858 places, 1050/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1578 ms. Remains : 811/858 places, 1050/1099 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 299 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s358 1) (EQ s515 1)), p1:(EQ s515 1), p2:(EQ s347 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-00 finished in 1942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0&&X(G((G((p2||X(p3)))||p1)))))))))'
Support contains 6 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 850 transition count 1091
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 850 transition count 1091
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 842 transition count 1083
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 842 transition count 1083
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 834 transition count 1075
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 834 transition count 1075
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 826 transition count 1067
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 826 transition count 1067
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 819 transition count 1060
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 819 transition count 1060
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 812 transition count 1053
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 812 transition count 1053
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 805 transition count 1046
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 805 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 805 transition count 1045
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 112 place count 800 transition count 1040
Iterating global reduction 1 with 5 rules applied. Total rules applied 117 place count 800 transition count 1040
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 796 transition count 1036
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 796 transition count 1036
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 796 transition count 1035
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 793 transition count 1032
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 793 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 133 place count 793 transition count 1031
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 791 transition count 1029
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 791 transition count 1029
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 791 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 790 transition count 1027
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 790 transition count 1027
Applied a total of 140 rules in 284 ms. Remains 790 /858 variables (removed 68) and now considering 1027/1099 (removed 72) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2024-05-30 23:16:30] [INFO ] Computed 5 invariants in 12 ms
[2024-05-30 23:16:30] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-30 23:16:30] [INFO ] Invariant cache hit.
[2024-05-30 23:16:30] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-05-30 23:16:30] [INFO ] Invariant cache hit.
[2024-05-30 23:16:31] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/858 places, 1027/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1335 ms. Remains : 790/858 places, 1027/1099 transitions.
Stuttering acceptance computed with spot in 418 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND p2 p3), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 7}]], initial=8, aps=[p0:(OR (NEQ s77 1) (NEQ s270 1) (NEQ s463 1) (NEQ s656 1)), p3:(NEQ s661 1), p2:(NEQ s401 1), p1:(OR (NEQ s77 1) (NEQ s270 1) (NEQ s463 1) (NEQ s656 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1285 reset in 237 ms.
Product exploration explored 100000 steps with 1287 reset in 187 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p3 p2 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 9 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Incomplete random walk after 10000 steps, including 130 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-30 23:16:33] [INFO ] Invariant cache hit.
[2024-05-30 23:16:33] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2024-05-30 23:16:33] [INFO ] After 368ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3 real:2
[2024-05-30 23:16:33] [INFO ] After 578ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:4
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-30 23:16:33] [INFO ] After 826ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:4
[2024-05-30 23:16:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-30 23:16:34] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-30 23:16:34] [INFO ] After 810ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 191 ms.
[2024-05-30 23:16:35] [INFO ] After 1216ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 10 ms.
Support contains 6 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Graph (trivial) has 780 edges and 790 vertex of which 61 / 790 are part of one of the 11 SCC in 2 ms
Free SCC test removed 50 places
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 1188 edges and 740 vertex of which 736 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 551 rules applied. Total rules applied 553 place count 736 transition count 408
Reduce places removed 547 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 561 rules applied. Total rules applied 1114 place count 189 transition count 394
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 1121 place count 184 transition count 392
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1123 place count 182 transition count 392
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1123 place count 182 transition count 346
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1215 place count 136 transition count 346
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1216 place count 136 transition count 345
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1274 place count 107 transition count 316
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1281 place count 107 transition count 309
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1305 place count 83 transition count 156
Iterating global reduction 6 with 24 rules applied. Total rules applied 1329 place count 83 transition count 156
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1342 place count 83 transition count 143
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1353 place count 72 transition count 132
Iterating global reduction 7 with 11 rules applied. Total rules applied 1364 place count 72 transition count 132
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1372 place count 64 transition count 124
Iterating global reduction 7 with 8 rules applied. Total rules applied 1380 place count 64 transition count 124
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1384 place count 64 transition count 120
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 8 with 10 rules applied. Total rules applied 1394 place count 59 transition count 115
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1402 place count 55 transition count 136
Free-agglomeration rule applied 21 times with reduction of 7 identical transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 1423 place count 55 transition count 108
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 1447 place count 34 transition count 105
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1451 place count 30 transition count 101
Iterating global reduction 9 with 4 rules applied. Total rules applied 1455 place count 30 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1456 place count 30 transition count 100
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 10 with 24 rules applied. Total rules applied 1480 place count 30 transition count 76
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 10 with 4 rules applied. Total rules applied 1484 place count 28 transition count 94
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1486 place count 28 transition count 92
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1488 place count 28 transition count 92
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1489 place count 28 transition count 91
Applied a total of 1489 rules in 67 ms. Remains 28 /790 variables (removed 762) and now considering 91/1027 (removed 936) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 28/790 places, 91/1027 transitions.
Finished random walk after 157 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=52 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p3 p2 p1), true]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p2 p3))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND (NOT p2) p3)), (F (NOT p3)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 219 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 9 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 381 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Support contains 6 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Applied a total of 0 rules in 20 ms. Remains 790 /790 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
[2024-05-30 23:16:36] [INFO ] Invariant cache hit.
[2024-05-30 23:16:36] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-30 23:16:36] [INFO ] Invariant cache hit.
[2024-05-30 23:16:36] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
[2024-05-30 23:16:36] [INFO ] Invariant cache hit.
[2024-05-30 23:16:37] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1074 ms. Remains : 790/790 places, 1027/1027 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p3 p2 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 9 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Incomplete random walk after 10000 steps, including 130 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-30 23:16:38] [INFO ] Invariant cache hit.
[2024-05-30 23:16:38] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-30 23:16:38] [INFO ] After 362ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3 real:2
[2024-05-30 23:16:38] [INFO ] After 558ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:4
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-30 23:16:38] [INFO ] After 782ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:4
[2024-05-30 23:16:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-30 23:16:39] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-30 23:16:39] [INFO ] After 758ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 198 ms.
[2024-05-30 23:16:40] [INFO ] After 1143ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 10 ms.
Support contains 6 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Graph (trivial) has 780 edges and 790 vertex of which 61 / 790 are part of one of the 11 SCC in 2 ms
Free SCC test removed 50 places
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 1188 edges and 740 vertex of which 736 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 551 rules applied. Total rules applied 553 place count 736 transition count 408
Reduce places removed 547 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 561 rules applied. Total rules applied 1114 place count 189 transition count 394
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 1121 place count 184 transition count 392
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1123 place count 182 transition count 392
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1123 place count 182 transition count 346
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1215 place count 136 transition count 346
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1216 place count 136 transition count 345
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1274 place count 107 transition count 316
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1281 place count 107 transition count 309
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1305 place count 83 transition count 156
Iterating global reduction 6 with 24 rules applied. Total rules applied 1329 place count 83 transition count 156
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1342 place count 83 transition count 143
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1353 place count 72 transition count 132
Iterating global reduction 7 with 11 rules applied. Total rules applied 1364 place count 72 transition count 132
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1372 place count 64 transition count 124
Iterating global reduction 7 with 8 rules applied. Total rules applied 1380 place count 64 transition count 124
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1384 place count 64 transition count 120
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 8 with 10 rules applied. Total rules applied 1394 place count 59 transition count 115
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1402 place count 55 transition count 136
Free-agglomeration rule applied 21 times with reduction of 7 identical transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 1423 place count 55 transition count 108
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 1447 place count 34 transition count 105
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1451 place count 30 transition count 101
Iterating global reduction 9 with 4 rules applied. Total rules applied 1455 place count 30 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1456 place count 30 transition count 100
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 10 with 24 rules applied. Total rules applied 1480 place count 30 transition count 76
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 10 with 4 rules applied. Total rules applied 1484 place count 28 transition count 94
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1486 place count 28 transition count 92
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1488 place count 28 transition count 92
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1489 place count 28 transition count 91
Applied a total of 1489 rules in 62 ms. Remains 28 /790 variables (removed 762) and now considering 91/1027 (removed 936) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 28/790 places, 91/1027 transitions.
Finished random walk after 1485 steps, including 0 resets, run visited all 3 properties in 15 ms. (steps per millisecond=99 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p3 p2 p1), true]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p2 p3))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND (NOT p2) p3)), (F (NOT p3)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 475 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 9 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 399 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 353 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 1275 reset in 135 ms.
Product exploration explored 100000 steps with 1289 reset in 142 ms.
Built C files in :
/tmp/ltsmin7926579639133852653
[2024-05-30 23:16:42] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7926579639133852653
Running compilation step : cd /tmp/ltsmin7926579639133852653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1687 ms.
Running link step : cd /tmp/ltsmin7926579639133852653;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin7926579639133852653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7973346896562111522.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Applied a total of 0 rules in 16 ms. Remains 790 /790 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
[2024-05-30 23:16:57] [INFO ] Invariant cache hit.
[2024-05-30 23:16:57] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-30 23:16:57] [INFO ] Invariant cache hit.
[2024-05-30 23:16:57] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2024-05-30 23:16:57] [INFO ] Invariant cache hit.
[2024-05-30 23:16:58] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1043 ms. Remains : 790/790 places, 1027/1027 transitions.
Built C files in :
/tmp/ltsmin12951920256863008038
[2024-05-30 23:16:58] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12951920256863008038
Running compilation step : cd /tmp/ltsmin12951920256863008038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1597 ms.
Running link step : cd /tmp/ltsmin12951920256863008038;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12951920256863008038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10765151515412428640.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 23:17:13] [INFO ] Flatten gal took : 43 ms
[2024-05-30 23:17:13] [INFO ] Flatten gal took : 36 ms
[2024-05-30 23:17:13] [INFO ] Time to serialize gal into /tmp/LTL6022127839408368143.gal : 9 ms
[2024-05-30 23:17:13] [INFO ] Time to serialize properties into /tmp/LTL6755887525071274572.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6022127839408368143.gal' '-t' 'CGAL' '-hoa' '/tmp/aut959405110843601638.hoa' '-atoms' '/tmp/LTL6755887525071274572.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL6755887525071274572.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut959405110843601638.hoa
Detected timeout of ITS tools.
[2024-05-30 23:17:28] [INFO ] Flatten gal took : 31 ms
[2024-05-30 23:17:28] [INFO ] Flatten gal took : 29 ms
[2024-05-30 23:17:28] [INFO ] Time to serialize gal into /tmp/LTL8094721176273502640.gal : 5 ms
[2024-05-30 23:17:28] [INFO ] Time to serialize properties into /tmp/LTL239259378960697360.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8094721176273502640.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL239259378960697360.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X((X(G(("(((p94!=1)||(p396!=1))||((p698!=1)||(p1000!=1)))")||(G(("(p622!=1)")||(X("(p1005!=1)")))))))&&("(((p94!=1)||(p396!=1...191
Formula 0 simplified : XXXX(!"(((p94!=1)||(p396!=1))||((p698!=1)||(p1000!=1)))" | XF(!"(((p94!=1)||(p396!=1))||((p698!=1)||(p1000!=1)))" & F(!"(p622!=1)" &...173
Detected timeout of ITS tools.
[2024-05-30 23:17:43] [INFO ] Flatten gal took : 33 ms
[2024-05-30 23:17:43] [INFO ] Applying decomposition
[2024-05-30 23:17:43] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2662923983274989510.txt' '-o' '/tmp/graph2662923983274989510.bin' '-w' '/tmp/graph2662923983274989510.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2662923983274989510.bin' '-l' '-1' '-v' '-w' '/tmp/graph2662923983274989510.weights' '-q' '0' '-e' '0.001'
[2024-05-30 23:17:44] [INFO ] Decomposing Gal with order
[2024-05-30 23:17:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 23:17:44] [INFO ] Removed a total of 854 redundant transitions.
[2024-05-30 23:17:44] [INFO ] Flatten gal took : 96 ms
[2024-05-30 23:17:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 13 ms.
[2024-05-30 23:17:44] [INFO ] Time to serialize gal into /tmp/LTL9113954295821502089.gal : 13 ms
[2024-05-30 23:17:44] [INFO ] Time to serialize properties into /tmp/LTL10543775146142123875.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9113954295821502089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10543775146142123875.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X((X(G(("(((i1.u32.p94!=1)||(i1.u111.p396!=1))||((i1.u190.p698!=1)||(i1.u274.p1000!=1)))")||(G(("(i18.u162.p622!=1)")||(X("(i...277
Formula 0 simplified : XXXX(!"(((i1.u32.p94!=1)||(i1.u111.p396!=1))||((i1.u190.p698!=1)||(i1.u274.p1000!=1)))" | XF(!"(((i1.u32.p94!=1)||(i1.u111.p396!=1))...259
Reverse transition relation is NOT exact ! Due to transitions t78, t174, t175, t231, t265, t292, t348, t404, t439, t605, t638, t732, t788, t808, t809, t813...600
Computing Next relation with stutter on 81276 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11730137985700835083
[2024-05-30 23:17:59] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11730137985700835083
Running compilation step : cd /tmp/ltsmin11730137985700835083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1597 ms.
Running link step : cd /tmp/ltsmin11730137985700835083;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11730137985700835083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X((X([](([](((LTLAPp1==true)||X((LTLAPp2==true))))||(LTLAPp0==true))))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-02 finished in 104571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(p0) U p1))'
Support contains 2 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 851 transition count 1092
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 851 transition count 1092
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 844 transition count 1085
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 844 transition count 1085
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 837 transition count 1078
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 837 transition count 1078
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 830 transition count 1071
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 830 transition count 1071
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 824 transition count 1065
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 824 transition count 1065
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 818 transition count 1059
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 818 transition count 1059
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 812 transition count 1053
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 812 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 812 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 808 transition count 1048
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 808 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 805 transition count 1045
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 805 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 802 transition count 1042
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 802 transition count 1042
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 114 place count 802 transition count 1041
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 800 transition count 1039
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 800 transition count 1039
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 800 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 799 transition count 1037
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 799 transition count 1037
Applied a total of 121 rules in 254 ms. Remains 799 /858 variables (removed 59) and now considering 1037/1099 (removed 62) transitions.
// Phase 1: matrix 1037 rows 799 cols
[2024-05-30 23:18:14] [INFO ] Computed 5 invariants in 11 ms
[2024-05-30 23:18:14] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-30 23:18:14] [INFO ] Invariant cache hit.
[2024-05-30 23:18:15] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2024-05-30 23:18:15] [INFO ] Invariant cache hit.
[2024-05-30 23:18:15] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 799/858 places, 1037/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1350 ms. Remains : 799/858 places, 1037/1099 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s733 1), p0:(EQ s543 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 81 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-03 finished in 1466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 2 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 852 transition count 1093
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 852 transition count 1093
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 846 transition count 1087
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 846 transition count 1087
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 840 transition count 1081
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 840 transition count 1081
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 834 transition count 1075
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 834 transition count 1075
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 828 transition count 1069
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 828 transition count 1069
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 822 transition count 1063
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 822 transition count 1063
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 816 transition count 1057
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 816 transition count 1057
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 816 transition count 1056
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 812 transition count 1052
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 812 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 808 transition count 1048
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 808 transition count 1048
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 808 transition count 1047
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 805 transition count 1044
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 805 transition count 1044
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 805 transition count 1043
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 803 transition count 1041
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 803 transition count 1041
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 803 transition count 1040
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 802 transition count 1039
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 802 transition count 1039
Applied a total of 116 rules in 261 ms. Remains 802 /858 variables (removed 56) and now considering 1039/1099 (removed 60) transitions.
// Phase 1: matrix 1039 rows 802 cols
[2024-05-30 23:18:16] [INFO ] Computed 5 invariants in 21 ms
[2024-05-30 23:18:16] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-30 23:18:16] [INFO ] Invariant cache hit.
[2024-05-30 23:18:16] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2024-05-30 23:18:16] [INFO ] Invariant cache hit.
[2024-05-30 23:18:17] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 802/858 places, 1039/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1368 ms. Remains : 802/858 places, 1039/1099 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s331 1), p1:(EQ s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-05 finished in 1519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 4 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 850 transition count 1091
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 850 transition count 1091
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 842 transition count 1083
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 842 transition count 1083
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 834 transition count 1075
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 834 transition count 1075
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 826 transition count 1067
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 826 transition count 1067
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 819 transition count 1060
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 819 transition count 1060
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 812 transition count 1053
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 812 transition count 1053
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 805 transition count 1046
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 805 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 805 transition count 1045
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 112 place count 800 transition count 1040
Iterating global reduction 1 with 5 rules applied. Total rules applied 117 place count 800 transition count 1040
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 796 transition count 1036
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 796 transition count 1036
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 796 transition count 1035
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 793 transition count 1032
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 793 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 133 place count 793 transition count 1031
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 791 transition count 1029
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 791 transition count 1029
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 791 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 790 transition count 1027
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 790 transition count 1027
Applied a total of 140 rules in 252 ms. Remains 790 /858 variables (removed 68) and now considering 1027/1099 (removed 72) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2024-05-30 23:18:17] [INFO ] Computed 5 invariants in 11 ms
[2024-05-30 23:18:17] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-30 23:18:17] [INFO ] Invariant cache hit.
[2024-05-30 23:18:18] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2024-05-30 23:18:18] [INFO ] Invariant cache hit.
[2024-05-30 23:18:18] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/858 places, 1027/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1314 ms. Remains : 790/858 places, 1027/1099 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s42 0) (EQ s235 0) (EQ s407 0) (EQ s621 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1287 reset in 157 ms.
Product exploration explored 100000 steps with 1282 reset in 162 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 426 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 131 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 969171 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 969171 steps, saw 182258 distinct states, run finished after 3004 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-30 23:18:22] [INFO ] Invariant cache hit.
[2024-05-30 23:18:22] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 23:18:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-30 23:18:23] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 23:18:23] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-30 23:18:23] [INFO ] After 534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 150 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=75 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Applied a total of 0 rules in 22 ms. Remains 790 /790 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
[2024-05-30 23:18:23] [INFO ] Invariant cache hit.
[2024-05-30 23:18:24] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-30 23:18:24] [INFO ] Invariant cache hit.
[2024-05-30 23:18:24] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2024-05-30 23:18:24] [INFO ] Invariant cache hit.
[2024-05-30 23:18:25] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1051 ms. Remains : 790/790 places, 1027/1027 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 465 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 127 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 990980 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 990980 steps, saw 186407 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-30 23:18:28] [INFO ] Invariant cache hit.
[2024-05-30 23:18:28] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 23:18:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-30 23:18:29] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 23:18:29] [INFO ] After 350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-30 23:18:29] [INFO ] After 508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 150 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=150 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1274 reset in 121 ms.
Product exploration explored 100000 steps with 1285 reset in 144 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Graph (trivial) has 785 edges and 790 vertex of which 68 / 790 are part of one of the 12 SCC in 2 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Performed 541 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 541 rules applied. Total rules applied 542 place count 734 transition count 963
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 550 place count 734 transition count 955
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 550 place count 734 transition count 959
Deduced a syphon composed of 573 places in 0 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 582 place count 734 transition count 959
Discarding 486 places :
Symmetric choice reduction at 2 with 486 rule applications. Total rules 1068 place count 248 transition count 473
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 2 with 486 rules applied. Total rules applied 1554 place count 248 transition count 473
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 1599 place count 248 transition count 485
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 1670 place count 177 transition count 316
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 71 rules applied. Total rules applied 1741 place count 177 transition count 316
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 1755 place count 177 transition count 302
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1785 place count 147 transition count 268
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 3 with 30 rules applied. Total rules applied 1815 place count 147 transition count 268
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1827 place count 135 transition count 256
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1839 place count 135 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1843 place count 135 transition count 252
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1851 place count 127 transition count 244
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 1859 place count 127 transition count 244
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1866 place count 127 transition count 279
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1877 place count 116 transition count 257
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1888 place count 116 transition count 257
Deduced a syphon composed of 56 places in 0 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 1896 place count 116 transition count 249
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 1896 rules in 94 ms. Remains 116 /790 variables (removed 674) and now considering 249/1027 (removed 778) transitions.
[2024-05-30 23:18:30] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-30 23:18:30] [INFO ] Flow matrix only has 244 transitions (discarded 5 similar events)
// Phase 1: matrix 244 rows 116 cols
[2024-05-30 23:18:30] [INFO ] Computed 2 invariants in 7 ms
[2024-05-30 23:18:30] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/790 places, 249/1027 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 116/790 places, 249/1027 transitions.
Built C files in :
/tmp/ltsmin13687211854066493768
[2024-05-30 23:18:30] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13687211854066493768
Running compilation step : cd /tmp/ltsmin13687211854066493768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1681 ms.
Running link step : cd /tmp/ltsmin13687211854066493768;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin13687211854066493768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased482665529819619851.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Applied a total of 0 rules in 35 ms. Remains 790 /790 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2024-05-30 23:18:45] [INFO ] Computed 5 invariants in 15 ms
[2024-05-30 23:18:45] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-30 23:18:45] [INFO ] Invariant cache hit.
[2024-05-30 23:18:46] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2024-05-30 23:18:46] [INFO ] Invariant cache hit.
[2024-05-30 23:18:46] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1083 ms. Remains : 790/790 places, 1027/1027 transitions.
Built C files in :
/tmp/ltsmin5326015123462120315
[2024-05-30 23:18:46] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5326015123462120315
Running compilation step : cd /tmp/ltsmin5326015123462120315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1590 ms.
Running link step : cd /tmp/ltsmin5326015123462120315;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5326015123462120315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15272084444498185184.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 23:19:01] [INFO ] Flatten gal took : 25 ms
[2024-05-30 23:19:02] [INFO ] Flatten gal took : 23 ms
[2024-05-30 23:19:02] [INFO ] Time to serialize gal into /tmp/LTL16960942116380249054.gal : 4 ms
[2024-05-30 23:19:02] [INFO ] Time to serialize properties into /tmp/LTL15524167369555203082.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16960942116380249054.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17899717105101409554.hoa' '-atoms' '/tmp/LTL15524167369555203082.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15524167369555203082.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17899717105101409554.hoa
Detected timeout of ITS tools.
[2024-05-30 23:19:17] [INFO ] Flatten gal took : 21 ms
[2024-05-30 23:19:17] [INFO ] Flatten gal took : 21 ms
[2024-05-30 23:19:17] [INFO ] Time to serialize gal into /tmp/LTL14528543307299269892.gal : 4 ms
[2024-05-30 23:19:17] [INFO ] Time to serialize properties into /tmp/LTL9313308654781915431.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14528543307299269892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9313308654781915431.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(((p49==0)||(p351==0))||((p631==0)||(p955==0)))"))))))
Formula 0 simplified : XXXF!"(((p49==0)||(p351==0))||((p631==0)||(p955==0)))"
Detected timeout of ITS tools.
[2024-05-30 23:19:32] [INFO ] Flatten gal took : 37 ms
[2024-05-30 23:19:32] [INFO ] Applying decomposition
[2024-05-30 23:19:32] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15033313434197761773.txt' '-o' '/tmp/graph15033313434197761773.bin' '-w' '/tmp/graph15033313434197761773.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15033313434197761773.bin' '-l' '-1' '-v' '-w' '/tmp/graph15033313434197761773.weights' '-q' '0' '-e' '0.001'
[2024-05-30 23:19:32] [INFO ] Decomposing Gal with order
[2024-05-30 23:19:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 23:19:32] [INFO ] Removed a total of 854 redundant transitions.
[2024-05-30 23:19:32] [INFO ] Flatten gal took : 66 ms
[2024-05-30 23:19:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2024-05-30 23:19:32] [INFO ] Time to serialize gal into /tmp/LTL6263996340093769528.gal : 7 ms
[2024-05-30 23:19:32] [INFO ] Time to serialize properties into /tmp/LTL158252807965994056.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6263996340093769528.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL158252807965994056.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(((i0.u2.p49==0)||(i0.u83.p351==0))||((i0.u169.p631==0)||(i0.u254.p955==0)))"))))))
Formula 0 simplified : XXXF!"(((i0.u2.p49==0)||(i0.u83.p351==0))||((i0.u169.p631==0)||(i0.u254.p955==0)))"
Reverse transition relation is NOT exact ! Due to transitions t78, t175, t231, t265, t348, t439, t493, t605, t638, t788, t808, t809, t813, t816, t819, t820...591
Computing Next relation with stutter on 81276 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1298945302551111906
[2024-05-30 23:19:47] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1298945302551111906
Running compilation step : cd /tmp/ltsmin1298945302551111906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1582 ms.
Running link step : cd /tmp/ltsmin1298945302551111906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1298945302551111906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-07 finished in 105161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 5 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 851 transition count 1092
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 851 transition count 1092
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 844 transition count 1085
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 844 transition count 1085
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 837 transition count 1078
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 837 transition count 1078
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 830 transition count 1071
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 830 transition count 1071
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 824 transition count 1065
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 824 transition count 1065
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 818 transition count 1059
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 818 transition count 1059
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 812 transition count 1053
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 812 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 812 transition count 1052
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 98 place count 807 transition count 1047
Iterating global reduction 1 with 5 rules applied. Total rules applied 103 place count 807 transition count 1047
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 107 place count 803 transition count 1043
Iterating global reduction 1 with 4 rules applied. Total rules applied 111 place count 803 transition count 1043
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 112 place count 803 transition count 1042
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 800 transition count 1039
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 800 transition count 1039
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 798 transition count 1037
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 798 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 798 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 797 transition count 1035
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 797 transition count 1035
Applied a total of 125 rules in 197 ms. Remains 797 /858 variables (removed 61) and now considering 1035/1099 (removed 64) transitions.
// Phase 1: matrix 1035 rows 797 cols
[2024-05-30 23:20:02] [INFO ] Computed 5 invariants in 12 ms
[2024-05-30 23:20:03] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-30 23:20:03] [INFO ] Invariant cache hit.
[2024-05-30 23:20:03] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2024-05-30 23:20:03] [INFO ] Invariant cache hit.
[2024-05-30 23:20:03] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 797/858 places, 1035/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1228 ms. Remains : 797/858 places, 1035/1099 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(EQ s347 0), p0:(AND (EQ s63 1) (EQ s235 1) (EQ s435 1) (EQ s628 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1275 reset in 136 ms.
Product exploration explored 100000 steps with 1279 reset in 141 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 132 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 654287 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 654287 steps, saw 124464 distinct states, run finished after 3004 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-30 23:20:07] [INFO ] Invariant cache hit.
[2024-05-30 23:20:07] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-30 23:20:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-30 23:20:08] [INFO ] After 386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-30 23:20:08] [INFO ] Deduced a trap composed of 302 places in 230 ms of which 1 ms to minimize.
[2024-05-30 23:20:08] [INFO ] Deduced a trap composed of 299 places in 219 ms of which 1 ms to minimize.
[2024-05-30 23:20:09] [INFO ] Deduced a trap composed of 299 places in 193 ms of which 1 ms to minimize.
[2024-05-30 23:20:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 791 ms
[2024-05-30 23:20:09] [INFO ] After 1279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 80 ms.
[2024-05-30 23:20:09] [INFO ] After 1504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Graph (trivial) has 791 edges and 797 vertex of which 68 / 797 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1188 edges and 741 vertex of which 737 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 554 transitions
Trivial Post-agglo rules discarded 554 transitions
Performed 554 trivial Post agglomeration. Transition count delta: 554
Iterating post reduction 0 with 558 rules applied. Total rules applied 560 place count 737 transition count 401
Reduce places removed 554 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 566 rules applied. Total rules applied 1126 place count 183 transition count 389
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1130 place count 179 transition count 389
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1130 place count 179 transition count 344
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1220 place count 134 transition count 344
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1221 place count 134 transition count 343
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1279 place count 105 transition count 314
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1287 place count 105 transition count 306
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1308 place count 84 transition count 217
Iterating global reduction 5 with 21 rules applied. Total rules applied 1329 place count 84 transition count 217
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1338 place count 84 transition count 208
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1350 place count 72 transition count 196
Iterating global reduction 6 with 12 rules applied. Total rules applied 1362 place count 72 transition count 196
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1370 place count 64 transition count 188
Iterating global reduction 6 with 8 rules applied. Total rules applied 1378 place count 64 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1382 place count 64 transition count 184
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1390 place count 60 transition count 180
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1398 place count 56 transition count 201
Free-agglomeration rule applied 26 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1424 place count 56 transition count 168
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 44 rules applied. Total rules applied 1468 place count 30 transition count 150
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1472 place count 26 transition count 146
Iterating global reduction 8 with 4 rules applied. Total rules applied 1476 place count 26 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1477 place count 26 transition count 145
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 9 with 61 rules applied. Total rules applied 1538 place count 26 transition count 84
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 9 with 4 rules applied. Total rules applied 1542 place count 24 transition count 102
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1548 place count 24 transition count 96
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1550 place count 24 transition count 96
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1551 place count 24 transition count 95
Applied a total of 1551 rules in 58 ms. Remains 24 /797 variables (removed 773) and now considering 95/1035 (removed 940) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 24/797 places, 95/1035 transitions.
Finished random walk after 26 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Applied a total of 0 rules in 21 ms. Remains 797 /797 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
[2024-05-30 23:20:09] [INFO ] Invariant cache hit.
[2024-05-30 23:20:09] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-30 23:20:09] [INFO ] Invariant cache hit.
[2024-05-30 23:20:10] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2024-05-30 23:20:10] [INFO ] Invariant cache hit.
[2024-05-30 23:20:10] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1049 ms. Remains : 797/797 places, 1035/1035 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 127 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 640270 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 640270 steps, saw 122046 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-30 23:20:14] [INFO ] Invariant cache hit.
[2024-05-30 23:20:14] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-30 23:20:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-30 23:20:14] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-30 23:20:15] [INFO ] Deduced a trap composed of 302 places in 307 ms of which 1 ms to minimize.
[2024-05-30 23:20:15] [INFO ] Deduced a trap composed of 299 places in 218 ms of which 0 ms to minimize.
[2024-05-30 23:20:15] [INFO ] Deduced a trap composed of 299 places in 217 ms of which 0 ms to minimize.
[2024-05-30 23:20:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 889 ms
[2024-05-30 23:20:15] [INFO ] After 1351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-30 23:20:15] [INFO ] After 1556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Graph (trivial) has 791 edges and 797 vertex of which 68 / 797 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1188 edges and 741 vertex of which 737 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 554 transitions
Trivial Post-agglo rules discarded 554 transitions
Performed 554 trivial Post agglomeration. Transition count delta: 554
Iterating post reduction 0 with 558 rules applied. Total rules applied 560 place count 737 transition count 401
Reduce places removed 554 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 566 rules applied. Total rules applied 1126 place count 183 transition count 389
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1130 place count 179 transition count 389
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1130 place count 179 transition count 344
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1220 place count 134 transition count 344
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1221 place count 134 transition count 343
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1279 place count 105 transition count 314
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1287 place count 105 transition count 306
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1308 place count 84 transition count 217
Iterating global reduction 5 with 21 rules applied. Total rules applied 1329 place count 84 transition count 217
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1338 place count 84 transition count 208
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1350 place count 72 transition count 196
Iterating global reduction 6 with 12 rules applied. Total rules applied 1362 place count 72 transition count 196
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1370 place count 64 transition count 188
Iterating global reduction 6 with 8 rules applied. Total rules applied 1378 place count 64 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1382 place count 64 transition count 184
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1390 place count 60 transition count 180
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1398 place count 56 transition count 201
Free-agglomeration rule applied 26 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1424 place count 56 transition count 168
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 44 rules applied. Total rules applied 1468 place count 30 transition count 150
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1472 place count 26 transition count 146
Iterating global reduction 8 with 4 rules applied. Total rules applied 1476 place count 26 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1477 place count 26 transition count 145
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 9 with 61 rules applied. Total rules applied 1538 place count 26 transition count 84
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 9 with 4 rules applied. Total rules applied 1542 place count 24 transition count 102
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1548 place count 24 transition count 96
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1550 place count 24 transition count 96
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1551 place count 24 transition count 95
Applied a total of 1551 rules in 43 ms. Remains 24 /797 variables (removed 773) and now considering 95/1035 (removed 940) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 24/797 places, 95/1035 transitions.
Finished random walk after 43 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1286 reset in 139 ms.
Product exploration explored 100000 steps with 1282 reset in 144 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Graph (trivial) has 791 edges and 797 vertex of which 68 / 797 are part of one of the 12 SCC in 2 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Performed 546 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 546 rules applied. Total rules applied 547 place count 741 transition count 971
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 555 place count 741 transition count 963
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 555 place count 741 transition count 967
Deduced a syphon composed of 578 places in 1 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 587 place count 741 transition count 967
Discarding 490 places :
Symmetric choice reduction at 2 with 490 rule applications. Total rules 1077 place count 251 transition count 477
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 2 with 490 rules applied. Total rules applied 1567 place count 251 transition count 477
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 1612 place count 251 transition count 490
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 1682 place count 181 transition count 348
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 1752 place count 181 transition count 348
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1765 place count 181 transition count 335
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1794 place count 152 transition count 302
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 3 with 29 rules applied. Total rules applied 1823 place count 152 transition count 302
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1835 place count 140 transition count 290
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1847 place count 140 transition count 290
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1851 place count 140 transition count 286
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1859 place count 132 transition count 278
Deduced a syphon composed of 62 places in 1 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 1867 place count 132 transition count 278
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1874 place count 132 transition count 313
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1885 place count 121 transition count 291
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1896 place count 121 transition count 291
Deduced a syphon composed of 58 places in 0 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 1904 place count 121 transition count 283
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 1904 rules in 78 ms. Remains 121 /797 variables (removed 676) and now considering 283/1035 (removed 752) transitions.
[2024-05-30 23:20:16] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-30 23:20:16] [INFO ] Flow matrix only has 278 transitions (discarded 5 similar events)
// Phase 1: matrix 278 rows 121 cols
[2024-05-30 23:20:16] [INFO ] Computed 2 invariants in 2 ms
[2024-05-30 23:20:16] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/797 places, 283/1035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 206 ms. Remains : 121/797 places, 283/1035 transitions.
Built C files in :
/tmp/ltsmin9895629435644769895
[2024-05-30 23:20:17] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9895629435644769895
Running compilation step : cd /tmp/ltsmin9895629435644769895;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1648 ms.
Running link step : cd /tmp/ltsmin9895629435644769895;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9895629435644769895;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased596256605716257862.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Applied a total of 0 rules in 19 ms. Remains 797 /797 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
// Phase 1: matrix 1035 rows 797 cols
[2024-05-30 23:20:32] [INFO ] Computed 5 invariants in 10 ms
[2024-05-30 23:20:32] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-30 23:20:32] [INFO ] Invariant cache hit.
[2024-05-30 23:20:32] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2024-05-30 23:20:32] [INFO ] Invariant cache hit.
[2024-05-30 23:20:33] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1070 ms. Remains : 797/797 places, 1035/1035 transitions.
Built C files in :
/tmp/ltsmin5720887606423739862
[2024-05-30 23:20:33] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5720887606423739862
Running compilation step : cd /tmp/ltsmin5720887606423739862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1619 ms.
Running link step : cd /tmp/ltsmin5720887606423739862;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5720887606423739862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8492512267011870199.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 23:20:48] [INFO ] Flatten gal took : 21 ms
[2024-05-30 23:20:48] [INFO ] Flatten gal took : 21 ms
[2024-05-30 23:20:48] [INFO ] Time to serialize gal into /tmp/LTL9732358388513293250.gal : 4 ms
[2024-05-30 23:20:48] [INFO ] Time to serialize properties into /tmp/LTL12578087958978699847.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9732358388513293250.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2530174786135470726.hoa' '-atoms' '/tmp/LTL12578087958978699847.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12578087958978699847.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2530174786135470726.hoa
Detected timeout of ITS tools.
[2024-05-30 23:21:03] [INFO ] Flatten gal took : 21 ms
[2024-05-30 23:21:03] [INFO ] Flatten gal took : 21 ms
[2024-05-30 23:21:03] [INFO ] Time to serialize gal into /tmp/LTL10277376280364857857.gal : 5 ms
[2024-05-30 23:21:03] [INFO ] Time to serialize properties into /tmp/LTL1350761056101070284.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10277376280364857857.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1350761056101070284.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(p513==0)"))||("(((p72==1)&&(p351==1))&&((p653==1)&&(p955==1)))"))))))
Formula 0 simplified : XXG(!"(((p72==1)&&(p351==1))&&((p653==1)&&(p955==1)))" & F!"(p513==0)")
Detected timeout of ITS tools.
[2024-05-30 23:21:18] [INFO ] Flatten gal took : 21 ms
[2024-05-30 23:21:18] [INFO ] Applying decomposition
[2024-05-30 23:21:18] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6103710734837355105.txt' '-o' '/tmp/graph6103710734837355105.bin' '-w' '/tmp/graph6103710734837355105.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6103710734837355105.bin' '-l' '-1' '-v' '-w' '/tmp/graph6103710734837355105.weights' '-q' '0' '-e' '0.001'
[2024-05-30 23:21:18] [INFO ] Decomposing Gal with order
[2024-05-30 23:21:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 23:21:18] [INFO ] Removed a total of 857 redundant transitions.
[2024-05-30 23:21:18] [INFO ] Flatten gal took : 42 ms
[2024-05-30 23:21:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 8 ms.
[2024-05-30 23:21:18] [INFO ] Time to serialize gal into /tmp/LTL11109984748175181947.gal : 7 ms
[2024-05-30 23:21:18] [INFO ] Time to serialize properties into /tmp/LTL2465758452446836669.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11109984748175181947.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2465758452446836669.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(i14.u146.p513==0)"))||("(((i0.u4.p72==1)&&(i0.u81.p351==1))&&((i0.u166.p653==1)&&(i0.u244.p955==1)))"))))))
Formula 0 simplified : XXG(!"(((i0.u4.p72==1)&&(i0.u81.p351==1))&&((i0.u166.p653==1)&&(i0.u244.p955==1)))" & F!"(i14.u146.p513==0)")
Reverse transition relation is NOT exact ! Due to transitions t78, t231, t265, t348, t439, t605, t638, t732, t808, t809, t813, t816, t819, t820, t825, t828...595
Computing Next relation with stutter on 81276 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7791294923860606577
[2024-05-30 23:21:33] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7791294923860606577
Running compilation step : cd /tmp/ltsmin7791294923860606577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1668 ms.
Running link step : cd /tmp/ltsmin7791294923860606577;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7791294923860606577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([]((LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-08 finished in 106230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((p0||G(p1)))) U p2)))'
Support contains 6 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 851 transition count 1092
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 851 transition count 1092
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 844 transition count 1085
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 844 transition count 1085
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 837 transition count 1078
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 837 transition count 1078
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 830 transition count 1071
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 830 transition count 1071
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 824 transition count 1065
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 824 transition count 1065
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 818 transition count 1059
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 818 transition count 1059
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 812 transition count 1053
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 812 transition count 1053
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 807 transition count 1048
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 807 transition count 1048
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 106 place count 803 transition count 1044
Iterating global reduction 0 with 4 rules applied. Total rules applied 110 place count 803 transition count 1044
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 111 place count 803 transition count 1043
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 114 place count 800 transition count 1040
Iterating global reduction 1 with 3 rules applied. Total rules applied 117 place count 800 transition count 1040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 118 place count 800 transition count 1039
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 798 transition count 1037
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 798 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 798 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 797 transition count 1035
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 797 transition count 1035
Applied a total of 125 rules in 188 ms. Remains 797 /858 variables (removed 61) and now considering 1035/1099 (removed 64) transitions.
// Phase 1: matrix 1035 rows 797 cols
[2024-05-30 23:21:49] [INFO ] Computed 5 invariants in 12 ms
[2024-05-30 23:21:49] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-30 23:21:49] [INFO ] Invariant cache hit.
[2024-05-30 23:21:49] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-05-30 23:21:49] [INFO ] Invariant cache hit.
[2024-05-30 23:21:50] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 797/858 places, 1035/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1224 ms. Remains : 797/858 places, 1035/1099 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s61 1), p1:(NEQ s733 1), p0:(AND (EQ s156 1) (EQ s350 1) (EQ s543 1) (EQ s743 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1291 reset in 118 ms.
Product exploration explored 100000 steps with 1277 reset in 186 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 112 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
Incomplete random walk after 10000 steps, including 132 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-30 23:21:51] [INFO ] Invariant cache hit.
[2024-05-30 23:21:51] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2024-05-30 23:21:51] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2024-05-30 23:21:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-30 23:21:52] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-30 23:21:52] [INFO ] Deduced a trap composed of 297 places in 184 ms of which 0 ms to minimize.
[2024-05-30 23:21:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2024-05-30 23:21:52] [INFO ] After 929ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 183 ms.
[2024-05-30 23:21:52] [INFO ] After 1309ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 6 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Graph (trivial) has 768 edges and 797 vertex of which 68 / 797 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1188 edges and 741 vertex of which 737 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 537 transitions
Trivial Post-agglo rules discarded 537 transitions
Performed 537 trivial Post agglomeration. Transition count delta: 537
Iterating post reduction 0 with 541 rules applied. Total rules applied 543 place count 737 transition count 418
Reduce places removed 537 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 549 rules applied. Total rules applied 1092 place count 200 transition count 406
Reduce places removed 4 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 23 rules applied. Total rules applied 1115 place count 196 transition count 387
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 1134 place count 177 transition count 387
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 1134 place count 177 transition count 345
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1218 place count 135 transition count 345
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1276 place count 106 transition count 316
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1284 place count 106 transition count 308
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1309 place count 81 transition count 154
Iterating global reduction 5 with 25 rules applied. Total rules applied 1334 place count 81 transition count 154
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1346 place count 81 transition count 142
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1358 place count 69 transition count 130
Iterating global reduction 6 with 12 rules applied. Total rules applied 1370 place count 69 transition count 130
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1378 place count 61 transition count 122
Iterating global reduction 6 with 8 rules applied. Total rules applied 1386 place count 61 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1390 place count 61 transition count 118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1398 place count 57 transition count 114
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1406 place count 53 transition count 135
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1412 place count 53 transition count 129
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1418 place count 47 transition count 129
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1422 place count 43 transition count 125
Iterating global reduction 8 with 4 rules applied. Total rules applied 1426 place count 43 transition count 125
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1428 place count 43 transition count 123
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1436 place count 43 transition count 123
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1437 place count 43 transition count 122
Applied a total of 1437 rules in 31 ms. Remains 43 /797 variables (removed 754) and now considering 122/1035 (removed 913) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 43/797 places, 122/1035 transitions.
Incomplete random walk after 10000 steps, including 618 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 108 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 122 rows 43 cols
[2024-05-30 23:21:53] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 23:21:53] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-30 23:21:53] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 23:21:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-30 23:21:53] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 23:21:53] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-30 23:21:53] [INFO ] After 15ms SMT Verify possible using 33 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-30 23:21:53] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-30 23:21:53] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-30 23:21:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2024-05-30 23:21:53] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-30 23:21:53] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 43/43 places, 122/122 transitions.
Incomplete random walk after 10000 steps, including 623 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 11790 steps, run visited all 1 properties in 14 ms. (steps per millisecond=842 )
Probabilistic random walk after 11790 steps, saw 3172 distinct states, run finished after 19 ms. (steps per millisecond=620 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (G (NOT (AND p0 p2 p1))), (G (NOT (AND p0 p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F p2), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p2 p1)), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 329 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
// Phase 1: matrix 1035 rows 797 cols
[2024-05-30 23:21:54] [INFO ] Computed 5 invariants in 14 ms
[2024-05-30 23:21:54] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-30 23:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:21:55] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2024-05-30 23:21:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:21:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-30 23:21:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:21:56] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2024-05-30 23:21:56] [INFO ] Computed and/alt/rep : 1009/1712/1009 causal constraints (skipped 25 transitions) in 57 ms.
[2024-05-30 23:22:03] [INFO ] Added : 690 causal constraints over 139 iterations in 7794 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 797 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Graph (trivial) has 768 edges and 797 vertex of which 68 / 797 are part of one of the 12 SCC in 0 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 529 transitions
Trivial Post-agglo rules discarded 529 transitions
Performed 529 trivial Post agglomeration. Transition count delta: 529
Iterating post reduction 0 with 529 rules applied. Total rules applied 530 place count 740 transition count 441
Reduce places removed 529 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 541 rules applied. Total rules applied 1071 place count 211 transition count 429
Reduce places removed 4 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 23 rules applied. Total rules applied 1094 place count 207 transition count 410
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 1113 place count 188 transition count 410
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 1113 place count 188 transition count 372
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1189 place count 150 transition count 372
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1192 place count 147 transition count 369
Iterating global reduction 4 with 3 rules applied. Total rules applied 1195 place count 147 transition count 369
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 1257 place count 116 transition count 338
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 1281 place count 92 transition count 188
Iterating global reduction 4 with 24 rules applied. Total rules applied 1305 place count 92 transition count 188
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1316 place count 92 transition count 177
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1328 place count 80 transition count 161
Iterating global reduction 5 with 12 rules applied. Total rules applied 1340 place count 80 transition count 161
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1352 place count 68 transition count 145
Iterating global reduction 5 with 12 rules applied. Total rules applied 1364 place count 68 transition count 145
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1368 place count 68 transition count 141
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1384 place count 60 transition count 148
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1385 place count 59 transition count 140
Iterating global reduction 6 with 1 rules applied. Total rules applied 1386 place count 59 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1387 place count 59 transition count 139
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1391 place count 59 transition count 135
Applied a total of 1391 rules in 32 ms. Remains 59 /797 variables (removed 738) and now considering 135/1035 (removed 900) transitions.
[2024-05-30 23:22:03] [INFO ] Flow matrix only has 131 transitions (discarded 4 similar events)
// Phase 1: matrix 131 rows 59 cols
[2024-05-30 23:22:03] [INFO ] Computed 2 invariants in 0 ms
[2024-05-30 23:22:03] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 23:22:03] [INFO ] Flow matrix only has 131 transitions (discarded 4 similar events)
[2024-05-30 23:22:03] [INFO ] Invariant cache hit.
[2024-05-30 23:22:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 23:22:04] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-30 23:22:04] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 23:22:04] [INFO ] Flow matrix only has 131 transitions (discarded 4 similar events)
[2024-05-30 23:22:04] [INFO ] Invariant cache hit.
[2024-05-30 23:22:04] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/797 places, 135/1035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 59/797 places, 135/1035 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 174 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
Incomplete random walk after 10000 steps, including 1131 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 161 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 124 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 159 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-30 23:22:04] [INFO ] Flow matrix only has 131 transitions (discarded 4 similar events)
[2024-05-30 23:22:04] [INFO ] Invariant cache hit.
[2024-05-30 23:22:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-30 23:22:04] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-30 23:22:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-30 23:22:04] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-30 23:22:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 23:22:05] [INFO ] After 23ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2024-05-30 23:22:05] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-30 23:22:05] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 135/135 transitions.
Graph (complete) has 256 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 58 transition count 126
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 54 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 53 transition count 135
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 53 transition count 129
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 11 rules applied. Total rules applied 36 place count 46 transition count 125
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 40 place count 42 transition count 125
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 44 place count 38 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 48 place count 38 transition count 121
Performed 8 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 64 place count 30 transition count 95
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 91 place count 30 transition count 68
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 97 place count 24 transition count 47
Iterating global reduction 4 with 6 rules applied. Total rules applied 103 place count 24 transition count 47
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 109 place count 24 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 113 place count 22 transition count 39
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 115 place count 22 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 116 place count 21 transition count 36
Applied a total of 116 rules in 13 ms. Remains 21 /59 variables (removed 38) and now considering 36/135 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 21/59 places, 36/135 transitions.
Finished random walk after 1170 steps, including 128 resets, run visited all 3 properties in 13 ms. (steps per millisecond=90 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F p2), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 20 factoid took 528 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
[2024-05-30 23:22:06] [INFO ] Flow matrix only has 131 transitions (discarded 4 similar events)
[2024-05-30 23:22:06] [INFO ] Invariant cache hit.
[2024-05-30 23:22:06] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-30 23:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:22:06] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-30 23:22:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:22:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-30 23:22:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:22:06] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-30 23:22:06] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 23:22:06] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-30 23:22:06] [INFO ] Computed and/alt/rep : 97/383/93 causal constraints (skipped 21 transitions) in 8 ms.
[2024-05-30 23:22:06] [INFO ] Added : 30 causal constraints over 8 iterations in 72 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
Stuttering criterion allowed to conclude after 365 steps with 38 reset in 2 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-09 finished in 17876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)&&G(p2)))))'
Support contains 2 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 851 transition count 1092
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 851 transition count 1092
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 844 transition count 1085
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 844 transition count 1085
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 837 transition count 1078
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 837 transition count 1078
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 830 transition count 1071
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 830 transition count 1071
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 824 transition count 1065
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 824 transition count 1065
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 818 transition count 1059
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 818 transition count 1059
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 812 transition count 1053
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 812 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 812 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 808 transition count 1048
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 808 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 805 transition count 1045
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 805 transition count 1045
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 805 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 803 transition count 1042
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 803 transition count 1042
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 803 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 802 transition count 1040
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 802 transition count 1040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 802 transition count 1039
Applied a total of 116 rules in 180 ms. Remains 802 /858 variables (removed 56) and now considering 1039/1099 (removed 60) transitions.
// Phase 1: matrix 1039 rows 802 cols
[2024-05-30 23:22:06] [INFO ] Computed 5 invariants in 11 ms
[2024-05-30 23:22:07] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-30 23:22:07] [INFO ] Invariant cache hit.
[2024-05-30 23:22:07] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2024-05-30 23:22:07] [INFO ] Invariant cache hit.
[2024-05-30 23:22:07] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 802/858 places, 1039/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1216 ms. Remains : 802/858 places, 1039/1099 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s139 0), p2:(NEQ s139 1), p1:(EQ s655 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1290 reset in 123 ms.
Product exploration explored 100000 steps with 1279 reset in 130 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 p2)), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X p2)), (X (X (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 132 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-30 23:22:08] [INFO ] Invariant cache hit.
[2024-05-30 23:22:09] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-30 23:22:09] [INFO ] After 285ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-30 23:22:09] [INFO ] Deduced a trap composed of 299 places in 206 ms of which 0 ms to minimize.
[2024-05-30 23:22:09] [INFO ] Deduced a trap composed of 299 places in 180 ms of which 0 ms to minimize.
[2024-05-30 23:22:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 503 ms
[2024-05-30 23:22:09] [INFO ] After 813ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-30 23:22:09] [INFO ] After 957ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-30 23:22:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-30 23:22:10] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-30 23:22:10] [INFO ] Deduced a trap composed of 299 places in 195 ms of which 0 ms to minimize.
[2024-05-30 23:22:10] [INFO ] Deduced a trap composed of 299 places in 159 ms of which 0 ms to minimize.
[2024-05-30 23:22:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2024-05-30 23:22:11] [INFO ] After 965ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 96 ms.
[2024-05-30 23:22:11] [INFO ] After 1228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Graph (trivial) has 798 edges and 802 vertex of which 68 / 802 are part of one of the 12 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1194 edges and 746 vertex of which 742 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 565 rules applied. Total rules applied 567 place count 742 transition count 398
Reduce places removed 561 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 573 rules applied. Total rules applied 1140 place count 181 transition count 386
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1144 place count 177 transition count 386
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1144 place count 177 transition count 341
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1234 place count 132 transition count 341
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1294 place count 102 transition count 311
Drop transitions removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1303 place count 102 transition count 302
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1328 place count 77 transition count 148
Iterating global reduction 4 with 25 rules applied. Total rules applied 1353 place count 77 transition count 148
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1365 place count 77 transition count 136
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1377 place count 65 transition count 124
Iterating global reduction 5 with 12 rules applied. Total rules applied 1389 place count 65 transition count 124
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1397 place count 57 transition count 116
Iterating global reduction 5 with 8 rules applied. Total rules applied 1405 place count 57 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1409 place count 57 transition count 112
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1417 place count 53 transition count 108
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1425 place count 49 transition count 129
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1447 place count 49 transition count 101
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 41 rules applied. Total rules applied 1488 place count 27 transition count 82
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1492 place count 23 transition count 78
Iterating global reduction 7 with 4 rules applied. Total rules applied 1496 place count 23 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1497 place count 23 transition count 77
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 1523 place count 23 transition count 51
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 1527 place count 21 transition count 69
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1535 place count 21 transition count 61
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1537 place count 21 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1538 place count 21 transition count 60
Applied a total of 1538 rules in 26 ms. Remains 21 /802 variables (removed 781) and now considering 60/1039 (removed 979) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 21/802 places, 60/1039 transitions.
Finished random walk after 25 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 p2)), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X p2)), (X (X (AND p0 p2)))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (OR (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 p2 (NOT p1)))]
Knowledge based reduction with 9 factoid took 245 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 802 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Applied a total of 0 rules in 22 ms. Remains 802 /802 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
[2024-05-30 23:22:11] [INFO ] Invariant cache hit.
[2024-05-30 23:22:11] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-30 23:22:11] [INFO ] Invariant cache hit.
[2024-05-30 23:22:12] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2024-05-30 23:22:12] [INFO ] Invariant cache hit.
[2024-05-30 23:22:12] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1045 ms. Remains : 802/802 places, 1039/1039 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 p2)), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p1)), (X (X p2)), (X (X (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 87 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 126 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-30 23:22:13] [INFO ] Invariant cache hit.
[2024-05-30 23:22:13] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-30 23:22:13] [INFO ] After 302ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-30 23:22:14] [INFO ] Deduced a trap composed of 299 places in 200 ms of which 1 ms to minimize.
[2024-05-30 23:22:14] [INFO ] Deduced a trap composed of 299 places in 174 ms of which 0 ms to minimize.
[2024-05-30 23:22:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 491 ms
[2024-05-30 23:22:14] [INFO ] After 821ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-30 23:22:14] [INFO ] After 950ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-30 23:22:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-30 23:22:14] [INFO ] After 355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-30 23:22:15] [INFO ] Deduced a trap composed of 299 places in 195 ms of which 0 ms to minimize.
[2024-05-30 23:22:15] [INFO ] Deduced a trap composed of 299 places in 165 ms of which 2 ms to minimize.
[2024-05-30 23:22:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 471 ms
[2024-05-30 23:22:15] [INFO ] After 977ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 102 ms.
[2024-05-30 23:22:15] [INFO ] After 1239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Graph (trivial) has 798 edges and 802 vertex of which 68 / 802 are part of one of the 12 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1194 edges and 746 vertex of which 742 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 565 rules applied. Total rules applied 567 place count 742 transition count 398
Reduce places removed 561 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 573 rules applied. Total rules applied 1140 place count 181 transition count 386
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1144 place count 177 transition count 386
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1144 place count 177 transition count 341
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1234 place count 132 transition count 341
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1294 place count 102 transition count 311
Drop transitions removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1303 place count 102 transition count 302
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1328 place count 77 transition count 148
Iterating global reduction 4 with 25 rules applied. Total rules applied 1353 place count 77 transition count 148
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1365 place count 77 transition count 136
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1377 place count 65 transition count 124
Iterating global reduction 5 with 12 rules applied. Total rules applied 1389 place count 65 transition count 124
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1397 place count 57 transition count 116
Iterating global reduction 5 with 8 rules applied. Total rules applied 1405 place count 57 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1409 place count 57 transition count 112
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1417 place count 53 transition count 108
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1425 place count 49 transition count 129
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1447 place count 49 transition count 101
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 41 rules applied. Total rules applied 1488 place count 27 transition count 82
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1492 place count 23 transition count 78
Iterating global reduction 7 with 4 rules applied. Total rules applied 1496 place count 23 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1497 place count 23 transition count 77
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 1523 place count 23 transition count 51
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 1527 place count 21 transition count 69
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1535 place count 21 transition count 61
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1537 place count 21 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1538 place count 21 transition count 60
Applied a total of 1538 rules in 26 ms. Remains 21 /802 variables (removed 781) and now considering 60/1039 (removed 979) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 21/802 places, 60/1039 transitions.
Finished random walk after 51 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 p2)), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p1)), (X (X p2)), (X (X (AND p0 p2)))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (OR (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 p2 (NOT p1)))]
Knowledge based reduction with 9 factoid took 240 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 1289 reset in 120 ms.
Product exploration explored 100000 steps with 1285 reset in 127 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 802 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Graph (trivial) has 796 edges and 802 vertex of which 68 / 802 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Performed 551 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 551 rules applied. Total rules applied 552 place count 746 transition count 975
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 560 place count 746 transition count 967
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 560 place count 746 transition count 971
Deduced a syphon composed of 584 places in 1 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 593 place count 746 transition count 971
Discarding 497 places :
Symmetric choice reduction at 2 with 497 rule applications. Total rules 1090 place count 249 transition count 474
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 2 with 497 rules applied. Total rules applied 1587 place count 249 transition count 474
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 1632 place count 249 transition count 486
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 1706 place count 175 transition count 279
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 74 rules applied. Total rules applied 1780 place count 175 transition count 279
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 1794 place count 175 transition count 265
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 1825 place count 144 transition count 230
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 3 with 31 rules applied. Total rules applied 1856 place count 144 transition count 230
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1868 place count 132 transition count 218
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1880 place count 132 transition count 218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1884 place count 132 transition count 214
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1892 place count 124 transition count 206
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 1900 place count 124 transition count 206
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1907 place count 124 transition count 241
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1918 place count 113 transition count 219
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1929 place count 113 transition count 219
Deduced a syphon composed of 55 places in 0 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 1937 place count 113 transition count 211
Deduced a syphon composed of 55 places in 0 ms
Applied a total of 1937 rules in 54 ms. Remains 113 /802 variables (removed 689) and now considering 211/1039 (removed 828) transitions.
[2024-05-30 23:22:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 23:22:16] [INFO ] Flow matrix only has 206 transitions (discarded 5 similar events)
// Phase 1: matrix 206 rows 113 cols
[2024-05-30 23:22:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 23:22:16] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/802 places, 211/1039 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 113/802 places, 211/1039 transitions.
Built C files in :
/tmp/ltsmin15834954878905981815
[2024-05-30 23:22:16] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15834954878905981815
Running compilation step : cd /tmp/ltsmin15834954878905981815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1646 ms.
Running link step : cd /tmp/ltsmin15834954878905981815;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15834954878905981815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18280425805943254659.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 802 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Applied a total of 0 rules in 18 ms. Remains 802 /802 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
// Phase 1: matrix 1039 rows 802 cols
[2024-05-30 23:22:32] [INFO ] Computed 5 invariants in 8 ms
[2024-05-30 23:22:32] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-30 23:22:32] [INFO ] Invariant cache hit.
[2024-05-30 23:22:32] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-05-30 23:22:32] [INFO ] Invariant cache hit.
[2024-05-30 23:22:33] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1136 ms. Remains : 802/802 places, 1039/1039 transitions.
Built C files in :
/tmp/ltsmin644144413301294561
[2024-05-30 23:22:33] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin644144413301294561
Running compilation step : cd /tmp/ltsmin644144413301294561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1592 ms.
Running link step : cd /tmp/ltsmin644144413301294561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin644144413301294561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7695107924167155802.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 23:22:48] [INFO ] Flatten gal took : 37 ms
[2024-05-30 23:22:48] [INFO ] Flatten gal took : 22 ms
[2024-05-30 23:22:48] [INFO ] Time to serialize gal into /tmp/LTL17362912591417899426.gal : 11 ms
[2024-05-30 23:22:48] [INFO ] Time to serialize properties into /tmp/LTL807411393447680877.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17362912591417899426.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10288960123287767788.hoa' '-atoms' '/tmp/LTL807411393447680877.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL807411393447680877.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10288960123287767788.hoa
Detected timeout of ITS tools.
[2024-05-30 23:23:03] [INFO ] Flatten gal took : 19 ms
[2024-05-30 23:23:03] [INFO ] Flatten gal took : 19 ms
[2024-05-30 23:23:03] [INFO ] Time to serialize gal into /tmp/LTL5790908723174483118.gal : 4 ms
[2024-05-30 23:23:03] [INFO ] Time to serialize properties into /tmp/LTL15125425749698049274.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5790908723174483118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15125425749698049274.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((("(p172==0)")&&(F("(p979==0)")))&&(G("(p172!=1)"))))))
Formula 0 simplified : XG(!"(p172==0)" | G!"(p979==0)" | F!"(p172!=1)")
Detected timeout of ITS tools.
[2024-05-30 23:23:18] [INFO ] Flatten gal took : 22 ms
[2024-05-30 23:23:18] [INFO ] Applying decomposition
[2024-05-30 23:23:18] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1805988909871008730.txt' '-o' '/tmp/graph1805988909871008730.bin' '-w' '/tmp/graph1805988909871008730.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1805988909871008730.bin' '-l' '-1' '-v' '-w' '/tmp/graph1805988909871008730.weights' '-q' '0' '-e' '0.001'
[2024-05-30 23:23:18] [INFO ] Decomposing Gal with order
[2024-05-30 23:23:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 23:23:18] [INFO ] Removed a total of 864 redundant transitions.
[2024-05-30 23:23:18] [INFO ] Flatten gal took : 41 ms
[2024-05-30 23:23:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2024-05-30 23:23:18] [INFO ] Time to serialize gal into /tmp/LTL13421416374390881379.gal : 7 ms
[2024-05-30 23:23:18] [INFO ] Time to serialize properties into /tmp/LTL7768192167406836809.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13421416374390881379.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7768192167406836809.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((("(i6.u58.p172==0)")&&(F("(i10.u278.p979==0)")))&&(G("(i6.u58.p172!=1)"))))))
Formula 0 simplified : XG(!"(i6.u58.p172==0)" | G!"(i10.u278.p979==0)" | F!"(i6.u58.p172!=1)")
Reverse transition relation is NOT exact ! Due to transitions t78, t119, t231, t265, t348, t401, t404, t439, t605, t638, t660, t732, t808, t809, t813, t816...594
Computing Next relation with stutter on 83938 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11280430814394056933
[2024-05-30 23:23:33] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11280430814394056933
Running compilation step : cd /tmp/ltsmin11280430814394056933;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1708 ms.
Running link step : cd /tmp/ltsmin11280430814394056933;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11280430814394056933;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&<>((LTLAPp1==true))&&[]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-10 finished in 102139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&(p0||G(p1)))))'
Support contains 2 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 850 transition count 1091
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 850 transition count 1091
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 842 transition count 1083
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 842 transition count 1083
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 834 transition count 1075
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 834 transition count 1075
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 826 transition count 1067
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 826 transition count 1067
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 819 transition count 1060
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 819 transition count 1060
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 812 transition count 1053
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 812 transition count 1053
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 805 transition count 1046
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 805 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 805 transition count 1045
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 112 place count 800 transition count 1040
Iterating global reduction 1 with 5 rules applied. Total rules applied 117 place count 800 transition count 1040
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 796 transition count 1036
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 796 transition count 1036
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 796 transition count 1035
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 793 transition count 1032
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 793 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 133 place count 793 transition count 1031
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 791 transition count 1029
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 791 transition count 1029
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 791 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 790 transition count 1027
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 790 transition count 1027
Applied a total of 140 rules in 193 ms. Remains 790 /858 variables (removed 68) and now considering 1027/1099 (removed 72) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2024-05-30 23:23:49] [INFO ] Computed 5 invariants in 9 ms
[2024-05-30 23:23:49] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-30 23:23:49] [INFO ] Invariant cache hit.
[2024-05-30 23:23:49] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2024-05-30 23:23:49] [INFO ] Invariant cache hit.
[2024-05-30 23:23:50] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/858 places, 1027/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1237 ms. Remains : 790/858 places, 1027/1099 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p0:(EQ s188 1), p1:(EQ s438 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-11 finished in 1430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 2 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 850 transition count 1091
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 850 transition count 1091
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 842 transition count 1083
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 842 transition count 1083
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 834 transition count 1075
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 834 transition count 1075
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 826 transition count 1067
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 826 transition count 1067
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 819 transition count 1060
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 819 transition count 1060
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 812 transition count 1053
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 812 transition count 1053
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 805 transition count 1046
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 805 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 805 transition count 1045
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 112 place count 800 transition count 1040
Iterating global reduction 1 with 5 rules applied. Total rules applied 117 place count 800 transition count 1040
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 796 transition count 1036
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 796 transition count 1036
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 796 transition count 1035
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 793 transition count 1032
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 793 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 133 place count 793 transition count 1031
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 791 transition count 1029
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 791 transition count 1029
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 791 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 790 transition count 1027
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 790 transition count 1027
Applied a total of 140 rules in 186 ms. Remains 790 /858 variables (removed 68) and now considering 1027/1099 (removed 72) transitions.
[2024-05-30 23:23:50] [INFO ] Invariant cache hit.
[2024-05-30 23:23:50] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-30 23:23:50] [INFO ] Invariant cache hit.
[2024-05-30 23:23:51] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2024-05-30 23:23:51] [INFO ] Invariant cache hit.
[2024-05-30 23:23:51] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 790/858 places, 1027/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1230 ms. Remains : 790/858 places, 1027/1099 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s733 1), p1:(EQ s689 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-15 finished in 1383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0&&X(G((G((p2||X(p3)))||p1)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Found a Lengthening insensitive property : StigmergyCommit-PT-03b-LTLFireability-07
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 858 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Graph (trivial) has 853 edges and 858 vertex of which 68 / 858 are part of one of the 12 SCC in 0 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 600 transitions
Trivial Post-agglo rules discarded 600 transitions
Performed 600 trivial Post agglomeration. Transition count delta: 600
Iterating post reduction 0 with 600 rules applied. Total rules applied 601 place count 801 transition count 434
Reduce places removed 600 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 611 rules applied. Total rules applied 1212 place count 201 transition count 423
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1216 place count 197 transition count 423
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1216 place count 197 transition count 382
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1298 place count 156 transition count 382
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1305 place count 149 transition count 375
Iterating global reduction 3 with 7 rules applied. Total rules applied 1312 place count 149 transition count 375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1312 place count 149 transition count 374
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1314 place count 148 transition count 374
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1317 place count 145 transition count 371
Iterating global reduction 3 with 3 rules applied. Total rules applied 1320 place count 145 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1321 place count 145 transition count 370
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1322 place count 144 transition count 369
Iterating global reduction 4 with 1 rules applied. Total rules applied 1323 place count 144 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1324 place count 144 transition count 368
Performed 31 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 1386 place count 113 transition count 334
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1407 place count 92 transition count 222
Iterating global reduction 5 with 21 rules applied. Total rules applied 1428 place count 92 transition count 222
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1437 place count 92 transition count 213
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1449 place count 80 transition count 197
Iterating global reduction 6 with 12 rules applied. Total rules applied 1461 place count 80 transition count 197
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1473 place count 68 transition count 181
Iterating global reduction 6 with 12 rules applied. Total rules applied 1485 place count 68 transition count 181
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1489 place count 68 transition count 177
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1505 place count 60 transition count 184
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1506 place count 59 transition count 176
Iterating global reduction 7 with 1 rules applied. Total rules applied 1507 place count 59 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1508 place count 59 transition count 175
Applied a total of 1508 rules in 50 ms. Remains 59 /858 variables (removed 799) and now considering 175/1099 (removed 924) transitions.
[2024-05-30 23:23:52] [INFO ] Flow matrix only has 170 transitions (discarded 5 similar events)
// Phase 1: matrix 170 rows 59 cols
[2024-05-30 23:23:52] [INFO ] Computed 2 invariants in 2 ms
[2024-05-30 23:23:52] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 23:23:52] [INFO ] Flow matrix only has 170 transitions (discarded 5 similar events)
[2024-05-30 23:23:52] [INFO ] Invariant cache hit.
[2024-05-30 23:23:52] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-30 23:23:52] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-30 23:23:52] [INFO ] Flow matrix only has 170 transitions (discarded 5 similar events)
[2024-05-30 23:23:52] [INFO ] Invariant cache hit.
[2024-05-30 23:23:52] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 59/858 places, 175/1099 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 248 ms. Remains : 59/858 places, 175/1099 transitions.
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s5 0) (EQ s19 0) (EQ s33 0) (EQ s47 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 95 reset in 83 ms.
Product exploration explored 100000 steps with 553 reset in 113 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1373 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 32302 steps, run visited all 1 properties in 59 ms. (steps per millisecond=547 )
Probabilistic random walk after 32302 steps, saw 9512 distinct states, run finished after 61 ms. (steps per millisecond=529 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 175/175 transitions.
Applied a total of 0 rules in 0 ms. Remains 59 /59 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-30 23:23:53] [INFO ] Flow matrix only has 170 transitions (discarded 5 similar events)
[2024-05-30 23:23:53] [INFO ] Invariant cache hit.
[2024-05-30 23:23:53] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 23:23:53] [INFO ] Flow matrix only has 170 transitions (discarded 5 similar events)
[2024-05-30 23:23:53] [INFO ] Invariant cache hit.
[2024-05-30 23:23:53] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-30 23:23:53] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-30 23:23:53] [INFO ] Flow matrix only has 170 transitions (discarded 5 similar events)
[2024-05-30 23:23:53] [INFO ] Invariant cache hit.
[2024-05-30 23:23:53] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 209 ms. Remains : 59/59 places, 175/175 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1340 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 148 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 32302 steps, run visited all 1 properties in 41 ms. (steps per millisecond=787 )
Probabilistic random walk after 32302 steps, saw 9512 distinct states, run finished after 41 ms. (steps per millisecond=787 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 866 reset in 50 ms.
Product exploration explored 100000 steps with 2152 reset in 244 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 175/175 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 59 transition count 171
Applied a total of 4 rules in 10 ms. Remains 59 /59 variables (removed 0) and now considering 171/175 (removed 4) transitions.
[2024-05-30 23:23:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 23:23:54] [INFO ] Flow matrix only has 166 transitions (discarded 5 similar events)
// Phase 1: matrix 166 rows 59 cols
[2024-05-30 23:23:54] [INFO ] Computed 2 invariants in 2 ms
[2024-05-30 23:23:54] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/59 places, 171/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 59/59 places, 171/175 transitions.
Built C files in :
/tmp/ltsmin12447594696098380047
[2024-05-30 23:23:54] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12447594696098380047
Running compilation step : cd /tmp/ltsmin12447594696098380047;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 292 ms.
Running link step : cd /tmp/ltsmin12447594696098380047;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12447594696098380047;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11433173560237792906.hoa' '--buchi-type=spotba'
LTSmin run took 300 ms.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-07 finished in 3805 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Found a Shortening insensitive property : StigmergyCommit-PT-03b-LTLFireability-08
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 858 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Graph (trivial) has 851 edges and 858 vertex of which 68 / 858 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 598 transitions
Trivial Post-agglo rules discarded 598 transitions
Performed 598 trivial Post agglomeration. Transition count delta: 598
Iterating post reduction 0 with 598 rules applied. Total rules applied 599 place count 801 transition count 436
Reduce places removed 598 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 609 rules applied. Total rules applied 1208 place count 203 transition count 425
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1212 place count 199 transition count 425
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1212 place count 199 transition count 384
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1294 place count 158 transition count 384
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1301 place count 151 transition count 377
Iterating global reduction 3 with 7 rules applied. Total rules applied 1308 place count 151 transition count 377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1308 place count 151 transition count 376
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1310 place count 150 transition count 376
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1313 place count 147 transition count 373
Iterating global reduction 3 with 3 rules applied. Total rules applied 1316 place count 147 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1317 place count 147 transition count 372
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1318 place count 146 transition count 371
Iterating global reduction 4 with 1 rules applied. Total rules applied 1319 place count 146 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1320 place count 146 transition count 370
Performed 31 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 1382 place count 115 transition count 337
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1402 place count 95 transition count 252
Iterating global reduction 5 with 20 rules applied. Total rules applied 1422 place count 95 transition count 252
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1430 place count 95 transition count 244
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1442 place count 83 transition count 228
Iterating global reduction 6 with 12 rules applied. Total rules applied 1454 place count 83 transition count 228
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1466 place count 71 transition count 212
Iterating global reduction 6 with 12 rules applied. Total rules applied 1478 place count 71 transition count 212
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1482 place count 71 transition count 208
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1498 place count 63 transition count 215
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1499 place count 62 transition count 207
Iterating global reduction 7 with 1 rules applied. Total rules applied 1500 place count 62 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1501 place count 62 transition count 206
Applied a total of 1501 rules in 37 ms. Remains 62 /858 variables (removed 796) and now considering 206/1099 (removed 893) transitions.
[2024-05-30 23:23:55] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
// Phase 1: matrix 201 rows 62 cols
[2024-05-30 23:23:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-30 23:23:55] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 23:23:55] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2024-05-30 23:23:55] [INFO ] Invariant cache hit.
[2024-05-30 23:23:55] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-30 23:23:55] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-30 23:23:55] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2024-05-30 23:23:55] [INFO ] Invariant cache hit.
[2024-05-30 23:23:56] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 62/858 places, 206/1099 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 280 ms. Remains : 62/858 places, 206/1099 transitions.
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(EQ s27 0), p0:(AND (EQ s6 1) (EQ s19 1) (EQ s36 1) (EQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1806 reset in 73 ms.
Product exploration explored 100000 steps with 8399 reset in 128 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1351 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Finished probabilistic random walk after 28303 steps, run visited all 2 properties in 112 ms. (steps per millisecond=252 )
Probabilistic random walk after 28303 steps, saw 8259 distinct states, run finished after 112 ms. (steps per millisecond=252 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 206/206 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-30 23:23:57] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2024-05-30 23:23:57] [INFO ] Invariant cache hit.
[2024-05-30 23:23:57] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 23:23:57] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2024-05-30 23:23:57] [INFO ] Invariant cache hit.
[2024-05-30 23:23:57] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-30 23:23:57] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-30 23:23:57] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2024-05-30 23:23:57] [INFO ] Invariant cache hit.
[2024-05-30 23:23:57] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 62/62 places, 206/206 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1378 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 150 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Finished probabilistic random walk after 28303 steps, run visited all 2 properties in 106 ms. (steps per millisecond=267 )
Probabilistic random walk after 28303 steps, saw 8259 distinct states, run finished after 107 ms. (steps per millisecond=264 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1479 reset in 67 ms.
Product exploration explored 100000 steps with 4041 reset in 117 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 206/206 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 62 transition count 202
Applied a total of 4 rules in 9 ms. Remains 62 /62 variables (removed 0) and now considering 202/206 (removed 4) transitions.
[2024-05-30 23:23:58] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 23:23:58] [INFO ] Flow matrix only has 197 transitions (discarded 5 similar events)
// Phase 1: matrix 197 rows 62 cols
[2024-05-30 23:23:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 23:23:58] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/62 places, 202/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 62/62 places, 202/206 transitions.
Built C files in :
/tmp/ltsmin5907414624235631073
[2024-05-30 23:23:58] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5907414624235631073
Running compilation step : cd /tmp/ltsmin5907414624235631073;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 316 ms.
Running link step : cd /tmp/ltsmin5907414624235631073;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5907414624235631073;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12295688523975207331.hoa' '--buchi-type=spotba'
LTSmin run took 252 ms.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-08 finished in 3803 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)&&G(p2)))))'
Found a Shortening insensitive property : StigmergyCommit-PT-03b-LTLFireability-10
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 858 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Graph (trivial) has 853 edges and 858 vertex of which 68 / 858 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 600 transitions
Trivial Post-agglo rules discarded 600 transitions
Performed 600 trivial Post agglomeration. Transition count delta: 600
Iterating post reduction 0 with 600 rules applied. Total rules applied 601 place count 801 transition count 434
Reduce places removed 600 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 611 rules applied. Total rules applied 1212 place count 201 transition count 423
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1216 place count 197 transition count 423
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 1216 place count 197 transition count 381
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1300 place count 155 transition count 381
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1306 place count 149 transition count 375
Iterating global reduction 3 with 6 rules applied. Total rules applied 1312 place count 149 transition count 375
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1315 place count 146 transition count 372
Iterating global reduction 3 with 3 rules applied. Total rules applied 1318 place count 146 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1319 place count 146 transition count 371
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1320 place count 145 transition count 370
Iterating global reduction 4 with 1 rules applied. Total rules applied 1321 place count 145 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1322 place count 145 transition count 369
Performed 32 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 1386 place count 113 transition count 334
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 1409 place count 90 transition count 185
Iterating global reduction 5 with 23 rules applied. Total rules applied 1432 place count 90 transition count 185
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1442 place count 90 transition count 175
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1454 place count 78 transition count 159
Iterating global reduction 6 with 12 rules applied. Total rules applied 1466 place count 78 transition count 159
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1478 place count 66 transition count 143
Iterating global reduction 6 with 12 rules applied. Total rules applied 1490 place count 66 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1494 place count 66 transition count 139
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1510 place count 58 transition count 146
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1511 place count 57 transition count 138
Iterating global reduction 7 with 1 rules applied. Total rules applied 1512 place count 57 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1513 place count 57 transition count 137
Applied a total of 1513 rules in 33 ms. Remains 57 /858 variables (removed 801) and now considering 137/1099 (removed 962) transitions.
[2024-05-30 23:23:59] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
// Phase 1: matrix 132 rows 57 cols
[2024-05-30 23:23:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 23:23:59] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-30 23:23:59] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-30 23:23:59] [INFO ] Invariant cache hit.
[2024-05-30 23:23:59] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-30 23:23:59] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-30 23:23:59] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-30 23:23:59] [INFO ] Invariant cache hit.
[2024-05-30 23:23:59] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 57/858 places, 137/1099 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 198 ms. Remains : 57/858 places, 137/1099 transitions.
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s9 0), p2:(NEQ s9 1), p1:(EQ s46 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2290 reset in 75 ms.
Product exploration explored 100000 steps with 1832 reset in 77 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 p2)), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X p2)), (X (X (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 92 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 1401 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 160 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-30 23:24:00] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-30 23:24:00] [INFO ] Invariant cache hit.
[2024-05-30 23:24:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-30 23:24:00] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-30 23:24:00] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-30 23:24:00] [INFO ] After 6ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-30 23:24:00] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-30 23:24:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-30 23:24:00] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-30 23:24:00] [INFO ] After 13ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-30 23:24:00] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-30 23:24:00] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 137/137 transitions.
Graph (complete) has 242 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 56 transition count 125
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 15 place count 54 transition count 124
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 23 place count 50 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 50 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 49 transition count 129
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 51 place count 49 transition count 101
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 46 rules applied. Total rules applied 97 place count 26 transition count 78
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 101 place count 22 transition count 78
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 105 place count 18 transition count 74
Iterating global reduction 5 with 4 rules applied. Total rules applied 109 place count 18 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 110 place count 18 transition count 73
Performed 8 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 126 place count 10 transition count 43
Drop transitions removed 5 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 155 place count 10 transition count 14
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 161 place count 6 transition count 10
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 165 place count 6 transition count 6
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 167 place count 5 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 168 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 169 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 170 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 170 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 172 place count 2 transition count 2
Applied a total of 172 rules in 24 ms. Remains 2 /57 variables (removed 55) and now considering 2/137 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 2/57 places, 2/137 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 p2)), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1)), (X (X p2)), (X (X (AND p0 p2)))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (OR (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 p2 (NOT p1)))]
Knowledge based reduction with 9 factoid took 243 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 137/137 transitions.
Applied a total of 0 rules in 0 ms. Remains 57 /57 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-30 23:24:01] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-30 23:24:01] [INFO ] Invariant cache hit.
[2024-05-30 23:24:01] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-30 23:24:01] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-30 23:24:01] [INFO ] Invariant cache hit.
[2024-05-30 23:24:01] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-30 23:24:01] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-30 23:24:01] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-30 23:24:01] [INFO ] Invariant cache hit.
[2024-05-30 23:24:01] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 57/57 places, 137/137 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 p2)), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p1)), (X (X p2)), (X (X (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 1420 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 159 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 165 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 158 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-30 23:24:01] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-30 23:24:01] [INFO ] Invariant cache hit.
[2024-05-30 23:24:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-30 23:24:01] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-30 23:24:01] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-30 23:24:01] [INFO ] After 6ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-30 23:24:01] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-30 23:24:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-30 23:24:02] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-30 23:24:02] [INFO ] After 16ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-30 23:24:02] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-30 23:24:02] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 137/137 transitions.
Graph (complete) has 242 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 56 transition count 125
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 15 place count 54 transition count 124
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 23 place count 50 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 50 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 49 transition count 129
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 51 place count 49 transition count 101
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 46 rules applied. Total rules applied 97 place count 26 transition count 78
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 101 place count 22 transition count 78
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 105 place count 18 transition count 74
Iterating global reduction 5 with 4 rules applied. Total rules applied 109 place count 18 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 110 place count 18 transition count 73
Performed 8 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 126 place count 10 transition count 43
Drop transitions removed 5 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 155 place count 10 transition count 14
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 161 place count 6 transition count 10
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 165 place count 6 transition count 6
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 167 place count 5 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 168 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 169 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 170 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 170 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 172 place count 2 transition count 2
Applied a total of 172 rules in 12 ms. Remains 2 /57 variables (removed 55) and now considering 2/137 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 2/57 places, 2/137 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (OR (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 p2)), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p1)), (X (X p2)), (X (X (AND p0 p2)))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (OR (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (AND p0 p2 (NOT p1)))]
Knowledge based reduction with 9 factoid took 257 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 1901 reset in 49 ms.
Product exploration explored 100000 steps with 5623 reset in 100 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 137/137 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 57 transition count 133
Applied a total of 4 rules in 9 ms. Remains 57 /57 variables (removed 0) and now considering 133/137 (removed 4) transitions.
[2024-05-30 23:24:03] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 23:24:03] [INFO ] Flow matrix only has 128 transitions (discarded 5 similar events)
// Phase 1: matrix 128 rows 57 cols
[2024-05-30 23:24:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 23:24:03] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/57 places, 133/137 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 57/57 places, 133/137 transitions.
Built C files in :
/tmp/ltsmin6970782868603940876
[2024-05-30 23:24:03] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6970782868603940876
Running compilation step : cd /tmp/ltsmin6970782868603940876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 223 ms.
Running link step : cd /tmp/ltsmin6970782868603940876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6970782868603940876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1231284272869419925.hoa' '--buchi-type=spotba'
LTSmin run took 205 ms.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-10 finished in 4312 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-30 23:24:03] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6219485682500172055
[2024-05-30 23:24:03] [INFO ] Computing symmetric may disable matrix : 1099 transitions.
[2024-05-30 23:24:03] [INFO ] Applying decomposition
[2024-05-30 23:24:03] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 23:24:03] [INFO ] Computing symmetric may enable matrix : 1099 transitions.
[2024-05-30 23:24:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 23:24:03] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15203568235242987175.txt' '-o' '/tmp/graph15203568235242987175.bin' '-w' '/tmp/graph15203568235242987175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15203568235242987175.bin' '-l' '-1' '-v' '-w' '/tmp/graph15203568235242987175.weights' '-q' '0' '-e' '0.001'
[2024-05-30 23:24:03] [INFO ] Decomposing Gal with order
[2024-05-30 23:24:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 23:24:03] [INFO ] Removed a total of 864 redundant transitions.
[2024-05-30 23:24:03] [INFO ] Flatten gal took : 39 ms
[2024-05-30 23:24:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2024-05-30 23:24:03] [INFO ] Time to serialize gal into /tmp/LTLFireability16900384455198528623.gal : 7 ms
[2024-05-30 23:24:03] [INFO ] Time to serialize properties into /tmp/LTLFireability11293374417324000773.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16900384455198528623.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11293374417324000773.ltl' '-c' '-stutter-deadlock'
[2024-05-30 23:24:04] [INFO ] Computing Do-Not-Accords matrix : 1099 transitions.

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
[2024-05-30 23:24:04] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 23:24:04] [INFO ] Built C files in 266ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6219485682500172055
Running compilation step : cd /tmp/ltsmin6219485682500172055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((X(X(X(X(("(((i19.u33.p94!=1)||(i19.u115.p396!=1))||((i19.u209.p698!=1)||(i19.u291.p1000!=1)))")&&(X(G(("(((i19.u33.p94!=1)||(i19.u1...279
Formula 0 simplified : XXXX(!"(((i19.u33.p94!=1)||(i19.u115.p396!=1))||((i19.u209.p698!=1)||(i19.u291.p1000!=1)))" | XF(!"(((i19.u33.p94!=1)||(i19.u115.p39...261
Compilation finished in 3175 ms.
Running link step : cd /tmp/ltsmin6219485682500172055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin6219485682500172055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X(((LTLAPp0==true)&&X([](([](((LTLAPp2==true)||X((LTLAPp3==true))))||(LTLAPp1==true)))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t78, t175, t265, t347, t348, t404, t439, t449, t549, t638, t660, t731, t732, t788, t808, t809...629
Computing Next relation with stutter on 93178 deadlock states
10 unique states visited
10 strongly connected components in search stack
10 transitions explored
10 items max in DFS search stack
3314 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,33.2299,1061960,1,0,1.40977e+06,1079,11400,8.19237e+06,248,4280,3816280
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA StigmergyCommit-PT-03b-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(F(("(((i19.u3.p72==1)&&(i19.u100.p351==1))&&((i19.u178.p653==1)&&(i19.u259.p955==1)))")||(G("(i14.u147.p513==0)")))))))
Formula 1 simplified : XXG(!"(((i19.u3.p72==1)&&(i19.u100.p351==1))&&((i19.u178.p653==1)&&(i19.u259.p955==1)))" & F!"(i14.u147.p513==0)")
Computing Next relation with stutter on 93178 deadlock states
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin6219485682500172055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X(((LTLAPp0==true)&&X([](([](((LTLAPp2==true)||X((LTLAPp3==true))))||(LTLAPp1==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6219485682500172055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((LTLAPp5==true)||[]((LTLAPp6==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-30 23:46:39] [INFO ] Applying decomposition
[2024-05-30 23:46:39] [INFO ] Flatten gal took : 54 ms
[2024-05-30 23:46:39] [INFO ] Decomposing Gal with order
[2024-05-30 23:46:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 23:46:39] [INFO ] Removed a total of 745 redundant transitions.
[2024-05-30 23:46:39] [INFO ] Flatten gal took : 215 ms
[2024-05-30 23:46:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 244 labels/synchronizations in 59 ms.
[2024-05-30 23:46:39] [INFO ] Time to serialize gal into /tmp/LTLFireability239568333594414052.gal : 3 ms
[2024-05-30 23:46:39] [INFO ] Time to serialize properties into /tmp/LTLFireability12705900822576694019.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability239568333594414052.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12705900822576694019.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((X(X(F(("(((i0.i0.i0.u4.p72==1)&&(i0.i0.i0.u5.p351==1))&&((i0.i0.u6.p653==1)&&(i0.u7.p955==1)))")||(G("(i0.i0.i0.u5.p513==0)")))))))
Formula 0 simplified : XXG(!"(((i0.i0.i0.u4.p72==1)&&(i0.i0.i0.u5.p351==1))&&((i0.i0.u6.p653==1)&&(i0.u7.p955==1)))" & F!"(i0.i0.i0.u5.p513==0)")
Reverse transition relation is NOT exact ! Due to transitions t829, i0.u7.t78, i0.u7.t81, i0.u7.t95, i0.u7.t110, i0.u7.t119, i0.u7.t173, i0.u7.t174, i0.u7....817
Computing Next relation with stutter on 93178 deadlock states
LTSmin run took 571768 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin6219485682500172055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp7==true)&&<>((LTLAPp8==true))&&[]((LTLAPp9==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-31 00:09:15] [INFO ] Flatten gal took : 83 ms
[2024-05-31 00:09:15] [INFO ] Input system was already deterministic with 1099 transitions.
[2024-05-31 00:09:15] [INFO ] Transformed 858 places.
[2024-05-31 00:09:15] [INFO ] Transformed 1099 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 00:09:15] [INFO ] Time to serialize gal into /tmp/LTLFireability12790552539605424629.gal : 4 ms
[2024-05-31 00:09:15] [INFO ] Time to serialize properties into /tmp/LTLFireability12880739445345445542.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12790552539605424629.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12880739445345445542.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F((("(p172==0)")&&(F("(p979==0)")))&&(G("(p172!=1)"))))))
Formula 0 simplified : XG(!"(p172==0)" | G!"(p979==0)" | F!"(p172!=1)")
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin6219485682500172055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp7==true)&&<>((LTLAPp8==true))&&[]((LTLAPp9==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin6219485682500172055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp7==true)&&<>((LTLAPp8==true))&&[]((LTLAPp9==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t78, t81, t95, t110, t119, t173, t174, t175, t228, t231, t265, t268, t283, t292, t346, t347, ...492
Computing Next relation with stutter on 93178 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11108336 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16035688 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-03b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is StigmergyCommit-PT-03b, 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 r417-tall-171690555700073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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