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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K 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 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 02:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 02:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 02:44 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 102K 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-S064P09-LTLFireability-00
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLFireability-01
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLFireability-02
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLFireability-03
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLFireability-04
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLFireability-05
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLFireability-06
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLFireability-07
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLFireability-08
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLFireability-09
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLFireability-10
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLFireability-11
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLFireability-12
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLFireability-13
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLFireability-14
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716872722171

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-S064P09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:05:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 05:05:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:05:23] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-28 05:05:23] [INFO ] Transformed 100 places.
[2024-05-28 05:05:23] [INFO ] Transformed 164 transitions.
[2024-05-28 05:05:23] [INFO ] Parsed PT model containing 100 places and 164 transitions and 719 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SemanticWebServices-PT-S064P09-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 82/82 transitions.
Ensure Unique test removed 17 places
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 50 transition count 59
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 77 place count 44 transition count 53
Iterating global reduction 1 with 6 rules applied. Total rules applied 83 place count 44 transition count 53
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 88 place count 39 transition count 48
Iterating global reduction 1 with 5 rules applied. Total rules applied 93 place count 39 transition count 48
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 36 transition count 45
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 36 transition count 45
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 102 place count 36 transition count 42
Applied a total of 102 rules in 23 ms. Remains 36 /98 variables (removed 62) and now considering 42/82 (removed 40) transitions.
[2024-05-28 05:05:23] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
// Phase 1: matrix 36 rows 36 cols
[2024-05-28 05:05:23] [INFO ] Computed 4 invariants in 5 ms
[2024-05-28 05:05:23] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-28 05:05:23] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
[2024-05-28 05:05:23] [INFO ] Invariant cache hit.
[2024-05-28 05:05:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 05:05:23] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 36 sub problems to find dead transitions.
[2024-05-28 05:05:23] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
[2024-05-28 05:05:23] [INFO ] Invariant cache hit.
[2024-05-28 05:05:23] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 2/36 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 35/71 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 25/65 constraints. Problems are: Problem set: 0 solved, 36 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/71 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/72 variables, and 65 constraints, problems are : Problem set: 0 solved, 36 unsolved in 578 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 36/36 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 2/36 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 35/71 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 25/65 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 36/101 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/71 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/72 variables, and 101 constraints, problems are : Problem set: 0 solved, 36 unsolved in 347 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 36/36 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 956ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 969ms
Starting structural reductions in LTL mode, iteration 1 : 36/98 places, 42/82 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1312 ms. Remains : 36/98 places, 42/82 transitions.
Support contains 16 out of 36 places after structural reductions.
[2024-05-28 05:05:25] [INFO ] Flatten gal took : 17 ms
[2024-05-28 05:05:25] [INFO ] Flatten gal took : 5 ms
[2024-05-28 05:05:25] [INFO ] Input system was already deterministic with 42 transitions.
Reduction of identical properties reduced properties to check from 14 to 12
RANDOM walk for 40000 steps (8 resets) in 1135 ms. (35 steps per ms) remains 0/12 properties
FORMULA SemanticWebServices-PT-S064P09-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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)&&F(G(p1)))))'
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 42/42 transitions.
Graph (complete) has 86 edges and 36 vertex of which 30 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
Reduce places removed 4 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 21 transition count 33
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 21 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 21 transition count 32
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 17 transition count 28
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 17 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 21 place count 17 transition count 27
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 14 transition count 24
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 14 transition count 24
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 14 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 14 transition count 19
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 27 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 34 place count 12 transition count 18
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 35 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 36 place count 11 transition count 17
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 37 place count 10 transition count 16
Iterating global reduction 5 with 1 rules applied. Total rules applied 38 place count 10 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 39 place count 10 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 40 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 41 place count 9 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 42 place count 9 transition count 13
Applied a total of 42 rules in 17 ms. Remains 9 /36 variables (removed 27) and now considering 13/42 (removed 29) transitions.
// Phase 1: matrix 13 rows 9 cols
[2024-05-28 05:05:25] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 05:05:25] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 05:05:25] [INFO ] Invariant cache hit.
[2024-05-28 05:05:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-28 05:05:25] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-28 05:05:25] [INFO ] Redundant transitions in 15 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-28 05:05:25] [INFO ] Invariant cache hit.
[2024-05-28 05:05:25] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/19 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/22 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 65 ms.
Refiners :[State Equation: 8/9 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/19 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/20 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/21 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/22 variables, and 21 constraints, problems are : Problem set: 0 solved, 6 unsolved in 88 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 158ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 158ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/36 places, 13/42 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 9/36 places, 13/42 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 171 ms.
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 5 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLFireability-02 finished in 707 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 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 42/42 transitions.
Graph (complete) has 86 edges and 36 vertex of which 30 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
Reduce places removed 4 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 20 transition count 32
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 20 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 15 place count 20 transition count 30
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 16 transition count 26
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 16 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 16 transition count 25
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 13 transition count 22
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 13 transition count 22
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 33 place count 13 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 12 transition count 17
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 37 place count 12 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 38 place count 11 transition count 16
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 39 place count 10 transition count 15
Iterating global reduction 5 with 1 rules applied. Total rules applied 40 place count 10 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 41 place count 10 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 42 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 43 place count 9 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 44 place count 9 transition count 12
Applied a total of 44 rules in 11 ms. Remains 9 /36 variables (removed 27) and now considering 12/42 (removed 30) transitions.
// Phase 1: matrix 12 rows 9 cols
[2024-05-28 05:05:26] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 05:05:26] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-28 05:05:26] [INFO ] Invariant cache hit.
[2024-05-28 05:05:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-28 05:05:26] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-28 05:05:26] [INFO ] Redundant transitions in 13 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-28 05:05:26] [INFO ] Invariant cache hit.
[2024-05-28 05:05:26] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/18 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/21 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[State Equation: 8/9 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/18 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/20 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/21 variables, and 20 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/36 places, 12/42 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 9/36 places, 12/42 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLFireability-04 finished in 243 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 1 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 42/42 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 33 transition count 42
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 29 transition count 38
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 29 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 29 transition count 37
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 26 transition count 34
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 26 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 26 transition count 33
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 21 place count 24 transition count 31
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 24 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 25 place count 24 transition count 29
Applied a total of 25 rules in 5 ms. Remains 24 /36 variables (removed 12) and now considering 29/42 (removed 13) transitions.
[2024-05-28 05:05:26] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
// Phase 1: matrix 26 rows 24 cols
[2024-05-28 05:05:26] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:05:26] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-28 05:05:26] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
[2024-05-28 05:05:26] [INFO ] Invariant cache hit.
[2024-05-28 05:05:26] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-28 05:05:26] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 24 sub problems to find dead transitions.
[2024-05-28 05:05:26] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
[2024-05-28 05:05:26] [INFO ] Invariant cache hit.
[2024-05-28 05:05:26] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 2/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 25/49 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/49 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/50 variables, and 41 constraints, problems are : Problem set: 0 solved, 24 unsolved in 232 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 2/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 25/49 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 24/65 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/49 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/50 variables, and 65 constraints, problems are : Problem set: 0 solved, 24 unsolved in 191 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 435ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 437ms
Starting structural reductions in LTL mode, iteration 1 : 24/36 places, 29/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 24/36 places, 29/42 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P09-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P09-LTLFireability-06 finished in 817 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||F(p1)))))'
Support contains 4 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 42/42 transitions.
Graph (complete) has 86 edges and 36 vertex of which 30 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
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 23 transition count 34
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 23 transition count 34
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 23 transition count 33
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 20 transition count 30
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 20 transition count 30
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 18 transition count 28
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 18 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 18 transition count 26
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 24 place count 18 transition count 24
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 39 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 16 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 16 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 15 transition count 21
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 30 place count 14 transition count 20
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 14 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 32 place count 14 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 35 place count 14 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 36 place count 13 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 37 place count 13 transition count 15
Applied a total of 37 rules in 7 ms. Remains 13 /36 variables (removed 23) and now considering 15/42 (removed 27) transitions.
// Phase 1: matrix 15 rows 13 cols
[2024-05-28 05:05:27] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:05:27] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 05:05:27] [INFO ] Invariant cache hit.
[2024-05-28 05:05:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-28 05:05:27] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-28 05:05:27] [INFO ] Redundant transitions in 14 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-28 05:05:27] [INFO ] Invariant cache hit.
[2024-05-28 05:05:27] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/19 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/20 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/28 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Generalized P Invariants (flows): 0/1 constraints, State Equation: 9/13 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/18 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/20 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/20 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/21 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/22 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/28 variables, and 22 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Generalized P Invariants (flows): 0/1 constraints, State Equation: 10/13 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 123ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/36 places, 15/42 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 13/36 places, 15/42 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLFireability-07 finished in 286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p0&&G(p1)))&&(G(p3)||p2)))))'
Support contains 7 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 42/42 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 35 transition count 42
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 31 transition count 38
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 31 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 31 transition count 36
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 29 transition count 34
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 29 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 29 transition count 33
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 28 transition count 32
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 28 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 28 transition count 31
Applied a total of 19 rules in 8 ms. Remains 28 /36 variables (removed 8) and now considering 31/42 (removed 11) transitions.
[2024-05-28 05:05:27] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
// Phase 1: matrix 28 rows 28 cols
[2024-05-28 05:05:27] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 05:05:27] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-28 05:05:27] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
[2024-05-28 05:05:27] [INFO ] Invariant cache hit.
[2024-05-28 05:05:27] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-28 05:05:27] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 26 sub problems to find dead transitions.
[2024-05-28 05:05:27] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
[2024-05-28 05:05:27] [INFO ] Invariant cache hit.
[2024-05-28 05:05:27] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 27/55 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/56 variables, and 49 constraints, problems are : Problem set: 0 solved, 26 unsolved in 207 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 27/55 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 26/75 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/56 variables, and 75 constraints, problems are : Problem set: 0 solved, 26 unsolved in 228 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 441ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 442ms
Starting structural reductions in LTL mode, iteration 1 : 28/36 places, 31/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 524 ms. Remains : 28/36 places, 31/42 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLFireability-08
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLFireability-08 finished in 896 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((p0||X(F(p1))))))))'
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 42/42 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 34 transition count 42
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 31 transition count 39
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 31 transition count 39
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 31 transition count 37
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 30 transition count 36
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 30 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 29 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 29 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 29 transition count 34
Applied a total of 15 rules in 6 ms. Remains 29 /36 variables (removed 7) and now considering 34/42 (removed 8) transitions.
[2024-05-28 05:05:28] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
// Phase 1: matrix 30 rows 29 cols
[2024-05-28 05:05:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 05:05:28] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 05:05:28] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
[2024-05-28 05:05:28] [INFO ] Invariant cache hit.
[2024-05-28 05:05:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-28 05:05:28] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2024-05-28 05:05:28] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
[2024-05-28 05:05:28] [INFO ] Invariant cache hit.
[2024-05-28 05:05:28] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 29/58 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 29 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/58 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/59 variables, and 51 constraints, problems are : Problem set: 0 solved, 29 unsolved in 227 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 20/20 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/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 29/58 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 29/80 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 0/58 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/59 variables, and 80 constraints, problems are : Problem set: 0 solved, 29 unsolved in 206 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 439ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 440ms
Starting structural reductions in LTL mode, iteration 1 : 29/36 places, 34/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 29/36 places, 34/42 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLFireability-09
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLFireability-09 finished in 656 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))'
Support contains 1 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 42/42 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 33 transition count 42
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 29 transition count 38
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 29 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 29 transition count 36
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 27 transition count 34
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 27 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 27 transition count 33
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 26 transition count 32
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 26 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 21 place count 26 transition count 31
Applied a total of 21 rules in 7 ms. Remains 26 /36 variables (removed 10) and now considering 31/42 (removed 11) transitions.
[2024-05-28 05:05:29] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
// Phase 1: matrix 28 rows 26 cols
[2024-05-28 05:05:29] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:05:29] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-28 05:05:29] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
[2024-05-28 05:05:29] [INFO ] Invariant cache hit.
[2024-05-28 05:05:29] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-28 05:05:29] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 26 sub problems to find dead transitions.
[2024-05-28 05:05:29] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
[2024-05-28 05:05:29] [INFO ] Invariant cache hit.
[2024-05-28 05:05:29] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 2/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 27/53 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/53 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/54 variables, and 45 constraints, problems are : Problem set: 0 solved, 26 unsolved in 217 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 18/18 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 2/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 27/53 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/54 variables, and 71 constraints, problems are : Problem set: 0 solved, 26 unsolved in 170 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 396ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 396ms
Starting structural reductions in LTL mode, iteration 1 : 26/36 places, 31/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 26/36 places, 31/42 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLFireability-10 finished in 551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&(G(!p0)||p1))))))'
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 42/42 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 33 transition count 42
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 28 transition count 37
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 28 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 28 transition count 35
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 25 transition count 32
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 25 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 25 transition count 31
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 23 transition count 29
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 23 transition count 29
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 23 transition count 27
Applied a total of 28 rules in 5 ms. Remains 23 /36 variables (removed 13) and now considering 27/42 (removed 15) transitions.
[2024-05-28 05:05:30] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
// Phase 1: matrix 25 rows 23 cols
[2024-05-28 05:05:30] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:05:30] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 05:05:30] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-28 05:05:30] [INFO ] Invariant cache hit.
[2024-05-28 05:05:30] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-28 05:05:30] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 22 sub problems to find dead transitions.
[2024-05-28 05:05:30] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-28 05:05:30] [INFO ] Invariant cache hit.
[2024-05-28 05:05:30] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/47 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/47 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/48 variables, and 39 constraints, problems are : Problem set: 0 solved, 22 unsolved in 172 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 15/15 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/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/47 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 22/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/47 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/48 variables, and 61 constraints, problems are : Problem set: 0 solved, 22 unsolved in 150 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 328ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 329ms
Starting structural reductions in LTL mode, iteration 1 : 23/36 places, 27/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 389 ms. Remains : 23/36 places, 27/42 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLFireability-13 finished in 513 ms.
All properties solved by simple procedures.
Total runtime 7221 ms.
ITS solved all properties within timeout

BK_STOP 1716872730553

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

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