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.r333-tall-171679078700547.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 greatspnxred
Input is SemanticWebServices-PT-S128P12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078700547
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 15K Apr 12 02:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Apr 12 02:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 02:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 12 02:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 224K 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-S128P12-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716873602074

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S128P12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:20:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 05:20:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:20:03] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-28 05:20:03] [INFO ] Transformed 191 places.
[2024-05-28 05:20:03] [INFO ] Transformed 414 transitions.
[2024-05-28 05:20:03] [INFO ] Parsed PT model containing 191 places and 414 transitions and 1559 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 208 transitions
Reduce redundant transitions removed 208 transitions.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 204/204 transitions.
Ensure Unique test removed 29 places
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 179 rules applied. Total rules applied 179 place count 100 transition count 114
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 184 place count 95 transition count 109
Iterating global reduction 1 with 5 rules applied. Total rules applied 189 place count 95 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 190 place count 95 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 192 place count 93 transition count 106
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 93 transition count 106
Applied a total of 194 rules in 34 ms. Remains 93 /189 variables (removed 96) and now considering 106/204 (removed 98) transitions.
[2024-05-28 05:20:03] [INFO ] Flow matrix only has 97 transitions (discarded 9 similar events)
// Phase 1: matrix 97 rows 93 cols
[2024-05-28 05:20:03] [INFO ] Computed 4 invariants in 6 ms
[2024-05-28 05:20:03] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-28 05:20:03] [INFO ] Flow matrix only has 97 transitions (discarded 9 similar events)
[2024-05-28 05:20:03] [INFO ] Invariant cache hit.
[2024-05-28 05:20:03] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-28 05:20:03] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2024-05-28 05:20:03] [INFO ] Flow matrix only has 97 transitions (discarded 9 similar events)
[2024-05-28 05:20:03] [INFO ] Invariant cache hit.
[2024-05-28 05:20:03] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 62/126 variables, 64/68 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 53/121 constraints. Problems are: Problem set: 0 solved, 67 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 36/162 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 28/190 variables, 28/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 150 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1586 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 93/93 constraints, ReadFeed: 53/53 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/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 62/126 variables, 64/68 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 53/121 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 36/162 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 54/189 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (OVERLAPS) 28/190 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 217 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1413 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 93/93 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 3034ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 3054ms
Starting structural reductions in LTL mode, iteration 1 : 93/189 places, 106/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3437 ms. Remains : 93/189 places, 106/204 transitions.
Support contains 59 out of 93 places after structural reductions.
[2024-05-28 05:20:07] [INFO ] Flatten gal took : 25 ms
[2024-05-28 05:20:07] [INFO ] Flatten gal took : 9 ms
[2024-05-28 05:20:07] [INFO ] Input system was already deterministic with 106 transitions.
Support contains 57 out of 93 places (down from 59) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1550 ms. (25 steps per ms) remains 1/35 properties
BEST_FIRST walk for 24944 steps (4 resets) in 62 ms. (395 steps per ms) remains 0/1 properties
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(G(p1) U p2)||G(p3)))))'
Support contains 5 out of 93 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 106/106 transitions.
Graph (complete) has 199 edges and 93 vertex of which 62 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 58 transition count 72
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 52 transition count 66
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 52 transition count 66
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 45 transition count 59
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 45 transition count 59
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 41 transition count 55
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 41 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 41 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 40 transition count 53
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 40 transition count 53
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 39 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 39 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 39 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 39 transition count 48
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 71 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 3 with 2 rules applied. Total rules applied 76 place count 37 transition count 47
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 36 transition count 46
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 36 transition count 46
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 80 place count 34 transition count 44
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 34 transition count 44
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 85 place count 31 transition count 41
Iterating global reduction 4 with 3 rules applied. Total rules applied 88 place count 31 transition count 41
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 91 place count 28 transition count 38
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 28 transition count 38
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 97 place count 28 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 98 place count 28 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 99 place count 27 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 101 place count 27 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 102 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 103 place count 25 transition count 31
Iterating global reduction 7 with 1 rules applied. Total rules applied 104 place count 25 transition count 31
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 106 place count 23 transition count 29
Iterating global reduction 7 with 2 rules applied. Total rules applied 108 place count 23 transition count 29
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 110 place count 23 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 111 place count 23 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 112 place count 22 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 113 place count 22 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 114 place count 21 transition count 25
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 115 place count 21 transition count 24
Applied a total of 115 rules in 42 ms. Remains 21 /93 variables (removed 72) and now considering 24/106 (removed 82) transitions.
// Phase 1: matrix 24 rows 21 cols
[2024-05-28 05:20:08] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 05:20:08] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 05:20:08] [INFO ] Invariant cache hit.
[2024-05-28 05:20:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-28 05:20:08] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-28 05:20:08] [INFO ] Redundant transitions in 17 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-28 05:20:08] [INFO ] Invariant cache hit.
[2024-05-28 05:20:08] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/28 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/32 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 2/34 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/45 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 152 ms.
Refiners :[State Equation: 16/21 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/28 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/30 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 2/32 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 2/34 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/34 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 1/35 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/35 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 1/36 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/36 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/36 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/45 variables, and 41 constraints, problems are : Problem set: 0 solved, 12 unsolved in 157 ms.
Refiners :[State Equation: 17/21 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 313ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 313ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/93 places, 24/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 436 ms. Remains : 21/93 places, 24/106 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 194 ms.
Product exploration explored 100000 steps with 0 reset in 189 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p3) p2 p0), (X p2), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT p3)), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 226 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
RANDOM walk for 36940 steps (8 resets) in 341 ms. (108 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p3) p2 p0), (X p2), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT p3)), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (OR p0 p2 (NOT p3)))), (F (NOT p2)), (F p3), (F (NOT (OR p0 p2 p3)))]
Knowledge based reduction with 9 factoid took 389 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 5 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2024-05-28 05:20:10] [INFO ] Invariant cache hit.
[2024-05-28 05:20:10] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 05:20:10] [INFO ] Invariant cache hit.
[2024-05-28 05:20:10] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-28 05:20:10] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-28 05:20:10] [INFO ] Redundant transitions in 15 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-28 05:20:10] [INFO ] Invariant cache hit.
[2024-05-28 05:20:10] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/28 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/32 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 2/34 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/45 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 130 ms.
Refiners :[State Equation: 16/21 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/28 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/30 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 2/32 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 2/34 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/34 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 1/35 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/35 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 1/36 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/36 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/36 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/45 variables, and 41 constraints, problems are : Problem set: 0 solved, 12 unsolved in 129 ms.
Refiners :[State Equation: 17/21 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 264ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 265ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 344 ms. Remains : 21/21 places, 24/24 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p3)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 240 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
RANDOM walk for 36715 steps (8 resets) in 168 ms. (217 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p2 (NOT p3)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (OR p0 p2 (NOT p3)))), (F (NOT p2)), (F p3), (F (NOT (OR p0 p2 p3)))]
Knowledge based reduction with 9 factoid took 387 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 84 ms.
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-00 finished in 3692 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(G((p0||X(F(p1))))))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 106/106 transitions.
Ensure Unique test removed 3 places
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 63 transition count 74
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 58 transition count 69
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 58 transition count 69
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 52 transition count 63
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 52 transition count 63
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 88 place count 48 transition count 59
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 48 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 93 place count 48 transition count 58
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 46 transition count 56
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 46 transition count 56
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 44 transition count 54
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 44 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 44 transition count 52
Applied a total of 103 rules in 12 ms. Remains 44 /93 variables (removed 49) and now considering 52/106 (removed 54) transitions.
[2024-05-28 05:20:11] [INFO ] Flow matrix only has 46 transitions (discarded 6 similar events)
// Phase 1: matrix 46 rows 44 cols
[2024-05-28 05:20:11] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:20:11] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 05:20:11] [INFO ] Flow matrix only has 46 transitions (discarded 6 similar events)
[2024-05-28 05:20:11] [INFO ] Invariant cache hit.
[2024-05-28 05:20:11] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-28 05:20:11] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2024-05-28 05:20:11] [INFO ] Flow matrix only has 46 transitions (discarded 6 similar events)
[2024-05-28 05:20:11] [INFO ] Invariant cache hit.
[2024-05-28 05:20:11] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 2/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 43/85 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 34/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/85 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/90 variables, and 77 constraints, problems are : Problem set: 0 solved, 45 unsolved in 477 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/44 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 2/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 43/85 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 34/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 45/122 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/85 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/90 variables, and 122 constraints, problems are : Problem set: 0 solved, 45 unsolved in 408 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/44 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 894ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 895ms
Starting structural reductions in LTL mode, iteration 1 : 44/93 places, 52/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 975 ms. Remains : 44/93 places, 52/106 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-01
Stuttering criterion allowed to conclude after 872 steps with 66 reset in 8 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-01 finished in 1191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 106/106 transitions.
Ensure Unique test removed 3 places
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 63 transition count 73
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 59 transition count 69
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 59 transition count 69
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 56 transition count 66
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 56 transition count 66
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 54 transition count 64
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 54 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 53 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 53 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 52 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 52 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 52 transition count 61
Applied a total of 86 rules in 11 ms. Remains 52 /93 variables (removed 41) and now considering 61/106 (removed 45) transitions.
[2024-05-28 05:20:12] [INFO ] Flow matrix only has 53 transitions (discarded 8 similar events)
// Phase 1: matrix 53 rows 52 cols
[2024-05-28 05:20:12] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:20:12] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-28 05:20:12] [INFO ] Flow matrix only has 53 transitions (discarded 8 similar events)
[2024-05-28 05:20:12] [INFO ] Invariant cache hit.
[2024-05-28 05:20:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 05:20:12] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-05-28 05:20:13] [INFO ] Flow matrix only has 53 transitions (discarded 8 similar events)
[2024-05-28 05:20:13] [INFO ] Invariant cache hit.
[2024-05-28 05:20:13] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 2/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 51/101 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 42/93 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 55 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/104 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 1/105 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 95 constraints, problems are : Problem set: 0 solved, 55 unsolved in 810 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 2/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 51/101 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 42/93 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 3/104 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 43/149 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 1/105 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/105 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 150 constraints, problems are : Problem set: 0 solved, 55 unsolved in 811 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
After SMT, in 1628ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1629ms
Starting structural reductions in LTL mode, iteration 1 : 52/93 places, 61/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1721 ms. Remains : 52/93 places, 61/106 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 17 steps with 3 reset in 5 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-03 finished in 1915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 106/106 transitions.
Graph (complete) has 199 edges and 93 vertex of which 60 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 56 transition count 70
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 40 place count 49 transition count 63
Iterating global reduction 1 with 7 rules applied. Total rules applied 47 place count 49 transition count 63
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 41 transition count 55
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 41 transition count 55
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 70 place count 34 transition count 48
Iterating global reduction 1 with 7 rules applied. Total rules applied 77 place count 34 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 34 transition count 47
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 29 transition count 42
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 29 transition count 42
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 94 place count 23 transition count 36
Iterating global reduction 2 with 6 rules applied. Total rules applied 100 place count 23 transition count 36
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 106 place count 23 transition count 30
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 108 place count 23 transition count 28
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 40 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 21 transition count 27
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 111 place count 20 transition count 26
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 20 transition count 26
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 19 transition count 25
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 19 transition count 25
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 18 transition count 24
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 18 transition count 24
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 17 transition count 23
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 17 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 119 place count 17 transition count 22
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 120 place count 17 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 121 place count 16 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 122 place count 16 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 123 place count 15 transition count 20
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 124 place count 14 transition count 19
Iterating global reduction 7 with 1 rules applied. Total rules applied 125 place count 14 transition count 19
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 126 place count 13 transition count 18
Iterating global reduction 7 with 1 rules applied. Total rules applied 127 place count 13 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 128 place count 13 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 129 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 130 place count 12 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 131 place count 12 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 132 place count 11 transition count 15
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 133 place count 11 transition count 14
Applied a total of 133 rules in 19 ms. Remains 11 /93 variables (removed 82) and now considering 14/106 (removed 92) transitions.
// Phase 1: matrix 14 rows 11 cols
[2024-05-28 05:20:14] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 05:20:14] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 05:20:14] [INFO ] Invariant cache hit.
[2024-05-28 05:20:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-28 05:20:14] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-28 05:20:14] [INFO ] Redundant transitions in 12 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-28 05:20:14] [INFO ] Invariant cache hit.
[2024-05-28 05:20:14] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/25 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[State Equation: 8/11 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/18 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/20 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/20 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/20 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[State Equation: 9/11 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 96ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/93 places, 14/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 11/93 places, 14/106 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-04 finished in 252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 106/106 transitions.
Ensure Unique test removed 3 places
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 63 transition count 74
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 57 transition count 68
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 57 transition count 68
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 81 place count 50 transition count 61
Iterating global reduction 1 with 7 rules applied. Total rules applied 88 place count 50 transition count 61
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 45 transition count 56
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 45 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 99 place count 45 transition count 55
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 103 place count 41 transition count 51
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 41 transition count 51
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 112 place count 36 transition count 46
Iterating global reduction 2 with 5 rules applied. Total rules applied 117 place count 36 transition count 46
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 122 place count 36 transition count 41
Applied a total of 122 rules in 6 ms. Remains 36 /93 variables (removed 57) and now considering 41/106 (removed 65) transitions.
[2024-05-28 05:20:15] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
// Phase 1: matrix 38 rows 36 cols
[2024-05-28 05:20:15] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:20:15] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 05:20:15] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
[2024-05-28 05:20:15] [INFO ] Invariant cache hit.
[2024-05-28 05:20:15] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 05:20:15] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Running 34 sub problems to find dead transitions.
[2024-05-28 05:20:15] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
[2024-05-28 05:20:15] [INFO ] Invariant cache hit.
[2024-05-28 05:20:15] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 2/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 35/69 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 26/61 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 34 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/69 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/74 variables, and 61 constraints, problems are : Problem set: 0 solved, 34 unsolved in 304 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/36 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 2/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 35/69 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 26/61 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 34/95 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/74 variables, and 95 constraints, problems are : Problem set: 0 solved, 34 unsolved in 239 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/36 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 548ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 548ms
Starting structural reductions in LTL mode, iteration 1 : 36/93 places, 41/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 610 ms. Remains : 36/93 places, 41/106 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 122 ms.
Product exploration explored 100000 steps with 0 reset in 199 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 161 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
RANDOM walk for 13425 steps (3 resets) in 32 ms. (406 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 6 factoid took 252 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-05 finished in 1677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1||G(F((p2||G(p3)))))))))'
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 106/106 transitions.
Graph (complete) has 199 edges and 93 vertex of which 61 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 57 transition count 71
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 51 transition count 65
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 51 transition count 65
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 44 transition count 58
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 44 transition count 58
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 39 transition count 53
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 39 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 39 transition count 52
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 37 transition count 50
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 37 transition count 50
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 76 place count 34 transition count 47
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 place count 34 transition count 47
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 34 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 34 transition count 41
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 61 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 87 place count 32 transition count 40
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 31 transition count 39
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 31 transition count 39
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 91 place count 29 transition count 37
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 29 transition count 37
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 95 place count 27 transition count 35
Iterating global reduction 4 with 2 rules applied. Total rules applied 97 place count 27 transition count 35
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 99 place count 25 transition count 33
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 25 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 103 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 104 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 105 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 106 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 107 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 108 place count 22 transition count 28
Iterating global reduction 7 with 1 rules applied. Total rules applied 109 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 110 place count 21 transition count 27
Iterating global reduction 7 with 1 rules applied. Total rules applied 111 place count 21 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 112 place count 21 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 114 place count 21 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 115 place count 20 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 116 place count 20 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 117 place count 19 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 118 place count 19 transition count 22
Applied a total of 118 rules in 29 ms. Remains 19 /93 variables (removed 74) and now considering 22/106 (removed 84) transitions.
// Phase 1: matrix 22 rows 19 cols
[2024-05-28 05:20:16] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 05:20:16] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 05:20:16] [INFO ] Invariant cache hit.
[2024-05-28 05:20:16] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-28 05:20:16] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-28 05:20:16] [INFO ] Redundant transitions in 11 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-28 05:20:16] [INFO ] Invariant cache hit.
[2024-05-28 05:20:16] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 14/26 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 2/28 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 2/30 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 2/32 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/32 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/41 variables, and 26 constraints, problems are : Problem set: 0 solved, 11 unsolved in 108 ms.
Refiners :[State Equation: 15/19 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 14/26 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 2/30 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2/32 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 1/33 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/33 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 1/34 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/34 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/34 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/41 variables, and 38 constraints, problems are : Problem set: 0 solved, 11 unsolved in 124 ms.
Refiners :[State Equation: 16/19 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 235ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 235ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/93 places, 22/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 321 ms. Remains : 19/93 places, 22/106 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-06 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' '!(X(F(((p1 U G(p2))||p0))))'
Support contains 7 out of 93 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 106/106 transitions.
Ensure Unique test removed 3 places
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 64 transition count 75
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 59 transition count 70
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 59 transition count 70
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 76 place count 53 transition count 64
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 53 transition count 64
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 48 transition count 59
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 48 transition count 59
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 96 place count 44 transition count 55
Iterating global reduction 1 with 4 rules applied. Total rules applied 100 place count 44 transition count 55
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 42 transition count 53
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 42 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 106 place count 42 transition count 51
Applied a total of 106 rules in 7 ms. Remains 42 /93 variables (removed 51) and now considering 51/106 (removed 55) transitions.
[2024-05-28 05:20:17] [INFO ] Flow matrix only has 44 transitions (discarded 7 similar events)
// Phase 1: matrix 44 rows 42 cols
[2024-05-28 05:20:17] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:20:17] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 05:20:17] [INFO ] Flow matrix only has 44 transitions (discarded 7 similar events)
[2024-05-28 05:20:17] [INFO ] Invariant cache hit.
[2024-05-28 05:20:17] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-28 05:20:17] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-28 05:20:17] [INFO ] Flow matrix only has 44 transitions (discarded 7 similar events)
[2024-05-28 05:20:17] [INFO ] Invariant cache hit.
[2024-05-28 05:20:17] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 40/79 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 31/71 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 43 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/79 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/86 variables, and 71 constraints, problems are : Problem set: 0 solved, 43 unsolved in 412 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/42 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 40/79 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 31/71 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 43/114 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/86 variables, and 114 constraints, problems are : Problem set: 0 solved, 43 unsolved in 341 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/42 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 760ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 761ms
Starting structural reductions in LTL mode, iteration 1 : 42/93 places, 51/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 831 ms. Remains : 42/93 places, 51/106 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-07
Stuttering criterion allowed to conclude after 94 steps with 6 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-07 finished in 928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G((p1&&X((p1 U (p2||G(p1)))))))))'
Support contains 6 out of 93 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 106/106 transitions.
Ensure Unique test removed 3 places
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 65 transition count 77
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 63 place count 59 transition count 71
Iterating global reduction 1 with 6 rules applied. Total rules applied 69 place count 59 transition count 71
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 74 place count 54 transition count 66
Iterating global reduction 1 with 5 rules applied. Total rules applied 79 place count 54 transition count 66
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 52 transition count 64
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 52 transition count 64
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 49 transition count 61
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 49 transition count 61
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 46 transition count 58
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 46 transition count 58
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 98 place count 46 transition count 55
Applied a total of 98 rules in 8 ms. Remains 46 /93 variables (removed 47) and now considering 55/106 (removed 51) transitions.
[2024-05-28 05:20:18] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
// Phase 1: matrix 49 rows 46 cols
[2024-05-28 05:20:18] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:20:18] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-28 05:20:18] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
[2024-05-28 05:20:18] [INFO ] Invariant cache hit.
[2024-05-28 05:20:18] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-28 05:20:18] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2024-05-28 05:20:18] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
[2024-05-28 05:20:18] [INFO ] Invariant cache hit.
[2024-05-28 05:20:18] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 2/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 43/85 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 34/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/85 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/95 variables, and 77 constraints, problems are : Problem set: 0 solved, 45 unsolved in 435 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/46 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 2/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 43/85 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 34/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 45/122 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/85 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/95 variables, and 122 constraints, problems are : Problem set: 0 solved, 45 unsolved in 368 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/46 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 809ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 810ms
Starting structural reductions in LTL mode, iteration 1 : 46/93 places, 55/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 892 ms. Remains : 46/93 places, 55/106 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-08 finished in 1044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 106/106 transitions.
Graph (complete) has 199 edges and 93 vertex of which 58 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 54 transition count 68
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 47 transition count 61
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 47 transition count 61
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 56 place count 40 transition count 54
Iterating global reduction 1 with 7 rules applied. Total rules applied 63 place count 40 transition count 54
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 34 transition count 48
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 34 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 34 transition count 47
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 29 transition count 42
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 29 transition count 42
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 24 transition count 37
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 24 transition count 37
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 24 transition count 32
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 103 place count 24 transition count 30
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 47 edges and 23 vertex of which 22 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 22 transition count 29
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 106 place count 21 transition count 28
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 21 transition count 28
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 108 place count 20 transition count 27
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 20 transition count 27
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 19 transition count 26
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 19 transition count 26
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 18 transition count 25
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 18 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 18 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 115 place count 18 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 116 place count 17 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 118 place count 17 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 119 place count 16 transition count 21
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 120 place count 15 transition count 20
Iterating global reduction 7 with 1 rules applied. Total rules applied 121 place count 15 transition count 20
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 122 place count 14 transition count 19
Iterating global reduction 7 with 1 rules applied. Total rules applied 123 place count 14 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 124 place count 14 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 125 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 126 place count 13 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 127 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 128 place count 12 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 129 place count 12 transition count 15
Applied a total of 129 rules in 8 ms. Remains 12 /93 variables (removed 81) and now considering 15/106 (removed 91) transitions.
// Phase 1: matrix 15 rows 12 cols
[2024-05-28 05:20:19] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 05:20:19] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 05:20:19] [INFO ] Invariant cache hit.
[2024-05-28 05:20:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-28 05:20:19] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-28 05:20:19] [INFO ] Redundant transitions in 14 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-28 05:20:19] [INFO ] Invariant cache hit.
[2024-05-28 05:20:19] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1/23 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/24 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/27 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 112 ms.
Refiners :[State Equation: 11/12 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/22 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/23 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/25 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/25 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1/26 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/26 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/26 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/27 variables, and 28 constraints, problems are : Problem set: 0 solved, 8 unsolved in 144 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 261ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 262ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/93 places, 15/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 331 ms. Remains : 12/93 places, 15/106 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-09 finished in 364 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((X(X(F(p0)))||(F(p1) U p2))))'
Support contains 2 out of 93 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 106/106 transitions.
Ensure Unique test removed 3 places
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 64 transition count 75
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 58 transition count 69
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 58 transition count 69
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 79 place count 51 transition count 62
Iterating global reduction 1 with 7 rules applied. Total rules applied 86 place count 51 transition count 62
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 47 transition count 58
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 47 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 95 place count 47 transition count 57
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 44 transition count 54
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 44 transition count 54
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 105 place count 40 transition count 50
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 40 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 113 place count 40 transition count 46
Applied a total of 113 rules in 5 ms. Remains 40 /93 variables (removed 53) and now considering 46/106 (removed 60) transitions.
[2024-05-28 05:20:19] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 40 cols
[2024-05-28 05:20:19] [INFO ] Computed 1 invariants in 3 ms
[2024-05-28 05:20:19] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-28 05:20:19] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
[2024-05-28 05:20:19] [INFO ] Invariant cache hit.
[2024-05-28 05:20:19] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-28 05:20:19] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2024-05-28 05:20:19] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
[2024-05-28 05:20:19] [INFO ] Invariant cache hit.
[2024-05-28 05:20:19] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 2/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/75 variables, 37/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 29/67 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 38 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/82 variables, and 67 constraints, problems are : Problem set: 0 solved, 38 unsolved in 400 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/40 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 2/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/75 variables, 37/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 29/67 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 38/105 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/82 variables, and 105 constraints, problems are : Problem set: 0 solved, 38 unsolved in 299 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/40 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 710ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 711ms
Starting structural reductions in LTL mode, iteration 1 : 40/93 places, 46/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 799 ms. Remains : 40/93 places, 46/106 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-10 finished in 925 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 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 106/106 transitions.
Graph (complete) has 199 edges and 93 vertex of which 58 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 54 transition count 68
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 48 transition count 62
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 48 transition count 62
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 41 transition count 55
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 41 transition count 55
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 36 transition count 50
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 36 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 36 transition count 49
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 34 transition count 47
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 34 transition count 47
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 32 transition count 45
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 32 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 32 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 32 transition count 40
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 64 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 87 place count 30 transition count 39
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 29 transition count 38
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 29 transition count 38
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 90 place count 28 transition count 37
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 28 transition count 37
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 93 place count 26 transition count 35
Iterating global reduction 4 with 2 rules applied. Total rules applied 95 place count 26 transition count 35
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 97 place count 24 transition count 33
Iterating global reduction 4 with 2 rules applied. Total rules applied 99 place count 24 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 101 place count 24 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 102 place count 24 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 103 place count 23 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 105 place count 23 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 106 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 107 place count 21 transition count 27
Iterating global reduction 7 with 1 rules applied. Total rules applied 108 place count 21 transition count 27
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 110 place count 19 transition count 25
Iterating global reduction 7 with 2 rules applied. Total rules applied 112 place count 19 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 114 place count 19 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 115 place count 19 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 116 place count 18 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 117 place count 18 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 118 place count 17 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 119 place count 17 transition count 20
Applied a total of 119 rules in 22 ms. Remains 17 /93 variables (removed 76) and now considering 20/106 (removed 86) transitions.
// Phase 1: matrix 20 rows 17 cols
[2024-05-28 05:20:20] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 05:20:20] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 05:20:20] [INFO ] Invariant cache hit.
[2024-05-28 05:20:20] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-28 05:20:20] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-28 05:20:20] [INFO ] Redundant transitions in 17 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-28 05:20:20] [INFO ] Invariant cache hit.
[2024-05-28 05:20:20] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/28 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/32 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 2/34 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/37 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 121 ms.
Refiners :[State Equation: 16/17 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/28 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/30 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 2/32 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 2/34 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/34 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 1/35 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/35 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 1/36 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/36 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/36 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/37 variables, and 41 constraints, problems are : Problem set: 0 solved, 12 unsolved in 120 ms.
Refiners :[State Equation: 17/17 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 246ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 247ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/93 places, 20/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 379 ms. Remains : 17/93 places, 20/106 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-11 finished in 425 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||G(p1)||X((X(G(p2)) U (p0&&X(G(p2))))))))'
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 106/106 transitions.
Ensure Unique test removed 3 places
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 63 transition count 74
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 57 transition count 68
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 57 transition count 68
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 51 transition count 62
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 51 transition count 62
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 47 transition count 58
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 47 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 95 place count 47 transition count 57
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 44 transition count 54
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 44 transition count 54
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 42 transition count 52
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 42 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 42 transition count 50
Applied a total of 107 rules in 9 ms. Remains 42 /93 variables (removed 51) and now considering 50/106 (removed 56) transitions.
[2024-05-28 05:20:20] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
// Phase 1: matrix 44 rows 42 cols
[2024-05-28 05:20:20] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:20:20] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-28 05:20:20] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
[2024-05-28 05:20:20] [INFO ] Invariant cache hit.
[2024-05-28 05:20:20] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-28 05:20:20] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-28 05:20:20] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
[2024-05-28 05:20:20] [INFO ] Invariant cache hit.
[2024-05-28 05:20:20] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 2/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 41/81 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 43 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/81 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/86 variables, and 73 constraints, problems are : Problem set: 0 solved, 43 unsolved in 459 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/42 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 2/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 41/81 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 43/116 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/86 variables, and 116 constraints, problems are : Problem set: 0 solved, 43 unsolved in 336 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/42 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 800ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 800ms
Starting structural reductions in LTL mode, iteration 1 : 42/93 places, 50/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 879 ms. Remains : 42/93 places, 50/106 transitions.
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-12 finished in 1191 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&&G(p1))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 106/106 transitions.
Ensure Unique test removed 3 places
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 64 transition count 75
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 59 transition count 70
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 59 transition count 70
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 76 place count 53 transition count 64
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 53 transition count 64
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 49 transition count 60
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 49 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 91 place count 49 transition count 59
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 94 place count 46 transition count 56
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 46 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 42 transition count 52
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 42 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 109 place count 42 transition count 48
Applied a total of 109 rules in 5 ms. Remains 42 /93 variables (removed 51) and now considering 48/106 (removed 58) transitions.
[2024-05-28 05:20:22] [INFO ] Flow matrix only has 44 transitions (discarded 4 similar events)
// Phase 1: matrix 44 rows 42 cols
[2024-05-28 05:20:22] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:20:22] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-28 05:20:22] [INFO ] Flow matrix only has 44 transitions (discarded 4 similar events)
[2024-05-28 05:20:22] [INFO ] Invariant cache hit.
[2024-05-28 05:20:22] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-28 05:20:22] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-28 05:20:22] [INFO ] Flow matrix only has 44 transitions (discarded 4 similar events)
[2024-05-28 05:20:22] [INFO ] Invariant cache hit.
[2024-05-28 05:20:22] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 40/79 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 31/71 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 40 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/79 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/86 variables, and 71 constraints, problems are : Problem set: 0 solved, 40 unsolved in 371 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/42 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 40/79 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 31/71 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 40/111 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/86 variables, and 111 constraints, problems are : Problem set: 0 solved, 40 unsolved in 305 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/42 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 679ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 680ms
Starting structural reductions in LTL mode, iteration 1 : 42/93 places, 48/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 752 ms. Remains : 42/93 places, 48/106 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-13 finished in 904 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(p0))))'
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 106/106 transitions.
Ensure Unique test removed 3 places
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 63 transition count 74
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 57 transition count 68
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 57 transition count 68
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 81 place count 50 transition count 61
Iterating global reduction 1 with 7 rules applied. Total rules applied 88 place count 50 transition count 61
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 45 transition count 56
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 45 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 99 place count 45 transition count 55
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 102 place count 42 transition count 52
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 42 transition count 52
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 38 transition count 48
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 38 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 117 place count 38 transition count 44
Applied a total of 117 rules in 3 ms. Remains 38 /93 variables (removed 55) and now considering 44/106 (removed 62) transitions.
[2024-05-28 05:20:23] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
// Phase 1: matrix 40 rows 38 cols
[2024-05-28 05:20:23] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:20:23] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 05:20:23] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-05-28 05:20:23] [INFO ] Invariant cache hit.
[2024-05-28 05:20:23] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-28 05:20:23] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 37 sub problems to find dead transitions.
[2024-05-28 05:20:23] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-05-28 05:20:23] [INFO ] Invariant cache hit.
[2024-05-28 05:20:23] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 2/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 37/73 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 28/65 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 37 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/73 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/78 variables, and 65 constraints, problems are : Problem set: 0 solved, 37 unsolved in 349 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 36/38 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 2/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 37/73 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 28/65 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 37/102 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/78 variables, and 102 constraints, problems are : Problem set: 0 solved, 37 unsolved in 253 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 36/38 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 607ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 607ms
Starting structural reductions in LTL mode, iteration 1 : 38/93 places, 44/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 681 ms. Remains : 38/93 places, 44/106 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 176 ms.
Product exploration explored 100000 steps with 33333 reset in 112 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 10 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-14 finished in 1073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||(X(X(!p1)) U ((p2&&X(X(!p1)))||X(X(G(!p1)))))))))'
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 106/106 transitions.
Ensure Unique test removed 3 places
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 61 transition count 72
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 55 transition count 66
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 55 transition count 66
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 48 transition count 59
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 48 transition count 59
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 45 transition count 56
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 45 transition count 56
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 42 transition count 53
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 42 transition count 53
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 39 transition count 50
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 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 113 place count 39 transition count 47
Applied a total of 113 rules in 8 ms. Remains 39 /93 variables (removed 54) and now considering 47/106 (removed 59) transitions.
[2024-05-28 05:20:24] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 39 cols
[2024-05-28 05:20:24] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:20:24] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 05:20:24] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2024-05-28 05:20:24] [INFO ] Invariant cache hit.
[2024-05-28 05:20:24] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-28 05:20:24] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 42 sub problems to find dead transitions.
[2024-05-28 05:20:24] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2024-05-28 05:20:24] [INFO ] Invariant cache hit.
[2024-05-28 05:20:24] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 40/79 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 31/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/79 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/80 variables, and 71 constraints, problems are : Problem set: 0 solved, 42 unsolved in 385 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 40/79 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 31/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 42/113 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/80 variables, and 113 constraints, problems are : Problem set: 0 solved, 42 unsolved in 300 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 692ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 693ms
Starting structural reductions in LTL mode, iteration 1 : 39/93 places, 47/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 762 ms. Remains : 39/93 places, 47/106 transitions.
Stuttering acceptance computed with spot in 351 ms :[p1, (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, true, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-15
Product exploration explored 100000 steps with 20224 reset in 187 ms.
Product exploration explored 100000 steps with 20231 reset in 129 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), true]
RANDOM walk for 33416 steps (8 resets) in 382 ms. (87 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X p2))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), true]
Stuttering acceptance computed with spot in 200 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), true]
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 47/47 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-05-28 05:20:26] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2024-05-28 05:20:26] [INFO ] Invariant cache hit.
[2024-05-28 05:20:26] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-28 05:20:26] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2024-05-28 05:20:26] [INFO ] Invariant cache hit.
[2024-05-28 05:20:26] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-28 05:20:26] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 42 sub problems to find dead transitions.
[2024-05-28 05:20:26] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2024-05-28 05:20:26] [INFO ] Invariant cache hit.
[2024-05-28 05:20:26] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 40/79 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 31/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/79 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/80 variables, and 71 constraints, problems are : Problem set: 0 solved, 42 unsolved in 413 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 40/79 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 31/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 42/113 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/80 variables, and 113 constraints, problems are : Problem set: 0 solved, 42 unsolved in 322 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 742ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 742ms
Finished structural reductions in LTL mode , in 1 iterations and 806 ms. Remains : 39/39 places, 47/47 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), true]
RANDOM walk for 26691 steps (8 resets) in 84 ms. (314 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), true]
Stuttering acceptance computed with spot in 194 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), true]
Stuttering acceptance computed with spot in 208 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), true]
Product exploration explored 100000 steps with 20220 reset in 73 ms.
Product exploration explored 100000 steps with 20226 reset in 76 ms.
Applying partial POR strategy [true, false, false, false, false, true]
Stuttering acceptance computed with spot in 222 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), true]
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 47/47 transitions.
Graph (complete) has 81 edges and 39 vertex of which 33 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 32 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 32 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 31 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 31 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 30 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 30 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 29 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 29 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 28 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 28 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 28 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 28 transition count 36
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 56 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 26 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 25 transition count 34
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 25 transition count 34
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 23 transition count 32
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 23 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 22 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 22 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 21 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 21 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 21 transition count 29
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 28 place count 21 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 20 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 20 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 32 place count 19 transition count 26
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 33 place count 18 transition count 25
Iterating global reduction 5 with 1 rules applied. Total rules applied 34 place count 18 transition count 25
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 35 place count 17 transition count 24
Iterating global reduction 5 with 1 rules applied. Total rules applied 36 place count 17 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 37 place count 17 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 38 place count 17 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 39 place count 16 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 42 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 43 place count 15 transition count 19
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 44 place count 15 transition count 18
Applied a total of 44 rules in 17 ms. Remains 15 /39 variables (removed 24) and now considering 18/47 (removed 29) transitions.
[2024-05-28 05:20:29] [INFO ] Redundant transitions in 16 ms returned []
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 18 rows 15 cols
[2024-05-28 05:20:29] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 05:20:29] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 13/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 3/26 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 3/29 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 3/32 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/32 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/33 variables, and 27 constraints, problems are : Problem set: 0 solved, 13 unsolved in 120 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 13/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 3/26 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 3/29 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 3/32 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/32 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/33 variables, and 40 constraints, problems are : Problem set: 0 solved, 13 unsolved in 108 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 231ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 232ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/39 places, 18/47 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 273 ms. Remains : 15/39 places, 18/47 transitions.
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 47/47 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-05-28 05:20:29] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 39 cols
[2024-05-28 05:20:29] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:20:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 05:20:29] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2024-05-28 05:20:29] [INFO ] Invariant cache hit.
[2024-05-28 05:20:29] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-28 05:20:29] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 42 sub problems to find dead transitions.
[2024-05-28 05:20:29] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2024-05-28 05:20:29] [INFO ] Invariant cache hit.
[2024-05-28 05:20:29] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 40/79 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 31/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/79 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/80 variables, and 71 constraints, problems are : Problem set: 0 solved, 42 unsolved in 411 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 40/79 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 31/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 42/113 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/80 variables, and 113 constraints, problems are : Problem set: 0 solved, 42 unsolved in 329 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 749ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 749ms
Finished structural reductions in LTL mode , in 1 iterations and 811 ms. Remains : 39/39 places, 47/47 transitions.
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-15 finished in 6094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||(X(X(!p1)) U ((p2&&X(X(!p1)))||X(X(G(!p1)))))))))'
[2024-05-28 05:20:30] [INFO ] Flatten gal took : 8 ms
[2024-05-28 05:20:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-28 05:20:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 93 places, 106 transitions and 358 arcs took 2 ms.
Total runtime 27141 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SemanticWebServices-PT-S128P12

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 93
TRANSITIONS: 106
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.001s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1496
MODEL NAME: /home/mcc/execution/412/model
93 places, 106 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
coverability test failed!!
coverability test failed!!
Convergence in 1 steps.
The state space is infinite.
Convergence in 1 steps.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716873631072

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SemanticWebServices-PT-S128P12"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is SemanticWebServices-PT-S128P12, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r333-tall-171679078700547"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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