fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r333-tall-171679078600515
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for SemanticWebServices-PT-S064P15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
374.107 31676.00 53038.00 162.10 FTTFTFFFFFFFFFFF normal

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-171679078600515.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-S064P15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078600515
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 02:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 02:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 02:45 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 137K 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-S064P15-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716873001155

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-S064P15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:10:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 05:10:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:10:02] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-28 05:10:02] [INFO ] Transformed 118 places.
[2024-05-28 05:10:02] [INFO ] Transformed 194 transitions.
[2024-05-28 05:10:02] [INFO ] Parsed PT model containing 118 places and 194 transitions and 1007 arcs in 178 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 101 transitions
Reduce redundant transitions removed 101 transitions.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 91/91 transitions.
Ensure Unique test removed 30 places
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 86 transition count 91
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 81 transition count 86
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 81 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 81 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 79 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 79 transition count 83
Applied a total of 45 rules in 25 ms. Remains 79 /116 variables (removed 37) and now considering 83/91 (removed 8) transitions.
[2024-05-28 05:10:02] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
// Phase 1: matrix 74 rows 79 cols
[2024-05-28 05:10:02] [INFO ] Computed 7 invariants in 9 ms
[2024-05-28 05:10:02] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-28 05:10:02] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2024-05-28 05:10:02] [INFO ] Invariant cache hit.
[2024-05-28 05:10:02] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-28 05:10:02] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-28 05:10:02] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2024-05-28 05:10:02] [INFO ] Invariant cache hit.
[2024-05-28 05:10:02] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 1/79 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 74/153 variables, 79/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 65/151 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 79 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/153 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 151 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1783 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 1/79 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 74/153 variables, 79/86 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 65/151 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 79/230 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 230 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1145 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
After SMT, in 2977ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 2987ms
Starting structural reductions in LTL mode, iteration 1 : 79/116 places, 83/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3303 ms. Remains : 79/116 places, 83/91 transitions.
Support contains 44 out of 79 places after structural reductions.
[2024-05-28 05:10:06] [INFO ] Flatten gal took : 24 ms
[2024-05-28 05:10:06] [INFO ] Flatten gal took : 9 ms
[2024-05-28 05:10:06] [INFO ] Input system was already deterministic with 83 transitions.
RANDOM walk for 40001 steps (8 resets) in 1745 ms. (22 steps per ms) remains 3/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
[2024-05-28 05:10:06] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2024-05-28 05:10:06] [INFO ] Invariant cache hit.
[2024-05-28 05:10:06] [INFO ] State equation strengthened by 65 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/75 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/79 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 74/153 variables, 79/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 65/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/75 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/79 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 74/153 variables, 79/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 65/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 1/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/153 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 152 constraints, problems are : Problem set: 1 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 155ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 36 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 5 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 9 stabilizing places and 9 stable transitions
Graph (complete) has 245 edges and 79 vertex of which 71 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 83/83 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 73 transition count 83
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 67 transition count 77
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 67 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 67 transition count 76
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 62 transition count 71
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 62 transition count 71
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 33 place count 58 transition count 67
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 58 transition count 67
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 56 transition count 65
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 56 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 55 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 55 transition count 64
Applied a total of 43 rules in 11 ms. Remains 55 /79 variables (removed 24) and now considering 64/83 (removed 19) transitions.
[2024-05-28 05:10:07] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
// Phase 1: matrix 55 rows 55 cols
[2024-05-28 05:10:07] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:10:07] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 05:10:07] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-28 05:10:07] [INFO ] Invariant cache hit.
[2024-05-28 05:10:07] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-28 05:10:07] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-28 05:10:07] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-28 05:10:07] [INFO ] Invariant cache hit.
[2024-05-28 05:10:07] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 2/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 55/110 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 47/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/110 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 103 constraints, problems are : Problem set: 0 solved, 61 unsolved in 742 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 2/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 55/110 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 47/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 61/164 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 164 constraints, problems are : Problem set: 0 solved, 61 unsolved in 536 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 1288ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 1299ms
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 64/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1394 ms. Remains : 55/79 places, 64/83 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-00 finished in 1670 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((X(F(p1))||p0))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 83/83 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 73 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 68 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 68 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 68 transition count 77
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 21 place count 64 transition count 73
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 64 transition count 73
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 61 transition count 70
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 61 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 59 transition count 68
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 59 transition count 68
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 58 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 58 transition count 67
Applied a total of 37 rules in 15 ms. Remains 58 /79 variables (removed 21) and now considering 67/83 (removed 16) transitions.
[2024-05-28 05:10:08] [INFO ] Flow matrix only has 58 transitions (discarded 9 similar events)
// Phase 1: matrix 58 rows 58 cols
[2024-05-28 05:10:08] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:10:09] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-28 05:10:09] [INFO ] Flow matrix only has 58 transitions (discarded 9 similar events)
[2024-05-28 05:10:09] [INFO ] Invariant cache hit.
[2024-05-28 05:10:09] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-28 05:10:09] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-28 05:10:09] [INFO ] Flow matrix only has 58 transitions (discarded 9 similar events)
[2024-05-28 05:10:09] [INFO ] Invariant cache hit.
[2024-05-28 05:10:09] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 2/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 58/116 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 50/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/116 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 109 constraints, problems are : Problem set: 0 solved, 64 unsolved in 808 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 2/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 58/116 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 50/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 64/173 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 173 constraints, problems are : Problem set: 0 solved, 64 unsolved in 579 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1395ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1396ms
Starting structural reductions in LTL mode, iteration 1 : 58/79 places, 67/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1485 ms. Remains : 58/79 places, 67/83 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 120 edges and 58 vertex of which 52 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-01 finished in 1946 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 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 83/83 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 73 transition count 83
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 67 transition count 77
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 67 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 67 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 23 place count 63 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 63 transition count 72
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 60 transition count 69
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 60 transition count 69
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 58 transition count 67
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 58 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 57 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 57 transition count 66
Applied a total of 39 rules in 10 ms. Remains 57 /79 variables (removed 22) and now considering 66/83 (removed 17) transitions.
[2024-05-28 05:10:10] [INFO ] Flow matrix only has 57 transitions (discarded 9 similar events)
// Phase 1: matrix 57 rows 57 cols
[2024-05-28 05:10:10] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:10:10] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 05:10:10] [INFO ] Flow matrix only has 57 transitions (discarded 9 similar events)
[2024-05-28 05:10:10] [INFO ] Invariant cache hit.
[2024-05-28 05:10:10] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 05:10:10] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-28 05:10:10] [INFO ] Flow matrix only has 57 transitions (discarded 9 similar events)
[2024-05-28 05:10:10] [INFO ] Invariant cache hit.
[2024-05-28 05:10:11] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 2/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 57/114 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 49/107 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 63 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 107 constraints, problems are : Problem set: 0 solved, 63 unsolved in 745 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 2/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 57/114 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 49/107 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 63/170 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 170 constraints, problems are : Problem set: 0 solved, 63 unsolved in 568 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 1321ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 1321ms
Starting structural reductions in LTL mode, iteration 1 : 57/79 places, 66/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1399 ms. Remains : 57/79 places, 66/83 transitions.
Stuttering acceptance computed with spot in 170 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-S064P15-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 118 edges and 57 vertex of which 51 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-02 finished in 1763 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 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 83/83 transitions.
Graph (complete) has 245 edges and 79 vertex of which 78 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 73 transition count 80
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 71 transition count 80
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 11 place count 65 transition count 74
Iterating global reduction 0 with 6 rules applied. Total rules applied 17 place count 65 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 65 transition count 73
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 60 transition count 68
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 60 transition count 68
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 56 transition count 64
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 56 transition count 64
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 54 transition count 62
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 54 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 53 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 53 transition count 61
Applied a total of 42 rules in 20 ms. Remains 53 /79 variables (removed 26) and now considering 61/83 (removed 22) transitions.
[2024-05-28 05:10:12] [INFO ] Flow matrix only has 52 transitions (discarded 9 similar events)
// Phase 1: matrix 52 rows 53 cols
[2024-05-28 05:10:12] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 05:10:12] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 05:10:12] [INFO ] Flow matrix only has 52 transitions (discarded 9 similar events)
[2024-05-28 05:10:12] [INFO ] Invariant cache hit.
[2024-05-28 05:10:12] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-28 05:10:12] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-28 05:10:12] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-28 05:10:12] [INFO ] Flow matrix only has 52 transitions (discarded 9 similar events)
[2024-05-28 05:10:12] [INFO ] Invariant cache hit.
[2024-05-28 05:10:12] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 3/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 52/105 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 36/91 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 47 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/105 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 91 constraints, problems are : Problem set: 0 solved, 47 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 3/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 52/105 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 36/91 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 138 constraints, problems are : Problem set: 0 solved, 47 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 942ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 943ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/79 places, 61/83 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1030 ms. Remains : 53/79 places, 61/83 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-03 finished in 1069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 83/83 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 73 transition count 83
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 67 transition count 77
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 67 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 67 transition count 76
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 62 transition count 71
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 62 transition count 71
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 33 place count 58 transition count 67
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 58 transition count 67
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 56 transition count 65
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 56 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 55 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 55 transition count 64
Applied a total of 43 rules in 10 ms. Remains 55 /79 variables (removed 24) and now considering 64/83 (removed 19) transitions.
[2024-05-28 05:10:13] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
// Phase 1: matrix 55 rows 55 cols
[2024-05-28 05:10:13] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:10:13] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 05:10:13] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-28 05:10:13] [INFO ] Invariant cache hit.
[2024-05-28 05:10:13] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-28 05:10:13] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-28 05:10:13] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-28 05:10:13] [INFO ] Invariant cache hit.
[2024-05-28 05:10:13] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 2/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 55/110 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 47/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/110 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 103 constraints, problems are : Problem set: 0 solved, 61 unsolved in 724 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 2/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 55/110 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 47/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 61/164 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 164 constraints, problems are : Problem set: 0 solved, 61 unsolved in 570 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 1300ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 1301ms
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 64/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1386 ms. Remains : 55/79 places, 64/83 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Product exploration explored 100000 steps with 50000 reset in 75 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 114 edges and 55 vertex of which 49 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-04 finished in 1682 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(G(p0))&&F(!p0))))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 83/83 transitions.
Graph (complete) has 245 edges and 79 vertex of which 71 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 60 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 60 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 72
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 54 transition count 66
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 54 transition count 66
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 48 transition count 60
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 48 transition count 60
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 43 transition count 55
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 43 transition count 55
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 39 transition count 51
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 39 transition count 51
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 36 transition count 48
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 36 transition count 48
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 65 place count 36 transition count 45
Applied a total of 65 rules in 19 ms. Remains 36 /79 variables (removed 43) and now considering 45/83 (removed 38) transitions.
[2024-05-28 05:10:15] [INFO ] Flow matrix only has 38 transitions (discarded 7 similar events)
// Phase 1: matrix 38 rows 36 cols
[2024-05-28 05:10:15] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 05:10:15] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 05:10:15] [INFO ] Flow matrix only has 38 transitions (discarded 7 similar events)
[2024-05-28 05:10:15] [INFO ] Invariant cache hit.
[2024-05-28 05:10:15] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 05:10:15] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-28 05:10:15] [INFO ] Redundant transitions in 0 ms returned []
Running 34 sub problems to find dead transitions.
[2024-05-28 05:10:15] [INFO ] Flow matrix only has 38 transitions (discarded 7 similar events)
[2024-05-28 05:10:15] [INFO ] Invariant cache hit.
[2024-05-28 05:10:15] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 36/70 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 1/71 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 1/72 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/72 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/74 variables, and 61 constraints, problems are : Problem set: 0 solved, 34 unsolved in 380 ms.
Refiners :[State Equation: 35/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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 36/70 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 26/85 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 1/71 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 1/72 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 1/73 variables, 8/95 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 1/74 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/74 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (OVERLAPS) 0/74 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 96 constraints, problems are : Problem set: 0 solved, 34 unsolved in 427 ms.
Refiners :[State Equation: 36/36 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 818ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 819ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/79 places, 45/83 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 907 ms. Remains : 36/79 places, 45/83 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), p0]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-05
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-05 finished in 1023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 83/83 transitions.
Graph (complete) has 245 edges and 79 vertex of which 71 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 59 transition count 72
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 59 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 59 transition count 71
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 23 place count 52 transition count 64
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 52 transition count 64
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 45 transition count 57
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 45 transition count 57
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 38 transition count 50
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 38 transition count 50
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 32 transition count 44
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 32 transition count 44
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 28 transition count 40
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 28 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 28 transition count 36
Applied a total of 82 rules in 13 ms. Remains 28 /79 variables (removed 51) and now considering 36/83 (removed 47) transitions.
[2024-05-28 05:10:16] [INFO ] Flow matrix only has 30 transitions (discarded 6 similar events)
// Phase 1: matrix 30 rows 28 cols
[2024-05-28 05:10:16] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 05:10:16] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 05:10:16] [INFO ] Flow matrix only has 30 transitions (discarded 6 similar events)
[2024-05-28 05:10:16] [INFO ] Invariant cache hit.
[2024-05-28 05:10:16] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-28 05:10:16] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-28 05:10:16] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2024-05-28 05:10:16] [INFO ] Flow matrix only has 30 transitions (discarded 6 similar events)
[2024-05-28 05:10:16] [INFO ] Invariant cache hit.
[2024-05-28 05:10:16] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 28/54 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 1/55 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 1/56 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/58 variables, and 46 constraints, problems are : Problem set: 0 solved, 26 unsolved in 253 ms.
Refiners :[State Equation: 27/28 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 28/54 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 1/55 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 1/56 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 1/57 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 1/58 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/58 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/58 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 73 constraints, problems are : Problem set: 0 solved, 26 unsolved in 315 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 572ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 572ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/79 places, 36/83 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 639 ms. Remains : 28/79 places, 36/83 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 127 ms.
Product exploration explored 100000 steps with 2 reset in 206 ms.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 33355 steps (7 resets) in 342 ms. (97 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 36/36 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2024-05-28 05:10:17] [INFO ] Flow matrix only has 30 transitions (discarded 6 similar events)
[2024-05-28 05:10:17] [INFO ] Invariant cache hit.
[2024-05-28 05:10:17] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 05:10:17] [INFO ] Flow matrix only has 30 transitions (discarded 6 similar events)
[2024-05-28 05:10:17] [INFO ] Invariant cache hit.
[2024-05-28 05:10:17] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-28 05:10:17] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-28 05:10:17] [INFO ] Redundant transitions in 1 ms returned []
Running 26 sub problems to find dead transitions.
[2024-05-28 05:10:17] [INFO ] Flow matrix only has 30 transitions (discarded 6 similar events)
[2024-05-28 05:10:17] [INFO ] Invariant cache hit.
[2024-05-28 05:10:17] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 28/54 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 1/55 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 1/56 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/58 variables, and 46 constraints, problems are : Problem set: 0 solved, 26 unsolved in 245 ms.
Refiners :[State Equation: 27/28 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 28/54 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 18/44 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 1/55 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 1/56 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 1/57 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 1/58 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/58 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/58 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 73 constraints, problems are : Problem set: 0 solved, 26 unsolved in 271 ms.
Refiners :[State Equation: 28/28 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 520ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 521ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 581 ms. Remains : 28/28 places, 36/36 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 140 steps (0 resets) in 4 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-07 finished in 2366 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 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 83/83 transitions.
Graph (complete) has 245 edges and 79 vertex of which 71 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 59 transition count 72
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 59 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 59 transition count 71
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 23 place count 52 transition count 64
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 52 transition count 64
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 45 transition count 57
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 45 transition count 57
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 38 transition count 50
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 38 transition count 50
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 33 transition count 45
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 33 transition count 45
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 29 transition count 41
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 29 transition count 41
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 29 transition count 37
Applied a total of 80 rules in 13 ms. Remains 29 /79 variables (removed 50) and now considering 37/83 (removed 46) transitions.
[2024-05-28 05:10:18] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
// Phase 1: matrix 31 rows 29 cols
[2024-05-28 05:10:18] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 05:10:18] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 05:10:18] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
[2024-05-28 05:10:18] [INFO ] Invariant cache hit.
[2024-05-28 05:10:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-28 05:10:18] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-28 05:10:18] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2024-05-28 05:10:18] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
[2024-05-28 05:10:18] [INFO ] Invariant cache hit.
[2024-05-28 05:10:18] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 29/56 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 1/57 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 1/58 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/58 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/60 variables, and 48 constraints, problems are : Problem set: 0 solved, 27 unsolved in 278 ms.
Refiners :[State Equation: 28/29 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 29/56 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 1/57 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 1/58 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 1/59 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/59 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 1/60 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/60 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 0/60 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 76 constraints, problems are : Problem set: 0 solved, 27 unsolved in 303 ms.
Refiners :[State Equation: 29/29 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 585ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 586ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/79 places, 37/83 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 652 ms. Remains : 29/79 places, 37/83 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-08
Stuttering criterion allowed to conclude after 94 steps with 1 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-08 finished in 744 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 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 83/83 transitions.
Graph (complete) has 245 edges and 79 vertex of which 71 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 59 transition count 72
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 59 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 59 transition count 71
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 23 place count 52 transition count 64
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 52 transition count 64
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 45 transition count 57
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 45 transition count 57
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 38 transition count 50
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 38 transition count 50
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 33 transition count 45
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 33 transition count 45
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 29 transition count 41
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 29 transition count 41
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 29 transition count 37
Applied a total of 80 rules in 14 ms. Remains 29 /79 variables (removed 50) and now considering 37/83 (removed 46) transitions.
[2024-05-28 05:10:19] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
// Phase 1: matrix 31 rows 29 cols
[2024-05-28 05:10:19] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 05:10:19] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 05:10:19] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
[2024-05-28 05:10:19] [INFO ] Invariant cache hit.
[2024-05-28 05:10:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-28 05:10:19] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-28 05:10:19] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2024-05-28 05:10:19] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
[2024-05-28 05:10:19] [INFO ] Invariant cache hit.
[2024-05-28 05:10:19] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 29/56 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 1/57 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 1/58 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/58 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/60 variables, and 48 constraints, problems are : Problem set: 0 solved, 27 unsolved in 255 ms.
Refiners :[State Equation: 28/29 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 29/56 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 1/57 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 1/58 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 1/59 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/59 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 1/60 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/60 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 0/60 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 76 constraints, problems are : Problem set: 0 solved, 27 unsolved in 304 ms.
Refiners :[State Equation: 29/29 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 563ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 563ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/79 places, 37/83 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 638 ms. Remains : 29/79 places, 37/83 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 93 ms.
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-09 finished in 782 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) U !p1) U (p0 U G(p2))))'
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 83/83 transitions.
Graph (complete) has 245 edges and 79 vertex of which 72 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 60 transition count 73
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 60 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 72
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 54 transition count 66
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 54 transition count 66
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 48 transition count 60
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 48 transition count 60
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 44 transition count 56
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 44 transition count 56
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 42 transition count 54
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 42 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 41 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 41 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 55 place count 41 transition count 52
Applied a total of 55 rules in 13 ms. Remains 41 /79 variables (removed 38) and now considering 52/83 (removed 31) transitions.
[2024-05-28 05:10:20] [INFO ] Flow matrix only has 44 transitions (discarded 8 similar events)
// Phase 1: matrix 44 rows 41 cols
[2024-05-28 05:10:20] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 05:10:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 05:10:20] [INFO ] Flow matrix only has 44 transitions (discarded 8 similar events)
[2024-05-28 05:10:20] [INFO ] Invariant cache hit.
[2024-05-28 05:10:20] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-28 05:10:20] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-28 05:10:20] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-28 05:10:20] [INFO ] Flow matrix only has 44 transitions (discarded 8 similar events)
[2024-05-28 05:10:20] [INFO ] Invariant cache hit.
[2024-05-28 05:10:20] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 42/81 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/82 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 1/83 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/83 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/85 variables, and 69 constraints, problems are : Problem set: 0 solved, 39 unsolved in 484 ms.
Refiners :[State Equation: 40/41 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 42/81 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 29/96 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 1/82 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 1/83 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 1/84 variables, 10/108 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 1/85 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/85 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (OVERLAPS) 0/85 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 109 constraints, problems are : Problem set: 0 solved, 39 unsolved in 544 ms.
Refiners :[State Equation: 41/41 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
After SMT, in 1032ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1032ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/79 places, 52/83 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1108 ms. Remains : 41/79 places, 52/83 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p0), p1, (AND (NOT p0) (NOT p2) (NOT p1)), (AND p0 p1 (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-10
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-10 finished in 1349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X(p1))||(X(p1)&&(X(F(p1)) U G(p2)))))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 83/83 transitions.
Ensure Unique test removed 4 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 74 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 69 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 69 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 69 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 66 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 66 transition count 74
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 26 place count 62 transition count 70
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 62 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 60 transition count 68
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 60 transition count 68
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 58 transition count 66
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 58 transition count 66
Applied a total of 38 rules in 10 ms. Remains 58 /79 variables (removed 21) and now considering 66/83 (removed 17) transitions.
[2024-05-28 05:10:21] [INFO ] Flow matrix only has 57 transitions (discarded 9 similar events)
// Phase 1: matrix 57 rows 58 cols
[2024-05-28 05:10:21] [INFO ] Computed 2 invariants in 6 ms
[2024-05-28 05:10:21] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-28 05:10:21] [INFO ] Flow matrix only has 57 transitions (discarded 9 similar events)
[2024-05-28 05:10:21] [INFO ] Invariant cache hit.
[2024-05-28 05:10:21] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 05:10:21] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-28 05:10:21] [INFO ] Flow matrix only has 57 transitions (discarded 9 similar events)
[2024-05-28 05:10:21] [INFO ] Invariant cache hit.
[2024-05-28 05:10:21] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 3/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 57/115 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 49/109 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 63 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/115 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 109 constraints, problems are : Problem set: 0 solved, 63 unsolved in 827 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 3/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 57/115 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 49/109 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 63/172 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/115 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 172 constraints, problems are : Problem set: 0 solved, 63 unsolved in 637 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 1470ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 1471ms
Starting structural reductions in LTL mode, iteration 1 : 58/79 places, 66/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1567 ms. Remains : 58/79 places, 66/83 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-11
Product exploration explored 100000 steps with 3 reset in 279 ms.
Product exploration explored 100000 steps with 6 reset in 327 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 58 vertex of which 51 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 18 factoid took 442 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 250 ms. (159 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p0), (F (NOT (OR p0 p1))), (F p2), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 18 factoid took 779 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2))]
[2024-05-28 05:10:26] [INFO ] Flow matrix only has 57 transitions (discarded 9 similar events)
[2024-05-28 05:10:26] [INFO ] Invariant cache hit.
Proved EG (AND (NOT p0) (NOT p2))
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p0), (F (NOT (OR p0 p1))), (F p2), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (G (AND (NOT p0) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p2)))
Knowledge based reduction with 18 factoid took 817 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-11 finished in 5281 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)) U G(p1)))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 83/83 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 73 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 68 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 68 transition count 78
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 63 transition count 73
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 63 transition count 73
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 59 transition count 69
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 59 transition count 69
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 57 transition count 67
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 57 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 56 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 56 transition count 66
Applied a total of 40 rules in 4 ms. Remains 56 /79 variables (removed 23) and now considering 66/83 (removed 17) transitions.
[2024-05-28 05:10:26] [INFO ] Flow matrix only has 57 transitions (discarded 9 similar events)
// Phase 1: matrix 57 rows 56 cols
[2024-05-28 05:10:26] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:10:27] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-28 05:10:27] [INFO ] Flow matrix only has 57 transitions (discarded 9 similar events)
[2024-05-28 05:10:27] [INFO ] Invariant cache hit.
[2024-05-28 05:10:27] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-28 05:10:27] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-05-28 05:10:27] [INFO ] Flow matrix only has 57 transitions (discarded 9 similar events)
[2024-05-28 05:10:27] [INFO ] Invariant cache hit.
[2024-05-28 05:10:27] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 2/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 57/113 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 48/105 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 62 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/113 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 105 constraints, problems are : Problem set: 0 solved, 62 unsolved in 745 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 2/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 57/113 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 48/105 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 62/167 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 167 constraints, problems are : Problem set: 0 solved, 62 unsolved in 554 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 1303ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 1304ms
Starting structural reductions in LTL mode, iteration 1 : 56/79 places, 66/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1379 ms. Remains : 56/79 places, 66/83 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-12 finished in 1568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 83/83 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 73 transition count 83
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 67 transition count 77
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 67 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 67 transition count 76
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 62 transition count 71
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 62 transition count 71
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 59 transition count 68
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 59 transition count 68
Applied a total of 35 rules in 5 ms. Remains 59 /79 variables (removed 20) and now considering 68/83 (removed 15) transitions.
[2024-05-28 05:10:28] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
// Phase 1: matrix 59 rows 59 cols
[2024-05-28 05:10:28] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:10:28] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-28 05:10:28] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
[2024-05-28 05:10:28] [INFO ] Invariant cache hit.
[2024-05-28 05:10:28] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-28 05:10:28] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-28 05:10:28] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
[2024-05-28 05:10:28] [INFO ] Invariant cache hit.
[2024-05-28 05:10:28] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 2/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 59/118 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 65 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/118 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 111 constraints, problems are : Problem set: 0 solved, 65 unsolved in 823 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 2/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 59/118 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 65/176 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 176 constraints, problems are : Problem set: 0 solved, 65 unsolved in 595 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 1427ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 1428ms
Starting structural reductions in LTL mode, iteration 1 : 59/79 places, 68/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1512 ms. Remains : 59/79 places, 68/83 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 138 ms.
Product exploration explored 100000 steps with 0 reset in 195 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 122 edges and 59 vertex of which 53 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 85 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 3751 steps (1 resets) in 10 ms. (341 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 05:10:31] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
[2024-05-28 05:10:31] [INFO ] Invariant cache hit.
[2024-05-28 05:10:31] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 05:10:31] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-28 05:10:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 05:10:31] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 05:10:31] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-28 05:10:31] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-28 05:10:31] [INFO ] [Nat]Added 51 Read/Feed constraints in 3 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 9 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-14 finished in 2763 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&&X(X(G(p1)))))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 83/83 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 73 transition count 83
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 67 transition count 77
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 67 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 67 transition count 76
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 62 transition count 71
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 62 transition count 71
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 33 place count 58 transition count 67
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 58 transition count 67
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 56 transition count 65
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 56 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 55 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 55 transition count 64
Applied a total of 43 rules in 8 ms. Remains 55 /79 variables (removed 24) and now considering 64/83 (removed 19) transitions.
[2024-05-28 05:10:31] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
// Phase 1: matrix 55 rows 55 cols
[2024-05-28 05:10:31] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:10:31] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-28 05:10:31] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-28 05:10:31] [INFO ] Invariant cache hit.
[2024-05-28 05:10:31] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-28 05:10:31] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-28 05:10:31] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-28 05:10:31] [INFO ] Invariant cache hit.
[2024-05-28 05:10:31] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 2/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 55/110 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 47/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/110 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 103 constraints, problems are : Problem set: 0 solved, 61 unsolved in 730 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 2/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 55/110 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 47/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 61/164 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 164 constraints, problems are : Problem set: 0 solved, 61 unsolved in 491 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 1227ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 1230ms
Starting structural reductions in LTL mode, iteration 1 : 55/79 places, 64/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1319 ms. Remains : 55/79 places, 64/83 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLCardinality-15 finished in 1489 ms.
All properties solved by simple procedures.
Total runtime 30534 ms.
ITS solved all properties within timeout

BK_STOP 1716873032831

--------------------
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-S064P15"
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-S064P15, 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-171679078600515"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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