Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 02:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 02:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 02:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 02:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 227K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717228564148

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S128P15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:56:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:56:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:56:05] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2024-06-01 07:56:05] [INFO ] Transformed 188 places.
[2024-06-01 07:56:05] [INFO ] Transformed 416 transitions.
[2024-06-01 07:56:05] [INFO ] Parsed PT model containing 188 places and 416 transitions and 1593 arcs in 296 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 220 transitions
Reduce redundant transitions removed 220 transitions.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Ensure Unique test removed 31 places
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 0 with 179 rules applied. Total rules applied 179 place count 96 transition count 105
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 184 place count 91 transition count 100
Iterating global reduction 1 with 5 rules applied. Total rules applied 189 place count 91 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 190 place count 91 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 192 place count 89 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 89 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 195 place count 88 transition count 96
Iterating global reduction 2 with 1 rules applied. Total rules applied 196 place count 88 transition count 96
Applied a total of 196 rules in 47 ms. Remains 88 /186 variables (removed 98) and now considering 96/194 (removed 98) transitions.
[2024-06-01 07:56:05] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
// Phase 1: matrix 87 rows 88 cols
[2024-06-01 07:56:06] [INFO ] Computed 4 invariants in 8 ms
[2024-06-01 07:56:06] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 07:56:06] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2024-06-01 07:56:06] [INFO ] Invariant cache hit.
[2024-06-01 07:56:06] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-01 07:56:06] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-06-01 07:56:06] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2024-06-01 07:56:06] [INFO ] Invariant cache hit.
[2024-06-01 07:56:06] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 2/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 73/148 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 64/143 constraints. Problems are: Problem set: 0 solved, 78 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/175 variables, and 143 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1186 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 75/88 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 2/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 73/148 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 64/143 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 78/221 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/148 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/175 variables, and 221 constraints, problems are : Problem set: 0 solved, 78 unsolved in 874 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 75/88 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 2114ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 2130ms
Starting structural reductions in LTL mode, iteration 1 : 88/186 places, 96/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2496 ms. Remains : 88/186 places, 96/194 transitions.
Support contains 44 out of 88 places after structural reductions.
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:56:08] [INFO ] Input system was already deterministic with 96 transitions.
Support contains 41 out of 88 places (down from 44) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1593 ms. (25 steps per ms) remains 1/33 properties
BEST_FIRST walk for 26063 steps (5 resets) in 75 ms. (342 steps per ms) remains 0/1 properties
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((G(p1) U p2))) U X(p3)))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 96/96 transitions.
Ensure Unique test removed 3 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 74 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 69 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 69 transition count 80
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 64 transition count 75
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 64 transition count 75
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 59 transition count 70
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 59 transition count 70
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 56 transition count 67
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 56 transition count 67
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 54 transition count 65
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 54 transition count 65
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 52 transition count 63
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 52 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 52 transition count 61
Applied a total of 71 rules in 12 ms. Remains 52 /88 variables (removed 36) and now considering 61/96 (removed 35) transitions.
[2024-06-01 07:56:09] [INFO ] Flow matrix only has 54 transitions (discarded 7 similar events)
// Phase 1: matrix 54 rows 52 cols
[2024-06-01 07:56:09] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:56:09] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 07:56:09] [INFO ] Flow matrix only has 54 transitions (discarded 7 similar events)
[2024-06-01 07:56:09] [INFO ] Invariant cache hit.
[2024-06-01 07:56:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 07:56:09] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 07:56:09] [INFO ] Flow matrix only has 54 transitions (discarded 7 similar events)
[2024-06-01 07:56:09] [INFO ] Invariant cache hit.
[2024-06-01 07:56:09] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 2/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 51/101 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 42/93 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 54 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/106 variables, and 93 constraints, problems are : Problem set: 0 solved, 54 unsolved in 612 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/52 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 2/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 51/101 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 42/93 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 54/147 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/106 variables, and 147 constraints, problems are : Problem set: 0 solved, 54 unsolved in 473 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/52 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 1092ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 1093ms
Starting structural reductions in LTL mode, iteration 1 : 52/88 places, 61/96 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1178 ms. Remains : 52/88 places, 61/96 transitions.
Stuttering acceptance computed with spot in 363 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), true, (NOT p1), (NOT p2)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-00
Stuttering criterion allowed to conclude after 3 steps with 1 reset in 3 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-00 finished in 1606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 96/96 transitions.
Graph (complete) has 165 edges and 88 vertex of which 69 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.2 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 3 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 66 transition count 80
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 60 transition count 74
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 60 transition count 74
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 53 transition count 67
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 53 transition count 67
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 46 transition count 60
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 46 transition count 60
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 40 transition count 54
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 40 transition count 54
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 35 transition count 49
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 35 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 35 transition count 48
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 81 place count 31 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 85 place count 31 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 89 place count 31 transition count 40
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 91 place count 31 transition count 38
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 62 edges and 30 vertex of which 29 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 3 with 2 rules applied. Total rules applied 93 place count 29 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 29 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 28 transition count 36
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 96 place count 27 transition count 35
Iterating global reduction 5 with 1 rules applied. Total rules applied 97 place count 27 transition count 35
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 99 place count 25 transition count 33
Iterating global reduction 5 with 2 rules applied. Total rules applied 101 place count 25 transition count 33
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 104 place count 22 transition count 30
Iterating global reduction 5 with 3 rules applied. Total rules applied 107 place count 22 transition count 30
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 109 place count 20 transition count 28
Iterating global reduction 5 with 2 rules applied. Total rules applied 111 place count 20 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 113 place count 20 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 114 place count 20 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 115 place count 19 transition count 25
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 116 place count 18 transition count 24
Iterating global reduction 7 with 1 rules applied. Total rules applied 117 place count 18 transition count 24
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 118 place count 17 transition count 23
Iterating global reduction 7 with 1 rules applied. Total rules applied 119 place count 17 transition count 23
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 120 place count 16 transition count 22
Iterating global reduction 7 with 1 rules applied. Total rules applied 121 place count 16 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 122 place count 16 transition count 21
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 123 place count 16 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 124 place count 15 transition count 20
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 125 place count 15 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 126 place count 14 transition count 19
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 127 place count 13 transition count 18
Iterating global reduction 10 with 1 rules applied. Total rules applied 128 place count 13 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 129 place count 13 transition count 17
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 130 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 131 place count 12 transition count 16
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 132 place count 12 transition count 15
Applied a total of 132 rules in 34 ms. Remains 12 /88 variables (removed 76) and now considering 15/96 (removed 81) transitions.
// Phase 1: matrix 15 rows 12 cols
[2024-06-01 07:56:11] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:56:11] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 07:56:11] [INFO ] Invariant cache hit.
[2024-06-01 07:56:11] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 07:56:11] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-06-01 07:56:11] [INFO ] Redundant transitions in 16 ms returned []
Running 10 sub problems to find dead transitions.
[2024-06-01 07:56:11] [INFO ] Invariant cache hit.
[2024-06-01 07:56:11] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 13/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 3/26 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/27 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 93 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 13/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 3/26 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/27 variables, and 31 constraints, problems are : Problem set: 0 solved, 10 unsolved in 83 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 179ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 180ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/88 places, 15/96 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 12/88 places, 15/96 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-01 finished in 347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((p0||F(p1)))&&G(p2)))))'
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 96/96 transitions.
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 73 transition count 84
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 69 transition count 80
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 69 transition count 80
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 65 transition count 76
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 65 transition count 76
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 61 transition count 72
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 61 transition count 72
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 58 transition count 69
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 58 transition count 69
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 56 transition count 67
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 56 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 56 transition count 66
Applied a total of 62 rules in 14 ms. Remains 56 /88 variables (removed 32) and now considering 66/96 (removed 30) transitions.
[2024-06-01 07:56:11] [INFO ] Flow matrix only has 58 transitions (discarded 8 similar events)
// Phase 1: matrix 58 rows 56 cols
[2024-06-01 07:56:11] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 07:56:11] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 07:56:11] [INFO ] Flow matrix only has 58 transitions (discarded 8 similar events)
[2024-06-01 07:56:11] [INFO ] Invariant cache hit.
[2024-06-01 07:56:11] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 07:56:11] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-06-01 07:56:11] [INFO ] Flow matrix only has 58 transitions (discarded 8 similar events)
[2024-06-01 07:56:11] [INFO ] Invariant cache hit.
[2024-06-01 07:56:11] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 56/111 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 47/103 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 60 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/111 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/114 variables, and 103 constraints, problems are : Problem set: 0 solved, 60 unsolved in 713 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/56 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 2/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 56/111 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 47/103 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 60/163 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/114 variables, and 163 constraints, problems are : Problem set: 0 solved, 60 unsolved in 537 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/56 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 1257ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1259ms
Starting structural reductions in LTL mode, iteration 1 : 56/88 places, 66/96 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1368 ms. Remains : 56/88 places, 66/96 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-02 finished in 1676 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(p1)||G(p2))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 96/96 transitions.
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 73 transition count 84
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 68 transition count 79
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 68 transition count 79
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 63 transition count 74
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 63 transition count 74
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 59 transition count 70
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 59 transition count 70
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 56 transition count 67
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 56 transition count 67
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 53 transition count 64
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 53 transition count 64
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 53 transition count 63
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 51 transition count 61
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 51 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 51 transition count 59
Applied a total of 74 rules in 11 ms. Remains 51 /88 variables (removed 37) and now considering 59/96 (removed 37) transitions.
[2024-06-01 07:56:13] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
// Phase 1: matrix 53 rows 51 cols
[2024-06-01 07:56:13] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:56:13] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 07:56:13] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
[2024-06-01 07:56:13] [INFO ] Invariant cache hit.
[2024-06-01 07:56:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 07:56:13] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 53 sub problems to find dead transitions.
[2024-06-01 07:56:13] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
[2024-06-01 07:56:13] [INFO ] Invariant cache hit.
[2024-06-01 07:56:13] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 2/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 51/101 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 42/93 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 53 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/104 variables, and 93 constraints, problems are : Problem set: 0 solved, 53 unsolved in 563 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/51 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 2/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 51/101 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 42/93 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 53/146 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/104 variables, and 146 constraints, problems are : Problem set: 0 solved, 53 unsolved in 459 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/51 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 1029ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1030ms
Starting structural reductions in LTL mode, iteration 1 : 51/88 places, 59/96 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1102 ms. Remains : 51/88 places, 59/96 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-03 finished in 1295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((p0&&X(p1)))) U G(p2)))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 96/96 transitions.
Ensure Unique test removed 3 places
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 72 transition count 83
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 68 transition count 79
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 68 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 64 transition count 75
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 62 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 62 transition count 73
Applied a total of 49 rules in 12 ms. Remains 62 /88 variables (removed 26) and now considering 73/96 (removed 23) transitions.
[2024-06-01 07:56:14] [INFO ] Flow matrix only has 64 transitions (discarded 9 similar events)
// Phase 1: matrix 64 rows 62 cols
[2024-06-01 07:56:14] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 07:56:14] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 07:56:14] [INFO ] Flow matrix only has 64 transitions (discarded 9 similar events)
[2024-06-01 07:56:14] [INFO ] Invariant cache hit.
[2024-06-01 07:56:14] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 07:56:14] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2024-06-01 07:56:14] [INFO ] Flow matrix only has 64 transitions (discarded 9 similar events)
[2024-06-01 07:56:14] [INFO ] Invariant cache hit.
[2024-06-01 07:56:14] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 54/117 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 68 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/126 variables, and 117 constraints, problems are : Problem set: 0 solved, 68 unsolved in 835 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 54/117 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 68/185 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/126 variables, and 185 constraints, problems are : Problem set: 0 solved, 68 unsolved in 615 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 1459ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 1460ms
Starting structural reductions in LTL mode, iteration 1 : 62/88 places, 73/96 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1540 ms. Remains : 62/88 places, 73/96 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-04 finished in 1730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||F(((X(p1)&&F(p2))||G(p1)))) U (G((p0||F(((X(p1)&&F(p2))||G(p1)))))||((p2 U (p3||G(p2)))&&(p0||F(((X(p1)&&F(p2))||G(p1)))))))))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 96/96 transitions.
Ensure Unique test removed 3 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 74 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 69 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 69 transition count 80
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 64 transition count 75
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 64 transition count 75
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 60 transition count 71
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 60 transition count 71
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 57 transition count 68
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 57 transition count 68
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 55 transition count 66
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 55 transition count 66
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 53 transition count 64
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 53 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 53 transition count 62
Applied a total of 69 rules in 12 ms. Remains 53 /88 variables (removed 35) and now considering 62/96 (removed 34) transitions.
[2024-06-01 07:56:16] [INFO ] Flow matrix only has 55 transitions (discarded 7 similar events)
// Phase 1: matrix 55 rows 53 cols
[2024-06-01 07:56:16] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:56:16] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 07:56:16] [INFO ] Flow matrix only has 55 transitions (discarded 7 similar events)
[2024-06-01 07:56:16] [INFO ] Invariant cache hit.
[2024-06-01 07:56:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:56:16] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-06-01 07:56:16] [INFO ] Flow matrix only has 55 transitions (discarded 7 similar events)
[2024-06-01 07:56:16] [INFO ] Invariant cache hit.
[2024-06-01 07:56:16] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 2/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 52/103 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 43/95 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 55 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/103 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/108 variables, and 95 constraints, problems are : Problem set: 0 solved, 55 unsolved in 626 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/53 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 2/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 52/103 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 43/95 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 55/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/103 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/108 variables, and 150 constraints, problems are : Problem set: 0 solved, 55 unsolved in 484 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/53 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
After SMT, in 1116ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1117ms
Starting structural reductions in LTL mode, iteration 1 : 53/88 places, 62/96 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1205 ms. Remains : 53/88 places, 62/96 transitions.
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3) p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-05
Stuttering criterion allowed to conclude after 146 steps with 1 reset in 4 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-05 finished in 1549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 96/96 transitions.
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 73 transition count 84
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 68 transition count 79
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 68 transition count 79
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 63 transition count 74
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 63 transition count 74
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 58 transition count 69
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 58 transition count 69
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 54 transition count 65
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 54 transition count 65
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 50 transition count 61
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 50 transition count 61
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 50 transition count 60
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 47 transition count 57
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 47 transition count 57
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 47 transition count 54
Applied a total of 83 rules in 6 ms. Remains 47 /88 variables (removed 41) and now considering 54/96 (removed 42) transitions.
[2024-06-01 07:56:17] [INFO ] Flow matrix only has 49 transitions (discarded 5 similar events)
// Phase 1: matrix 49 rows 47 cols
[2024-06-01 07:56:17] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:56:17] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 07:56:17] [INFO ] Flow matrix only has 49 transitions (discarded 5 similar events)
[2024-06-01 07:56:17] [INFO ] Invariant cache hit.
[2024-06-01 07:56:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-01 07:56:17] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-06-01 07:56:17] [INFO ] Flow matrix only has 49 transitions (discarded 5 similar events)
[2024-06-01 07:56:17] [INFO ] Invariant cache hit.
[2024-06-01 07:56:17] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 2/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 47/93 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 48 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/93 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/96 variables, and 85 constraints, problems are : Problem set: 0 solved, 48 unsolved in 490 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/47 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 2/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 47/93 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 48/133 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/93 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/96 variables, and 133 constraints, problems are : Problem set: 0 solved, 48 unsolved in 386 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/47 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 893ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 893ms
Starting structural reductions in LTL mode, iteration 1 : 47/88 places, 54/96 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1031 ms. Remains : 47/88 places, 54/96 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-06
Stuttering criterion allowed to conclude after 15 steps with 3 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-06 finished in 1214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0) U p1)))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 96/96 transitions.
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 75 transition count 86
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 71 transition count 82
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 71 transition count 82
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 67 transition count 78
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 67 transition count 78
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 63 transition count 74
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 63 transition count 74
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 59 transition count 70
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 59 transition count 70
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 55 transition count 66
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 55 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 55 transition count 65
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 52 transition count 62
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 52 transition count 62
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 52 transition count 59
Applied a total of 73 rules in 9 ms. Remains 52 /88 variables (removed 36) and now considering 59/96 (removed 37) transitions.
[2024-06-01 07:56:18] [INFO ] Flow matrix only has 54 transitions (discarded 5 similar events)
// Phase 1: matrix 54 rows 52 cols
[2024-06-01 07:56:18] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:56:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 07:56:19] [INFO ] Flow matrix only has 54 transitions (discarded 5 similar events)
[2024-06-01 07:56:19] [INFO ] Invariant cache hit.
[2024-06-01 07:56:19] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 07:56:19] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 51 sub problems to find dead transitions.
[2024-06-01 07:56:19] [INFO ] Flow matrix only has 54 transitions (discarded 5 similar events)
[2024-06-01 07:56:19] [INFO ] Invariant cache hit.
[2024-06-01 07:56:19] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 2/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 50/99 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 41/91 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 51 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/99 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/106 variables, and 91 constraints, problems are : Problem set: 0 solved, 51 unsolved in 524 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/52 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 2/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 50/99 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 41/91 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 51/142 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/99 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/106 variables, and 142 constraints, problems are : Problem set: 0 solved, 51 unsolved in 411 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/52 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
After SMT, in 942ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 943ms
Starting structural reductions in LTL mode, iteration 1 : 52/88 places, 59/96 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1028 ms. Remains : 52/88 places, 59/96 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-07 finished in 1263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 96/96 transitions.
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 73 transition count 84
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 69 transition count 80
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 69 transition count 80
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 65 transition count 76
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 65 transition count 76
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 61 transition count 72
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 61 transition count 72
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 58 transition count 69
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 58 transition count 69
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 55 transition count 66
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 55 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 55 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 54 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 54 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 54 transition count 63
Applied a total of 67 rules in 6 ms. Remains 54 /88 variables (removed 34) and now considering 63/96 (removed 33) transitions.
[2024-06-01 07:56:20] [INFO ] Flow matrix only has 56 transitions (discarded 7 similar events)
// Phase 1: matrix 56 rows 54 cols
[2024-06-01 07:56:20] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:56:20] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 07:56:20] [INFO ] Flow matrix only has 56 transitions (discarded 7 similar events)
[2024-06-01 07:56:20] [INFO ] Invariant cache hit.
[2024-06-01 07:56:20] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 07:56:20] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-06-01 07:56:20] [INFO ] Flow matrix only has 56 transitions (discarded 7 similar events)
[2024-06-01 07:56:20] [INFO ] Invariant cache hit.
[2024-06-01 07:56:20] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 2/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 54/107 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 45/99 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 57 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/107 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/110 variables, and 99 constraints, problems are : Problem set: 0 solved, 57 unsolved in 645 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/54 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 2/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 54/107 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 45/99 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 57/156 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/107 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/110 variables, and 156 constraints, problems are : Problem set: 0 solved, 57 unsolved in 504 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/54 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 1156ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 1156ms
Starting structural reductions in LTL mode, iteration 1 : 54/88 places, 63/96 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1236 ms. Remains : 54/88 places, 63/96 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-08 finished in 1325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 96/96 transitions.
Graph (complete) has 165 edges and 88 vertex of which 69 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.2 ms
Discarding 19 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 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 65 transition count 79
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 60 transition count 74
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 60 transition count 74
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 54 transition count 68
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 54 transition count 68
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 48 transition count 62
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 48 transition count 62
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 42 transition count 56
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 42 transition count 56
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 37 transition count 51
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 37 transition count 51
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 37 transition count 50
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 34 transition count 47
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 34 transition count 47
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 34 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 34 transition count 41
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 68 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 85 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 86 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 87 place count 31 transition count 39
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 88 place count 30 transition count 38
Iterating global reduction 5 with 1 rules applied. Total rules applied 89 place count 30 transition count 38
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 29 transition count 37
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 29 transition count 37
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 93 place count 27 transition count 35
Iterating global reduction 5 with 2 rules applied. Total rules applied 95 place count 27 transition count 35
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 96 place count 26 transition count 34
Iterating global reduction 5 with 1 rules applied. Total rules applied 97 place count 26 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 98 place count 26 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 99 place count 26 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 100 place count 25 transition count 32
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 101 place count 24 transition count 31
Iterating global reduction 7 with 1 rules applied. Total rules applied 102 place count 24 transition count 31
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 103 place count 23 transition count 30
Iterating global reduction 7 with 1 rules applied. Total rules applied 104 place count 23 transition count 30
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 105 place count 22 transition count 29
Iterating global reduction 7 with 1 rules applied. Total rules applied 106 place count 22 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 107 place count 22 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 108 place count 22 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 109 place count 21 transition count 27
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 110 place count 21 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 111 place count 20 transition count 26
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 112 place count 19 transition count 25
Iterating global reduction 10 with 1 rules applied. Total rules applied 113 place count 19 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 114 place count 19 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 116 place count 19 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 117 place count 18 transition count 22
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 118 place count 18 transition count 21
Applied a total of 118 rules in 20 ms. Remains 18 /88 variables (removed 70) and now considering 21/96 (removed 75) transitions.
// Phase 1: matrix 21 rows 18 cols
[2024-06-01 07:56:21] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 07:56:21] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 07:56:21] [INFO ] Invariant cache hit.
[2024-06-01 07:56:21] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:56:21] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-06-01 07:56:21] [INFO ] Redundant transitions in 13 ms returned []
Running 13 sub problems to find dead transitions.
[2024-06-01 07:56:21] [INFO ] Invariant cache hit.
[2024-06-01 07:56:21] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 16/30 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 2/32 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/33 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/34 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/34 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/39 variables, and 29 constraints, problems are : Problem set: 0 solved, 13 unsolved in 133 ms.
Refiners :[State Equation: 16/18 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 16/30 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/32 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/33 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/34 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/34 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 1/35 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/35 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 1/36 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/36 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 0/36 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/39 variables, and 43 constraints, problems are : Problem set: 0 solved, 13 unsolved in 153 ms.
Refiners :[State Equation: 17/18 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 288ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 288ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/88 places, 21/96 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 375 ms. Remains : 18/88 places, 21/96 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-09 finished in 512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F((p1&&G(!p0))))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 96/96 transitions.
Ensure Unique test removed 3 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 74 transition count 85
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 70 transition count 81
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 70 transition count 81
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 66 transition count 77
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 66 transition count 77
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 62 transition count 73
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 62 transition count 73
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 59 transition count 70
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 59 transition count 70
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 56 transition count 67
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 56 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 56 transition count 66
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 54 transition count 64
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 54 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 54 transition count 62
Applied a total of 68 rules in 6 ms. Remains 54 /88 variables (removed 34) and now considering 62/96 (removed 34) transitions.
[2024-06-01 07:56:22] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 54 cols
[2024-06-01 07:56:22] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:56:22] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 07:56:22] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-06-01 07:56:22] [INFO ] Invariant cache hit.
[2024-06-01 07:56:22] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 07:56:22] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-06-01 07:56:22] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-06-01 07:56:22] [INFO ] Invariant cache hit.
[2024-06-01 07:56:22] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 2/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 53/105 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 55 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/105 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/110 variables, and 97 constraints, problems are : Problem set: 0 solved, 55 unsolved in 605 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/54 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 2/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 53/105 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 55/152 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/110 variables, and 152 constraints, problems are : Problem set: 0 solved, 55 unsolved in 458 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/54 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
After SMT, in 1069ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1070ms
Starting structural reductions in LTL mode, iteration 1 : 54/88 places, 62/96 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1151 ms. Remains : 54/88 places, 62/96 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, true, (NOT p0), (OR (NOT p1) p0), p0]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-10 finished in 1370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 96/96 transitions.
Graph (complete) has 165 edges and 88 vertex of which 69 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 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 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 65 transition count 79
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 59 transition count 73
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 59 transition count 73
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 52 transition count 66
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 52 transition count 66
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 45 transition count 59
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 45 transition count 59
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 39 transition count 53
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 39 transition count 53
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 34 transition count 48
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 34 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 34 transition count 47
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 81 place count 30 transition count 43
Iterating global reduction 2 with 4 rules applied. Total rules applied 85 place count 30 transition count 43
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 89 place count 30 transition count 39
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 91 place count 30 transition count 37
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 61 edges and 29 vertex of which 28 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 3 with 2 rules applied. Total rules applied 93 place count 28 transition count 36
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 94 place count 28 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 27 transition count 35
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 96 place count 26 transition count 34
Iterating global reduction 5 with 1 rules applied. Total rules applied 97 place count 26 transition count 34
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 99 place count 24 transition count 32
Iterating global reduction 5 with 2 rules applied. Total rules applied 101 place count 24 transition count 32
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 104 place count 21 transition count 29
Iterating global reduction 5 with 3 rules applied. Total rules applied 107 place count 21 transition count 29
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 108 place count 20 transition count 28
Iterating global reduction 5 with 1 rules applied. Total rules applied 109 place count 20 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 110 place count 20 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 111 place count 20 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 112 place count 19 transition count 26
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 113 place count 18 transition count 25
Iterating global reduction 7 with 1 rules applied. Total rules applied 114 place count 18 transition count 25
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 115 place count 17 transition count 24
Iterating global reduction 7 with 1 rules applied. Total rules applied 116 place count 17 transition count 24
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 117 place count 16 transition count 23
Iterating global reduction 7 with 1 rules applied. Total rules applied 118 place count 16 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 119 place count 16 transition count 22
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 120 place count 16 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 121 place count 15 transition count 21
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 122 place count 15 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 123 place count 14 transition count 20
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 124 place count 13 transition count 19
Iterating global reduction 10 with 1 rules applied. Total rules applied 125 place count 13 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 126 place count 13 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 128 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 129 place count 12 transition count 16
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 130 place count 12 transition count 15
Applied a total of 130 rules in 16 ms. Remains 12 /88 variables (removed 76) and now considering 15/96 (removed 81) transitions.
// Phase 1: matrix 15 rows 12 cols
[2024-06-01 07:56:23] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:56:23] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 07:56:23] [INFO ] Invariant cache hit.
[2024-06-01 07:56:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 07:56:23] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-06-01 07:56:23] [INFO ] Redundant transitions in 12 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 07:56:23] [INFO ] Invariant cache hit.
[2024-06-01 07:56:23] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/27 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 61 ms.
Refiners :[State Equation: 10/12 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/22 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/23 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/24 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/27 variables, and 27 constraints, problems are : Problem set: 0 solved, 8 unsolved in 75 ms.
Refiners :[State Equation: 11/12 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 139ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 139ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/88 places, 15/96 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 12/88 places, 15/96 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-11
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-11 finished in 297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0)&&F(p1)) U (!p2&&G(p0)&&F(p1)))))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 96/96 transitions.
Ensure Unique test removed 3 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 74 transition count 85
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 70 transition count 81
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 70 transition count 81
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 66 transition count 77
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 66 transition count 77
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 62 transition count 73
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 60 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 60 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 58 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 58 transition count 69
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 56 transition count 67
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 56 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 56 transition count 65
Applied a total of 63 rules in 5 ms. Remains 56 /88 variables (removed 32) and now considering 65/96 (removed 31) transitions.
[2024-06-01 07:56:23] [INFO ] Flow matrix only has 58 transitions (discarded 7 similar events)
// Phase 1: matrix 58 rows 56 cols
[2024-06-01 07:56:23] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:56:23] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 07:56:23] [INFO ] Flow matrix only has 58 transitions (discarded 7 similar events)
[2024-06-01 07:56:23] [INFO ] Invariant cache hit.
[2024-06-01 07:56:23] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 07:56:23] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-06-01 07:56:23] [INFO ] Flow matrix only has 58 transitions (discarded 7 similar events)
[2024-06-01 07:56:23] [INFO ] Invariant cache hit.
[2024-06-01 07:56:23] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 2/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 55/109 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 46/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/109 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/114 variables, and 101 constraints, problems are : Problem set: 0 solved, 58 unsolved in 688 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/56 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 2/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 55/109 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 46/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 58/159 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/109 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/114 variables, and 159 constraints, problems are : Problem set: 0 solved, 58 unsolved in 498 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/56 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 1192ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 1193ms
Starting structural reductions in LTL mode, iteration 1 : 56/88 places, 65/96 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1272 ms. Remains : 56/88 places, 65/96 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) p2), true, (OR (NOT p1) (NOT p0) p2)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-12 finished in 1460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 96/96 transitions.
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 73 transition count 84
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 68 transition count 79
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 68 transition count 79
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 63 transition count 74
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 63 transition count 74
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 58 transition count 69
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 58 transition count 69
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 54 transition count 65
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 54 transition count 65
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 50 transition count 61
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 50 transition count 61
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 50 transition count 60
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 47 transition count 57
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 47 transition count 57
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 47 transition count 54
Applied a total of 83 rules in 4 ms. Remains 47 /88 variables (removed 41) and now considering 54/96 (removed 42) transitions.
[2024-06-01 07:56:25] [INFO ] Flow matrix only has 49 transitions (discarded 5 similar events)
// Phase 1: matrix 49 rows 47 cols
[2024-06-01 07:56:25] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:56:25] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 07:56:25] [INFO ] Flow matrix only has 49 transitions (discarded 5 similar events)
[2024-06-01 07:56:25] [INFO ] Invariant cache hit.
[2024-06-01 07:56:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-01 07:56:25] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-06-01 07:56:25] [INFO ] Flow matrix only has 49 transitions (discarded 5 similar events)
[2024-06-01 07:56:25] [INFO ] Invariant cache hit.
[2024-06-01 07:56:25] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 2/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 47/93 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 48 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/93 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/96 variables, and 85 constraints, problems are : Problem set: 0 solved, 48 unsolved in 483 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/47 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 2/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 47/93 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 48/133 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/93 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/96 variables, and 133 constraints, problems are : Problem set: 0 solved, 48 unsolved in 359 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/47 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 847ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 847ms
Starting structural reductions in LTL mode, iteration 1 : 47/88 places, 54/96 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 920 ms. Remains : 47/88 places, 54/96 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-13 finished in 1013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 96/96 transitions.
Graph (complete) has 165 edges and 88 vertex of which 70 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 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 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 66 transition count 80
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 60 transition count 74
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 60 transition count 74
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 53 transition count 67
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 53 transition count 67
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 46 transition count 60
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 46 transition count 60
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 59 place count 40 transition count 54
Iterating global reduction 1 with 6 rules applied. Total rules applied 65 place count 40 transition count 54
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 70 place count 35 transition count 49
Iterating global reduction 1 with 5 rules applied. Total rules applied 75 place count 35 transition count 49
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 35 transition count 48
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 31 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 31 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 88 place count 31 transition count 40
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 90 place count 31 transition count 38
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 61 edges and 30 vertex of which 29 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 3 with 2 rules applied. Total rules applied 92 place count 29 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 29 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 94 place count 28 transition count 36
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 95 place count 27 transition count 35
Iterating global reduction 5 with 1 rules applied. Total rules applied 96 place count 27 transition count 35
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 98 place count 25 transition count 33
Iterating global reduction 5 with 2 rules applied. Total rules applied 100 place count 25 transition count 33
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 103 place count 22 transition count 30
Iterating global reduction 5 with 3 rules applied. Total rules applied 106 place count 22 transition count 30
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 107 place count 21 transition count 29
Iterating global reduction 5 with 1 rules applied. Total rules applied 108 place count 21 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 109 place count 21 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 110 place count 21 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 111 place count 20 transition count 27
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 112 place count 19 transition count 26
Iterating global reduction 7 with 1 rules applied. Total rules applied 113 place count 19 transition count 26
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 114 place count 18 transition count 25
Iterating global reduction 7 with 1 rules applied. Total rules applied 115 place count 18 transition count 25
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 116 place count 17 transition count 24
Iterating global reduction 7 with 1 rules applied. Total rules applied 117 place count 17 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 118 place count 17 transition count 23
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 119 place count 17 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 120 place count 16 transition count 22
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 121 place count 16 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 122 place count 15 transition count 21
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 123 place count 14 transition count 20
Iterating global reduction 10 with 1 rules applied. Total rules applied 124 place count 14 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 125 place count 14 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 127 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 128 place count 13 transition count 17
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 129 place count 13 transition count 16
Applied a total of 129 rules in 14 ms. Remains 13 /88 variables (removed 75) and now considering 16/96 (removed 80) transitions.
// Phase 1: matrix 16 rows 13 cols
[2024-06-01 07:56:26] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:56:26] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 07:56:26] [INFO ] Invariant cache hit.
[2024-06-01 07:56:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 07:56:26] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-06-01 07:56:26] [INFO ] Redundant transitions in 13 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 07:56:26] [INFO ] Invariant cache hit.
[2024-06-01 07:56:26] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/29 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 52 ms.
Refiners :[State Equation: 10/13 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/22 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/23 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/24 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/29 variables, and 27 constraints, problems are : Problem set: 0 solved, 8 unsolved in 73 ms.
Refiners :[State Equation: 11/13 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 128ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 128ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/88 places, 16/96 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 13/88 places, 16/96 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-14 finished in 256 ms.
All properties solved by simple procedures.
Total runtime 21144 ms.
ITS solved all properties within timeout

BK_STOP 1717228586503

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-S128P15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is SemanticWebServices-PT-S128P15, 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 r524-tall-171679080600555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S128P15.tgz
mv SemanticWebServices-PT-S128P15 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;