About the Execution of ITS-Tools for SemanticWebServices-PT-S128P09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12630.079 | 3600000.00 | 4476354.00 | 1013.10 | TFFFFTFFF?FFFFFF | normal |
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-165281599200387.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-S128P09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599200387
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.2K Apr 29 12:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 12:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:43 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 814K 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-S128P09-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652965555582
Running Version 202205111006
[2022-05-19 13:05:57] [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:05:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 13:05:57] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2022-05-19 13:05:57] [INFO ] Transformed 242 places.
[2022-05-19 13:05:57] [INFO ] Transformed 946 transitions.
[2022-05-19 13:05:57] [INFO ] Parsed PT model containing 242 places and 946 transitions in 419 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 2 formulas.
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 534 transitions.
Ensure Unique test removed 212 transitions
Reduce redundant transitions removed 212 transitions.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 200/200 transitions.
Ensure Unique test removed 20 places
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 68 transition count 89
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 230 place count 59 transition count 78
Iterating global reduction 1 with 9 rules applied. Total rules applied 239 place count 59 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 242 place count 59 transition count 75
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 247 place count 54 transition count 70
Iterating global reduction 2 with 5 rules applied. Total rules applied 252 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 255 place count 51 transition count 67
Iterating global reduction 2 with 3 rules applied. Total rules applied 258 place count 51 transition count 67
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 261 place count 51 transition count 64
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 265 place count 51 transition count 60
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 274 place count 47 transition count 55
Applied a total of 274 rules in 43 ms. Remains 47 /178 variables (removed 131) and now considering 55/200 (removed 145) transitions.
[2022-05-19 13:05:58] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
// Phase 1: matrix 49 rows 47 cols
[2022-05-19 13:05:58] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-19 13:05:58] [INFO ] Implicit Places using invariants in 140 ms returned []
[2022-05-19 13:05:58] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
// Phase 1: matrix 49 rows 47 cols
[2022-05-19 13:05:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:05:58] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-05-19 13:05:58] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2022-05-19 13:05:58] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
// Phase 1: matrix 49 rows 47 cols
[2022-05-19 13:05:58] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-19 13:05:58] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/178 places, 55/200 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/178 places, 55/200 transitions.
Support contains 19 out of 47 places after structural reductions.
[2022-05-19 13:05:58] [INFO ] Flatten gal took : 18 ms
[2022-05-19 13:05:58] [INFO ] Flatten gal took : 20 ms
[2022-05-19 13:05:58] [INFO ] Input system was already deterministic with 55 transitions.
Finished random walk after 1408 steps, including 0 resets, run visited all 15 properties in 64 ms. (steps per millisecond=22 )
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F(p0) U !X(G(p0))))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 55/55 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 34 transition count 42
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 32 transition count 40
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 32 transition count 40
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 30 transition count 38
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 30 transition count 38
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 28 transition count 36
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 28 transition count 36
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 28 transition count 34
Applied a total of 40 rules in 4 ms. Remains 28 /47 variables (removed 19) and now considering 34/55 (removed 21) transitions.
[2022-05-19 13:05:59] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
// Phase 1: matrix 30 rows 28 cols
[2022-05-19 13:05:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:05:59] [INFO ] Implicit Places using invariants in 70 ms returned []
[2022-05-19 13:05:59] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
// Phase 1: matrix 30 rows 28 cols
[2022-05-19 13:05:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:05:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-19 13:05:59] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2022-05-19 13:05:59] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
// Phase 1: matrix 30 rows 28 cols
[2022-05-19 13:05:59] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-19 13:06:00] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 28/47 places, 34/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/47 places, 34/55 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P09-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:(LEQ s12 s17)], 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]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 3 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-01 finished in 1297 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0) U p0)))'
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 55/55 transitions.
Graph (complete) has 67 edges and 47 vertex of which 27 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.7 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 26 transition count 37
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 23 transition count 34
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 23 transition count 34
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 19 transition count 30
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 19 transition count 30
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 14 transition count 25
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 14 transition count 25
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 44 place count 14 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 24 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 12 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 12 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 11 transition count 16
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 51 place count 10 transition count 15
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 10 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 53 place count 10 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 54 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 55 place count 9 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 56 place count 9 transition count 12
Applied a total of 56 rules in 17 ms. Remains 9 /47 variables (removed 38) and now considering 12/55 (removed 43) transitions.
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:06:00] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-19 13:06:00] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:06:00] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-19 13:06:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-19 13:06:00] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2022-05-19 13:06:00] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:06:00] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:06:00] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/47 places, 12/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/47 places, 12/55 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s6)], 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][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-03 finished in 265 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U !p0)))'
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 55/55 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 33 transition count 41
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 31 transition count 39
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 31 transition count 39
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 29 transition count 37
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 29 transition count 37
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 27 transition count 35
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 27 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 27 transition count 33
Applied a total of 42 rules in 2 ms. Remains 27 /47 variables (removed 20) and now considering 33/55 (removed 22) transitions.
[2022-05-19 13:06:00] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
// Phase 1: matrix 29 rows 27 cols
[2022-05-19 13:06:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:06:00] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-19 13:06:00] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
// Phase 1: matrix 29 rows 27 cols
[2022-05-19 13:06:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:06:00] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-19 13:06:01] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-05-19 13:06:01] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
// Phase 1: matrix 29 rows 27 cols
[2022-05-19 13:06:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:06:01] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 27/47 places, 33/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/47 places, 33/55 transitions.
Stuttering acceptance computed with spot in 126 ms :[p0, p0]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s6 0)], 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][false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-04 finished in 329 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 55/55 transitions.
Graph (complete) has 67 edges and 47 vertex of which 28 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 27 transition count 38
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 24 transition count 35
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 24 transition count 35
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 20 transition count 31
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 20 transition count 31
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 15 transition count 26
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 15 transition count 26
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 43 place count 15 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 15 transition count 19
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 24 edges and 14 vertex of which 13 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 47 place count 13 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 12 transition count 17
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 11 transition count 16
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 11 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 52 place count 11 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 53 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 54 place count 10 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 55 place count 10 transition count 13
Applied a total of 55 rules in 5 ms. Remains 10 /47 variables (removed 37) and now considering 13/55 (removed 42) transitions.
// Phase 1: matrix 13 rows 10 cols
[2022-05-19 13:06:01] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:06:01] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 13 rows 10 cols
[2022-05-19 13:06:01] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:06:01] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-19 13:06:01] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2022-05-19 13:06:01] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 13 rows 10 cols
[2022-05-19 13:06:01] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:06:01] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/47 places, 13/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/47 places, 13/55 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s6 s5)], 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][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-06 finished in 272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(((p0 U p1)||G(F(!p0))))))))'
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 55/55 transitions.
Graph (complete) has 67 edges and 47 vertex of which 34 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 33 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 14 place count 33 transition count 39
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 18 place count 31 transition count 39
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 30 transition count 38
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 30 transition count 38
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 29 transition count 37
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 28 transition count 36
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 28 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 28 transition count 35
Applied a total of 25 rules in 5 ms. Remains 28 /47 variables (removed 19) and now considering 35/55 (removed 20) transitions.
[2022-05-19 13:06:01] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
// Phase 1: matrix 30 rows 28 cols
[2022-05-19 13:06:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:06:01] [INFO ] Implicit Places using invariants in 66 ms returned []
[2022-05-19 13:06:01] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
// Phase 1: matrix 30 rows 28 cols
[2022-05-19 13:06:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:06:01] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-19 13:06:01] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2022-05-19 13:06:01] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-19 13:06:01] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
// Phase 1: matrix 30 rows 28 cols
[2022-05-19 13:06:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:06:01] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/47 places, 35/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/47 places, 35/55 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s25 s1), p1:(LEQ s20 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-07 finished in 381 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 55/55 transitions.
Graph (complete) has 67 edges and 47 vertex of which 26 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 25 transition count 36
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 23 transition count 34
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 23 transition count 34
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 20 transition count 31
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 20 transition count 31
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 16 transition count 27
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 16 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 16 transition count 23
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 16 transition count 20
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 29 edges and 15 vertex of which 14 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 43 place count 14 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 13 transition count 18
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 46 place count 12 transition count 17
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 12 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 48 place count 12 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 49 place count 12 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 50 place count 11 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 51 place count 11 transition count 14
Applied a total of 51 rules in 6 ms. Remains 11 /47 variables (removed 36) and now considering 14/55 (removed 41) transitions.
// Phase 1: matrix 14 rows 11 cols
[2022-05-19 13:06:01] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:06:01] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 14 rows 11 cols
[2022-05-19 13:06:01] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:06:01] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 13:06:01] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-19 13:06:01] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 14 rows 11 cols
[2022-05-19 13:06:01] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:06:02] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/47 places, 14/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/47 places, 14/55 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 207 ms.
Product exploration explored 100000 steps with 0 reset in 93 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 3344 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=557 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 11 cols
[2022-05-19 13:06:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:06:02] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 14 rows 11 cols
[2022-05-19 13:06:02] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:06:02] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 13:06:02] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-19 13:06:02] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 14 rows 11 cols
[2022-05-19 13:06:02] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:06:03] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 14/14 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 11 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-08 finished in 2044 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!(p0 U !p0)||G(!p0)))))'
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 55/55 transitions.
Graph (complete) has 67 edges and 47 vertex of which 27 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 26 transition count 37
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 23 transition count 34
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 23 transition count 34
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 19 transition count 30
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 19 transition count 30
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 14 transition count 25
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 14 transition count 25
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 44 place count 14 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 24 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 12 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 12 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 11 transition count 16
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 51 place count 10 transition count 15
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 10 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 53 place count 10 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 54 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 55 place count 9 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 56 place count 9 transition count 12
Applied a total of 56 rules in 10 ms. Remains 9 /47 variables (removed 38) and now considering 12/55 (removed 43) transitions.
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:06:03] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:06:03] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:06:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:06:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-19 13:06:03] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2022-05-19 13:06:04] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:06:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:06:04] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/47 places, 12/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/47 places, 12/55 transitions.
Stuttering acceptance computed with spot in 49 ms :[false]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s4)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 170 ms.
Product exploration explored 100000 steps with 0 reset in 190 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[false]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[false]
Stuttering acceptance computed with spot in 32 ms :[false]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:06:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:06:04] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:06:04] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:06:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-19 13:06:05] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-19 13:06:05] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:06:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:06:05] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 12/12 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[false]
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), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[false]
Stuttering acceptance computed with spot in 53 ms :[false]
Stuttering acceptance computed with spot in 58 ms :[false]
Product exploration explored 100000 steps with 0 reset in 69 ms.
Product exploration explored 100000 steps with 0 reset in 170 ms.
Built C files in :
/tmp/ltsmin6565617182506906532
[2022-05-19 13:06:05] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2022-05-19 13:06:05] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:06:05] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2022-05-19 13:06:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:06:05] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2022-05-19 13:06:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:06:05] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6565617182506906532
Running compilation step : cd /tmp/ltsmin6565617182506906532;'/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 211 ms.
Running link step : cd /tmp/ltsmin6565617182506906532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin6565617182506906532;'/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/stateBased210141347517718820.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:06:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:06:21] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:06:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:06:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-19 13:06:21] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2022-05-19 13:06:21] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:06:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:06:21] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin14865954093118155207
[2022-05-19 13:06:21] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2022-05-19 13:06:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:06:21] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2022-05-19 13:06:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:06:21] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2022-05-19 13:06:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:06:21] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14865954093118155207
Running compilation step : cd /tmp/ltsmin14865954093118155207;'/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 106 ms.
Running link step : cd /tmp/ltsmin14865954093118155207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin14865954093118155207;'/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/stateBased13807909258466487292.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 13:06:36] [INFO ] Flatten gal took : 2 ms
[2022-05-19 13:06:36] [INFO ] Flatten gal took : 1 ms
[2022-05-19 13:06:36] [INFO ] Time to serialize gal into /tmp/LTL1216872123097907521.gal : 14 ms
[2022-05-19 13:06:36] [INFO ] Time to serialize properties into /tmp/LTL13146292810475595820.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/LTL1216872123097907521.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13146292810475595820.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/LTL1216872...267
Read 1 LTL properties
Checking formula 0 : !((F(G((!(("(p84>=2)")U("(p84<2)")))||(G("(p84<2)"))))))
Formula 0 simplified : !FG(!("(p84>=2)" U "(p84<2)") | G"(p84<2)")
Detected timeout of ITS tools.
[2022-05-19 13:06:51] [INFO ] Flatten gal took : 1 ms
[2022-05-19 13:06:51] [INFO ] Applying decomposition
[2022-05-19 13:06:51] [INFO ] Flatten gal took : 2 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/graph8554188842381523639.txt' '-o' '/tmp/graph8554188842381523639.bin' '-w' '/tmp/graph8554188842381523639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8554188842381523639.bin' '-l' '-1' '-v' '-w' '/tmp/graph8554188842381523639.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:06:51] [INFO ] Decomposing Gal with order
[2022-05-19 13:06:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:06:51] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-19 13:06:51] [INFO ] Flatten gal took : 123 ms
[2022-05-19 13:06:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2022-05-19 13:06:51] [INFO ] Time to serialize gal into /tmp/LTL8112338924317578790.gal : 1 ms
[2022-05-19 13:06:51] [INFO ] Time to serialize properties into /tmp/LTL3807947115227826088.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/LTL8112338924317578790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3807947115227826088.ltl' '-c' '-stutter-deadlock'
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/LTL8112338...245
Read 1 LTL properties
Checking formula 0 : !((F(G((!(("(u2.p84>=2)")U("(u2.p84<2)")))||(G("(u2.p84<2)"))))))
Formula 0 simplified : !FG(!("(u2.p84>=2)" U "(u2.p84<2)") | G"(u2.p84<2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8126031904126302440
[2022-05-19 13:07:06] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8126031904126302440
Running compilation step : cd /tmp/ltsmin8126031904126302440;'/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 82 ms.
Running link step : cd /tmp/ltsmin8126031904126302440;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8126031904126302440;'/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' '<>([]((!((LTLAPp0==true) U !(LTLAPp0==true))||[](!(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-09 finished in 77789 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 55/55 transitions.
Graph (complete) has 67 edges and 47 vertex of which 27 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 26 transition count 37
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 23 transition count 34
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 23 transition count 34
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 19 transition count 30
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 19 transition count 30
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 14 transition count 25
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 14 transition count 25
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 44 place count 14 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 24 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 12 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 12 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 11 transition count 16
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 51 place count 10 transition count 15
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 10 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 53 place count 10 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 54 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 55 place count 9 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 56 place count 9 transition count 12
Applied a total of 56 rules in 11 ms. Remains 9 /47 variables (removed 38) and now considering 12/55 (removed 43) transitions.
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:07:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:07:21] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:07:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:07:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-19 13:07:21] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-05-19 13:07:21] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:07:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:07:21] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/47 places, 12/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/47 places, 12/55 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-12 finished in 271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 55/55 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 32 transition count 40
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 30 transition count 38
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 30 transition count 38
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 28 transition count 36
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 28 transition count 36
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 26 transition count 34
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 26 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 26 transition count 32
Applied a total of 44 rules in 3 ms. Remains 26 /47 variables (removed 21) and now considering 32/55 (removed 23) transitions.
[2022-05-19 13:07:21] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 26 cols
[2022-05-19 13:07:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:07:22] [INFO ] Implicit Places using invariants in 404 ms returned []
[2022-05-19 13:07:22] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 26 cols
[2022-05-19 13:07:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:07:22] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-19 13:07:22] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2022-05-19 13:07:22] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 26 cols
[2022-05-19 13:07:22] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:07:22] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 26/47 places, 32/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/47 places, 32/55 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p0:(LEQ 1 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 0 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-13 finished in 739 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(((X(p0) U p1)&&p2))||G(!p2)))'
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 55/55 transitions.
Graph (complete) has 67 edges and 47 vertex of which 30 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 29 transition count 40
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 26 transition count 37
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 26 transition count 37
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 22 transition count 33
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 22 transition count 33
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 17 transition count 28
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 17 transition count 28
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 41 place count 17 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 17 transition count 21
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 24 edges and 16 vertex of which 15 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 45 place count 15 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 15 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 14 transition count 19
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 13 transition count 18
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 13 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 50 place count 13 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 51 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 52 place count 12 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 53 place count 12 transition count 15
Applied a total of 53 rules in 20 ms. Remains 12 /47 variables (removed 35) and now considering 15/55 (removed 40) transitions.
// Phase 1: matrix 15 rows 12 cols
[2022-05-19 13:07:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:07:22] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 15 rows 12 cols
[2022-05-19 13:07:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:07:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-19 13:07:22] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-19 13:07:22] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 15 rows 12 cols
[2022-05-19 13:07:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:07:22] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/47 places, 15/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/47 places, 15/55 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) p2), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GT s6 s7), p1:(LEQ 2 s9), p0:(LEQ 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-14 finished in 351 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(X(F(G(p0))))&&F(p1)))))'
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 55/55 transitions.
Graph (complete) has 67 edges and 47 vertex of which 28 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 27 transition count 38
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 25 transition count 36
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 25 transition count 36
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 22 transition count 33
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 22 transition count 33
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 18 transition count 29
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 18 transition count 29
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 36 place count 18 transition count 25
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 18 transition count 22
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 29 edges and 17 vertex of which 16 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 41 place count 16 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 16 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 15 transition count 20
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 44 place count 14 transition count 19
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 14 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 46 place count 14 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 47 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 48 place count 13 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 49 place count 13 transition count 16
Applied a total of 49 rules in 7 ms. Remains 13 /47 variables (removed 34) and now considering 16/55 (removed 39) transitions.
// Phase 1: matrix 16 rows 13 cols
[2022-05-19 13:07:23] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:07:23] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 16 rows 13 cols
[2022-05-19 13:07:23] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:07:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 13:07:23] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-19 13:07:23] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 16 rows 13 cols
[2022-05-19 13:07:23] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:07:23] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/47 places, 16/55 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/47 places, 16/55 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s4), p1:(LEQ s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-15 finished in 273 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!(p0 U !p0)||G(!p0)))))'
[2022-05-19 13:07:23] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14280718083723584637
[2022-05-19 13:07:23] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2022-05-19 13:07:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:07:23] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2022-05-19 13:07:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:07:23] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2022-05-19 13:07:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:07:23] [INFO ] Applying decomposition
[2022-05-19 13:07:23] [INFO ] Flatten gal took : 3 ms
[2022-05-19 13:07:23] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14280718083723584637
Running compilation step : cd /tmp/ltsmin14280718083723584637;'/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'
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/graph6323079880641221030.txt' '-o' '/tmp/graph6323079880641221030.bin' '-w' '/tmp/graph6323079880641221030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6323079880641221030.bin' '-l' '-1' '-v' '-w' '/tmp/graph6323079880641221030.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:07:23] [INFO ] Decomposing Gal with order
[2022-05-19 13:07:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:07:23] [INFO ] Removed a total of 12 redundant transitions.
[2022-05-19 13:07:23] [INFO ] Flatten gal took : 11 ms
[2022-05-19 13:07:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 1 ms.
[2022-05-19 13:07:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality3887306487188183013.gal : 1 ms
[2022-05-19 13:07:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality11369253414142861941.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/LTLCardinality3887306487188183013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11369253414142861941.ltl' '-c' '-stutter-deadlock'
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...268
Read 1 LTL properties
Checking formula 0 : !((F(G((!(("(u8.p84>=2)")U("(u8.p84<2)")))||(G("(u8.p84<2)"))))))
Formula 0 simplified : !FG(!("(u8.p84>=2)" U "(u8.p84<2)") | G"(u8.p84<2)")
Compilation finished in 192 ms.
Running link step : cd /tmp/ltsmin14280718083723584637;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14280718083723584637;'/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' '--ltl' '<>([]((!((LTLAPp0==true) U !(LTLAPp0==true))||[](!(LTLAPp0==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Initializing POR dependencies: labels 56, guards 55
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: LTL layer: formula: <>([]((!((LTLAPp0==true) U !(LTLAPp0==true))||[](!(LTLAPp0==true)))))
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: "<>([]((!((LTLAPp0==true) U !(LTLAPp0==true))||[](!(LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.025: There are 57 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.025: State length is 48, there are 61 groups
pins2lts-mc-linux64( 0/ 8), 0.025: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.025: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.025: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.025: Visible groups: 0 / 61, labels: 1 / 57
pins2lts-mc-linux64( 0/ 8), 0.025: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.025: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.035: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 0/ 8), 0.047: [Blue] ~240 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 6/ 8), 0.075: [Blue] ~480 levels ~3840 states ~3840 transitions
pins2lts-mc-linux64( 7/ 8), 0.146: [Blue] ~960 levels ~7680 states ~7680 transitions
pins2lts-mc-linux64( 1/ 8), 0.395: [Blue] ~1920 levels ~15360 states ~15360 transitions
pins2lts-mc-linux64( 3/ 8), 0.937: [Blue] ~3840 levels ~30720 states ~30720 transitions
pins2lts-mc-linux64( 0/ 8), 1.938: [Blue] ~7680 levels ~122880 states ~61440 transitions
pins2lts-mc-linux64( 3/ 8), 1.937: [Blue] ~7680 levels ~61440 states ~61440 transitions
pins2lts-mc-linux64( 0/ 8), 4.313: [Blue] ~30720 levels ~245760 states ~245760 transitions
pins2lts-mc-linux64( 6/ 8), 6.233: [Blue] ~61440 levels ~491520 states ~491520 transitions
pins2lts-mc-linux64( 6/ 8), 10.360: [Blue] ~122880 levels ~983040 states ~983040 transitions
pins2lts-mc-linux64( 0/ 8), 17.483: [Blue] ~245760 levels ~1966080 states ~1966080 transitions
pins2lts-mc-linux64( 7/ 8), 32.210: [Blue] ~491520 levels ~3932160 states ~3932160 transitions
pins2lts-mc-linux64( 0/ 8), 60.177: [Blue] ~983040 levels ~7864320 states ~7864320 transitions
pins2lts-mc-linux64( 6/ 8), 90.910: [Blue] ~1966080 levels ~15728640 states ~15728640 transitions
pins2lts-mc-linux64( 6/ 8), 129.421: [Blue] ~3932160 levels ~31457280 states ~31457280 transitions
pins2lts-mc-linux64( 2/ 8), 227.548: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 227.572:
pins2lts-mc-linux64( 0/ 8), 227.572: Explored 58847694 states 58847694 transitions, fanout: 1.000
pins2lts-mc-linux64( 0/ 8), 227.572: Total exploration time 227.540 sec (227.510 sec minimum, 227.518 sec on average)
pins2lts-mc-linux64( 0/ 8), 227.572: States per second: 258626, Transitions per second: 258626
pins2lts-mc-linux64( 0/ 8), 227.572:
pins2lts-mc-linux64( 0/ 8), 227.572: State space has 7356009 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 227.572: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 227.572: blue states: 58847694 (799.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 227.572: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 227.572: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 227.572:
pins2lts-mc-linux64( 0/ 8), 227.572: Total memory used for local state coloring: 897.9MB
pins2lts-mc-linux64( 0/ 8), 227.572:
pins2lts-mc-linux64( 0/ 8), 227.572: Queue width: 8B, total height: 58847694, memory: 448.97MB
pins2lts-mc-linux64( 0/ 8), 227.572: Tree memory: 312.1MB, 44.5 B/state, compr.: 22.9%
pins2lts-mc-linux64( 0/ 8), 227.573: Tree fill ratio (roots/leafs): 5.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 227.573: Stored 56 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 227.573: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 227.573: Est. total memory use: 761.1MB (~1473.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14280718083723584637;'/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' '--ltl' '<>([]((!((LTLAPp0==true) U !(LTLAPp0==true))||[](!(LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14280718083723584637;'/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' '--ltl' '<>([]((!((LTLAPp0==true) U !(LTLAPp0==true))||[](!(LTLAPp0==true)))))' '--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.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:27:51] [INFO ] Flatten gal took : 9 ms
[2022-05-19 13:27:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality15736744402084579051.gal : 1 ms
[2022-05-19 13:27:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality9824593290074764789.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/LTLCardinality15736744402084579051.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9824593290074764789.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 : !((F(G((!(("(p84>=2)")U("(p84<2)")))||(G("(p84<2)"))))))
Formula 0 simplified : !FG(!("(p84>=2)" U "(p84<2)") | G"(p84<2)")
Detected timeout of ITS tools.
[2022-05-19 13:48:20] [INFO ] Flatten gal took : 4 ms
[2022-05-19 13:48:20] [INFO ] Input system was already deterministic with 55 transitions.
[2022-05-19 13:48:20] [INFO ] Transformed 47 places.
[2022-05-19 13:48:20] [INFO ] Transformed 55 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 13:48:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality12352937532118089059.gal : 1 ms
[2022-05-19 13:48:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality14848185961480690060.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/LTLCardinality12352937532118089059.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14848185961480690060.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...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G((!(("(p84>=2)")U("(p84<2)")))||(G("(p84<2)"))))))
Formula 0 simplified : !FG(!("(p84>=2)" U "(p84<2)") | G"(p84<2)")
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-S128P09"
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-S128P09, 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-165281599200387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S128P09.tgz
mv SemanticWebServices-PT-S128P09 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 '
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 ;