Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 14K Apr 12 02:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 12 02:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 02:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 02:50 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 96K 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-S064P06-LTLFireability-00
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLFireability-01
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLFireability-02
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLFireability-03
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLFireability-04
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLFireability-05
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLFireability-06
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLFireability-07
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLFireability-08
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLFireability-09
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLFireability-10
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLFireability-11
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLFireability-12
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLFireability-13
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLFireability-14
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716872578154

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S064P06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:02:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 05:02:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:02:59] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-28 05:02:59] [INFO ] Transformed 97 places.
[2024-05-28 05:02:59] [INFO ] Transformed 164 transitions.
[2024-05-28 05:02:59] [INFO ] Parsed PT model containing 97 places and 164 transitions and 661 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
FORMULA SemanticWebServices-PT-S064P06-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 82/82 transitions.
Ensure Unique test removed 10 places
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 38 transition count 47
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 99 place count 31 transition count 40
Iterating global reduction 1 with 7 rules applied. Total rules applied 106 place count 31 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 107 place count 31 transition count 39
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 27 transition count 35
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 27 transition count 35
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 119 place count 27 transition count 31
Applied a total of 119 rules in 21 ms. Remains 27 /95 variables (removed 68) and now considering 31/82 (removed 51) transitions.
[2024-05-28 05:02:59] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
// Phase 1: matrix 26 rows 27 cols
[2024-05-28 05:02:59] [INFO ] Computed 4 invariants in 6 ms
[2024-05-28 05:02:59] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-28 05:02:59] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
[2024-05-28 05:02:59] [INFO ] Invariant cache hit.
[2024-05-28 05:02:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-28 05:02:59] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 26 sub problems to find dead transitions.
[2024-05-28 05:02:59] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
[2024-05-28 05:02:59] [INFO ] Invariant cache hit.
[2024-05-28 05:02:59] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 25/52 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 47 constraints, problems are : Problem set: 0 solved, 26 unsolved in 309 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 27/27 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 25/52 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 26/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 73 constraints, problems are : Problem set: 0 solved, 26 unsolved in 279 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 27/27 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 620ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 628ms
Starting structural reductions in LTL mode, iteration 1 : 27/95 places, 31/82 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 898 ms. Remains : 27/95 places, 31/82 transitions.
Support contains 11 out of 27 places after structural reductions.
[2024-05-28 05:03:00] [INFO ] Flatten gal took : 16 ms
[2024-05-28 05:03:00] [INFO ] Flatten gal took : 5 ms
[2024-05-28 05:03:00] [INFO ] Input system was already deterministic with 31 transitions.
RANDOM walk for 33346 steps (7 resets) in 992 ms. (33 steps per ms) remains 0/10 properties
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 31/31 transitions.
Graph (complete) has 69 edges and 27 vertex of which 21 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 3 places
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 14 transition count 24
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 14 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 14 transition count 23
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 11 transition count 20
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 11 transition count 20
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 19 place count 11 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 18 edges and 10 vertex of which 9 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 9 transition count 14
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 8 transition count 13
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 8 transition count 13
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 8 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 8 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 28 place count 7 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 29 place count 7 transition count 10
Applied a total of 29 rules in 23 ms. Remains 7 /27 variables (removed 20) and now considering 10/31 (removed 21) transitions.
// Phase 1: matrix 10 rows 7 cols
[2024-05-28 05:03:01] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 05:03:01] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 05:03:01] [INFO ] Invariant cache hit.
[2024-05-28 05:03:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 05:03:01] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-28 05:03:01] [INFO ] Redundant transitions in 17 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-28 05:03:01] [INFO ] Invariant cache hit.
[2024-05-28 05:03:01] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/16 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 43 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/16 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 43 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 92ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 92ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/27 places, 10/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 7/27 places, 10/31 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLFireability-00 finished in 543 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((p0&&(X(p1)||F(!p0))))))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 31/31 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 31
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 23 transition count 29
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 23 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 23 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 22 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 22 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 22 transition count 26
Applied a total of 10 rules in 2 ms. Remains 22 /27 variables (removed 5) and now considering 26/31 (removed 5) transitions.
[2024-05-28 05:03:01] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 22 cols
[2024-05-28 05:03:01] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 05:03:01] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 05:03:01] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
[2024-05-28 05:03:01] [INFO ] Invariant cache hit.
[2024-05-28 05:03:01] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 05:03:01] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 21 sub problems to find dead transitions.
[2024-05-28 05:03:01] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
[2024-05-28 05:03:01] [INFO ] Invariant cache hit.
[2024-05-28 05:03:01] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 2/22 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 22/44 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 21 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/45 variables, and 37 constraints, problems are : Problem set: 0 solved, 21 unsolved in 164 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 2/22 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 22/44 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 21/58 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/44 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/45 variables, and 58 constraints, problems are : Problem set: 0 solved, 21 unsolved in 170 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 341ms
Starting structural reductions in LTL mode, iteration 1 : 22/27 places, 26/31 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 405 ms. Remains : 22/27 places, 26/31 transitions.
Stuttering acceptance computed with spot in 232 ms :[p0, (AND p0 (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLFireability-02
Stuttering criterion allowed to conclude after 15 steps with 3 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLFireability-02 finished in 657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 31/31 transitions.
Graph (complete) has 69 edges and 27 vertex of which 21 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 2 places
Reduce places removed 3 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 14 transition count 23
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 14 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 14 transition count 22
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 11 transition count 19
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 11 transition count 19
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 19 place count 11 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 24 edges and 10 vertex of which 9 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 9 transition count 13
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 8 transition count 12
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 8 transition count 12
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 8 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 8 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 28 place count 7 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 29 place count 7 transition count 9
Applied a total of 29 rules in 8 ms. Remains 7 /27 variables (removed 20) and now considering 9/31 (removed 22) transitions.
// Phase 1: matrix 9 rows 7 cols
[2024-05-28 05:03:02] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:03:02] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 05:03:02] [INFO ] Invariant cache hit.
[2024-05-28 05:03:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-28 05:03:02] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-28 05:03:02] [INFO ] Redundant transitions in 15 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-28 05:03:02] [INFO ] Invariant cache hit.
[2024-05-28 05:03:02] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 6/11 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/13 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/16 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/7 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 6/11 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/13 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/14 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/15 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/15 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/15 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 14 constraints, problems are : Problem set: 0 solved, 3 unsolved in 50 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 7/7 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 92ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 92ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/27 places, 9/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 7/27 places, 9/31 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLFireability-04 finished in 224 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' '!((p0 U (G(p0)||(F(G(p2))&&p1))))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 31/31 transitions.
Graph (complete) has 69 edges and 27 vertex of which 21 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 16 transition count 25
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 16 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 16 transition count 24
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 14 transition count 22
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 14 transition count 22
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 14 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 22 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 12 transition count 16
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 11 transition count 15
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 11 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 11 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 23 place count 11 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 24 place count 10 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 25 place count 10 transition count 12
Applied a total of 25 rules in 15 ms. Remains 10 /27 variables (removed 17) and now considering 12/31 (removed 19) transitions.
// Phase 1: matrix 12 rows 10 cols
[2024-05-28 05:03:02] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:03:02] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 05:03:02] [INFO ] Invariant cache hit.
[2024-05-28 05:03:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-28 05:03:02] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-28 05:03:02] [INFO ] Redundant transitions in 16 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-28 05:03:02] [INFO ] Invariant cache hit.
[2024-05-28 05:03:02] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 3/18 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/19 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2/21 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/21 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/22 variables, and 17 constraints, problems are : Problem set: 0 solved, 7 unsolved in 83 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 3/18 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 2/21 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/21 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/21 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/22 variables, and 24 constraints, problems are : Problem set: 0 solved, 7 unsolved in 72 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 161ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/27 places, 12/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 243 ms. Remains : 10/27 places, 12/31 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLFireability-05
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLFireability-05 finished in 397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 31/31 transitions.
Graph (complete) has 69 edges and 27 vertex of which 21 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 3 places
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 14 transition count 24
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 14 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 14 transition count 23
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 11 transition count 20
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 11 transition count 20
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 19 place count 11 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 18 edges and 10 vertex of which 9 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 9 transition count 14
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 8 transition count 13
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 8 transition count 13
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 8 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 8 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 28 place count 7 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 29 place count 7 transition count 10
Applied a total of 29 rules in 6 ms. Remains 7 /27 variables (removed 20) and now considering 10/31 (removed 21) transitions.
// Phase 1: matrix 10 rows 7 cols
[2024-05-28 05:03:03] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 05:03:03] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 05:03:03] [INFO ] Invariant cache hit.
[2024-05-28 05:03:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 05:03:03] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-28 05:03:03] [INFO ] Redundant transitions in 19 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-28 05:03:03] [INFO ] Invariant cache hit.
[2024-05-28 05:03:03] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/16 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 58 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/16 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 108ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/27 places, 10/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 7/27 places, 10/31 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLFireability-07 finished in 237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))))))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 31/31 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 31
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 22 transition count 29
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 22 transition count 29
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 21 transition count 28
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 21 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 21 transition count 27
Applied a total of 10 rules in 3 ms. Remains 21 /27 variables (removed 6) and now considering 27/31 (removed 4) transitions.
[2024-05-28 05:03:03] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
// Phase 1: matrix 23 rows 21 cols
[2024-05-28 05:03:03] [INFO ] Computed 1 invariants in 2 ms
[2024-05-28 05:03:03] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-28 05:03:03] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2024-05-28 05:03:03] [INFO ] Invariant cache hit.
[2024-05-28 05:03:03] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 05:03:03] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 22 sub problems to find dead transitions.
[2024-05-28 05:03:03] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2024-05-28 05:03:03] [INFO ] Invariant cache hit.
[2024-05-28 05:03:03] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 2/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 22/43 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/44 variables, and 35 constraints, problems are : Problem set: 0 solved, 22 unsolved in 174 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 2/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 22/43 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 22/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/44 variables, and 57 constraints, problems are : Problem set: 0 solved, 22 unsolved in 164 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 342ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 343ms
Starting structural reductions in LTL mode, iteration 1 : 21/27 places, 27/31 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 21/27 places, 27/31 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLFireability-08
Stuttering criterion allowed to conclude after 32 steps with 3 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLFireability-08 finished in 610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 31/31 transitions.
Graph (complete) has 69 edges and 27 vertex of which 21 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 3 places
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 14 transition count 24
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 14 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 14 transition count 23
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 11 transition count 20
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 11 transition count 20
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 19 place count 11 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 18 edges and 10 vertex of which 9 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 9 transition count 14
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 8 transition count 13
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 8 transition count 13
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 8 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 8 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 28 place count 7 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 29 place count 7 transition count 10
Applied a total of 29 rules in 11 ms. Remains 7 /27 variables (removed 20) and now considering 10/31 (removed 21) transitions.
// Phase 1: matrix 10 rows 7 cols
[2024-05-28 05:03:03] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 05:03:03] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 05:03:03] [INFO ] Invariant cache hit.
[2024-05-28 05:03:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 05:03:04] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-28 05:03:04] [INFO ] Redundant transitions in 12 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-28 05:03:04] [INFO ] Invariant cache hit.
[2024-05-28 05:03:04] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/16 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 39 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/16 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 48 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 89ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/27 places, 10/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 7/27 places, 10/31 transitions.
Stuttering acceptance computed with spot in 25 ms :[p0]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLFireability-09 finished in 211 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(!p0)))))'
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 31/31 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 31
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 21 transition count 28
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 21 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 21 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 20 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 20 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 20 transition count 25
Applied a total of 13 rules in 3 ms. Remains 20 /27 variables (removed 7) and now considering 25/31 (removed 6) transitions.
[2024-05-28 05:03:04] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 20 cols
[2024-05-28 05:03:04] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:03:04] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 05:03:04] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2024-05-28 05:03:04] [INFO ] Invariant cache hit.
[2024-05-28 05:03:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-28 05:03:04] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-28 05:03:04] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2024-05-28 05:03:04] [INFO ] Invariant cache hit.
[2024-05-28 05:03:04] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 2/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 21/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/42 variables, and 33 constraints, problems are : Problem set: 0 solved, 20 unsolved in 148 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 2/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 21/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/42 variables, and 53 constraints, problems are : Problem set: 0 solved, 20 unsolved in 139 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 291ms
Starting structural reductions in LTL mode, iteration 1 : 20/27 places, 25/31 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 343 ms. Remains : 20/27 places, 25/31 transitions.
Stuttering acceptance computed with spot in 171 ms :[p0, p0, p0, p0, true, p0]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLFireability-11 finished in 524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(G(F(!p1))||(F(!p1)&&F(p2)))))))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 31/31 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 31
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 23 transition count 30
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 23 transition count 30
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 22 transition count 29
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 22 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 22 transition count 28
Applied a total of 8 rules in 3 ms. Remains 22 /27 variables (removed 5) and now considering 28/31 (removed 3) transitions.
[2024-05-28 05:03:04] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 22 cols
[2024-05-28 05:03:04] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:03:04] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 05:03:04] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2024-05-28 05:03:04] [INFO ] Invariant cache hit.
[2024-05-28 05:03:04] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-28 05:03:04] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 23 sub problems to find dead transitions.
[2024-05-28 05:03:04] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2024-05-28 05:03:04] [INFO ] Invariant cache hit.
[2024-05-28 05:03:04] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 2/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 23/45 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 23 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/46 variables, and 37 constraints, problems are : Problem set: 0 solved, 23 unsolved in 197 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 2/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 23/45 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 23/60 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/45 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/46 variables, and 60 constraints, problems are : Problem set: 0 solved, 23 unsolved in 166 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 370ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 371ms
Starting structural reductions in LTL mode, iteration 1 : 22/27 places, 28/31 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 441 ms. Remains : 22/27 places, 28/31 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLFireability-12 finished in 590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 31/31 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 31
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 22 transition count 28
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 22 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 22 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 21 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 21 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 21 transition count 25
Applied a total of 12 rules in 3 ms. Remains 21 /27 variables (removed 6) and now considering 25/31 (removed 6) transitions.
[2024-05-28 05:03:05] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 21 cols
[2024-05-28 05:03:05] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 05:03:05] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-28 05:03:05] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2024-05-28 05:03:05] [INFO ] Invariant cache hit.
[2024-05-28 05:03:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-28 05:03:05] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-28 05:03:05] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2024-05-28 05:03:05] [INFO ] Invariant cache hit.
[2024-05-28 05:03:05] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/42 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/43 variables, and 35 constraints, problems are : Problem set: 0 solved, 20 unsolved in 141 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 21/21 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/42 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/43 variables, and 55 constraints, problems are : Problem set: 0 solved, 20 unsolved in 128 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 21/21 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 274ms
Starting structural reductions in LTL mode, iteration 1 : 21/27 places, 25/31 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 349 ms. Remains : 21/27 places, 25/31 transitions.
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLFireability-15 finished in 438 ms.
All properties solved by simple procedures.
Total runtime 6442 ms.
ITS solved all properties within timeout

BK_STOP 1716872585757

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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