Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r184-tall-174889265100916.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is SemanticWebServices-PT-S128P18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889265100916
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 261K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749254767170

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S128P18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 00:06:08] [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]
[2025-06-07 00:06:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 00:06:08] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2025-06-07 00:06:08] [INFO ] Transformed 184 places.
[2025-06-07 00:06:08] [INFO ] Transformed 466 transitions.
[2025-06-07 00:06:08] [INFO ] Parsed PT model containing 184 places and 466 transitions and 1873 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 269 transitions
Reduce redundant transitions removed 269 transitions.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 195/195 transitions.
Ensure Unique test removed 37 places
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 113 transition count 113
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 158 place count 106 transition count 106
Iterating global reduction 1 with 7 rules applied. Total rules applied 165 place count 106 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 167 place count 106 transition count 104
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 170 place count 103 transition count 101
Iterating global reduction 2 with 3 rules applied. Total rules applied 173 place count 103 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 102 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 102 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 176 place count 101 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 101 transition count 99
Applied a total of 177 rules in 59 ms. Remains 101 /182 variables (removed 81) and now considering 99/195 (removed 96) transitions.
[2025-06-07 00:06:08] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
// Phase 1: matrix 90 rows 101 cols
[2025-06-07 00:06:08] [INFO ] Computed 13 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:09] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-06-07 00:06:09] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2025-06-07 00:06:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:09] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-06-07 00:06:09] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2025-06-07 00:06:09] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2025-06-07 00:06:09] [INFO ] Invariant cache hit.
[2025-06-07 00:06:09] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 2/101 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 89/190 variables, 101/114 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 81/195 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/191 variables, and 195 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2001 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 101/101 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 2/101 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 89/190 variables, 101/114 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 81/195 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 95/290 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/190 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/191 variables, and 290 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2715 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 101/101 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4754ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 4764ms
Starting structural reductions in LTL mode, iteration 1 : 101/182 places, 99/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5169 ms. Remains : 101/182 places, 99/195 transitions.
Support contains 29 out of 101 places after structural reductions.
[2025-06-07 00:06:14] [INFO ] Flatten gal took : 21 ms
[2025-06-07 00:06:14] [INFO ] Flatten gal took : 8 ms
[2025-06-07 00:06:14] [INFO ] Input system was already deterministic with 99 transitions.
Support contains 27 out of 101 places (down from 29) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (8 resets) in 1598 ms. (25 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
[2025-06-07 00:06:14] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2025-06-07 00:06:14] [INFO ] Invariant cache hit.
[2025-06-07 00:06:14] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 4/191 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 35 ms.
Refiners :[Generalized P Invariants (flows): 0/13 constraints, State Equation: 0/101 constraints, ReadFeed: 0/81 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 99/99 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 90 transition count 99
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 17 place count 84 transition count 93
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 84 transition count 93
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 80 transition count 89
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 80 transition count 89
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 76 transition count 85
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 76 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 73 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 73 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 70 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 70 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 68 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 68 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 67 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 67 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 66 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 66 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 66 transition count 74
Applied a total of 60 rules in 21 ms. Remains 66 /101 variables (removed 35) and now considering 74/99 (removed 25) transitions.
[2025-06-07 00:06:15] [INFO ] Flow matrix only has 66 transitions (discarded 8 similar events)
// Phase 1: matrix 66 rows 66 cols
[2025-06-07 00:06:15] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:15] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-07 00:06:15] [INFO ] Flow matrix only has 66 transitions (discarded 8 similar events)
[2025-06-07 00:06:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-07 00:06:15] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2025-06-07 00:06:15] [INFO ] Flow matrix only has 66 transitions (discarded 8 similar events)
[2025-06-07 00:06:15] [INFO ] Invariant cache hit.
[2025-06-07 00:06:15] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 65/131 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 57/125 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/132 variables, and 125 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1029 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 65/131 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 57/125 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 70/195 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/132 variables, and 195 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1188 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2225ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2226ms
Starting structural reductions in LTL mode, iteration 1 : 66/101 places, 74/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2320 ms. Remains : 66/101 places, 74/99 transitions.
Stuttering acceptance computed with spot in 352 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-00 finished in 2728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 99/99 transitions.
Graph (complete) has 242 edges and 101 vertex of which 95 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 76 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 76 transition count 88
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 70 transition count 82
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 70 transition count 82
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 32 place count 65 transition count 77
Iterating global reduction 0 with 5 rules applied. Total rules applied 37 place count 65 transition count 77
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 43 place count 59 transition count 71
Iterating global reduction 0 with 6 rules applied. Total rules applied 49 place count 59 transition count 71
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 54 place count 54 transition count 66
Iterating global reduction 0 with 5 rules applied. Total rules applied 59 place count 54 transition count 66
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 64 place count 49 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 69 place count 49 transition count 61
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 74 place count 44 transition count 56
Iterating global reduction 0 with 5 rules applied. Total rules applied 79 place count 44 transition count 56
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 83 place count 40 transition count 52
Iterating global reduction 0 with 4 rules applied. Total rules applied 87 place count 40 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 91 place count 40 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 40 transition count 46
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 84 edges and 39 vertex of which 38 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 (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 95 place count 38 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 38 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 37 transition count 44
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 36 transition count 43
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 36 transition count 43
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 35 transition count 42
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 35 transition count 42
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 34 transition count 41
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 34 transition count 41
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 33 transition count 40
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 33 transition count 40
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 32 transition count 39
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 32 transition count 39
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 31 transition count 38
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 31 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 31 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 31 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 113 place count 30 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 114 place count 30 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 115 place count 29 transition count 34
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 116 place count 28 transition count 33
Iterating global reduction 6 with 1 rules applied. Total rules applied 117 place count 28 transition count 33
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 118 place count 27 transition count 32
Iterating global reduction 6 with 1 rules applied. Total rules applied 119 place count 27 transition count 32
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 120 place count 26 transition count 31
Iterating global reduction 6 with 1 rules applied. Total rules applied 121 place count 26 transition count 31
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 122 place count 25 transition count 30
Iterating global reduction 6 with 1 rules applied. Total rules applied 123 place count 25 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 124 place count 25 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 125 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 126 place count 24 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 127 place count 24 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 128 place count 23 transition count 27
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 129 place count 22 transition count 26
Iterating global reduction 9 with 1 rules applied. Total rules applied 130 place count 22 transition count 26
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 132 place count 20 transition count 24
Iterating global reduction 9 with 2 rules applied. Total rules applied 134 place count 20 transition count 24
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 136 place count 20 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 137 place count 20 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 138 place count 19 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 139 place count 19 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 140 place count 18 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 141 place count 18 transition count 19
Applied a total of 141 rules in 47 ms. Remains 18 /101 variables (removed 83) and now considering 19/99 (removed 80) transitions.
// Phase 1: matrix 19 rows 18 cols
[2025-06-07 00:06:17] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:17] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-07 00:06:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:17] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-07 00:06:17] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 00:06:17] [INFO ] Redundant transitions in 16 ms returned []
Running 13 sub problems to find dead transitions.
[2025-06-07 00:06:17] [INFO ] Invariant cache hit.
[2025-06-07 00:06:17] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 15/29 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 2/31 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/32 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 2/34 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/34 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/34 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/37 variables, and 31 constraints, problems are : Problem set: 0 solved, 13 unsolved in 195 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/18 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 15/29 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/31 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/32 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 2/34 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/34 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/34 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 1/35 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/35 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 1/36 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/37 variables, and 45 constraints, problems are : Problem set: 0 solved, 13 unsolved in 255 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 456ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 456ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/101 places, 19/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 577 ms. Remains : 18/101 places, 19/99 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-01 finished in 618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(((p1 U p0)&&X(X(p2)))))))'
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 99/99 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 91 transition count 99
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 16 place count 85 transition count 93
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 85 transition count 93
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 81 transition count 89
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 81 transition count 89
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 77 transition count 85
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 77 transition count 85
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 73 transition count 81
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 73 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 70 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 70 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 69 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 69 transition count 77
Applied a total of 54 rules in 22 ms. Remains 69 /101 variables (removed 32) and now considering 77/99 (removed 22) transitions.
[2025-06-07 00:06:18] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
// Phase 1: matrix 68 rows 69 cols
[2025-06-07 00:06:18] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:18] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-07 00:06:18] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2025-06-07 00:06:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:18] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-07 00:06:18] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2025-06-07 00:06:18] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2025-06-07 00:06:18] [INFO ] Invariant cache hit.
[2025-06-07 00:06:18] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 2/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 67/136 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 59/131 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/137 variables, and 131 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1087 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 69/69 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 2/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 67/136 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 59/131 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 73/204 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/137 variables, and 204 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1361 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 69/69 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2481ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2481ms
Starting structural reductions in LTL mode, iteration 1 : 69/101 places, 77/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2690 ms. Remains : 69/101 places, 77/99 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), true, (NOT p0), (OR (NOT p0) (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-02 finished in 2908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 99/99 transitions.
Graph (complete) has 242 edges and 101 vertex of which 95 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 76 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 76 transition count 88
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 70 transition count 82
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 70 transition count 82
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 32 place count 65 transition count 77
Iterating global reduction 0 with 5 rules applied. Total rules applied 37 place count 65 transition count 77
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 43 place count 59 transition count 71
Iterating global reduction 0 with 6 rules applied. Total rules applied 49 place count 59 transition count 71
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 54 place count 54 transition count 66
Iterating global reduction 0 with 5 rules applied. Total rules applied 59 place count 54 transition count 66
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 64 place count 49 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 69 place count 49 transition count 61
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 74 place count 44 transition count 56
Iterating global reduction 0 with 5 rules applied. Total rules applied 79 place count 44 transition count 56
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 83 place count 40 transition count 52
Iterating global reduction 0 with 4 rules applied. Total rules applied 87 place count 40 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 91 place count 40 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 40 transition count 46
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 84 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 95 place count 38 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 38 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 37 transition count 44
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 36 transition count 43
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 36 transition count 43
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 35 transition count 42
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 35 transition count 42
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 34 transition count 41
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 34 transition count 41
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 33 transition count 40
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 33 transition count 40
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 32 transition count 39
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 32 transition count 39
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 31 transition count 38
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 31 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 31 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 31 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 113 place count 30 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 114 place count 30 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 115 place count 29 transition count 34
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 116 place count 28 transition count 33
Iterating global reduction 6 with 1 rules applied. Total rules applied 117 place count 28 transition count 33
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 118 place count 27 transition count 32
Iterating global reduction 6 with 1 rules applied. Total rules applied 119 place count 27 transition count 32
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 120 place count 26 transition count 31
Iterating global reduction 6 with 1 rules applied. Total rules applied 121 place count 26 transition count 31
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 122 place count 25 transition count 30
Iterating global reduction 6 with 1 rules applied. Total rules applied 123 place count 25 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 124 place count 25 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 125 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 126 place count 24 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 127 place count 24 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 128 place count 23 transition count 27
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 129 place count 22 transition count 26
Iterating global reduction 9 with 1 rules applied. Total rules applied 130 place count 22 transition count 26
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 132 place count 20 transition count 24
Iterating global reduction 9 with 2 rules applied. Total rules applied 134 place count 20 transition count 24
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 136 place count 20 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 137 place count 20 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 138 place count 19 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 139 place count 19 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 140 place count 18 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 141 place count 18 transition count 19
Applied a total of 141 rules in 45 ms. Remains 18 /101 variables (removed 83) and now considering 19/99 (removed 80) transitions.
// Phase 1: matrix 19 rows 18 cols
[2025-06-07 00:06:21] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:21] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-07 00:06:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:21] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-07 00:06:21] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 00:06:21] [INFO ] Redundant transitions in 34 ms returned []
Running 13 sub problems to find dead transitions.
[2025-06-07 00:06:21] [INFO ] Invariant cache hit.
[2025-06-07 00:06:21] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 15/29 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 2/31 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/32 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 2/34 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/34 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/34 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/37 variables, and 31 constraints, problems are : Problem set: 0 solved, 13 unsolved in 409 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/18 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 15/29 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/31 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/32 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 2/34 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/34 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/34 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 1/35 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/35 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 1/36 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/37 variables, and 45 constraints, problems are : Problem set: 0 solved, 13 unsolved in 503 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 917ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 917ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/101 places, 19/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1117 ms. Remains : 18/101 places, 19/99 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-03 finished in 1172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 99/99 transitions.
Graph (complete) has 242 edges and 101 vertex of which 95 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 10 places
Reduce places removed 11 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 79 transition count 90
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 79 transition count 90
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 15 place count 75 transition count 86
Iterating global reduction 0 with 4 rules applied. Total rules applied 19 place count 75 transition count 86
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 23 place count 71 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 27 place count 71 transition count 82
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 32 place count 66 transition count 77
Iterating global reduction 0 with 5 rules applied. Total rules applied 37 place count 66 transition count 77
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 42 place count 61 transition count 72
Iterating global reduction 0 with 5 rules applied. Total rules applied 47 place count 61 transition count 72
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 52 place count 56 transition count 67
Iterating global reduction 0 with 5 rules applied. Total rules applied 57 place count 56 transition count 67
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 62 place count 51 transition count 62
Iterating global reduction 0 with 5 rules applied. Total rules applied 67 place count 51 transition count 62
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 71 place count 47 transition count 58
Iterating global reduction 0 with 4 rules applied. Total rules applied 75 place count 47 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 79 place count 47 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 47 transition count 50
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 89 edges and 46 vertex of which 45 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 (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 85 place count 45 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 45 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 44 transition count 48
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 43 transition count 47
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 43 transition count 47
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 42 transition count 46
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 42 transition count 46
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 41 transition count 45
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 41 transition count 45
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 40 transition count 44
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 40 transition count 44
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 39 transition count 43
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 39 transition count 43
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 38 transition count 42
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 38 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 100 place count 38 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 38 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 37 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 103 place count 37 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 104 place count 36 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 105 place count 36 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 106 place count 35 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 107 place count 35 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 108 place count 34 transition count 37
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 109 place count 33 transition count 36
Iterating global reduction 8 with 1 rules applied. Total rules applied 110 place count 33 transition count 36
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 112 place count 31 transition count 34
Iterating global reduction 8 with 2 rules applied. Total rules applied 114 place count 31 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 116 place count 31 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 117 place count 31 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 118 place count 30 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 119 place count 30 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 120 place count 29 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 121 place count 29 transition count 29
Applied a total of 121 rules in 34 ms. Remains 29 /101 variables (removed 72) and now considering 29/99 (removed 70) transitions.
// Phase 1: matrix 29 rows 29 cols
[2025-06-07 00:06:22] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:22] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-07 00:06:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-07 00:06:22] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 00:06:22] [INFO ] Redundant transitions in 14 ms returned []
Running 22 sub problems to find dead transitions.
[2025-06-07 00:06:22] [INFO ] Invariant cache hit.
[2025-06-07 00:06:22] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 24/47 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 2/49 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 2/51 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 4/55 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 0/55 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/58 variables, and 52 constraints, problems are : Problem set: 0 solved, 22 unsolved in 408 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 28/29 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 24/47 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 2/49 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2/51 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 4/55 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 1/56 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 1/57 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/57 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 0/57 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/58 variables, and 75 constraints, problems are : Problem set: 0 solved, 22 unsolved in 490 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 938ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 939ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/101 places, 29/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1094 ms. Remains : 29/101 places, 29/99 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 215 ms.
Stuttering criterion allowed to conclude after 145 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-04 finished in 1352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((G(p1) U X(G(!p2)))&&p0))))'
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 99/99 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 91 transition count 99
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 86 transition count 94
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 86 transition count 94
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 82 transition count 90
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 82 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 80 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 80 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 78 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 78 transition count 86
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 76 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 76 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 74 transition count 82
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 74 transition count 82
Applied a total of 44 rules in 3 ms. Remains 74 /101 variables (removed 27) and now considering 82/99 (removed 17) transitions.
[2025-06-07 00:06:23] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 74 cols
[2025-06-07 00:06:23] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:23] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-07 00:06:23] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2025-06-07 00:06:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:23] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-07 00:06:23] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2025-06-07 00:06:23] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2025-06-07 00:06:23] [INFO ] Invariant cache hit.
[2025-06-07 00:06:23] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 72/146 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 64/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/147 variables, and 141 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1109 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 72/146 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 64/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 78/219 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/147 variables, and 219 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1390 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2503ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 2503ms
Starting structural reductions in LTL mode, iteration 1 : 74/101 places, 82/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2648 ms. Remains : 74/101 places, 82/99 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), p2, (AND (NOT p1) p2), p2, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-05 finished in 2896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 99/99 transitions.
Graph (complete) has 242 edges and 101 vertex of which 95 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 12 places
Reduce places removed 13 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 75 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 75 transition count 88
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 69 transition count 82
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 69 transition count 82
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 33 place count 63 transition count 76
Iterating global reduction 0 with 6 rules applied. Total rules applied 39 place count 63 transition count 76
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 46 place count 56 transition count 69
Iterating global reduction 0 with 7 rules applied. Total rules applied 53 place count 56 transition count 69
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 59 place count 50 transition count 63
Iterating global reduction 0 with 6 rules applied. Total rules applied 65 place count 50 transition count 63
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 71 place count 44 transition count 57
Iterating global reduction 0 with 6 rules applied. Total rules applied 77 place count 44 transition count 57
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 83 place count 38 transition count 51
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 38 transition count 51
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 93 place count 34 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 97 place count 34 transition count 47
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 101 place count 34 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 34 transition count 41
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 69 edges and 33 vertex of which 32 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 (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 32 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 32 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 107 place count 31 transition count 39
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 30 transition count 38
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 30 transition count 38
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 29 transition count 37
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 28 transition count 36
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 28 transition count 36
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 27 transition count 35
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 27 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 26 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 26 transition count 34
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 25 transition count 33
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 25 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 25 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 25 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 122 place count 24 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 123 place count 24 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 124 place count 23 transition count 30
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 125 place count 22 transition count 29
Iterating global reduction 6 with 1 rules applied. Total rules applied 126 place count 22 transition count 29
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 127 place count 21 transition count 28
Iterating global reduction 6 with 1 rules applied. Total rules applied 128 place count 21 transition count 28
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 129 place count 20 transition count 27
Iterating global reduction 6 with 1 rules applied. Total rules applied 130 place count 20 transition count 27
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 131 place count 19 transition count 26
Iterating global reduction 6 with 1 rules applied. Total rules applied 132 place count 19 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 133 place count 19 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 134 place count 19 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 135 place count 18 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 136 place count 18 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 137 place count 17 transition count 23
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 138 place count 16 transition count 22
Iterating global reduction 9 with 1 rules applied. Total rules applied 139 place count 16 transition count 22
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 141 place count 14 transition count 20
Iterating global reduction 9 with 2 rules applied. Total rules applied 143 place count 14 transition count 20
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 145 place count 14 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 146 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 147 place count 13 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 149 place count 13 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 150 place count 12 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 151 place count 12 transition count 14
Applied a total of 151 rules in 14 ms. Remains 12 /101 variables (removed 89) and now considering 14/99 (removed 85) transitions.
// Phase 1: matrix 14 rows 12 cols
[2025-06-07 00:06:26] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:26] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-07 00:06:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-07 00:06:26] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 00:06:26] [INFO ] Redundant transitions in 12 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-07 00:06:26] [INFO ] Invariant cache hit.
[2025-06-07 00:06:26] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/19 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/21 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/26 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 105 ms.
Refiners :[State Equation: 10/12 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/19 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/21 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/22 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/23 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/23 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/23 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/26 variables, and 27 constraints, problems are : Problem set: 0 solved, 8 unsolved in 94 ms.
Refiners :[State Equation: 11/12 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 232ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 233ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/101 places, 14/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 489 ms. Remains : 12/101 places, 14/99 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-10 finished in 532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 99/99 transitions.
Graph (complete) has 242 edges and 101 vertex of which 95 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 78 transition count 90
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 78 transition count 90
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 73 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 73 transition count 85
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 25 place count 69 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 29 place count 69 transition count 81
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 34 place count 64 transition count 76
Iterating global reduction 0 with 5 rules applied. Total rules applied 39 place count 64 transition count 76
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 43 place count 60 transition count 72
Iterating global reduction 0 with 4 rules applied. Total rules applied 47 place count 60 transition count 72
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 52 place count 55 transition count 67
Iterating global reduction 0 with 5 rules applied. Total rules applied 57 place count 55 transition count 67
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 61 place count 51 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 65 place count 51 transition count 63
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 68 place count 48 transition count 60
Iterating global reduction 0 with 3 rules applied. Total rules applied 71 place count 48 transition count 60
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 74 place count 48 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 48 transition count 54
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 95 edges and 47 vertex of which 46 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 (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 79 place count 46 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 46 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 45 transition count 52
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 44 transition count 51
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 44 transition count 51
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 43 transition count 50
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 43 transition count 50
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 42 transition count 49
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 42 transition count 49
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 41 transition count 48
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 41 transition count 48
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 40 transition count 47
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 40 transition count 47
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 39 transition count 46
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 39 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 39 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 39 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 97 place count 38 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 98 place count 38 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 99 place count 37 transition count 42
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 100 place count 36 transition count 41
Iterating global reduction 6 with 1 rules applied. Total rules applied 101 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 102 place count 35 transition count 40
Iterating global reduction 6 with 1 rules applied. Total rules applied 103 place count 35 transition count 40
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 104 place count 34 transition count 39
Iterating global reduction 6 with 1 rules applied. Total rules applied 105 place count 34 transition count 39
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 106 place count 33 transition count 38
Iterating global reduction 6 with 1 rules applied. Total rules applied 107 place count 33 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 108 place count 33 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 109 place count 33 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 110 place count 32 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 111 place count 32 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 112 place count 31 transition count 35
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 113 place count 30 transition count 34
Iterating global reduction 9 with 1 rules applied. Total rules applied 114 place count 30 transition count 34
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 116 place count 28 transition count 32
Iterating global reduction 9 with 2 rules applied. Total rules applied 118 place count 28 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 120 place count 28 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 121 place count 28 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 122 place count 27 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 123 place count 27 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 124 place count 26 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 125 place count 26 transition count 27
Applied a total of 125 rules in 36 ms. Remains 26 /101 variables (removed 75) and now considering 27/99 (removed 72) transitions.
// Phase 1: matrix 27 rows 26 cols
[2025-06-07 00:06:27] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:27] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-07 00:06:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-07 00:06:27] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 00:06:27] [INFO ] Redundant transitions in 19 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-07 00:06:27] [INFO ] Invariant cache hit.
[2025-06-07 00:06:27] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/43 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 2/45 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/47 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 3/50 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/50 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/50 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/50 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/53 variables, and 46 constraints, problems are : Problem set: 0 solved, 20 unsolved in 412 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/26 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/43 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 17/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 2/45 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 2/47 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 3/50 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/50 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/50 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 1/51 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/51 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 1/52 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/52 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (OVERLAPS) 0/52 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 67 constraints, problems are : Problem set: 0 solved, 20 unsolved in 512 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 960ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 961ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/101 places, 27/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1173 ms. Remains : 26/101 places, 27/99 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-11 finished in 1271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F(p1))))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 99/99 transitions.
Graph (complete) has 242 edges and 101 vertex of which 95 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 77 transition count 89
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 77 transition count 89
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 72 transition count 84
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 72 transition count 84
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 28 place count 67 transition count 79
Iterating global reduction 0 with 5 rules applied. Total rules applied 33 place count 67 transition count 79
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 39 place count 61 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 45 place count 61 transition count 73
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 51 place count 55 transition count 67
Iterating global reduction 0 with 6 rules applied. Total rules applied 57 place count 55 transition count 67
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 63 place count 49 transition count 61
Iterating global reduction 0 with 6 rules applied. Total rules applied 69 place count 49 transition count 61
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 75 place count 43 transition count 55
Iterating global reduction 0 with 6 rules applied. Total rules applied 81 place count 43 transition count 55
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 85 place count 39 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 89 place count 39 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 93 place count 39 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 39 transition count 44
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 76 edges and 38 vertex of which 37 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 (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 98 place count 37 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 37 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 36 transition count 42
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 35 transition count 41
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 35 transition count 41
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 34 transition count 40
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 34 transition count 40
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 33 transition count 39
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 33 transition count 39
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 32 transition count 38
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 32 transition count 38
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 31 transition count 37
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 31 transition count 37
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 30 transition count 36
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 30 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 30 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 30 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 115 place count 29 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 116 place count 29 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 117 place count 28 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 118 place count 28 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 119 place count 27 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 120 place count 27 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 121 place count 26 transition count 31
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 122 place count 25 transition count 30
Iterating global reduction 8 with 1 rules applied. Total rules applied 123 place count 25 transition count 30
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 125 place count 23 transition count 28
Iterating global reduction 8 with 2 rules applied. Total rules applied 127 place count 23 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 129 place count 23 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 130 place count 23 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 131 place count 22 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 133 place count 22 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 134 place count 21 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 135 place count 21 transition count 22
Applied a total of 135 rules in 15 ms. Remains 21 /101 variables (removed 80) and now considering 22/99 (removed 77) transitions.
// Phase 1: matrix 22 rows 21 cols
[2025-06-07 00:06:28] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:28] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-07 00:06:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:28] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-07 00:06:28] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 00:06:28] [INFO ] Redundant transitions in 11 ms returned []
Running 15 sub problems to find dead transitions.
[2025-06-07 00:06:28] [INFO ] Invariant cache hit.
[2025-06-07 00:06:28] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/33 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2/35 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/36 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 2/38 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/43 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 369 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/33 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 2/35 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/36 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 2/38 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 1/39 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/39 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 1/40 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/40 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 0/40 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 15 unsolved in 328 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 713ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 713ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/101 places, 22/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 832 ms. Remains : 21/101 places, 22/99 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-12 finished in 915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 99/99 transitions.
Graph (complete) has 242 edges and 101 vertex of which 95 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 77 transition count 89
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 77 transition count 89
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 72 transition count 84
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 72 transition count 84
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 28 place count 67 transition count 79
Iterating global reduction 0 with 5 rules applied. Total rules applied 33 place count 67 transition count 79
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 39 place count 61 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 45 place count 61 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 50 place count 56 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 55 place count 56 transition count 68
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 61 place count 50 transition count 62
Iterating global reduction 0 with 6 rules applied. Total rules applied 67 place count 50 transition count 62
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 72 place count 45 transition count 57
Iterating global reduction 0 with 5 rules applied. Total rules applied 77 place count 45 transition count 57
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 81 place count 41 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 85 place count 41 transition count 53
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 89 place count 41 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 41 transition count 47
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 84 edges and 40 vertex of which 39 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 (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 39 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 39 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 38 transition count 44
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 37 transition count 43
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 37 transition count 43
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 36 transition count 42
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 36 transition count 42
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 35 transition count 41
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 35 transition count 41
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 34 transition count 40
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 34 transition count 40
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 33 transition count 39
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 33 transition count 39
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 32 transition count 38
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 32 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 32 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 32 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 111 place count 31 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 112 place count 31 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 113 place count 30 transition count 35
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 114 place count 29 transition count 34
Iterating global reduction 6 with 1 rules applied. Total rules applied 115 place count 29 transition count 34
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 116 place count 28 transition count 33
Iterating global reduction 6 with 1 rules applied. Total rules applied 117 place count 28 transition count 33
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 118 place count 27 transition count 32
Iterating global reduction 6 with 1 rules applied. Total rules applied 119 place count 27 transition count 32
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 120 place count 26 transition count 31
Iterating global reduction 6 with 1 rules applied. Total rules applied 121 place count 26 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 122 place count 26 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 123 place count 26 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 124 place count 25 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 125 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 126 place count 24 transition count 28
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 127 place count 23 transition count 27
Iterating global reduction 9 with 1 rules applied. Total rules applied 128 place count 23 transition count 27
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 130 place count 21 transition count 25
Iterating global reduction 9 with 2 rules applied. Total rules applied 132 place count 21 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 134 place count 21 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 135 place count 21 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 136 place count 20 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 137 place count 20 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 138 place count 19 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 139 place count 19 transition count 20
Applied a total of 139 rules in 20 ms. Remains 19 /101 variables (removed 82) and now considering 20/99 (removed 79) transitions.
// Phase 1: matrix 20 rows 19 cols
[2025-06-07 00:06:29] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:29] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-07 00:06:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:06:29] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-07 00:06:29] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 00:06:29] [INFO ] Redundant transitions in 24 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-07 00:06:29] [INFO ] Invariant cache hit.
[2025-06-07 00:06:29] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 2/33 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 2/36 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/39 variables, and 33 constraints, problems are : Problem set: 0 solved, 14 unsolved in 366 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/19 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/33 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/34 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 2/36 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 1/37 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 1/38 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/39 variables, and 48 constraints, problems are : Problem set: 0 solved, 14 unsolved in 290 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 681ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 681ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/101 places, 20/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 845 ms. Remains : 19/101 places, 20/99 transitions.
Stuttering acceptance computed with spot in 30 ms :[p0]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-13
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-13 finished in 884 ms.
All properties solved by simple procedures.
Total runtime 21936 ms.

BK_STOP 1749254790369

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="SemanticWebServices-PT-S128P18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is SemanticWebServices-PT-S128P18, 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 r184-tall-174889265100916"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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