About the Execution of ITS-Tools for SemanticWebServices-PT-S128P18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 31607.00 | 0.00 | 0.00 | FFFFFFFTFFFTFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r184-tall-174889265100915.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889265100915
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749254726765
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202505121319
[2025-06-07 00:05:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 00:05:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 00:05:28] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2025-06-07 00:05:28] [INFO ] Transformed 184 places.
[2025-06-07 00:05:28] [INFO ] Transformed 466 transitions.
[2025-06-07 00:05:28] [INFO ] Parsed PT model containing 184 places and 466 transitions and 1873 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 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-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 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 46 places
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 116 transition count 137
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 133 place count 107 transition count 128
Iterating global reduction 1 with 9 rules applied. Total rules applied 142 place count 107 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 144 place count 107 transition count 126
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 148 place count 103 transition count 122
Iterating global reduction 2 with 4 rules applied. Total rules applied 152 place count 103 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 154 place count 101 transition count 120
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 101 transition count 120
Applied a total of 156 rules in 28 ms. Remains 101 /182 variables (removed 81) and now considering 120/195 (removed 75) transitions.
[2025-06-07 00:05:28] [INFO ] Flow matrix only has 111 transitions (discarded 9 similar events)
// Phase 1: matrix 111 rows 101 cols
[2025-06-07 00:05:28] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:28] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-07 00:05:28] [INFO ] Flow matrix only has 111 transitions (discarded 9 similar events)
[2025-06-07 00:05:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-07 00:05:28] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2025-06-07 00:05:28] [INFO ] Flow matrix only has 111 transitions (discarded 9 similar events)
[2025-06-07 00:05:28] [INFO ] Invariant cache hit.
[2025-06-07 00:05:28] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 86/175 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/175 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/212 variables, and 171 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1941 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/101 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 86/175 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 92/263 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/175 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/212 variables, and 263 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2126 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/101 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4095ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4106ms
Starting structural reductions in LTL mode, iteration 1 : 101/182 places, 120/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4455 ms. Remains : 101/182 places, 120/195 transitions.
Support contains 48 out of 101 places after structural reductions.
[2025-06-07 00:05:32] [INFO ] Flatten gal took : 21 ms
[2025-06-07 00:05:32] [INFO ] Flatten gal took : 9 ms
[2025-06-07 00:05:33] [INFO ] Input system was already deterministic with 120 transitions.
Support contains 46 out of 101 places (down from 48) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1014 ms. (39 steps per ms) remains 1/32 properties
BEST_FIRST walk for 39528 steps (8 resets) in 81 ms. (482 steps per ms) remains 0/1 properties
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X(p2)&&(p0 U (p1||G(p0))))))) U (G(F(((p0 U (p1||G(p0))) U ((X(p2)&&(p0 U (p1||G(p0))))||G((p0 U (p1||G(p0))))))))||(p3&&F(((p0 U (p1||G(p0))) U ((X(p2)&&(p0 U (p1||G(p0))))||G((p0 U (p1||G(p0))))))))))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 120/120 transitions.
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 89 transition count 99
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 84 transition count 94
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 84 transition count 94
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 80 transition count 90
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 80 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 77 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 77 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 76 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 76 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 75 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 75 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 74 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 74 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 73 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 73 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 72 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 72 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 72 transition count 81
Applied a total of 68 rules in 20 ms. Remains 72 /101 variables (removed 29) and now considering 81/120 (removed 39) transitions.
[2025-06-07 00:05:33] [INFO ] Flow matrix only has 73 transitions (discarded 8 similar events)
// Phase 1: matrix 73 rows 72 cols
[2025-06-07 00:05:33] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:33] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-07 00:05:33] [INFO ] Flow matrix only has 73 transitions (discarded 8 similar events)
[2025-06-07 00:05:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:33] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-07 00:05:33] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-07 00:05:33] [INFO ] Flow matrix only has 73 transitions (discarded 8 similar events)
[2025-06-07 00:05:33] [INFO ] Invariant cache hit.
[2025-06-07 00:05:33] [INFO ] State equation strengthened by 61 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, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 2/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 69/138 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 61/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 0/138 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/145 variables, and 131 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1220 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/72 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 2/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 69/138 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 61/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 74/205 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/145 variables, and 205 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1344 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/72 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2578ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2578ms
Starting structural reductions in LTL mode, iteration 1 : 72/101 places, 81/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2675 ms. Remains : 72/101 places, 81/120 transitions.
Stuttering acceptance computed with spot in 432 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-00 finished in 3184 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||X(((G(p1)&&F(p2)) U (!p0&&G(p1)&&F(p2)))))))'
Support contains 4 out of 101 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 120/120 transitions.
Graph (complete) has 191 edges and 101 vertex of which 84 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.3 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 80 transition count 93
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 76 transition count 89
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 76 transition count 89
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 72 transition count 85
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 72 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 69 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 69 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 66 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 66 transition count 79
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 63 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 63 transition count 76
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 60 transition count 73
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 60 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 58 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 58 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 57 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 57 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 57 transition count 69
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 73 place count 57 transition count 67
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 114 edges and 56 vertex of which 55 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 2 with 2 rules applied. Total rules applied 75 place count 55 transition count 66
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 54 transition count 65
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 54 transition count 65
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 53 transition count 64
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 53 transition count 64
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 52 transition count 63
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 52 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 52 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 51 transition count 61
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 85 place count 51 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 50 transition count 60
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 87 place count 49 transition count 59
Iterating global reduction 5 with 1 rules applied. Total rules applied 88 place count 49 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 91 place count 49 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 48 transition count 56
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 93 place count 47 transition count 55
Iterating global reduction 6 with 1 rules applied. Total rules applied 94 place count 47 transition count 55
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 95 place count 46 transition count 54
Iterating global reduction 6 with 1 rules applied. Total rules applied 96 place count 46 transition count 54
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 97 place count 45 transition count 53
Iterating global reduction 6 with 1 rules applied. Total rules applied 98 place count 45 transition count 53
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 99 place count 44 transition count 52
Iterating global reduction 6 with 1 rules applied. Total rules applied 100 place count 44 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 101 place count 44 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 104 place count 44 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 105 place count 43 transition count 48
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 106 place count 43 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 107 place count 42 transition count 47
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 108 place count 41 transition count 46
Iterating global reduction 9 with 1 rules applied. Total rules applied 109 place count 41 transition count 46
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 111 place count 39 transition count 44
Iterating global reduction 9 with 2 rules applied. Total rules applied 113 place count 39 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 115 place count 39 transition count 42
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 116 place count 39 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 117 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 11 with 1 rules applied. Total rules applied 118 place count 38 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 119 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 12 with 1 rules applied. Total rules applied 120 place count 37 transition count 39
Applied a total of 120 rules in 78 ms. Remains 37 /101 variables (removed 64) and now considering 39/120 (removed 81) transitions.
// Phase 1: matrix 39 rows 37 cols
[2025-06-07 00:05:37] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:37] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-07 00:05:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:37] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-07 00:05:37] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 00:05:37] [INFO ] Redundant transitions in 21 ms returned []
Running 28 sub problems to find dead transitions.
[2025-06-07 00:05:37] [INFO ] Invariant cache hit.
[2025-06-07 00:05:37] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 30/59 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 23/52 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 2/61 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 5/66 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 5/71 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/71 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/76 variables, and 63 constraints, problems are : Problem set: 0 solved, 28 unsolved in 655 ms.
Refiners :[State Equation: 35/37 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 30/59 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 23/52 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 22/74 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 2/61 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 5/66 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 5/71 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 1/72 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 1/73 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/73 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (OVERLAPS) 0/73 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/76 variables, and 92 constraints, problems are : Problem set: 0 solved, 28 unsolved in 630 ms.
Refiners :[State Equation: 36/37 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1308ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1309ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/101 places, 39/120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1527 ms. Remains : 37/101 places, 39/120 transitions.
Stuttering acceptance computed with spot in 24 ms :[p0]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-01 finished in 1566 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&&X(F((X(p1)&&((p2||X(!p0)) U (G((p2||X(!p0)))||(!p0&&(p2||X(!p0)))))))))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 120/120 transitions.
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 88 transition count 98
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 83 transition count 93
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 83 transition count 93
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 78 transition count 88
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 78 transition count 88
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 75 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 75 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 73 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 73 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 72 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 72 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 71 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 71 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 70 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 70 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 69 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 69 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 69 transition count 78
Applied a total of 74 rules in 13 ms. Remains 69 /101 variables (removed 32) and now considering 78/120 (removed 42) transitions.
[2025-06-07 00:05:38] [INFO ] Flow matrix only has 70 transitions (discarded 8 similar events)
// Phase 1: matrix 70 rows 69 cols
[2025-06-07 00:05:38] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:38] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-07 00:05:38] [INFO ] Flow matrix only has 70 transitions (discarded 8 similar events)
[2025-06-07 00:05:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:38] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-07 00:05:38] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2025-06-07 00:05:38] [INFO ] Flow matrix only has 70 transitions (discarded 8 similar events)
[2025-06-07 00:05:38] [INFO ] Invariant cache hit.
[2025-06-07 00:05:38] [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/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 2/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 67/134 variables, 67/68 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 59/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/139 variables, and 127 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1105 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/69 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 2/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 67/134 variables, 67/68 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 59/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 72/199 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/139 variables, and 199 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1080 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/69 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2200ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2200ms
Starting structural reductions in LTL mode, iteration 1 : 69/101 places, 78/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2298 ms. Remains : 69/101 places, 78/120 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p1) (AND p0 (NOT p2))), (NOT p1), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-02
Stuttering criterion allowed to conclude after 64 steps with 1 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-02 finished in 2539 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||G(p1)))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 120/120 transitions.
Graph (complete) has 191 edges and 101 vertex of which 84 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 80 transition count 93
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 74 transition count 87
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 74 transition count 87
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 69 transition count 82
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 69 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 66 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 64 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 63 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 63 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 62 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 62 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 61 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 61 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 60 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 60 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 60 transition count 72
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 67 place count 60 transition count 70
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 120 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 58 transition count 69
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 57 transition count 68
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 57 transition count 68
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 55 transition count 66
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 55 transition count 66
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 78 place count 52 transition count 63
Iterating global reduction 3 with 3 rules applied. Total rules applied 81 place count 52 transition count 63
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 84 place count 49 transition count 60
Iterating global reduction 3 with 3 rules applied. Total rules applied 87 place count 49 transition count 60
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 45 transition count 56
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 45 transition count 56
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 40 transition count 51
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 40 transition count 51
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 36 transition count 47
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 36 transition count 47
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 117 place count 36 transition count 43
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 119 place count 36 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 120 place count 35 transition count 41
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 121 place count 35 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 122 place count 34 transition count 40
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 123 place count 33 transition count 39
Iterating global reduction 6 with 1 rules applied. Total rules applied 124 place count 33 transition count 39
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 125 place count 32 transition count 38
Iterating global reduction 6 with 1 rules applied. Total rules applied 126 place count 32 transition count 38
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 127 place count 31 transition count 37
Iterating global reduction 6 with 1 rules applied. Total rules applied 128 place count 31 transition count 37
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 129 place count 30 transition count 36
Iterating global reduction 6 with 1 rules applied. Total rules applied 130 place count 30 transition count 36
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 131 place count 29 transition count 35
Iterating global reduction 6 with 1 rules applied. Total rules applied 132 place count 29 transition count 35
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 29 transition count 34
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 29 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 135 place count 28 transition count 33
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 136 place count 27 transition count 32
Iterating global reduction 8 with 1 rules applied. Total rules applied 137 place count 27 transition count 32
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 138 place count 26 transition count 31
Iterating global reduction 8 with 1 rules applied. Total rules applied 139 place count 26 transition count 31
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 140 place count 26 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 141 place count 25 transition count 30
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 142 place count 25 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 143 place count 24 transition count 29
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 144 place count 23 transition count 28
Iterating global reduction 10 with 1 rules applied. Total rules applied 145 place count 23 transition count 28
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 146 place count 22 transition count 27
Iterating global reduction 10 with 1 rules applied. Total rules applied 147 place count 22 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 148 place count 22 transition count 26
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 149 place count 22 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 150 place count 21 transition count 25
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 151 place count 20 transition count 24
Iterating global reduction 12 with 1 rules applied. Total rules applied 152 place count 20 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 153 place count 20 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 154 place count 20 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 155 place count 19 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 156 place count 19 transition count 21
Applied a total of 156 rules in 31 ms. Remains 19 /101 variables (removed 82) and now considering 21/120 (removed 99) transitions.
// Phase 1: matrix 21 rows 19 cols
[2025-06-07 00:05:41] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:41] [INFO ] Implicit Places using invariants in 14 ms returned []
[2025-06-07 00:05:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:41] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-07 00:05:41] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 00:05:41] [INFO ] Redundant transitions in 12 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-07 00:05:41] [INFO ] Invariant cache hit.
[2025-06-07 00:05:41] [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) 1/35 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/35 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/40 variables, and 31 constraints, problems are : Problem set: 0 solved, 14 unsolved in 180 ms.
Refiners :[State Equation: 17/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) 1/35 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/35 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 1/36 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 1/37 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/37 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 0/37 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/40 variables, and 46 constraints, problems are : Problem set: 0 solved, 14 unsolved in 225 ms.
Refiners :[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]
After SMT, in 424ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 425ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/101 places, 21/120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 528 ms. Remains : 19/101 places, 21/120 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-04
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-04 finished in 613 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((p0||X((p1||F((!p1&&X(X(!p0)))))))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 120/120 transitions.
Ensure Unique test removed 3 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 87 transition count 97
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 82 transition count 92
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 82 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 77 transition count 87
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 77 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 74 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 74 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 72 transition count 82
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 72 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 71 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 71 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 70 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 70 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 69 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 68 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 68 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 68 transition count 77
Applied a total of 76 rules in 10 ms. Remains 68 /101 variables (removed 33) and now considering 77/120 (removed 43) transitions.
[2025-06-07 00:05:41] [INFO ] Flow matrix only has 69 transitions (discarded 8 similar events)
// Phase 1: matrix 69 rows 68 cols
[2025-06-07 00:05:41] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:41] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-07 00:05:41] [INFO ] Flow matrix only has 69 transitions (discarded 8 similar events)
[2025-06-07 00:05:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:41] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-07 00:05:41] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2025-06-07 00:05:41] [INFO ] Flow matrix only has 69 transitions (discarded 8 similar events)
[2025-06-07 00:05:41] [INFO ] Invariant cache hit.
[2025-06-07 00:05:41] [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/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 2/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 67/134 variables, 67/68 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 59/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/137 variables, and 127 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1133 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/68 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 2/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 67/134 variables, 67/68 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 59/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 72/199 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/137 variables, and 199 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1132 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/68 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2270ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2271ms
Starting structural reductions in LTL mode, iteration 1 : 68/101 places, 77/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2379 ms. Remains : 68/101 places, 77/120 transitions.
Stuttering acceptance computed with spot in 231 ms :[false, (AND (NOT p1) p0), p0, p0, p0, (OR p0 p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-05
Stuttering criterion allowed to conclude after 31 steps with 4 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-05 finished in 2631 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||X(((F(p1)||G((p2||X(p3)))) U (p0&&(F(p1)||G((p2||X(p3))))))))))'
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 120/120 transitions.
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 88 transition count 98
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 84 transition count 94
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 84 transition count 94
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 80 transition count 90
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 80 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 77 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 77 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 75 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 75 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 74 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 74 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 73 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 73 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 72 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 72 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 71 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 71 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 71 transition count 80
Applied a total of 70 rules in 11 ms. Remains 71 /101 variables (removed 30) and now considering 80/120 (removed 40) transitions.
[2025-06-07 00:05:44] [INFO ] Flow matrix only has 72 transitions (discarded 8 similar events)
// Phase 1: matrix 72 rows 71 cols
[2025-06-07 00:05:44] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:44] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-07 00:05:44] [INFO ] Flow matrix only has 72 transitions (discarded 8 similar events)
[2025-06-07 00:05:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:44] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-07 00:05:44] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-07 00:05:44] [INFO ] Flow matrix only has 72 transitions (discarded 8 similar events)
[2025-06-07 00:05:44] [INFO ] Invariant cache hit.
[2025-06-07 00:05:44] [INFO ] State equation strengthened by 61 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, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 2/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 69/138 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 61/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 0/138 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/143 variables, and 131 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1085 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/71 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 2/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 69/138 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 61/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 74/205 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/143 variables, and 205 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1209 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/71 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2299ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2300ms
Starting structural reductions in LTL mode, iteration 1 : 71/101 places, 80/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2404 ms. Remains : 71/101 places, 80/120 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-06 finished in 2651 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(X(G(p0))))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 120/120 transitions.
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 86 transition count 96
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 81 transition count 91
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 81 transition count 91
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 76 transition count 86
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 76 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 73 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 73 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 71 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 71 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 70 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 70 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 69 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 68 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 68 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 67 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 67 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 67 transition count 76
Applied a total of 78 rules in 6 ms. Remains 67 /101 variables (removed 34) and now considering 76/120 (removed 44) transitions.
[2025-06-07 00:05:47] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
// Phase 1: matrix 68 rows 67 cols
[2025-06-07 00:05:47] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:47] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-07 00:05:47] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2025-06-07 00:05:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:47] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-07 00:05:47] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2025-06-07 00:05:47] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2025-06-07 00:05:47] [INFO ] Invariant cache hit.
[2025-06-07 00:05:47] [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/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 2/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 67/134 variables, 67/68 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 59/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/135 variables, and 127 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1106 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 2/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 67/134 variables, 67/68 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 59/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 72/199 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/135 variables, and 199 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1146 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2256ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2256ms
Starting structural reductions in LTL mode, iteration 1 : 67/101 places, 76/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2337 ms. Remains : 67/101 places, 76/120 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 253 steps with 0 reset in 8 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-08 finished in 2477 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(X((F(p0)&&(p1||(p2 U X(X(!p0))))))))'
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 120/120 transitions.
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 88 transition count 98
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 83 transition count 93
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 83 transition count 93
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 78 transition count 88
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 78 transition count 88
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 75 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 75 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 73 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 73 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 72 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 72 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 71 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 71 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 70 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 70 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 69 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 69 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 69 transition count 78
Applied a total of 74 rules in 7 ms. Remains 69 /101 variables (removed 32) and now considering 78/120 (removed 42) transitions.
[2025-06-07 00:05:49] [INFO ] Flow matrix only has 70 transitions (discarded 8 similar events)
// Phase 1: matrix 70 rows 69 cols
[2025-06-07 00:05:49] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-07 00:05:49] [INFO ] Flow matrix only has 70 transitions (discarded 8 similar events)
[2025-06-07 00:05:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:49] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-07 00:05:49] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2025-06-07 00:05:49] [INFO ] Flow matrix only has 70 transitions (discarded 8 similar events)
[2025-06-07 00:05:49] [INFO ] Invariant cache hit.
[2025-06-07 00:05:49] [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/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 2/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 67/134 variables, 67/68 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 59/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/139 variables, and 127 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1051 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/69 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 2/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 67/134 variables, 67/68 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 59/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 72/199 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/139 variables, and 199 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1093 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/69 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2149ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2150ms
Starting structural reductions in LTL mode, iteration 1 : 69/101 places, 78/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2234 ms. Remains : 69/101 places, 78/120 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), p0, p0, p0, true, p0, p0]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-09 finished in 2583 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(X(G((F(G(p0)) U p1)))))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 120/120 transitions.
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 86 transition count 96
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 82 transition count 92
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 82 transition count 92
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 78 transition count 88
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 78 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 76 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 76 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 75 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 75 transition count 85
Applied a total of 61 rules in 4 ms. Remains 75 /101 variables (removed 26) and now considering 85/120 (removed 35) transitions.
[2025-06-07 00:05:52] [INFO ] Flow matrix only has 76 transitions (discarded 9 similar events)
// Phase 1: matrix 76 rows 75 cols
[2025-06-07 00:05:52] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:52] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-07 00:05:52] [INFO ] Flow matrix only has 76 transitions (discarded 9 similar events)
[2025-06-07 00:05:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:52] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-07 00:05:52] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2025-06-07 00:05:52] [INFO ] Flow matrix only has 76 transitions (discarded 9 similar events)
[2025-06-07 00:05:52] [INFO ] Invariant cache hit.
[2025-06-07 00:05:52] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 2/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 75/150 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 67/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 0/150 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/151 variables, and 143 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1336 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 2/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 75/150 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 67/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 81/224 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/151 variables, and 224 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1417 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2757ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 2758ms
Starting structural reductions in LTL mode, iteration 1 : 75/101 places, 85/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2860 ms. Remains : 75/101 places, 85/120 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-12
Stuttering criterion allowed to conclude after 711 steps with 0 reset in 8 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-12 finished in 3065 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(p0)||F((G(F(p1))||(p2&&F(p1))))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 120/120 transitions.
Graph (complete) has 191 edges and 101 vertex of which 84 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 80 transition count 93
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 74 transition count 87
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 74 transition count 87
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 68 transition count 81
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 68 transition count 81
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 63 transition count 76
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 63 transition count 76
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 59 transition count 72
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 59 transition count 72
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 56 transition count 69
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 56 transition count 69
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 52 transition count 65
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 52 transition count 65
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 84 place count 48 transition count 61
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 48 transition count 61
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 46 transition count 59
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 46 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 94 place count 46 transition count 57
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 96 place count 46 transition count 55
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 92 edges and 45 vertex of which 44 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 2 with 2 rules applied. Total rules applied 98 place count 44 transition count 54
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 43 transition count 53
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 43 transition count 53
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 42 transition count 52
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 42 transition count 52
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 40 transition count 50
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 40 transition count 50
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 38 transition count 48
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 38 transition count 48
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 36 transition count 46
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 36 transition count 46
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 34 transition count 44
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 34 transition count 44
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 32 transition count 42
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 32 transition count 42
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 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 4 with 1 rules applied. Total rules applied 125 place count 32 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 126 place count 31 transition count 39
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 127 place count 31 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 128 place count 30 transition count 38
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 129 place count 29 transition count 37
Iterating global reduction 6 with 1 rules applied. Total rules applied 130 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 131 place count 28 transition count 36
Iterating global reduction 6 with 1 rules applied. Total rules applied 132 place count 28 transition count 36
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 133 place count 27 transition count 35
Iterating global reduction 6 with 1 rules applied. Total rules applied 134 place count 27 transition count 35
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 136 place count 25 transition count 33
Iterating global reduction 6 with 2 rules applied. Total rules applied 138 place count 25 transition count 33
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 141 place count 22 transition count 30
Iterating global reduction 6 with 3 rules applied. Total rules applied 144 place count 22 transition count 30
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 147 place count 22 transition count 27
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 148 place count 22 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 149 place count 21 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 151 place count 21 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 152 place count 20 transition count 24
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 153 place count 20 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 154 place count 19 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 155 place count 19 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 156 place count 18 transition count 22
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 157 place count 17 transition count 21
Iterating global reduction 11 with 1 rules applied. Total rules applied 158 place count 17 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 159 place count 17 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 160 place count 17 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 161 place count 16 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 162 place count 16 transition count 18
Applied a total of 162 rules in 15 ms. Remains 16 /101 variables (removed 85) and now considering 18/120 (removed 102) transitions.
// Phase 1: matrix 18 rows 16 cols
[2025-06-07 00:05:55] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:55] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-07 00:05:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:55] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-07 00:05:55] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 00:05:55] [INFO ] Redundant transitions in 11 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-07 00:05:55] [INFO ] Invariant cache hit.
[2025-06-07 00:05:55] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 13/25 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 2/27 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1/28 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/29 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/29 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/34 variables, and 25 constraints, problems are : Problem set: 0 solved, 11 unsolved in 142 ms.
Refiners :[State Equation: 14/16 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 13/25 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/27 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/29 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/29 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 1/30 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/30 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 1/31 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/31 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/31 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/34 variables, and 37 constraints, problems are : Problem set: 0 solved, 11 unsolved in 179 ms.
Refiners :[State Equation: 15/16 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 322ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 323ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/101 places, 18/120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 398 ms. Remains : 16/101 places, 18/120 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-13
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-13 finished in 554 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(X(((G(!p0)||(!p0&&F(p1))) U p2))))'
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 120/120 transitions.
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 86 transition count 96
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 81 transition count 91
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 81 transition count 91
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 77 transition count 87
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 77 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 74 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 74 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 73 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 73 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 72 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 72 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 71 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 71 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 70 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 70 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 69 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 69 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 69 transition count 78
Applied a total of 74 rules in 8 ms. Remains 69 /101 variables (removed 32) and now considering 78/120 (removed 42) transitions.
[2025-06-07 00:05:55] [INFO ] Flow matrix only has 70 transitions (discarded 8 similar events)
// Phase 1: matrix 70 rows 69 cols
[2025-06-07 00:05:55] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:55] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-07 00:05:55] [INFO ] Flow matrix only has 70 transitions (discarded 8 similar events)
[2025-06-07 00:05:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 00:05:55] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-07 00:05:55] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-06-07 00:05:55] [INFO ] Flow matrix only has 70 transitions (discarded 8 similar events)
[2025-06-07 00:05:55] [INFO ] Invariant cache hit.
[2025-06-07 00:05:55] [INFO ] State equation strengthened by 61 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, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 2/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 69/138 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 61/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 0/138 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/139 variables, and 131 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1159 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 2/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 69/138 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 61/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 74/205 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/139 variables, and 205 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1172 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2350ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2350ms
Starting structural reductions in LTL mode, iteration 1 : 69/101 places, 78/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2428 ms. Remains : 69/101 places, 78/120 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-15 finished in 2630 ms.
All properties solved by simple procedures.
Total runtime 30378 ms.
BK_STOP 1749254758372
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-174889265100915"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;