Execution Chart

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

Trace from the execution

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

--------------------
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-LTLFireability-00
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-01
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-02
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-03
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-04
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-05
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-06
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-07
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-08
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-09
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-10
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-11
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-12
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-13
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-14
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717228415101

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S064P15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:53:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:53:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:53:36] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-06-01 07:53:36] [INFO ] Transformed 118 places.
[2024-06-01 07:53:36] [INFO ] Transformed 194 transitions.
[2024-06-01 07:53:36] [INFO ] Parsed PT model containing 118 places and 194 transitions and 1007 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 2 places in 1 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-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 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 20 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 94 transition count 91
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 90 transition count 87
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 90 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 90 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 88 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 88 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 87 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 87 transition count 83
Applied a total of 37 rules in 29 ms. Remains 87 /116 variables (removed 29) and now considering 83/91 (removed 8) transitions.
[2024-06-01 07:53:36] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
// Phase 1: matrix 74 rows 87 cols
[2024-06-01 07:53:36] [INFO ] Computed 15 invariants in 8 ms
[2024-06-01 07:53:36] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 07:53:36] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2024-06-01 07:53:36] [INFO ] Invariant cache hit.
[2024-06-01 07:53:37] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-01 07:53:37] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-06-01 07:53:37] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2024-06-01 07:53:37] [INFO ] Invariant cache hit.
[2024-06-01 07:53:37] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 2/87 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 74/161 variables, 87/102 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 65/167 constraints. Problems are: Problem set: 0 solved, 79 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 167 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1369 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 87/87 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/85 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 2/87 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 74/161 variables, 87/102 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 65/167 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 79/246 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/161 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 246 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1099 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 87/87 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
After SMT, in 2502ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 2515ms
Starting structural reductions in LTL mode, iteration 1 : 87/116 places, 83/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2853 ms. Remains : 87/116 places, 83/91 transitions.
Support contains 46 out of 87 places after structural reductions.
[2024-06-01 07:53:39] [INFO ] Flatten gal took : 23 ms
[2024-06-01 07:53:39] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:53:39] [INFO ] Input system was already deterministic with 83 transitions.
Support contains 40 out of 87 places (down from 46) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 28 to 26
RANDOM walk for 40000 steps (8 resets) in 1921 ms. (20 steps per ms) remains 2/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
[2024-06-01 07:53:40] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2024-06-01 07:53:40] [INFO ] Invariant cache hit.
[2024-06-01 07:53:40] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/20 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/26 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/28 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/28 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 48/161 variables, and 33 constraints, problems are : Problem set: 1 solved, 0 unsolved in 39 ms.
Refiners :[Generalized P Invariants (flows): 2/15 constraints, State Equation: 14/87 constraints, ReadFeed: 17/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 46ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 224 edges and 87 vertex of which 81 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F(p1))||p0)))))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 83/83 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 74 transition count 83
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 70 transition count 79
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 70 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 66 transition count 75
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 66 transition count 75
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 62 transition count 71
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 62 transition count 71
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 58 transition count 67
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 58 transition count 67
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 55 transition count 64
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 55 transition count 64
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 52 transition count 61
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 52 transition count 61
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 52 transition count 58
Applied a total of 60 rules in 14 ms. Remains 52 /87 variables (removed 35) and now considering 58/83 (removed 25) transitions.
[2024-06-01 07:53:40] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 52 cols
[2024-06-01 07:53:40] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:53:40] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 07:53:40] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-06-01 07:53:40] [INFO ] Invariant cache hit.
[2024-06-01 07:53:41] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 07:53:41] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 07:53:41] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2024-06-01 07:53:41] [INFO ] Invariant cache hit.
[2024-06-01 07:53:41] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 2/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 52/104 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 43/97 constraints. Problems are: Problem set: 0 solved, 54 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 97 constraints, problems are : Problem set: 0 solved, 54 unsolved in 556 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 2/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 52/104 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 43/97 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 54/151 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 151 constraints, problems are : Problem set: 0 solved, 54 unsolved in 509 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 1092ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 1093ms
Starting structural reductions in LTL mode, iteration 1 : 52/87 places, 58/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1179 ms. Remains : 52/87 places, 58/83 transitions.
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p0) (NOT p1)), (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-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 194 ms.
Product exploration explored 100000 steps with 33333 reset in 114 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 110 edges and 52 vertex of which 46 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-00 finished in 1876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((p1 U p0))))))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 83/83 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 73 transition count 83
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 69 transition count 79
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 69 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 65 transition count 75
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 65 transition count 75
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 62 transition count 72
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 60 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 59 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 59 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 58 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 58 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 58 transition count 67
Applied a total of 45 rules in 13 ms. Remains 58 /87 variables (removed 29) and now considering 67/83 (removed 16) transitions.
[2024-06-01 07:53:42] [INFO ] Flow matrix only has 59 transitions (discarded 8 similar events)
// Phase 1: matrix 59 rows 58 cols
[2024-06-01 07:53:42] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:53:42] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 07:53:42] [INFO ] Flow matrix only has 59 transitions (discarded 8 similar events)
[2024-06-01 07:53:42] [INFO ] Invariant cache hit.
[2024-06-01 07:53:42] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 07:53:42] [INFO ] Implicit Places using invariants and state equation in 47 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-06-01 07:53:42] [INFO ] Flow matrix only has 59 transitions (discarded 8 similar events)
[2024-06-01 07:53:42] [INFO ] Invariant cache hit.
[2024-06-01 07:53:42] [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, 63 unsolved
At refinement iteration 1 (OVERLAPS) 2/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 59/117 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 50/109 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 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/117 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 109 constraints, problems are : Problem set: 0 solved, 63 unsolved in 776 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 50/50 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/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 2/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 59/117 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 50/109 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 63/172 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 172 constraints, problems are : Problem set: 0 solved, 63 unsolved in 561 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 1347ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 1348ms
Starting structural reductions in LTL mode, iteration 1 : 58/87 places, 67/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1447 ms. Remains : 58/87 places, 67/83 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 154 ms.
Product exploration explored 100000 steps with 0 reset in 303 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 121 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 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 17148 steps (4 resets) in 80 ms. (211 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:53:45] [INFO ] Flow matrix only has 59 transitions (discarded 8 similar events)
[2024-06-01 07:53:45] [INFO ] Invariant cache hit.
[2024-06-01 07:53:45] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 07:53:45] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 07:53:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:53:45] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 07:53:45] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 07:53:45] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 07:53:45] [INFO ] [Nat]Added 50 Read/Feed constraints in 4 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-01 finished in 2965 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((p1&&G(p2)))&&p0)))'
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 83/83 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 74 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 69 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 69 transition count 78
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 65 transition count 74
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 65 transition count 74
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 62 transition count 71
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 62 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 60 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 60 transition count 69
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 58 transition count 67
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 58 transition count 67
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 56 transition count 65
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 56 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 56 transition count 63
Applied a total of 51 rules in 14 ms. Remains 56 /87 variables (removed 31) and now considering 63/83 (removed 20) transitions.
[2024-06-01 07:53:45] [INFO ] Flow matrix only has 56 transitions (discarded 7 similar events)
// Phase 1: matrix 56 rows 56 cols
[2024-06-01 07:53:45] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:53:45] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 07:53:45] [INFO ] Flow matrix only has 56 transitions (discarded 7 similar events)
[2024-06-01 07:53:45] [INFO ] Invariant cache hit.
[2024-06-01 07:53:45] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 07:53:45] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-06-01 07:53:45] [INFO ] Flow matrix only has 56 transitions (discarded 7 similar events)
[2024-06-01 07:53:45] [INFO ] Invariant cache hit.
[2024-06-01 07:53:45] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 56/112 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 47/105 constraints. Problems are: Problem set: 0 solved, 59 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/112 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 105 constraints, problems are : Problem set: 0 solved, 59 unsolved in 592 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 56/112 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 47/105 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 59/164 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 164 constraints, problems are : Problem set: 0 solved, 59 unsolved in 549 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 1149ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 1150ms
Starting structural reductions in LTL mode, iteration 1 : 56/87 places, 63/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1250 ms. Remains : 56/87 places, 63/83 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 101 ms.
Product exploration explored 100000 steps with 0 reset in 235 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 119 edges and 56 vertex of which 50 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Detected a total of 8/56 stabilizing places and 9/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT p0)), (X (NOT (AND p1 p2))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 370 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (8 resets) in 403 ms. (99 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
[2024-06-01 07:53:48] [INFO ] Flow matrix only has 56 transitions (discarded 7 similar events)
[2024-06-01 07:53:48] [INFO ] Invariant cache hit.
[2024-06-01 07:53:48] [INFO ] State equation strengthened by 47 read => feed constraints.
Problem apf2 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 4/112 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 29 ms.
Refiners :[Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/56 constraints, ReadFeed: 0/47 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT p0)), (X (NOT (AND p1 p2))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (G (OR p2 (NOT p0))), (G (AND (OR p1 (NOT p0)) (OR p2 (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F p0), (F p1)]
Knowledge based reduction with 16 factoid took 608 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
[2024-06-01 07:53:49] [INFO ] Flow matrix only has 56 transitions (discarded 7 similar events)
[2024-06-01 07:53:49] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
[2024-06-01 07:53:49] [INFO ] Flow matrix only has 56 transitions (discarded 7 similar events)
[2024-06-01 07:53:49] [INFO ] Invariant cache hit.
[2024-06-01 07:53:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 07:53:49] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 07:53:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:53:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 07:53:49] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 07:53:49] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 07:53:49] [INFO ] [Nat]Added 47 Read/Feed constraints in 3 ms returned sat
[2024-06-01 07:53:49] [INFO ] Computed and/alt/rep : 59/72/52 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 07:53:49] [INFO ] Added : 0 causal constraints over 0 iterations in 24 ms. Result :sat
Could not prove EG (NOT p1)
[2024-06-01 07:53:49] [INFO ] Flow matrix only has 56 transitions (discarded 7 similar events)
[2024-06-01 07:53:49] [INFO ] Invariant cache hit.
[2024-06-01 07:53:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2024-06-01 07:53:49] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 07:53:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:53:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2024-06-01 07:53:49] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 07:53:49] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 07:53:49] [INFO ] [Nat]Added 47 Read/Feed constraints in 18 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT p0)), (X (NOT (AND p1 p2))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (G (OR p2 (NOT p0))), (G (AND (OR p1 (NOT p0)) (OR p2 (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F p0), (F p1), (G (NOT p0)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 16 factoid took 702 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-02 finished in 4622 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 U (p1||F(!p2))) U X(p1))))'
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 83/83 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 74 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 69 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 69 transition count 78
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 65 transition count 74
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 65 transition count 74
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 61 transition count 70
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 61 transition count 70
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 58 transition count 67
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 58 transition count 67
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 56 transition count 65
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 56 transition count 65
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 54 transition count 63
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 54 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 54 transition count 61
Applied a total of 55 rules in 11 ms. Remains 54 /87 variables (removed 33) and now considering 61/83 (removed 22) transitions.
[2024-06-01 07:53:50] [INFO ] Flow matrix only has 54 transitions (discarded 7 similar events)
// Phase 1: matrix 54 rows 54 cols
[2024-06-01 07:53:50] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:53:50] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 07:53:50] [INFO ] Flow matrix only has 54 transitions (discarded 7 similar events)
[2024-06-01 07:53:50] [INFO ] Invariant cache hit.
[2024-06-01 07:53:50] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 07:53:50] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-06-01 07:53:50] [INFO ] Flow matrix only has 54 transitions (discarded 7 similar events)
[2024-06-01 07:53:50] [INFO ] Invariant cache hit.
[2024-06-01 07:53:50] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 54/108 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 45/101 constraints. Problems are: Problem set: 0 solved, 57 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 101 constraints, problems are : Problem set: 0 solved, 57 unsolved in 602 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 54/108 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 45/101 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 57/158 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 158 constraints, problems are : Problem set: 0 solved, 57 unsolved in 511 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 1124ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 1124ms
Starting structural reductions in LTL mode, iteration 1 : 54/87 places, 61/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1218 ms. Remains : 54/87 places, 61/83 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (AND (NOT p1) p2 (NOT p0)), p2]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-05
Product exploration explored 100000 steps with 1 reset in 93 ms.
Product exploration explored 100000 steps with 2 reset in 236 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 115 edges and 54 vertex of which 48 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Detected a total of 8/54 stabilizing places and 9/61 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 425 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (AND (NOT p0) p2 (NOT p1)), p2]
RANDOM walk for 40000 steps (9 resets) in 153 ms. (259 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
[2024-06-01 07:53:52] [INFO ] Flow matrix only has 54 transitions (discarded 7 similar events)
[2024-06-01 07:53:52] [INFO ] Invariant cache hit.
[2024-06-01 07:53:52] [INFO ] State equation strengthened by 45 read => feed constraints.
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Real declared 4/108 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 14 ms.
Refiners :[Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/54 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 17ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p2) p1)), (G (OR p0 (NOT p2) p1)), (G (OR (NOT p0) (NOT p2) p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F p1), (F p2)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 727 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
[2024-06-01 07:53:53] [INFO ] Flow matrix only has 54 transitions (discarded 7 similar events)
[2024-06-01 07:53:53] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p2) p1)), (G (OR p0 (NOT p2) p1)), (G (OR (NOT p0) (NOT p2) p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F p1), (F p2), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 14 factoid took 612 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-05 finished in 4111 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)||G(p1)))'
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 83/83 transitions.
Graph (complete) has 224 edges and 87 vertex of which 81 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 13 places
Reduce places removed 14 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 61 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 61 transition count 73
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 54 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 54 transition count 66
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 34 place count 47 transition count 59
Iterating global reduction 0 with 7 rules applied. Total rules applied 41 place count 47 transition count 59
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 47 place count 41 transition count 53
Iterating global reduction 0 with 6 rules applied. Total rules applied 53 place count 41 transition count 53
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 58 place count 36 transition count 48
Iterating global reduction 0 with 5 rules applied. Total rules applied 63 place count 36 transition count 48
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 67 place count 32 transition count 44
Iterating global reduction 0 with 4 rules applied. Total rules applied 71 place count 32 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 75 place count 32 transition count 40
Applied a total of 75 rules in 22 ms. Remains 32 /87 variables (removed 55) and now considering 40/83 (removed 43) transitions.
[2024-06-01 07:53:54] [INFO ] Flow matrix only has 34 transitions (discarded 6 similar events)
// Phase 1: matrix 34 rows 32 cols
[2024-06-01 07:53:54] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:53:54] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 07:53:54] [INFO ] Flow matrix only has 34 transitions (discarded 6 similar events)
[2024-06-01 07:53:54] [INFO ] Invariant cache hit.
[2024-06-01 07:53:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 07:53:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-06-01 07:53:54] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
[2024-06-01 07:53:54] [INFO ] Flow matrix only has 34 transitions (discarded 6 similar events)
[2024-06-01 07:53:54] [INFO ] Invariant cache hit.
[2024-06-01 07:53:54] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 32/62 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 21/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 1/63 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 1/64 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/64 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/66 variables, and 54 constraints, problems are : Problem set: 0 solved, 29 unsolved in 320 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/32 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 32/62 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 21/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 22/74 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 1/63 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 1/64 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 1/65 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 1/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (OVERLAPS) 0/66 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 84 constraints, problems are : Problem set: 0 solved, 29 unsolved in 329 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 652ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 653ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/87 places, 40/83 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 735 ms. Remains : 32/87 places, 40/83 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-06
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-06 finished in 849 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 U X(p1)))||(p2 U p3)))'
Support contains 7 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 83/83 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 74 transition count 83
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 70 transition count 79
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 70 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 66 transition count 75
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 66 transition count 75
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 62 transition count 71
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 62 transition count 71
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 59 transition count 68
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 59 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 58 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 58 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 57 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 57 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 57 transition count 65
Applied a total of 48 rules in 10 ms. Remains 57 /87 variables (removed 30) and now considering 65/83 (removed 18) transitions.
[2024-06-01 07:53:55] [INFO ] Flow matrix only has 57 transitions (discarded 8 similar events)
// Phase 1: matrix 57 rows 57 cols
[2024-06-01 07:53:55] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:53:55] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 07:53:55] [INFO ] Flow matrix only has 57 transitions (discarded 8 similar events)
[2024-06-01 07:53:55] [INFO ] Invariant cache hit.
[2024-06-01 07:53:55] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 07:53:55] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-06-01 07:53:55] [INFO ] Flow matrix only has 57 transitions (discarded 8 similar events)
[2024-06-01 07:53:55] [INFO ] Invariant cache hit.
[2024-06-01 07:53:55] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 2/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 57/114 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 48/107 constraints. Problems are: Problem set: 0 solved, 61 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 107 constraints, problems are : Problem set: 0 solved, 61 unsolved in 584 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 48/48 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/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 2/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 57/114 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 48/107 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 61/168 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 168 constraints, problems are : Problem set: 0 solved, 61 unsolved in 546 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 1140ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 1140ms
Starting structural reductions in LTL mode, iteration 1 : 57/87 places, 65/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1224 ms. Remains : 57/87 places, 65/83 transitions.
Stuttering acceptance computed with spot in 320 ms :[true, (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-07 finished in 1563 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||F(p1))))'
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 83/83 transitions.
Graph (complete) has 224 edges and 87 vertex of which 81 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 13 places
Reduce places removed 14 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 61 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 61 transition count 73
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 54 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 54 transition count 66
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 34 place count 47 transition count 59
Iterating global reduction 0 with 7 rules applied. Total rules applied 41 place count 47 transition count 59
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 48 place count 40 transition count 52
Iterating global reduction 0 with 7 rules applied. Total rules applied 55 place count 40 transition count 52
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 60 place count 35 transition count 47
Iterating global reduction 0 with 5 rules applied. Total rules applied 65 place count 35 transition count 47
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 69 place count 31 transition count 43
Iterating global reduction 0 with 4 rules applied. Total rules applied 73 place count 31 transition count 43
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 77 place count 31 transition count 39
Applied a total of 77 rules in 13 ms. Remains 31 /87 variables (removed 56) and now considering 39/83 (removed 44) transitions.
[2024-06-01 07:53:56] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
// Phase 1: matrix 33 rows 31 cols
[2024-06-01 07:53:56] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:53:56] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 07:53:56] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
[2024-06-01 07:53:56] [INFO ] Invariant cache hit.
[2024-06-01 07:53:56] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 07:53:56] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-06-01 07:53:56] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2024-06-01 07:53:56] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
[2024-06-01 07:53:56] [INFO ] Invariant cache hit.
[2024-06-01 07:53:56] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 31/60 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/61 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 1/62 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/64 variables, and 52 constraints, problems are : Problem set: 0 solved, 28 unsolved in 288 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/31 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 31/60 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 1/61 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 1/62 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 1/63 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/63 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 1/64 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/64 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 0/64 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 81 constraints, problems are : Problem set: 0 solved, 28 unsolved in 355 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 650ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 651ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/87 places, 39/83 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 721 ms. Remains : 31/87 places, 39/83 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-08
Stuttering criterion allowed to conclude after 50 steps with 2 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-08 finished in 811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(X(G(p0))))) U (X(X(X(X(G(p0)))))&&p1))))'
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 83/83 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 74 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 69 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 69 transition count 78
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 64 transition count 73
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 64 transition count 73
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 59 transition count 68
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 59 transition count 68
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 55 transition count 64
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 55 transition count 64
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 52 transition count 61
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 52 transition count 61
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 50 transition count 59
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 50 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 50 transition count 57
Applied a total of 63 rules in 7 ms. Remains 50 /87 variables (removed 37) and now considering 57/83 (removed 26) transitions.
[2024-06-01 07:53:57] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
// Phase 1: matrix 50 rows 50 cols
[2024-06-01 07:53:57] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:53:57] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 07:53:57] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
[2024-06-01 07:53:57] [INFO ] Invariant cache hit.
[2024-06-01 07:53:57] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 07:53:57] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 53 sub problems to find dead transitions.
[2024-06-01 07:53:57] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
[2024-06-01 07:53:57] [INFO ] Invariant cache hit.
[2024-06-01 07:53:57] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 2/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 50/100 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 41/93 constraints. Problems are: Problem set: 0 solved, 53 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 93 constraints, problems are : Problem set: 0 solved, 53 unsolved in 493 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 2/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 50/100 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 41/93 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 53/146 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 146 constraints, problems are : Problem set: 0 solved, 53 unsolved in 440 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 939ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 939ms
Starting structural reductions in LTL mode, iteration 1 : 50/87 places, 57/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1025 ms. Remains : 50/87 places, 57/83 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-09
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-09 finished in 1322 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((G(p2)||p1))))'
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 83/83 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 74 transition count 83
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 70 transition count 79
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 70 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 66 transition count 75
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 66 transition count 75
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 62 transition count 71
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 62 transition count 71
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 59 transition count 68
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 59 transition count 68
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 57 transition count 66
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 57 transition count 66
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 55 transition count 64
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 55 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 55 transition count 62
Applied a total of 53 rules in 6 ms. Remains 55 /87 variables (removed 32) and now considering 62/83 (removed 21) transitions.
[2024-06-01 07:53:59] [INFO ] Flow matrix only has 55 transitions (discarded 7 similar events)
// Phase 1: matrix 55 rows 55 cols
[2024-06-01 07:53:59] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:53:59] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 07:53:59] [INFO ] Flow matrix only has 55 transitions (discarded 7 similar events)
[2024-06-01 07:53:59] [INFO ] Invariant cache hit.
[2024-06-01 07:53:59] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 07:53:59] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-06-01 07:53:59] [INFO ] Flow matrix only has 55 transitions (discarded 7 similar events)
[2024-06-01 07:53:59] [INFO ] Invariant cache hit.
[2024-06-01 07:53:59] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 55/110 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 46/103 constraints. Problems are: Problem set: 0 solved, 58 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 103 constraints, problems are : Problem set: 0 solved, 58 unsolved in 600 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 55/110 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 46/103 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 58/161 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 161 constraints, problems are : Problem set: 0 solved, 58 unsolved in 529 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 1136ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 1136ms
Starting structural reductions in LTL mode, iteration 1 : 55/87 places, 62/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1223 ms. Remains : 55/87 places, 62/83 transitions.
Stuttering acceptance computed with spot in 242 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Product exploration explored 100000 steps with 50000 reset in 74 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 117 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 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 20 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-12 finished in 1657 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 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 83/83 transitions.
Graph (complete) has 224 edges and 87 vertex of which 81 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 13 places
Reduce places removed 14 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 61 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 61 transition count 73
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 54 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 54 transition count 66
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 34 place count 47 transition count 59
Iterating global reduction 0 with 7 rules applied. Total rules applied 41 place count 47 transition count 59
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 47 place count 41 transition count 53
Iterating global reduction 0 with 6 rules applied. Total rules applied 53 place count 41 transition count 53
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 58 place count 36 transition count 48
Iterating global reduction 0 with 5 rules applied. Total rules applied 63 place count 36 transition count 48
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 67 place count 32 transition count 44
Iterating global reduction 0 with 4 rules applied. Total rules applied 71 place count 32 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 75 place count 32 transition count 40
Applied a total of 75 rules in 14 ms. Remains 32 /87 variables (removed 55) and now considering 40/83 (removed 43) transitions.
[2024-06-01 07:54:00] [INFO ] Flow matrix only has 34 transitions (discarded 6 similar events)
// Phase 1: matrix 34 rows 32 cols
[2024-06-01 07:54:00] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:54:00] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 07:54:00] [INFO ] Flow matrix only has 34 transitions (discarded 6 similar events)
[2024-06-01 07:54:00] [INFO ] Invariant cache hit.
[2024-06-01 07:54:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 07:54:00] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-06-01 07:54:00] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
[2024-06-01 07:54:00] [INFO ] Flow matrix only has 34 transitions (discarded 6 similar events)
[2024-06-01 07:54:00] [INFO ] Invariant cache hit.
[2024-06-01 07:54:00] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 32/62 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 21/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 1/63 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 1/64 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/64 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/66 variables, and 54 constraints, problems are : Problem set: 0 solved, 29 unsolved in 311 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/32 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 32/62 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 21/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 22/74 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 1/63 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 1/64 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 1/65 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 1/66 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (OVERLAPS) 0/66 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 84 constraints, problems are : Problem set: 0 solved, 29 unsolved in 362 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 677ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 677ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/87 places, 40/83 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 759 ms. Remains : 32/87 places, 40/83 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-13
Stuttering criterion allowed to conclude after 30 steps with 1 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-13 finished in 813 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 U X(G((!p0 U X(p1)))))))'
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 83/83 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 83
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 71 transition count 79
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 71 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 67 transition count 75
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 67 transition count 75
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 63 transition count 71
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 63 transition count 71
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 60 transition count 68
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 60 transition count 68
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 58 transition count 66
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 58 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 57 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 57 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 57 transition count 64
Applied a total of 49 rules in 10 ms. Remains 57 /87 variables (removed 30) and now considering 64/83 (removed 19) transitions.
[2024-06-01 07:54:01] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
// Phase 1: matrix 56 rows 57 cols
[2024-06-01 07:54:01] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 07:54:01] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 07:54:01] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
[2024-06-01 07:54:01] [INFO ] Invariant cache hit.
[2024-06-01 07:54:01] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 07:54:01] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-06-01 07:54:01] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
[2024-06-01 07:54:01] [INFO ] Invariant cache hit.
[2024-06-01 07:54:01] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 2/57 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 56/113 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 47/107 constraints. Problems are: Problem set: 0 solved, 60 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 107 constraints, problems are : Problem set: 0 solved, 60 unsolved in 604 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 57/57 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 2/57 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 56/113 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 47/107 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/113 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 167 constraints, problems are : Problem set: 0 solved, 60 unsolved in 562 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 57/57 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 1173ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1173ms
Starting structural reductions in LTL mode, iteration 1 : 57/87 places, 64/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1265 ms. Remains : 57/87 places, 64/83 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-14
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-14 finished in 1541 ms.
All properties solved by simple procedures.
Total runtime 26704 ms.
ITS solved all properties within timeout

BK_STOP 1717228443177

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is SemanticWebServices-PT-S064P15, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r524-tall-171679080500516"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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