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.r334-tall-171679080600564.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is SemanticWebServices-PT-S128P18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679080600564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 14K Apr 12 02:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 12 02:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 02:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 02:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:31 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 261K 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-S128P18-LTLFireability-00
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-01
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-02
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-03
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-04
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-05
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-06
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-07
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-08
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-09
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-10
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-11
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-12
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-13
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-14
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716853275152

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S128P18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-27 23:41:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 23:41:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 23:41:16] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-27 23:41:16] [INFO ] Transformed 184 places.
[2024-05-27 23:41:16] [INFO ] Transformed 466 transitions.
[2024-05-27 23:41:16] [INFO ] Parsed PT model containing 184 places and 466 transitions and 1873 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 269 transitions
Reduce redundant transitions removed 269 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 195/195 transitions.
Ensure Unique test removed 44 places
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 106 transition count 113
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 167 place count 97 transition count 104
Iterating global reduction 1 with 9 rules applied. Total rules applied 176 place count 97 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 178 place count 97 transition count 102
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 183 place count 92 transition count 97
Iterating global reduction 2 with 5 rules applied. Total rules applied 188 place count 92 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 191 place count 89 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 194 place count 89 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 196 place count 87 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 198 place count 87 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 200 place count 85 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 202 place count 85 transition count 90
Applied a total of 202 rules in 44 ms. Remains 85 /182 variables (removed 97) and now considering 90/195 (removed 105) transitions.
[2024-05-27 23:41:16] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
// Phase 1: matrix 81 rows 85 cols
[2024-05-27 23:41:16] [INFO ] Computed 6 invariants in 15 ms
[2024-05-27 23:41:16] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-27 23:41:16] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2024-05-27 23:41:16] [INFO ] Invariant cache hit.
[2024-05-27 23:41:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-27 23:41:17] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-05-27 23:41:17] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2024-05-27 23:41:17] [INFO ] Invariant cache hit.
[2024-05-27 23:41:17] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 2/85 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 80/165 variables, 85/91 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 72/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/165 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/166 variables, and 163 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1373 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 2/85 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 80/165 variables, 85/91 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 72/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 86/249 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/165 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/166 variables, and 249 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1204 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
After SMT, in 2611ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 2635ms
Starting structural reductions in LTL mode, iteration 1 : 85/182 places, 90/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3009 ms. Remains : 85/182 places, 90/195 transitions.
Support contains 15 out of 85 places after structural reductions.
[2024-05-27 23:41:19] [INFO ] Flatten gal took : 20 ms
[2024-05-27 23:41:19] [INFO ] Flatten gal took : 8 ms
[2024-05-27 23:41:19] [INFO ] Input system was already deterministic with 90 transitions.
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (8 resets) in 998 ms. (40 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
[2024-05-27 23:41:20] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2024-05-27 23:41:20] [INFO ] Invariant cache hit.
[2024-05-27 23:41:20] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 4/166 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/85 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 25ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
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 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 90/90 transitions.
Graph (complete) has 189 edges and 85 vertex of which 79 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 5 places
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 69 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 69 transition count 82
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 17 place count 63 transition count 76
Iterating global reduction 0 with 6 rules applied. Total rules applied 23 place count 63 transition count 76
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 29 place count 57 transition count 70
Iterating global reduction 0 with 6 rules applied. Total rules applied 35 place count 57 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 36 place count 57 transition count 69
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 51 transition count 63
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 51 transition count 63
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 47 transition count 59
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 47 transition count 59
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 43 transition count 55
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 43 transition count 55
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 38 transition count 50
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 38 transition count 50
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 34 transition count 46
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 34 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 86 place count 34 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 34 transition count 40
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 67 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 2 with 2 rules applied. Total rules applied 90 place count 32 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 32 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 31 transition count 38
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 30 transition count 37
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 30 transition count 37
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 29 transition count 36
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 29 transition count 36
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 28 transition count 35
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 27 transition count 34
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 27 transition count 34
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 26 transition count 33
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 26 transition count 33
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 25 transition count 32
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 25 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 105 place count 25 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 25 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 107 place count 24 transition count 30
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 108 place count 24 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 109 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 110 place count 22 transition count 28
Iterating global reduction 7 with 1 rules applied. Total rules applied 111 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 112 place count 21 transition count 27
Iterating global reduction 7 with 1 rules applied. Total rules applied 113 place count 21 transition count 27
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 114 place count 20 transition count 26
Iterating global reduction 7 with 1 rules applied. Total rules applied 115 place count 20 transition count 26
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 116 place count 19 transition count 25
Iterating global reduction 7 with 1 rules applied. Total rules applied 117 place count 19 transition count 25
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 19 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 119 place count 19 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 120 place count 18 transition count 23
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 18 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 122 place count 17 transition count 22
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 123 place count 16 transition count 21
Iterating global reduction 10 with 1 rules applied. Total rules applied 124 place count 16 transition count 21
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 126 place count 14 transition count 19
Iterating global reduction 10 with 2 rules applied. Total rules applied 128 place count 14 transition count 19
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 130 place count 14 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 131 place count 14 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 132 place count 13 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 133 place count 13 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 134 place count 12 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 135 place count 12 transition count 14
Applied a total of 135 rules in 49 ms. Remains 12 /85 variables (removed 73) and now considering 14/90 (removed 76) transitions.
// Phase 1: matrix 14 rows 12 cols
[2024-05-27 23:41:20] [INFO ] Computed 0 invariants in 1 ms
[2024-05-27 23:41:20] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-27 23:41:20] [INFO ] Invariant cache hit.
[2024-05-27 23:41:20] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-27 23:41:20] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-27 23:41:20] [INFO ] Redundant transitions in 13 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-27 23:41:20] [INFO ] Invariant cache hit.
[2024-05-27 23:41:20] [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) 12/22 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 3/25 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/26 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 77 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) 12/22 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 3/25 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/26 variables, and 31 constraints, problems are : Problem set: 0 solved, 10 unsolved in 77 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 157ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 157ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/85 places, 14/90 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 314 ms. Remains : 12/85 places, 14/90 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-00 finished in 534 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(p1)&&p0)))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 90/90 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 81 transition count 90
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 77 transition count 86
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 77 transition count 86
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 73 transition count 82
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 73 transition count 82
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 69 transition count 78
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 69 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 69 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 66 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 66 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 64 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 64 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 63 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 63 transition count 71
Applied a total of 41 rules in 12 ms. Remains 63 /85 variables (removed 22) and now considering 71/90 (removed 19) transitions.
[2024-05-27 23:41:21] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
// Phase 1: matrix 63 rows 63 cols
[2024-05-27 23:41:21] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 23:41:21] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-27 23:41:21] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
[2024-05-27 23:41:21] [INFO ] Invariant cache hit.
[2024-05-27 23:41:21] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-27 23:41:21] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2024-05-27 23:41:21] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
[2024-05-27 23:41:21] [INFO ] Invariant cache hit.
[2024-05-27 23:41:21] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 2/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 62/125 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 67 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/126 variables, and 119 constraints, problems are : Problem set: 0 solved, 67 unsolved in 749 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 2/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 62/125 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 67/186 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/126 variables, and 186 constraints, problems are : Problem set: 0 solved, 67 unsolved in 634 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 1390ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 1392ms
Starting structural reductions in LTL mode, iteration 1 : 63/85 places, 71/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1587 ms. Remains : 63/85 places, 71/90 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-01 finished in 1724 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&&X(G(p1)))))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 90/90 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 80 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 8 place count 77 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 77 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 74 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 74 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 71 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 71 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 71 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 69 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 69 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 67 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 67 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 66 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 66 transition count 75
Applied a total of 34 rules in 19 ms. Remains 66 /85 variables (removed 19) and now considering 75/90 (removed 15) transitions.
[2024-05-27 23:41:22] [INFO ] Flow matrix only has 67 transitions (discarded 8 similar events)
// Phase 1: matrix 67 rows 66 cols
[2024-05-27 23:41:22] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 23:41:22] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-27 23:41:22] [INFO ] Flow matrix only has 67 transitions (discarded 8 similar events)
[2024-05-27 23:41:22] [INFO ] Invariant cache hit.
[2024-05-27 23:41:22] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-27 23:41:22] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2024-05-27 23:41:22] [INFO ] Flow matrix only has 67 transitions (discarded 8 similar events)
[2024-05-27 23:41:22] [INFO ] Invariant cache hit.
[2024-05-27 23:41:22] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 2/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 66/132 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 58/125 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/132 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/133 variables, and 125 constraints, problems are : Problem set: 0 solved, 71 unsolved in 960 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 2/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 66/132 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 58/125 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 71/196 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/133 variables, and 196 constraints, problems are : Problem set: 0 solved, 71 unsolved in 659 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 1626ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 1627ms
Starting structural reductions in LTL mode, iteration 1 : 66/85 places, 75/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1761 ms. Remains : 66/85 places, 75/90 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-04
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-04 finished in 1889 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 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 90/90 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 80 transition count 90
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 9 place count 76 transition count 86
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 76 transition count 86
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 72 transition count 82
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 72 transition count 82
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 68 transition count 78
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 68 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 68 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 65 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 65 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 63 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 63 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 62 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 62 transition count 71
Applied a total of 42 rules in 8 ms. Remains 62 /85 variables (removed 23) and now considering 71/90 (removed 19) transitions.
[2024-05-27 23:41:24] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
// Phase 1: matrix 63 rows 62 cols
[2024-05-27 23:41:24] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 23:41:24] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-27 23:41:24] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
[2024-05-27 23:41:24] [INFO ] Invariant cache hit.
[2024-05-27 23:41:24] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-27 23:41:24] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2024-05-27 23:41:24] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
[2024-05-27 23:41:24] [INFO ] Invariant cache hit.
[2024-05-27 23:41:24] [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, 67 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 62/124 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 54/117 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 67 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/124 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/125 variables, and 117 constraints, problems are : Problem set: 0 solved, 67 unsolved in 800 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 2/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 62/124 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 54/117 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 67/184 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/124 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/125 variables, and 184 constraints, problems are : Problem set: 0 solved, 67 unsolved in 615 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 1423ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 1424ms
Starting structural reductions in LTL mode, iteration 1 : 62/85 places, 71/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1499 ms. Remains : 62/85 places, 71/90 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-10
Stuttering criterion allowed to conclude after 403 steps with 100 reset in 9 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-10 finished in 1644 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(F((X(p0)&&G((G(p1)||!(!p1 U p0))))))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 90/90 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 81 transition count 90
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 77 transition count 86
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 77 transition count 86
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 73 transition count 82
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 73 transition count 82
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 69 transition count 78
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 69 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 69 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 66 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 66 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 64 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 64 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 63 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 63 transition count 71
Applied a total of 41 rules in 3 ms. Remains 63 /85 variables (removed 22) and now considering 71/90 (removed 19) transitions.
[2024-05-27 23:41:26] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
// Phase 1: matrix 63 rows 63 cols
[2024-05-27 23:41:26] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 23:41:26] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-27 23:41:26] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
[2024-05-27 23:41:26] [INFO ] Invariant cache hit.
[2024-05-27 23:41:26] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-27 23:41:26] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2024-05-27 23:41:26] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
[2024-05-27 23:41:26] [INFO ] Invariant cache hit.
[2024-05-27 23:41:26] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 2/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 62/125 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 67 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/126 variables, and 119 constraints, problems are : Problem set: 0 solved, 67 unsolved in 697 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 2/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 62/125 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 67/186 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/126 variables, and 186 constraints, problems are : Problem set: 0 solved, 67 unsolved in 621 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 1329ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 1330ms
Starting structural reductions in LTL mode, iteration 1 : 63/85 places, 71/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1405 ms. Remains : 63/85 places, 71/90 transitions.
Stuttering acceptance computed with spot in 455 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-11 finished in 1881 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||X(F(p1))))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 90/90 transitions.
Graph (complete) has 189 edges and 85 vertex of which 79 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 70 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 70 transition count 82
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 65 transition count 77
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 65 transition count 77
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 24 place count 60 transition count 72
Iterating global reduction 0 with 5 rules applied. Total rules applied 29 place count 60 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 60 transition count 71
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 55 transition count 66
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 55 transition count 66
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 51 transition count 62
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 51 transition count 62
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 47 transition count 58
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 47 transition count 58
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 42 transition count 53
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 42 transition count 53
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 39 transition count 50
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 39 transition count 50
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 75 place count 39 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 39 transition count 44
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 76 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 37 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 37 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 36 transition count 42
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 35 transition count 41
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 35 transition count 41
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 34 transition count 40
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 34 transition count 40
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 33 transition count 39
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 33 transition count 39
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 32 transition count 38
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 32 transition count 38
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 31 transition count 37
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 31 transition count 37
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 30 transition count 36
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 30 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 30 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 96 place count 30 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 97 place count 29 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 98 place count 29 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 99 place count 28 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 100 place count 28 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 101 place count 27 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 102 place count 27 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 103 place count 26 transition count 31
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 104 place count 25 transition count 30
Iterating global reduction 9 with 1 rules applied. Total rules applied 105 place count 25 transition count 30
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 107 place count 23 transition count 28
Iterating global reduction 9 with 2 rules applied. Total rules applied 109 place count 23 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 111 place count 23 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 112 place count 23 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 113 place count 22 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 115 place count 22 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 116 place count 21 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 117 place count 21 transition count 22
Applied a total of 117 rules in 31 ms. Remains 21 /85 variables (removed 64) and now considering 22/90 (removed 68) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-27 23:41:28] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 23:41:28] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-27 23:41:28] [INFO ] Invariant cache hit.
[2024-05-27 23:41:28] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-27 23:41:28] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-27 23:41:28] [INFO ] Redundant transitions in 11 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-27 23:41:28] [INFO ] Invariant cache hit.
[2024-05-27 23:41:28] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/33 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2/35 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/36 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 2/38 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/43 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 142 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/33 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 2/35 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/36 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 2/38 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 1/39 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/39 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 1/40 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/40 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 0/40 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/43 variables, and 51 constraints, problems are : Problem set: 0 solved, 15 unsolved in 153 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 297ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 297ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/85 places, 22/90 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 389 ms. Remains : 21/85 places, 22/90 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-12 finished in 474 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 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 90/90 transitions.
Graph (complete) has 189 edges and 85 vertex of which 79 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 70 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 70 transition count 82
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 65 transition count 77
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 65 transition count 77
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 24 place count 60 transition count 72
Iterating global reduction 0 with 5 rules applied. Total rules applied 29 place count 60 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 60 transition count 71
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 55 transition count 66
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 55 transition count 66
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 52 transition count 63
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 52 transition count 63
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 48 transition count 59
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 48 transition count 59
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 44 transition count 55
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 44 transition count 55
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 41 transition count 52
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 41 transition count 52
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 71 place count 41 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 41 transition count 47
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 84 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 39 transition count 46
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 77 place count 39 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 38 transition count 44
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 37 transition count 43
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 37 transition count 43
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 36 transition count 42
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 36 transition count 42
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 35 transition count 41
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 35 transition count 41
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 34 transition count 40
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 34 transition count 40
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 33 transition count 39
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 33 transition count 39
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 32 transition count 38
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 32 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 32 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 92 place count 32 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 93 place count 31 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 94 place count 31 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 95 place count 30 transition count 35
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 96 place count 29 transition count 34
Iterating global reduction 7 with 1 rules applied. Total rules applied 97 place count 29 transition count 34
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 98 place count 28 transition count 33
Iterating global reduction 7 with 1 rules applied. Total rules applied 99 place count 28 transition count 33
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 100 place count 27 transition count 32
Iterating global reduction 7 with 1 rules applied. Total rules applied 101 place count 27 transition count 32
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 102 place count 26 transition count 31
Iterating global reduction 7 with 1 rules applied. Total rules applied 103 place count 26 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 104 place count 26 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 105 place count 26 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 106 place count 25 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 107 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 108 place count 24 transition count 28
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 109 place count 23 transition count 27
Iterating global reduction 10 with 1 rules applied. Total rules applied 110 place count 23 transition count 27
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 112 place count 21 transition count 25
Iterating global reduction 10 with 2 rules applied. Total rules applied 114 place count 21 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 116 place count 21 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 117 place count 21 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 118 place count 20 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 119 place count 20 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 120 place count 19 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 121 place count 19 transition count 20
Applied a total of 121 rules in 20 ms. Remains 19 /85 variables (removed 66) and now considering 20/90 (removed 70) transitions.
// Phase 1: matrix 20 rows 19 cols
[2024-05-27 23:41:28] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 23:41:28] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-27 23:41:28] [INFO ] Invariant cache hit.
[2024-05-27 23:41:28] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-27 23:41:28] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-27 23:41:28] [INFO ] Redundant transitions in 11 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-27 23:41:28] [INFO ] Invariant cache hit.
[2024-05-27 23:41:28] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 2/33 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 2/36 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/39 variables, and 33 constraints, problems are : Problem set: 0 solved, 14 unsolved in 146 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/19 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/33 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/34 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 2/36 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 1/37 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 1/38 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/39 variables, and 48 constraints, problems are : Problem set: 0 solved, 14 unsolved in 154 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 303ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 303ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/85 places, 20/90 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 401 ms. Remains : 19/85 places, 20/90 transitions.
Stuttering acceptance computed with spot in 27 ms :[p0]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 125 ms.
Product exploration explored 100000 steps with 0 reset in 158 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[p0]
RANDOM walk for 6850 steps (8 resets) in 14 ms. (456 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[p0]
Stuttering acceptance computed with spot in 35 ms :[p0]
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-27 23:41:29] [INFO ] Invariant cache hit.
[2024-05-27 23:41:29] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-27 23:41:29] [INFO ] Invariant cache hit.
[2024-05-27 23:41:29] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-27 23:41:29] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-27 23:41:29] [INFO ] Redundant transitions in 10 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-27 23:41:29] [INFO ] Invariant cache hit.
[2024-05-27 23:41:29] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 2/33 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 2/36 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/39 variables, and 33 constraints, problems are : Problem set: 0 solved, 14 unsolved in 128 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/19 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/33 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/34 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 2/36 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 1/37 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 1/38 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/39 variables, and 48 constraints, problems are : Problem set: 0 solved, 14 unsolved in 143 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 276ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 276ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 349 ms. Remains : 19/19 places, 20/20 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[p0]
RANDOM walk for 169 steps (5 resets) in 7 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[p0]
Stuttering acceptance computed with spot in 40 ms :[p0]
Stuttering acceptance computed with spot in 38 ms :[p0]
Product exploration explored 100000 steps with 0 reset in 65 ms.
Product exploration explored 100000 steps with 0 reset in 122 ms.
Built C files in :
/tmp/ltsmin7747690068410811593
[2024-05-27 23:41:30] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2024-05-27 23:41:30] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:41:30] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2024-05-27 23:41:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:41:30] [INFO ] Computing Do-Not-Accords matrix : 20 transitions.
[2024-05-27 23:41:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:41:30] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7747690068410811593
Running compilation step : cd /tmp/ltsmin7747690068410811593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 200 ms.
Running link step : cd /tmp/ltsmin7747690068410811593;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7747690068410811593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6344025334049145703.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-27 23:41:45] [INFO ] Invariant cache hit.
[2024-05-27 23:41:45] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-27 23:41:45] [INFO ] Invariant cache hit.
[2024-05-27 23:41:45] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-27 23:41:45] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-27 23:41:45] [INFO ] Redundant transitions in 11 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-27 23:41:45] [INFO ] Invariant cache hit.
[2024-05-27 23:41:45] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 2/33 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 2/36 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/39 variables, and 33 constraints, problems are : Problem set: 0 solved, 14 unsolved in 136 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/19 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/33 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/34 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 2/36 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 1/37 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 1/38 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/39 variables, and 48 constraints, problems are : Problem set: 0 solved, 14 unsolved in 142 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 297ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 377 ms. Remains : 19/19 places, 20/20 transitions.
Built C files in :
/tmp/ltsmin13006373915382768648
[2024-05-27 23:41:46] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2024-05-27 23:41:46] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:41:46] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2024-05-27 23:41:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:41:46] [INFO ] Computing Do-Not-Accords matrix : 20 transitions.
[2024-05-27 23:41:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:41:46] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13006373915382768648
Running compilation step : cd /tmp/ltsmin13006373915382768648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 91 ms.
Running link step : cd /tmp/ltsmin13006373915382768648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13006373915382768648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12481949677026273492.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 23:42:01] [INFO ] Flatten gal took : 2 ms
[2024-05-27 23:42:01] [INFO ] Flatten gal took : 1 ms
[2024-05-27 23:42:01] [INFO ] Time to serialize gal into /tmp/LTL11608518639116239217.gal : 1 ms
[2024-05-27 23:42:01] [INFO ] Time to serialize properties into /tmp/LTL762296048919630468.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11608518639116239217.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3986750985992008042.hoa' '-atoms' '/tmp/LTL762296048919630468.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL762296048919630468.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3986750985992008042.hoa
Detected timeout of ITS tools.
[2024-05-27 23:42:16] [INFO ] Flatten gal took : 2 ms
[2024-05-27 23:42:16] [INFO ] Flatten gal took : 1 ms
[2024-05-27 23:42:16] [INFO ] Time to serialize gal into /tmp/LTL2679827981611538020.gal : 1 ms
[2024-05-27 23:42:16] [INFO ] Time to serialize properties into /tmp/LTL9942255051506683402.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2679827981611538020.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9942255051506683402.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((p14<1)||(p164<1))"))))
Formula 0 simplified : GF!"((p14<1)||(p164<1))"
Detected timeout of ITS tools.
[2024-05-27 23:42:31] [INFO ] Flatten gal took : 2 ms
[2024-05-27 23:42:31] [INFO ] Applying decomposition
[2024-05-27 23:42:31] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11056748605205237807.txt' '-o' '/tmp/graph11056748605205237807.bin' '-w' '/tmp/graph11056748605205237807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11056748605205237807.bin' '-l' '-1' '-v' '-w' '/tmp/graph11056748605205237807.weights' '-q' '0' '-e' '0.001'
[2024-05-27 23:42:31] [INFO ] Decomposing Gal with order
[2024-05-27 23:42:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 23:42:31] [INFO ] Flatten gal took : 37 ms
[2024-05-27 23:42:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-27 23:42:31] [INFO ] Time to serialize gal into /tmp/LTL16275098164706362910.gal : 1 ms
[2024-05-27 23:42:31] [INFO ] Time to serialize properties into /tmp/LTL9057166653491820438.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16275098164706362910.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9057166653491820438.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((i1.u3.p14<1)||(i1.u3.p164<1))"))))
Formula 0 simplified : GF!"((i1.u3.p14<1)||(i1.u3.p164<1))"
Detected timeout of ITS tools.
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-13 finished in 77797 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)))'
[2024-05-27 23:42:46] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16870972791215541541
[2024-05-27 23:42:46] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-27 23:42:46] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:42:46] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-27 23:42:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:42:46] [INFO ] Applying decomposition
[2024-05-27 23:42:46] [INFO ] Flatten gal took : 4 ms
[2024-05-27 23:42:46] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-27 23:42:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:42:46] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16870972791215541541
Running compilation step : cd /tmp/ltsmin16870972791215541541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8849427807288668221.txt' '-o' '/tmp/graph8849427807288668221.bin' '-w' '/tmp/graph8849427807288668221.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8849427807288668221.bin' '-l' '-1' '-v' '-w' '/tmp/graph8849427807288668221.weights' '-q' '0' '-e' '0.001'
[2024-05-27 23:42:46] [INFO ] Decomposing Gal with order
[2024-05-27 23:42:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 23:42:46] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-27 23:42:46] [INFO ] Flatten gal took : 7 ms
[2024-05-27 23:42:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-27 23:42:46] [INFO ] Time to serialize gal into /tmp/LTLFireability17314612625501072694.gal : 8 ms
[2024-05-27 23:42:46] [INFO ] Time to serialize properties into /tmp/LTLFireability5201616895176084023.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17314612625501072694.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5201616895176084023.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(!("((i5.u21.p14>=1)&&(i5.u21.p164>=1))")))))
Formula 0 simplified : GF"((i5.u21.p14>=1)&&(i5.u21.p164>=1))"
Compilation finished in 209 ms.
Running link step : cd /tmp/ltsmin16870972791215541541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16870972791215541541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](!(LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.038: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.038: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.037: LTL layer: formula: <>([](!(LTLAPp0==true)))
pins2lts-mc-linux64( 5/ 8), 0.038: "<>([](!(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.038: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.074: Initializing POR dependencies: labels 91, guards 90
pins2lts-mc-linux64( 0/ 8), 0.300: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.315: There are 92 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.315: State length is 86, there are 94 groups
pins2lts-mc-linux64( 0/ 8), 0.315: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.315: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.315: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.315: Visible groups: 0 / 94, labels: 1 / 92
pins2lts-mc-linux64( 0/ 8), 0.315: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.315: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.357: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 4/ 8), 0.380: [Blue] ~240 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 5/ 8), 0.422: [Blue] ~480 levels ~3840 states ~3840 transitions
pins2lts-mc-linux64( 5/ 8), 0.512: [Blue] ~960 levels ~7680 states ~7680 transitions
pins2lts-mc-linux64( 4/ 8), 0.781: [Blue] ~1920 levels ~15360 states ~15360 transitions
pins2lts-mc-linux64( 5/ 8), 1.196: [Blue] ~3840 levels ~30720 states ~30720 transitions
pins2lts-mc-linux64( 5/ 8), 1.713: [Blue] ~7680 levels ~61440 states ~61440 transitions
pins2lts-mc-linux64( 4/ 8), 2.264: [Blue] ~15360 levels ~122880 states ~122880 transitions
pins2lts-mc-linux64( 5/ 8), 3.609: [Blue] ~30720 levels ~245760 states ~245760 transitions
pins2lts-mc-linux64( 5/ 8), 4.463: [Blue] ~61440 levels ~491520 states ~491520 transitions
pins2lts-mc-linux64( 4/ 8), 5.527: [Blue] ~122880 levels ~983040 states ~983040 transitions
pins2lts-mc-linux64( 5/ 8), 7.362: [Blue] ~245760 levels ~1966080 states ~1966080 transitions
pins2lts-mc-linux64( 5/ 8), 11.808: [Blue] ~491520 levels ~3932160 states ~3932160 transitions
pins2lts-mc-linux64( 4/ 8), 21.115: [Blue] ~983040 levels ~7864320 states ~7864320 transitions
pins2lts-mc-linux64( 1/ 8), 23.445: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 23.749:
pins2lts-mc-linux64( 0/ 8), 23.749: Explored 4835375 states 4835388 transitions, fanout: 1.000
pins2lts-mc-linux64( 0/ 8), 23.749: Total exploration time 23.420 sec (23.100 sec minimum, 23.247 sec on average)
pins2lts-mc-linux64( 0/ 8), 23.749: States per second: 206463, Transitions per second: 206464
pins2lts-mc-linux64( 0/ 8), 23.749:
pins2lts-mc-linux64( 0/ 8), 23.749: State space has 14720276 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 23.749: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 23.749: blue states: 4835375 (32.85%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 23.749: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 23.749: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 23.749:
pins2lts-mc-linux64( 0/ 8), 23.749: Total memory used for local state coloring: 73.8MB
pins2lts-mc-linux64( 0/ 8), 23.749:
pins2lts-mc-linux64( 0/ 8), 23.749: Queue width: 8B, total height: 4835373, memory: 36.89MB
pins2lts-mc-linux64( 0/ 8), 23.749: Tree memory: 368.3MB, 26.2 B/state, compr.: 7.6%
pins2lts-mc-linux64( 0/ 8), 23.749: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 23.749: Stored 90 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 23.750: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 23.750: Est. total memory use: 405.2MB (~1060.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16870972791215541541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](!(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16870972791215541541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](!(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-28 00:03:17] [INFO ] Flatten gal took : 5 ms
[2024-05-28 00:03:17] [INFO ] Time to serialize gal into /tmp/LTLFireability1425835622437453975.gal : 2 ms
[2024-05-28 00:03:17] [INFO ] Time to serialize properties into /tmp/LTLFireability8828898627072539963.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1425835622437453975.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8828898627072539963.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G(!("((p14>=1)&&(p164>=1))")))))
Formula 0 simplified : GF"((p14>=1)&&(p164>=1))"
Detected timeout of ITS tools.
[2024-05-28 00:23:47] [INFO ] Flatten gal took : 8 ms
[2024-05-28 00:23:47] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-28 00:23:47] [INFO ] Transformed 85 places.
[2024-05-28 00:23:47] [INFO ] Transformed 90 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 00:23:47] [INFO ] Time to serialize gal into /tmp/LTLFireability16402184906968503124.gal : 1 ms
[2024-05-28 00:23:47] [INFO ] Time to serialize properties into /tmp/LTLFireability12150299899108944694.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16402184906968503124.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12150299899108944694.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(!("((p14>=1)&&(p164>=1))")))))
Formula 0 simplified : GF"((p14>=1)&&(p164>=1))"

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SemanticWebServices-PT-S128P18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SemanticWebServices-PT-S128P18, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r334-tall-171679080600564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S128P18.tgz
mv SemanticWebServices-PT-S128P18 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;