Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281599200403.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SemanticWebServices-PT-S128P15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599200403
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.0K Apr 29 12:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 12:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 12:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 29 12:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 227K May 10 09:34 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-S128P15-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652967175100

Running Version 202205111006
[2022-05-19 13:32:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 13:32:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 13:32:56] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2022-05-19 13:32:56] [INFO ] Transformed 188 places.
[2022-05-19 13:32:56] [INFO ] Transformed 416 transitions.
[2022-05-19 13:32:56] [INFO ] Parsed PT model containing 188 places and 416 transitions in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 220 transitions
Reduce redundant transitions removed 220 transitions.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Ensure Unique test removed 33 places
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 98 transition count 113
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 175 place count 92 transition count 107
Iterating global reduction 1 with 6 rules applied. Total rules applied 181 place count 92 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 182 place count 92 transition count 106
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 185 place count 89 transition count 103
Iterating global reduction 2 with 3 rules applied. Total rules applied 188 place count 89 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 189 place count 88 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 190 place count 88 transition count 102
Applied a total of 190 rules in 18 ms. Remains 88 /186 variables (removed 98) and now considering 102/194 (removed 92) transitions.
[2022-05-19 13:32:56] [INFO ] Flow matrix only has 93 transitions (discarded 9 similar events)
// Phase 1: matrix 93 rows 88 cols
[2022-05-19 13:32:56] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-19 13:32:56] [INFO ] Implicit Places using invariants in 142 ms returned []
[2022-05-19 13:32:56] [INFO ] Flow matrix only has 93 transitions (discarded 9 similar events)
// Phase 1: matrix 93 rows 88 cols
[2022-05-19 13:32:56] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-19 13:32:56] [INFO ] State equation strengthened by 62 read => feed constraints.
[2022-05-19 13:32:56] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2022-05-19 13:32:56] [INFO ] Flow matrix only has 93 transitions (discarded 9 similar events)
// Phase 1: matrix 93 rows 88 cols
[2022-05-19 13:32:56] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-19 13:32:56] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/186 places, 102/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/186 places, 102/194 transitions.
Support contains 40 out of 88 places after structural reductions.
[2022-05-19 13:32:56] [INFO ] Flatten gal took : 24 ms
[2022-05-19 13:32:56] [INFO ] Flatten gal took : 10 ms
[2022-05-19 13:32:57] [INFO ] Input system was already deterministic with 102 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 22) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2022-05-19 13:32:57] [INFO ] Flow matrix only has 93 transitions (discarded 9 similar events)
// Phase 1: matrix 93 rows 88 cols
[2022-05-19 13:32:57] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 13:32:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-19 13:32:57] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 13:32:57] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 6 ms returned sat
[2022-05-19 13:32:57] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 13:32:57] [INFO ] State equation strengthened by 62 read => feed constraints.
[2022-05-19 13:32:57] [INFO ] After 14ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 13:32:57] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-19 13:32:57] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 88/88 places, 102/102 transitions.
Graph (complete) has 148 edges and 88 vertex of which 15 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.2 ms
Discarding 73 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Drop transitions removed 29 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 15 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 14 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 13 transition count 14
Applied a total of 34 rules in 10 ms. Remains 13 /88 variables (removed 75) and now considering 14/102 (removed 88) transitions.
Finished structural reductions, in 1 iterations. Remains : 13/88 places, 14/102 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 2) seen :1
Finished Best-First random walk after 458 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=458 )
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((G(F(p0))&&X((X(X(G(p1)))&&p1))))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 102/102 transitions.
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 72 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 67 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 67 transition count 78
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 62 transition count 73
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 62 transition count 73
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 59 transition count 70
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 59 transition count 70
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 57 transition count 68
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 57 transition count 68
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 55 transition count 66
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 55 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 54 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 54 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 54 transition count 64
Applied a total of 72 rules in 17 ms. Remains 54 /88 variables (removed 34) and now considering 64/102 (removed 38) transitions.
[2022-05-19 13:32:58] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
// Phase 1: matrix 56 rows 54 cols
[2022-05-19 13:32:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:32:58] [INFO ] Implicit Places using invariants in 29 ms returned []
[2022-05-19 13:32:58] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
// Phase 1: matrix 56 rows 54 cols
[2022-05-19 13:32:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:32:58] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-05-19 13:32:58] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-19 13:32:58] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
// Phase 1: matrix 56 rows 54 cols
[2022-05-19 13:32:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:32:58] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/88 places, 64/102 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/88 places, 64/102 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT s22 s12), p0:(GT s21 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-00 finished in 506 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 102/102 transitions.
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 71 transition count 82
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 66 transition count 77
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 66 transition count 77
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 62 transition count 73
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 60 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 60 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 59 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 59 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 58 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 58 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 57 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 57 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 57 transition count 67
Applied a total of 66 rules in 10 ms. Remains 57 /88 variables (removed 31) and now considering 67/102 (removed 35) transitions.
[2022-05-19 13:32:58] [INFO ] Flow matrix only has 59 transitions (discarded 8 similar events)
// Phase 1: matrix 59 rows 57 cols
[2022-05-19 13:32:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:32:58] [INFO ] Implicit Places using invariants in 29 ms returned []
[2022-05-19 13:32:58] [INFO ] Flow matrix only has 59 transitions (discarded 8 similar events)
// Phase 1: matrix 59 rows 57 cols
[2022-05-19 13:32:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:32:58] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-19 13:32:58] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2022-05-19 13:32:58] [INFO ] Flow matrix only has 59 transitions (discarded 8 similar events)
// Phase 1: matrix 59 rows 57 cols
[2022-05-19 13:32:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:32:58] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/88 places, 67/102 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/88 places, 67/102 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LEQ s32 s52) (LEQ 2 s32))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-01 finished in 221 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 102/102 transitions.
Graph (complete) has 214 edges and 88 vertex of which 73 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.2 ms
Discarding 15 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 71 transition count 82
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 20 place count 71 transition count 80
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 69 transition count 80
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 65 transition count 76
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 65 transition count 76
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 61 transition count 72
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 61 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 59 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 59 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 58 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 58 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 57 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 57 transition count 68
Applied a total of 48 rules in 23 ms. Remains 57 /88 variables (removed 31) and now considering 68/102 (removed 34) transitions.
[2022-05-19 13:32:58] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
// Phase 1: matrix 59 rows 57 cols
[2022-05-19 13:32:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:32:58] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-19 13:32:58] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
// Phase 1: matrix 59 rows 57 cols
[2022-05-19 13:32:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:32:58] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-05-19 13:32:58] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2022-05-19 13:32:58] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-19 13:32:58] [INFO ] Flow matrix only has 59 transitions (discarded 9 similar events)
// Phase 1: matrix 59 rows 57 cols
[2022-05-19 13:32:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:32:58] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/88 places, 68/102 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/88 places, 68/102 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(GT s0 s27), p0:(AND (GT s0 s27) (LEQ s5 s6) (OR (LEQ s0 s27) (LEQ s38 s34)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-02 finished in 219 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(X(p0)) U p1)||p0)))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 102/102 transitions.
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 72 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 67 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 67 transition count 78
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 62 transition count 73
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 62 transition count 73
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 59 transition count 70
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 59 transition count 70
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 57 transition count 68
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 57 transition count 68
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 55 transition count 66
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 55 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 54 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 54 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 54 transition count 64
Applied a total of 72 rules in 10 ms. Remains 54 /88 variables (removed 34) and now considering 64/102 (removed 38) transitions.
[2022-05-19 13:32:59] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
// Phase 1: matrix 56 rows 54 cols
[2022-05-19 13:32:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:32:59] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-19 13:32:59] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
// Phase 1: matrix 56 rows 54 cols
[2022-05-19 13:32:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:32:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-05-19 13:32:59] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-19 13:32:59] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
// Phase 1: matrix 56 rows 54 cols
[2022-05-19 13:32:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:32:59] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/88 places, 64/102 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/88 places, 64/102 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 3 s45), p1:(OR (LEQ 3 s22) (LEQ s12 s30))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 316 ms.
Product exploration explored 100000 steps with 0 reset in 368 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 566 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 206 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Finished Best-First random walk after 3399 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=1133 )
Knowledge obtained : [(AND (NOT p0) p1), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 775 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2022-05-19 13:33:02] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
// Phase 1: matrix 56 rows 54 cols
[2022-05-19 13:33:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:33:02] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-05-19 13:33:02] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
// Phase 1: matrix 56 rows 54 cols
[2022-05-19 13:33:02] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-19 13:33:02] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-05-19 13:33:02] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2022-05-19 13:33:02] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
// Phase 1: matrix 56 rows 54 cols
[2022-05-19 13:33:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:33:02] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 64/64 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 797 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 202 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :4
Finished Best-First random walk after 207 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=207 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 462 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 184 ms.
Product exploration explored 100000 steps with 0 reset in 102 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 132 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 64/64 transitions.
Graph (complete) has 109 edges and 54 vertex of which 48 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 removed 3 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 47 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 60
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 45 transition count 58
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 45 transition count 58
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 9 place count 43 transition count 56
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 43 transition count 56
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 14 place count 40 transition count 53
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 40 transition count 53
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 19 place count 38 transition count 51
Iterating global reduction 0 with 2 rules applied. Total rules applied 21 place count 38 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 37 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 37 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 37 transition count 49
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 37 transition count 47
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 73 edges and 36 vertex of which 35 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 removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 35 transition count 46
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 35 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 34 transition count 45
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 33 transition count 44
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 33 transition count 44
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 31 transition count 42
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 31 transition count 42
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 38 place count 29 transition count 40
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 29 transition count 40
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 42 place count 27 transition count 38
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 27 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 27 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 27 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 48 place count 26 transition count 35
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 49 place count 25 transition count 34
Iterating global reduction 5 with 1 rules applied. Total rules applied 50 place count 25 transition count 34
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 52 place count 23 transition count 32
Iterating global reduction 5 with 2 rules applied. Total rules applied 54 place count 23 transition count 32
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 57 place count 20 transition count 29
Iterating global reduction 5 with 3 rules applied. Total rules applied 60 place count 20 transition count 29
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 63 place count 20 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 64 place count 20 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 65 place count 19 transition count 25
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 67 place count 19 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 68 place count 18 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 70 place count 18 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 71 place count 17 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 72 place count 17 transition count 20
Applied a total of 72 rules in 27 ms. Remains 17 /54 variables (removed 37) and now considering 20/64 (removed 44) transitions.
[2022-05-19 13:33:04] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 20 rows 17 cols
[2022-05-19 13:33:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:33:04] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/54 places, 20/64 transitions.
Finished structural reductions, in 1 iterations. Remains : 17/54 places, 20/64 transitions.
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-04 finished in 5713 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 102/102 transitions.
Graph (complete) has 214 edges and 88 vertex of which 65 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 63 transition count 77
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 58 transition count 72
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 58 transition count 72
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 52 transition count 66
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 52 transition count 66
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 47 transition count 61
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 47 transition count 61
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 42 transition count 56
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 42 transition count 56
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 38 transition count 52
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 38 transition count 52
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 36 transition count 50
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 36 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 78 place count 36 transition count 48
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 36 transition count 46
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 75 edges and 35 vertex of which 34 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 removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 34 transition count 45
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 34 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 33 transition count 43
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 32 transition count 42
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 32 transition count 42
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 31 transition count 41
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 31 transition count 41
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 90 place count 30 transition count 40
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 30 transition count 40
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 92 place count 29 transition count 39
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 29 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 94 place count 29 transition count 38
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 95 place count 29 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 96 place count 28 transition count 37
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 97 place count 27 transition count 36
Iterating global reduction 6 with 1 rules applied. Total rules applied 98 place count 27 transition count 36
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 100 place count 25 transition count 34
Iterating global reduction 6 with 2 rules applied. Total rules applied 102 place count 25 transition count 34
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 106 place count 21 transition count 30
Iterating global reduction 6 with 4 rules applied. Total rules applied 110 place count 21 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 114 place count 21 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 115 place count 21 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 116 place count 20 transition count 25
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 118 place count 20 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 119 place count 19 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 120 place count 19 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 121 place count 18 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 122 place count 18 transition count 21
Applied a total of 122 rules in 24 ms. Remains 18 /88 variables (removed 70) and now considering 21/102 (removed 81) transitions.
// Phase 1: matrix 21 rows 18 cols
[2022-05-19 13:33:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:33:04] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 21 rows 18 cols
[2022-05-19 13:33:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:33:04] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 13:33:04] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-19 13:33:04] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 21 rows 18 cols
[2022-05-19 13:33:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:33:04] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/88 places, 21/102 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/88 places, 21/102 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s15 s2), p1:(GT 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 104 ms.
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-05 finished in 298 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((X(F(G(F(p0))))||p1)))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 102/102 transitions.
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 71 transition count 81
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 66 transition count 76
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 66 transition count 76
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 61 transition count 71
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 59 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 59 transition count 69
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 57 transition count 67
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 57 transition count 67
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 55 transition count 65
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 55 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 54 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 54 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 54 transition count 63
Applied a total of 73 rules in 9 ms. Remains 54 /88 variables (removed 34) and now considering 63/102 (removed 39) transitions.
[2022-05-19 13:33:05] [INFO ] Flow matrix only has 55 transitions (discarded 8 similar events)
// Phase 1: matrix 55 rows 54 cols
[2022-05-19 13:33:05] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:33:05] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-19 13:33:05] [INFO ] Flow matrix only has 55 transitions (discarded 8 similar events)
// Phase 1: matrix 55 rows 54 cols
[2022-05-19 13:33:05] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:33:05] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-19 13:33:05] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-19 13:33:05] [INFO ] Flow matrix only has 55 transitions (discarded 8 similar events)
// Phase 1: matrix 55 rows 54 cols
[2022-05-19 13:33:05] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:33:05] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/88 places, 63/102 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/88 places, 63/102 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT s24 s29), p0:(GT s8 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 266 ms.
Product exploration explored 100000 steps with 1 reset in 190 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0)]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
[2022-05-19 13:33:06] [INFO ] Flow matrix only has 55 transitions (discarded 8 similar events)
// Phase 1: matrix 55 rows 54 cols
[2022-05-19 13:33:06] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:33:06] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 13:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 13:33:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 13:33:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 13:33:06] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 13:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 13:33:06] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-19 13:33:06] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-19 13:33:06] [INFO ] [Nat]Added 45 Read/Feed constraints in 2 ms returned sat
[2022-05-19 13:33:06] [INFO ] Computed and/alt/rep : 58/70/50 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 13:33:06] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 63/63 transitions.
Graph (complete) has 156 edges and 54 vertex of which 48 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 removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 46 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 46 transition count 58
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 44 transition count 56
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 44 transition count 56
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 9 place count 42 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 42 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 41 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 41 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 40 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 40 transition count 52
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 40 transition count 50
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 119 edges and 39 vertex of which 38 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 removed 1 transitions
Iterating post reduction 0 with 2 rules applied. Total rules applied 19 place count 38 transition count 49
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 38 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 37 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 36 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 36 transition count 47
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 34 transition count 45
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 45
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 32 transition count 43
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 32 transition count 43
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 30 transition count 41
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 30 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 30 transition count 39
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 30 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 29 transition count 37
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 43 place count 29 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 45 place count 27 transition count 34
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 47 place count 25 transition count 32
Iterating global reduction 5 with 2 rules applied. Total rules applied 49 place count 25 transition count 32
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 53 place count 21 transition count 28
Iterating global reduction 5 with 4 rules applied. Total rules applied 57 place count 21 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 61 place count 21 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 62 place count 21 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 63 place count 20 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 64 place count 20 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 65 place count 19 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 66 place count 19 transition count 21
Applied a total of 66 rules in 13 ms. Remains 19 /54 variables (removed 35) and now considering 21/63 (removed 42) transitions.
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 13:33:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:33:06] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 13:33:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:33:06] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 13:33:06] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-19 13:33:06] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 13:33:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:33:06] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/54 places, 21/63 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/54 places, 21/63 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 13:33:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 13:33:06] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-19 13:33:06] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 13:33:06] [INFO ] [Real]Added 13 Read/Feed constraints in 2 ms returned sat
[2022-05-19 13:33:06] [INFO ] Computed and/alt/rep : 13/15/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 13:33:06] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 52 ms.
Product exploration explored 100000 steps with 2 reset in 139 ms.
Built C files in :
/tmp/ltsmin8644016010303261552
[2022-05-19 13:33:07] [INFO ] Computing symmetric may disable matrix : 21 transitions.
[2022-05-19 13:33:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:33:07] [INFO ] Computing symmetric may enable matrix : 21 transitions.
[2022-05-19 13:33:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:33:07] [INFO ] Computing Do-Not-Accords matrix : 21 transitions.
[2022-05-19 13:33:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:33:07] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8644016010303261552
Running compilation step : cd /tmp/ltsmin8644016010303261552;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 160 ms.
Running link step : cd /tmp/ltsmin8644016010303261552;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin8644016010303261552;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6203108071287217187.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 21/21 transitions.
Graph (complete) has 46 edges and 19 vertex of which 17 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 16 transition count 20
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 16 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 15 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 15 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 14 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 14 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 13 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 13 transition count 15
Applied a total of 11 rules in 2 ms. Remains 13 /19 variables (removed 6) and now considering 15/21 (removed 6) transitions.
// Phase 1: matrix 15 rows 13 cols
[2022-05-19 13:33:22] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:33:22] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 15 rows 13 cols
[2022-05-19 13:33:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:33:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-19 13:33:22] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-19 13:33:22] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 15 rows 13 cols
[2022-05-19 13:33:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:33:22] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/19 places, 15/21 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/19 places, 15/21 transitions.
Built C files in :
/tmp/ltsmin8167094448218862772
[2022-05-19 13:33:22] [INFO ] Computing symmetric may disable matrix : 15 transitions.
[2022-05-19 13:33:22] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:33:22] [INFO ] Computing symmetric may enable matrix : 15 transitions.
[2022-05-19 13:33:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:33:22] [INFO ] Computing Do-Not-Accords matrix : 15 transitions.
[2022-05-19 13:33:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:33:22] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8167094448218862772
Running compilation step : cd /tmp/ltsmin8167094448218862772;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 76 ms.
Running link step : cd /tmp/ltsmin8167094448218862772;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8167094448218862772;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15288916690402726563.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 13:33:37] [INFO ] Flatten gal took : 2 ms
[2022-05-19 13:33:37] [INFO ] Flatten gal took : 2 ms
[2022-05-19 13:33:37] [INFO ] Time to serialize gal into /tmp/LTL255458526056112211.gal : 0 ms
[2022-05-19 13:33:37] [INFO ] Time to serialize properties into /tmp/LTL11632970233650597424.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL255458526056112211.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11632970233650597424.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2554585...266
Read 1 LTL properties
Checking formula 0 : !((X(G(X((X(F(G(F("(p29>p39)")))))||("(p89>p104)"))))))
Formula 0 simplified : !XGX("(p89>p104)" | XFGF"(p29>p39)")
Detected timeout of ITS tools.
[2022-05-19 13:33:52] [INFO ] Flatten gal took : 2 ms
[2022-05-19 13:33:52] [INFO ] Applying decomposition
[2022-05-19 13:33:52] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4249639302213757242.txt' '-o' '/tmp/graph4249639302213757242.bin' '-w' '/tmp/graph4249639302213757242.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4249639302213757242.bin' '-l' '-1' '-v' '-w' '/tmp/graph4249639302213757242.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:33:52] [INFO ] Decomposing Gal with order
[2022-05-19 13:33:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:33:52] [INFO ] Removed a total of 12 redundant transitions.
[2022-05-19 13:33:52] [INFO ] Flatten gal took : 60 ms
[2022-05-19 13:33:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2022-05-19 13:33:52] [INFO ] Time to serialize gal into /tmp/LTL11537193297559483663.gal : 1 ms
[2022-05-19 13:33:52] [INFO ] Time to serialize properties into /tmp/LTL15640635006094286204.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11537193297559483663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15640635006094286204.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1153719...268
Read 1 LTL properties
Checking formula 0 : !((X(G(X((X(F(G(F("(gu0.p29>gu0.p39)")))))||("(gu3.p89>gu3.p104)"))))))
Formula 0 simplified : !XGX("(gu3.p89>gu3.p104)" | XFGF"(gu0.p29>gu0.p39)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6613535066856405171
[2022-05-19 13:34:07] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6613535066856405171
Running compilation step : cd /tmp/ltsmin6613535066856405171;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 65 ms.
Running link step : cd /tmp/ltsmin6613535066856405171;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin6613535066856405171;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X((X(<>([](<>((LTLAPp0==true)))))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-07 finished in 77856 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(F((X(G(X(X(p0))))&&p1))))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 102/102 transitions.
Graph (complete) has 214 edges and 88 vertex of which 72 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 70 transition count 81
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 21 place count 70 transition count 79
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 68 transition count 79
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 63 transition count 74
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 63 transition count 74
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 58 transition count 69
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 58 transition count 69
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 55 transition count 66
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 55 transition count 66
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 53 transition count 64
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 53 transition count 64
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 51 transition count 62
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 51 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 50 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 50 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 50 transition count 60
Applied a total of 62 rules in 19 ms. Remains 50 /88 variables (removed 38) and now considering 60/102 (removed 42) transitions.
[2022-05-19 13:34:22] [INFO ] Flow matrix only has 52 transitions (discarded 8 similar events)
// Phase 1: matrix 52 rows 50 cols
[2022-05-19 13:34:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:34:22] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-19 13:34:22] [INFO ] Flow matrix only has 52 transitions (discarded 8 similar events)
// Phase 1: matrix 52 rows 50 cols
[2022-05-19 13:34:22] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:34:22] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-05-19 13:34:22] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2022-05-19 13:34:22] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-19 13:34:22] [INFO ] Flow matrix only has 52 transitions (discarded 8 similar events)
// Phase 1: matrix 52 rows 50 cols
[2022-05-19 13:34:22] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:34:23] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/88 places, 60/102 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/88 places, 60/102 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 5}, { cond=p1, acceptance={0} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 7}, { cond=p1, acceptance={0} source=4 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 7}, { cond=(AND p1 p0), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 5}, { cond=(AND p1 p0), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={0} source=7 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 7}, { cond=(AND p1 p0), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(LEQ 2 s37), p0:(LEQ s1 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-09 finished in 519 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1)) U G(p0)))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 102/102 transitions.
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 71 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 68 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 68 transition count 79
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 65 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 65 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 63 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 61 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 61 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 59 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 59 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 58 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 58 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 58 transition count 68
Applied a total of 64 rules in 5 ms. Remains 58 /88 variables (removed 30) and now considering 68/102 (removed 34) transitions.
[2022-05-19 13:34:23] [INFO ] Flow matrix only has 60 transitions (discarded 8 similar events)
// Phase 1: matrix 60 rows 58 cols
[2022-05-19 13:34:23] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:34:23] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-19 13:34:23] [INFO ] Flow matrix only has 60 transitions (discarded 8 similar events)
// Phase 1: matrix 60 rows 58 cols
[2022-05-19 13:34:23] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:34:23] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-19 13:34:23] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2022-05-19 13:34:23] [INFO ] Flow matrix only has 60 transitions (discarded 8 similar events)
// Phase 1: matrix 60 rows 58 cols
[2022-05-19 13:34:23] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:34:23] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/88 places, 68/102 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/88 places, 68/102 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p1), true]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s29 s17), p1:(LEQ 2 s41)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 350 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-12 finished in 231 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1)||p2)))'
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 102/102 transitions.
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 72 transition count 83
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 68 transition count 79
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 68 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 64 transition count 75
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 62 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 61 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 61 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 60 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 60 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 59 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 59 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 59 transition count 69
Applied a total of 62 rules in 3 ms. Remains 59 /88 variables (removed 29) and now considering 69/102 (removed 33) transitions.
[2022-05-19 13:34:23] [INFO ] Flow matrix only has 61 transitions (discarded 8 similar events)
// Phase 1: matrix 61 rows 59 cols
[2022-05-19 13:34:23] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:34:23] [INFO ] Implicit Places using invariants in 64 ms returned []
[2022-05-19 13:34:23] [INFO ] Flow matrix only has 61 transitions (discarded 8 similar events)
// Phase 1: matrix 61 rows 59 cols
[2022-05-19 13:34:23] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-19 13:34:23] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-19 13:34:23] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2022-05-19 13:34:23] [INFO ] Flow matrix only has 61 transitions (discarded 8 similar events)
// Phase 1: matrix 61 rows 59 cols
[2022-05-19 13:34:23] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:34:23] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/88 places, 69/102 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/88 places, 69/102 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT s23 s7), p2:(LEQ s53 s12), p1:(LEQ s36 s55)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p1)))
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-13 finished in 869 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(G((G(X(p0))||p1)) U (X(p0)||p2)))))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 102/102 transitions.
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 74 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 69 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 69 transition count 80
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 64 transition count 75
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 64 transition count 75
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 61 transition count 72
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 61 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 59 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 59 transition count 70
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 57 transition count 68
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 57 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 56 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 56 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 56 transition count 66
Applied a total of 68 rules in 6 ms. Remains 56 /88 variables (removed 32) and now considering 66/102 (removed 36) transitions.
[2022-05-19 13:34:24] [INFO ] Flow matrix only has 58 transitions (discarded 8 similar events)
// Phase 1: matrix 58 rows 56 cols
[2022-05-19 13:34:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:34:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-19 13:34:24] [INFO ] Flow matrix only has 58 transitions (discarded 8 similar events)
// Phase 1: matrix 58 rows 56 cols
[2022-05-19 13:34:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:34:24] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-05-19 13:34:24] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-19 13:34:24] [INFO ] Flow matrix only has 58 transitions (discarded 8 similar events)
// Phase 1: matrix 58 rows 56 cols
[2022-05-19 13:34:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:34:24] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/88 places, 66/102 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/88 places, 66/102 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR p2 p0), (OR p0 p2), p0, p0, (OR p0 (AND p1 p2)), p0]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2 p0), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(GT 1 s24), p1:(LEQ s7 s31), p0:(LEQ s36 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-15 finished in 355 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((X(F(G(F(p0))))||p1)))))'
Found a SL insensitive property : SemanticWebServices-PT-S128P15-LTLCardinality-07
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 88/88 places, 102/102 transitions.
Graph (complete) has 214 edges and 88 vertex of which 66 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 64 transition count 77
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 58 transition count 71
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 58 transition count 71
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 51 transition count 64
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 51 transition count 64
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 47 transition count 60
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 47 transition count 60
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 44 transition count 57
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 44 transition count 57
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 41 transition count 54
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 41 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 40 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 40 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 40 transition count 52
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 40 transition count 50
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 119 edges and 39 vertex of which 38 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 removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 38 transition count 49
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 38 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 37 transition count 48
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 36 transition count 47
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 36 transition count 47
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 81 place count 34 transition count 45
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 34 transition count 45
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 85 place count 32 transition count 43
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 32 transition count 43
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 89 place count 30 transition count 41
Iterating global reduction 4 with 2 rules applied. Total rules applied 91 place count 30 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 93 place count 30 transition count 39
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 95 place count 30 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 96 place count 29 transition count 37
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 99 place count 29 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 101 place count 27 transition count 34
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 103 place count 25 transition count 32
Iterating global reduction 7 with 2 rules applied. Total rules applied 105 place count 25 transition count 32
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 109 place count 21 transition count 28
Iterating global reduction 7 with 4 rules applied. Total rules applied 113 place count 21 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 117 place count 21 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 118 place count 21 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 119 place count 20 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 120 place count 20 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 121 place count 19 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 122 place count 19 transition count 21
Applied a total of 122 rules in 18 ms. Remains 19 /88 variables (removed 69) and now considering 21/102 (removed 81) transitions.
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 13:34:25] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:34:25] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 13:34:25] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:34:25] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 13:34:25] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 13:34:25] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:34:25] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 19/88 places, 21/102 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/88 places, 21/102 transitions.
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT s6 s8), p0:(GT s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 79 ms.
Product exploration explored 100000 steps with 0 reset in 134 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0)]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 13:34:25] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 13:34:25] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-19 13:34:25] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 13:34:25] [INFO ] [Real]Added 13 Read/Feed constraints in 1 ms returned sat
[2022-05-19 13:34:25] [INFO ] Computed and/alt/rep : 13/15/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 13:34:25] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 19 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 13:34:26] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:34:26] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 13:34:26] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:34:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 13:34:26] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-19 13:34:26] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 13:34:26] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:34:26] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/19 places, 21/21 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 13:34:26] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:34:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 13:34:26] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-19 13:34:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 13:34:26] [INFO ] [Real]Added 13 Read/Feed constraints in 1 ms returned sat
[2022-05-19 13:34:26] [INFO ] Computed and/alt/rep : 13/15/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 13:34:26] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 65 ms.
Product exploration explored 100000 steps with 1 reset in 123 ms.
Built C files in :
/tmp/ltsmin2031243323299566688
[2022-05-19 13:34:26] [INFO ] Computing symmetric may disable matrix : 21 transitions.
[2022-05-19 13:34:26] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:34:26] [INFO ] Computing symmetric may enable matrix : 21 transitions.
[2022-05-19 13:34:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:34:26] [INFO ] Computing Do-Not-Accords matrix : 21 transitions.
[2022-05-19 13:34:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:34:26] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2031243323299566688
Running compilation step : cd /tmp/ltsmin2031243323299566688;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 74 ms.
Running link step : cd /tmp/ltsmin2031243323299566688;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2031243323299566688;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4380347062873905636.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 21/21 transitions.
Graph (complete) has 46 edges and 19 vertex of which 17 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 16 transition count 20
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 16 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 15 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 15 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 14 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 14 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 13 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 13 transition count 15
Applied a total of 11 rules in 4 ms. Remains 13 /19 variables (removed 6) and now considering 15/21 (removed 6) transitions.
// Phase 1: matrix 15 rows 13 cols
[2022-05-19 13:34:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:34:41] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 15 rows 13 cols
[2022-05-19 13:34:42] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:34:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-19 13:34:42] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-19 13:34:42] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 15 rows 13 cols
[2022-05-19 13:34:42] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:34:42] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/19 places, 15/21 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/19 places, 15/21 transitions.
Built C files in :
/tmp/ltsmin3282345606880615560
[2022-05-19 13:34:42] [INFO ] Computing symmetric may disable matrix : 15 transitions.
[2022-05-19 13:34:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:34:42] [INFO ] Computing symmetric may enable matrix : 15 transitions.
[2022-05-19 13:34:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:34:42] [INFO ] Computing Do-Not-Accords matrix : 15 transitions.
[2022-05-19 13:34:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:34:42] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3282345606880615560
Running compilation step : cd /tmp/ltsmin3282345606880615560;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 65 ms.
Running link step : cd /tmp/ltsmin3282345606880615560;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin3282345606880615560;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10165138574403881137.hoa' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Initializing POR dependencies: labels 16, guards 15
pins2lts-mc-linux64( 1/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.004: LTL layer using automaton file : /tmp/stateBased10165138574403881137.hoa
pins2lts-mc-linux64( 2/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.012: "(LTLAPp0==true)" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.012: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.012: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.022: There are 18 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.023: State length is 14, there are 18 groups
pins2lts-mc-linux64( 0/ 8), 0.023: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.023: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.023: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.023: Visible groups: 0 / 18, labels: 1 / 18
pins2lts-mc-linux64( 0/ 8), 0.023: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.023: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.032: [Blue] ~120 levels ~960 states ~1064 transitions
pins2lts-mc-linux64( 1/ 8), 0.042: [Blue] ~240 levels ~1920 states ~2040 transitions
pins2lts-mc-linux64( 5/ 8), 0.051: [Blue] ~480 levels ~3840 states ~3944 transitions
pins2lts-mc-linux64( 4/ 8), 0.075: [Blue] ~960 levels ~7680 states ~7784 transitions
pins2lts-mc-linux64( 1/ 8), 0.120: [Blue] ~1920 levels ~15360 states ~15480 transitions
pins2lts-mc-linux64( 1/ 8), 0.194: [Blue] ~3840 levels ~30720 states ~30840 transitions
pins2lts-mc-linux64( 1/ 8), 0.311: [Blue] ~7680 levels ~61440 states ~61560 transitions
pins2lts-mc-linux64( 5/ 8), 0.464: [Blue] ~15360 levels ~122880 states ~122984 transitions
pins2lts-mc-linux64( 1/ 8), 0.682: [Blue] ~30720 levels ~245760 states ~245880 transitions
pins2lts-mc-linux64( 5/ 8), 0.989: [Blue] ~61440 levels ~491520 states ~491624 transitions
pins2lts-mc-linux64( 4/ 8), 1.415: [Blue] ~122880 levels ~983040 states ~983144 transitions
pins2lts-mc-linux64( 5/ 8), 1.926: [Blue] ~245760 levels ~1966080 states ~1966184 transitions
pins2lts-mc-linux64( 5/ 8), 2.767: [Blue] ~491520 levels ~3932160 states ~3932264 transitions
pins2lts-mc-linux64( 5/ 8), 4.498: [Blue] ~983040 levels ~7864320 states ~7864424 transitions
pins2lts-mc-linux64( 5/ 8), 8.329: [Blue] ~1966080 levels ~15728640 states ~15728744 transitions
pins2lts-mc-linux64( 3/ 8), 13.392: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 13.484:
pins2lts-mc-linux64( 0/ 8), 13.485: Explored 12016367 states 21498840 transitions, fanout: 1.789
pins2lts-mc-linux64( 0/ 8), 13.485: Total exploration time 13.420 sec (13.360 sec minimum, 13.384 sec on average)
pins2lts-mc-linux64( 0/ 8), 13.485: States per second: 895407, Transitions per second: 1602000
pins2lts-mc-linux64( 0/ 8), 13.485:
pins2lts-mc-linux64( 0/ 8), 13.485: State space has 16882565 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 13.485: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 13.485: blue states: 12016367 (71.18%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 13.485: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 13.485: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 13.485:
pins2lts-mc-linux64( 0/ 8), 13.485: Total memory used for local state coloring: 183.4MB
pins2lts-mc-linux64( 0/ 8), 13.485:
pins2lts-mc-linux64( 0/ 8), 13.485: Queue width: 8B, total height: 12016367, memory: 91.68MB
pins2lts-mc-linux64( 0/ 8), 13.485: Tree memory: 384.8MB, 23.9 B/state, compr.: 41.2%
pins2lts-mc-linux64( 0/ 8), 13.485: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 13.485: Stored 15 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 13.485: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 13.485: Est. total memory use: 476.5MB (~1115.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3282345606880615560;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10165138574403881137.hoa' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3282345606880615560;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10165138574403881137.hoa' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:117)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 13:34:55] [INFO ] Flatten gal took : 1 ms
[2022-05-19 13:34:55] [INFO ] Flatten gal took : 4 ms
[2022-05-19 13:34:55] [INFO ] Time to serialize gal into /tmp/LTL7018712641401358239.gal : 1 ms
[2022-05-19 13:34:55] [INFO ] Time to serialize properties into /tmp/LTL2966804357651260409.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7018712641401358239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2966804357651260409.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7018712...266
Read 1 LTL properties
Checking formula 0 : !((X(G(X((X(F(G(F("(p29>p39)")))))||("(p89>p104)"))))))
Formula 0 simplified : !XGX("(p89>p104)" | XFGF"(p29>p39)")
Detected timeout of ITS tools.
[2022-05-19 13:35:10] [INFO ] Flatten gal took : 1 ms
[2022-05-19 13:35:10] [INFO ] Applying decomposition
[2022-05-19 13:35:10] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4476591492533989714.txt' '-o' '/tmp/graph4476591492533989714.bin' '-w' '/tmp/graph4476591492533989714.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4476591492533989714.bin' '-l' '-1' '-v' '-w' '/tmp/graph4476591492533989714.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:35:10] [INFO ] Decomposing Gal with order
[2022-05-19 13:35:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:35:10] [INFO ] Removed a total of 12 redundant transitions.
[2022-05-19 13:35:10] [INFO ] Flatten gal took : 2 ms
[2022-05-19 13:35:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 0 ms.
[2022-05-19 13:35:10] [INFO ] Time to serialize gal into /tmp/LTL11602251465637541321.gal : 1 ms
[2022-05-19 13:35:10] [INFO ] Time to serialize properties into /tmp/LTL4858835488397281059.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11602251465637541321.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4858835488397281059.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1160225...267
Read 1 LTL properties
Checking formula 0 : !((X(G(X((X(F(G(F("(gu1.p29>gu1.p39)")))))||("(gu3.p89>gu3.p104)"))))))
Formula 0 simplified : !XGX("(gu3.p89>gu3.p104)" | XFGF"(gu1.p29>gu1.p39)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6063051581680965297
[2022-05-19 13:35:25] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6063051581680965297
Running compilation step : cd /tmp/ltsmin6063051581680965297;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 66 ms.
Running link step : cd /tmp/ltsmin6063051581680965297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 18 ms.
Running LTSmin : cd /tmp/ltsmin6063051581680965297;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X((X(<>([](<>((LTLAPp0==true)))))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SemanticWebServices-PT-S128P15-LTLCardinality-07 finished in 76220 ms.
[2022-05-19 13:35:41] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11143265274345193005
[2022-05-19 13:35:41] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2022-05-19 13:35:41] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:35:41] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2022-05-19 13:35:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:35:41] [INFO ] Applying decomposition
[2022-05-19 13:35:41] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2022-05-19 13:35:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:35:41] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11143265274345193005
Running compilation step : cd /tmp/ltsmin11143265274345193005;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 13:35:41] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18032729885416980832.txt' '-o' '/tmp/graph18032729885416980832.bin' '-w' '/tmp/graph18032729885416980832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18032729885416980832.bin' '-l' '-1' '-v' '-w' '/tmp/graph18032729885416980832.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:35:41] [INFO ] Decomposing Gal with order
[2022-05-19 13:35:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:35:41] [INFO ] Removed a total of 117 redundant transitions.
[2022-05-19 13:35:41] [INFO ] Flatten gal took : 9 ms
[2022-05-19 13:35:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 7 ms.
[2022-05-19 13:35:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality12894603949281833614.gal : 2 ms
[2022-05-19 13:35:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality9078078138982721439.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12894603949281833614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9078078138982721439.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((X(G(X((X(F(G(F("(gu6.p29>gu6.p39)")))))||("(gu19.p89>gu19.p104)"))))))
Formula 0 simplified : !XGX("(gu19.p89>gu19.p104)" | XFGF"(gu6.p29>gu6.p39)")
Compilation finished in 238 ms.
Running link step : cd /tmp/ltsmin11143265274345193005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin11143265274345193005;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X((X(<>([](<>((LTLAPp0==true)))))||(LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: LTL layer: formula: X([](X((X(<>([](<>((LTLAPp0==true)))))||(LTLAPp1==true)))))
pins2lts-mc-linux64( 1/ 8), 0.001: "X([](X((X(<>([](<>((LTLAPp0==true)))))||(LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.024: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.043: DFS-FIFO for weak LTL, using special progress label 105
pins2lts-mc-linux64( 0/ 8), 0.043: There are 106 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.043: State length is 89, there are 110 groups
pins2lts-mc-linux64( 0/ 8), 0.043: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.043: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.043: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.043: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.054: ~6 levels ~960 states ~10224 transitions
pins2lts-mc-linux64( 0/ 8), 0.129: ~13 levels ~1920 states ~12368 transitions
pins2lts-mc-linux64( 0/ 8), 0.157: ~20 levels ~3840 states ~14968 transitions
pins2lts-mc-linux64( 0/ 8), 0.320: ~37 levels ~7680 states ~21296 transitions
pins2lts-mc-linux64( 0/ 8), 0.942: ~64 levels ~15360 states ~32168 transitions
pins2lts-mc-linux64( 0/ 8), 1.909: ~130 levels ~30720 states ~57088 transitions
pins2lts-mc-linux64( 0/ 8), 3.839: ~260 levels ~61440 states ~105448 transitions
pins2lts-mc-linux64( 0/ 8), 6.893: ~514 levels ~122880 states ~200856 transitions
pins2lts-mc-linux64( 0/ 8), 17.511: ~1057 levels ~245760 states ~397880 transitions
pins2lts-mc-linux64( 0/ 8), 28.810: ~2126 levels ~491520 states ~792328 transitions
pins2lts-mc-linux64( 0/ 8), 52.858: ~4200 levels ~983040 states ~1563584 transitions
pins2lts-mc-linux64( 0/ 8), 64.958: ~8353 levels ~1966080 states ~3111720 transitions
pins2lts-mc-linux64( 0/ 8), 68.924: ~16733 levels ~3932160 states ~6217760 transitions
pins2lts-mc-linux64( 0/ 8), 75.076: ~33306 levels ~7864320 states ~12393680 transitions
pins2lts-mc-linux64( 0/ 8), 87.079: ~66699 levels ~15728640 states ~24809896 transitions
pins2lts-mc-linux64( 0/ 8), 113.024: ~133532 levels ~31457280 states ~49649416 transitions
pins2lts-mc-linux64( 0/ 8), 175.279: ~266938 levels ~62914560 states ~99258144 transitions
pins2lts-mc-linux64( 0/ 8), 297.140: ~533959 levels ~125829120 states ~198590136 transitions
pins2lts-mc-linux64( 0/ 8), 441.742, file ../../../src/pins2lts-mc/algorithm/ltl.h, line 73: assertion "res != FSET_FULL" failed: ECD table full
free(): double free detected in tcache 2
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11143265274345193005;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X((X(<>([](<>((LTLAPp0==true)))))||(LTLAPp1==true)))))' '--buchi-type=spotba'
134
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11143265274345193005;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X((X(<>([](<>((LTLAPp0==true)))))||(LTLAPp1==true)))))' '--buchi-type=spotba'
134
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 13:56:35] [INFO ] Flatten gal took : 8 ms
[2022-05-19 13:56:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality15024439684680627098.gal : 14 ms
[2022-05-19 13:56:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality9306024733759589316.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15024439684680627098.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9306024733759589316.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((X(G(X((X(F(G(F("(p29>p39)")))))||("(p89>p104)"))))))
Formula 0 simplified : !XGX("(p89>p104)" | XFGF"(p29>p39)")
Detected timeout of ITS tools.
[2022-05-19 14:17:30] [INFO ] Flatten gal took : 192 ms
[2022-05-19 14:17:31] [INFO ] Input system was already deterministic with 102 transitions.
[2022-05-19 14:17:31] [INFO ] Transformed 88 places.
[2022-05-19 14:17:31] [INFO ] Transformed 102 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 14:17:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality2135091303678285476.gal : 19 ms
[2022-05-19 14:17:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality7504782268010739173.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2135091303678285476.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7504782268010739173.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(X((X(F(G(F("(p29>p39)")))))||("(p89>p104)"))))))
Formula 0 simplified : !XGX("(p89>p104)" | XFGF"(p29>p39)")

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-S128P15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is SemanticWebServices-PT-S128P15, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r204-oct2-165281599200403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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