Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 02:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 12 02:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 02:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 02:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 261K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-00
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-01
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-02
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-03
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-04
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-05
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-06
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-07
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-08
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-09
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-10
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-11
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-12
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-13
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-14
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716886760861

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S128P18
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 08:59:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 08:59:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 08:59:22] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-28 08:59:22] [INFO ] Transformed 184 places.
[2024-05-28 08:59:22] [INFO ] Transformed 466 transitions.
[2024-05-28 08:59:22] [INFO ] Parsed PT model containing 184 places and 466 transitions and 1873 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 269 transitions
Reduce redundant transitions removed 269 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 195/195 transitions.
Ensure Unique test removed 44 places
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 106 transition count 113
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 167 place count 97 transition count 104
Iterating global reduction 1 with 9 rules applied. Total rules applied 176 place count 97 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 178 place count 97 transition count 102
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 183 place count 92 transition count 97
Iterating global reduction 2 with 5 rules applied. Total rules applied 188 place count 92 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 191 place count 89 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 194 place count 89 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 196 place count 87 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 198 place count 87 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 200 place count 85 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 202 place count 85 transition count 90
Applied a total of 202 rules in 37 ms. Remains 85 /182 variables (removed 97) and now considering 90/195 (removed 105) transitions.
[2024-05-28 08:59:22] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
// Phase 1: matrix 81 rows 85 cols
[2024-05-28 08:59:22] [INFO ] Computed 6 invariants in 8 ms
[2024-05-28 08:59:23] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-28 08:59:23] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2024-05-28 08:59:23] [INFO ] Invariant cache hit.
[2024-05-28 08:59:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 08:59:23] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-28 08:59:23] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2024-05-28 08:59:23] [INFO ] Invariant cache hit.
[2024-05-28 08:59:23] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/182 places, 90/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 85/182 places, 90/195 transitions.
Support contains 15 out of 85 places after structural reductions.
[2024-05-28 08:59:23] [INFO ] Flatten gal took : 19 ms
[2024-05-28 08:59:23] [INFO ] Flatten gal took : 9 ms
[2024-05-28 08:59:23] [INFO ] Input system was already deterministic with 90 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 08:59:23] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2024-05-28 08:59:23] [INFO ] Invariant cache hit.
[2024-05-28 08:59:23] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 90/90 transitions.
Graph (complete) has 189 edges and 85 vertex of which 79 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 5 places
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 69 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 69 transition count 82
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 17 place count 63 transition count 76
Iterating global reduction 0 with 6 rules applied. Total rules applied 23 place count 63 transition count 76
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 29 place count 57 transition count 70
Iterating global reduction 0 with 6 rules applied. Total rules applied 35 place count 57 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 36 place count 57 transition count 69
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 51 transition count 63
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 51 transition count 63
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 47 transition count 59
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 47 transition count 59
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 43 transition count 55
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 43 transition count 55
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 38 transition count 50
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 38 transition count 50
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 34 transition count 46
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 34 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 86 place count 34 transition count 42
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 34 transition count 40
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 67 edges and 33 vertex of which 32 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 90 place count 32 transition count 39
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 32 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 31 transition count 38
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 30 transition count 37
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 30 transition count 37
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 29 transition count 36
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 29 transition count 36
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 28 transition count 35
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 27 transition count 34
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 27 transition count 34
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 26 transition count 33
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 26 transition count 33
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 25 transition count 32
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 25 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 105 place count 25 transition count 31
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 25 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 107 place count 24 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 108 place count 24 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 109 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 110 place count 22 transition count 28
Iterating global reduction 7 with 1 rules applied. Total rules applied 111 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 112 place count 21 transition count 27
Iterating global reduction 7 with 1 rules applied. Total rules applied 113 place count 21 transition count 27
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 114 place count 20 transition count 26
Iterating global reduction 7 with 1 rules applied. Total rules applied 115 place count 20 transition count 26
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 116 place count 19 transition count 25
Iterating global reduction 7 with 1 rules applied. Total rules applied 117 place count 19 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 118 place count 19 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 119 place count 19 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 120 place count 18 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 121 place count 18 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 122 place count 17 transition count 22
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 123 place count 16 transition count 21
Iterating global reduction 10 with 1 rules applied. Total rules applied 124 place count 16 transition count 21
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 126 place count 14 transition count 19
Iterating global reduction 10 with 2 rules applied. Total rules applied 128 place count 14 transition count 19
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 130 place count 14 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 131 place count 14 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 132 place count 13 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 133 place count 13 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 134 place count 12 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 135 place count 12 transition count 14
Applied a total of 135 rules in 55 ms. Remains 12 /85 variables (removed 73) and now considering 14/90 (removed 76) transitions.
// Phase 1: matrix 14 rows 12 cols
[2024-05-28 08:59:23] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 08:59:23] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 08:59:23] [INFO ] Invariant cache hit.
[2024-05-28 08:59:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-28 08:59:23] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-28 08:59:23] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-28 08:59:23] [INFO ] Invariant cache hit.
[2024-05-28 08:59:23] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/85 places, 14/90 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 12/85 places, 14/90 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 146 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-00 finished in 358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 90/90 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 81 transition count 90
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 77 transition count 86
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 77 transition count 86
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 73 transition count 82
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 73 transition count 82
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 69 transition count 78
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 69 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 69 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 66 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 66 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 64 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 64 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 63 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 63 transition count 71
Applied a total of 41 rules in 12 ms. Remains 63 /85 variables (removed 22) and now considering 71/90 (removed 19) transitions.
[2024-05-28 08:59:24] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
// Phase 1: matrix 63 rows 63 cols
[2024-05-28 08:59:24] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 08:59:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 08:59:24] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
[2024-05-28 08:59:24] [INFO ] Invariant cache hit.
[2024-05-28 08:59:24] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-28 08:59:24] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-28 08:59:24] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
[2024-05-28 08:59:24] [INFO ] Invariant cache hit.
[2024-05-28 08:59:24] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/85 places, 71/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 63/85 places, 71/90 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s6 1) (LT s41 1)), p0:(AND (GEQ s6 1) (GEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-01 finished in 302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1)))))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 90/90 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 80 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 8 place count 77 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 77 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 74 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 74 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 71 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 71 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 71 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 69 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 69 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 67 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 67 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 66 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 66 transition count 75
Applied a total of 34 rules in 10 ms. Remains 66 /85 variables (removed 19) and now considering 75/90 (removed 15) transitions.
[2024-05-28 08:59:24] [INFO ] Flow matrix only has 67 transitions (discarded 8 similar events)
// Phase 1: matrix 67 rows 66 cols
[2024-05-28 08:59:24] [INFO ] Computed 1 invariants in 2 ms
[2024-05-28 08:59:24] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-28 08:59:24] [INFO ] Flow matrix only has 67 transitions (discarded 8 similar events)
[2024-05-28 08:59:24] [INFO ] Invariant cache hit.
[2024-05-28 08:59:24] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 08:59:24] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-28 08:59:24] [INFO ] Flow matrix only has 67 transitions (discarded 8 similar events)
[2024-05-28 08:59:24] [INFO ] Invariant cache hit.
[2024-05-28 08:59:24] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/85 places, 75/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 66/85 places, 75/90 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-04 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LT s16 1), p1:(LT s21 1)], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 266 ms.
Entered a terminal (fully accepting) state of product in 267 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-04 finished in 691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 90/90 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 80 transition count 90
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 9 place count 76 transition count 86
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 76 transition count 86
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 72 transition count 82
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 72 transition count 82
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 68 transition count 78
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 68 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 68 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 65 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 65 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 63 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 63 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 62 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 62 transition count 71
Applied a total of 42 rules in 7 ms. Remains 62 /85 variables (removed 23) and now considering 71/90 (removed 19) transitions.
[2024-05-28 08:59:25] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
// Phase 1: matrix 63 rows 62 cols
[2024-05-28 08:59:25] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 08:59:25] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-28 08:59:25] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
[2024-05-28 08:59:25] [INFO ] Invariant cache hit.
[2024-05-28 08:59:25] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-28 08:59:25] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-28 08:59:25] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
[2024-05-28 08:59:25] [INFO ] Invariant cache hit.
[2024-05-28 08:59:25] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/85 places, 71/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 62/85 places, 71/90 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LT s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 147 steps with 36 reset in 3 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-10 finished in 272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p0)&&G((G(p1)||!(!p1 U p0))))))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 90/90 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 81 transition count 90
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 77 transition count 86
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 77 transition count 86
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 73 transition count 82
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 73 transition count 82
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 69 transition count 78
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 69 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 69 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 66 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 66 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 64 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 64 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 63 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 63 transition count 71
Applied a total of 41 rules in 10 ms. Remains 63 /85 variables (removed 22) and now considering 71/90 (removed 19) transitions.
[2024-05-28 08:59:25] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
// Phase 1: matrix 63 rows 63 cols
[2024-05-28 08:59:25] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 08:59:25] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 08:59:25] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
[2024-05-28 08:59:25] [INFO ] Invariant cache hit.
[2024-05-28 08:59:25] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-28 08:59:25] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-28 08:59:25] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
[2024-05-28 08:59:25] [INFO ] Invariant cache hit.
[2024-05-28 08:59:25] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/85 places, 71/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 63/85 places, 71/90 transitions.
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(OR p1 (NOT p0)), acceptance={0, 1, 2} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=2 dest: 4}, { cond=(OR p1 (NOT p0)), acceptance={0, 1} source=2 dest: 5}, { cond=(AND p1 p0), acceptance={0, 2} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=3 dest: 4}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={0, 1} source=4 dest: 5}, { cond=(AND p1 p0), acceptance={0, 2} source=4 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=5 dest: 4}, { cond=(OR p1 (NOT p0)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={0, 2} source=5 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 p0), acceptance={0, 2} source=6 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=6 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=7 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=7 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={0} source=7 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=8 dest: 2}, { cond=(AND p1 p0), acceptance={0, 2} source=8 dest: 6}]], initial=0, aps=[p1:(LT s7 1), p0:(AND (GEQ s6 1) (GEQ s49 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-11 finished in 583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F(p1))))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 90/90 transitions.
Graph (complete) has 189 edges and 85 vertex of which 79 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 70 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 70 transition count 82
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 65 transition count 77
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 65 transition count 77
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 24 place count 60 transition count 72
Iterating global reduction 0 with 5 rules applied. Total rules applied 29 place count 60 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 60 transition count 71
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 55 transition count 66
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 55 transition count 66
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 51 transition count 62
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 51 transition count 62
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 47 transition count 58
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 47 transition count 58
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 42 transition count 53
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 42 transition count 53
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 39 transition count 50
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 39 transition count 50
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 75 place count 39 transition count 47
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 39 transition count 44
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 76 edges and 38 vertex of which 37 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 80 place count 37 transition count 43
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 37 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 36 transition count 42
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 35 transition count 41
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 35 transition count 41
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 34 transition count 40
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 34 transition count 40
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 33 transition count 39
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 33 transition count 39
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 32 transition count 38
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 32 transition count 38
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 31 transition count 37
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 31 transition count 37
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 30 transition count 36
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 30 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 30 transition count 35
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 96 place count 30 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 97 place count 29 transition count 34
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 98 place count 29 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 99 place count 28 transition count 33
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 100 place count 28 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 101 place count 27 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 102 place count 27 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 103 place count 26 transition count 31
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 104 place count 25 transition count 30
Iterating global reduction 9 with 1 rules applied. Total rules applied 105 place count 25 transition count 30
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 107 place count 23 transition count 28
Iterating global reduction 9 with 2 rules applied. Total rules applied 109 place count 23 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 111 place count 23 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 112 place count 23 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 113 place count 22 transition count 25
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 115 place count 22 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 116 place count 21 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 117 place count 21 transition count 22
Applied a total of 117 rules in 28 ms. Remains 21 /85 variables (removed 64) and now considering 22/90 (removed 68) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-05-28 08:59:25] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 08:59:25] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 08:59:25] [INFO ] Invariant cache hit.
[2024-05-28 08:59:26] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-28 08:59:26] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-28 08:59:26] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-28 08:59:26] [INFO ] Invariant cache hit.
[2024-05-28 08:59:26] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/85 places, 22/90 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 21/85 places, 22/90 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s20 1) (GEQ s5 1)), p1:(AND (GEQ s1 1) (GEQ s20 1))], 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 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-12 finished in 232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 90/90 transitions.
Graph (complete) has 189 edges and 85 vertex of which 79 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 70 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 70 transition count 82
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 65 transition count 77
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 65 transition count 77
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 24 place count 60 transition count 72
Iterating global reduction 0 with 5 rules applied. Total rules applied 29 place count 60 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 60 transition count 71
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 55 transition count 66
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 55 transition count 66
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 52 transition count 63
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 52 transition count 63
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 48 transition count 59
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 48 transition count 59
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 44 transition count 55
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 44 transition count 55
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 41 transition count 52
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 41 transition count 52
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 71 place count 41 transition count 49
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 41 transition count 47
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 84 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 39 transition count 46
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 39 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 38 transition count 44
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 37 transition count 43
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 37 transition count 43
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 36 transition count 42
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 36 transition count 42
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 35 transition count 41
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 35 transition count 41
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 34 transition count 40
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 34 transition count 40
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 33 transition count 39
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 33 transition count 39
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 32 transition count 38
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 32 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 32 transition count 37
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 92 place count 32 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 93 place count 31 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 94 place count 31 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 95 place count 30 transition count 35
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 96 place count 29 transition count 34
Iterating global reduction 7 with 1 rules applied. Total rules applied 97 place count 29 transition count 34
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 98 place count 28 transition count 33
Iterating global reduction 7 with 1 rules applied. Total rules applied 99 place count 28 transition count 33
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 100 place count 27 transition count 32
Iterating global reduction 7 with 1 rules applied. Total rules applied 101 place count 27 transition count 32
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 102 place count 26 transition count 31
Iterating global reduction 7 with 1 rules applied. Total rules applied 103 place count 26 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 104 place count 26 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 105 place count 26 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 106 place count 25 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 107 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 108 place count 24 transition count 28
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 109 place count 23 transition count 27
Iterating global reduction 10 with 1 rules applied. Total rules applied 110 place count 23 transition count 27
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 112 place count 21 transition count 25
Iterating global reduction 10 with 2 rules applied. Total rules applied 114 place count 21 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 116 place count 21 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 117 place count 21 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 118 place count 20 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 119 place count 20 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 120 place count 19 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 121 place count 19 transition count 20
Applied a total of 121 rules in 28 ms. Remains 19 /85 variables (removed 66) and now considering 20/90 (removed 70) transitions.
// Phase 1: matrix 20 rows 19 cols
[2024-05-28 08:59:26] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 08:59:26] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-28 08:59:26] [INFO ] Invariant cache hit.
[2024-05-28 08:59:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-28 08:59:26] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-28 08:59:26] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-28 08:59:26] [INFO ] Invariant cache hit.
[2024-05-28 08:59:26] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/85 places, 20/90 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 19/85 places, 20/90 transitions.
Stuttering acceptance computed with spot in 41 ms :[p0]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s14 1))], 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 70 ms.
Product exploration explored 100000 steps with 0 reset in 74 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[p0]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[p0]
Stuttering acceptance computed with spot in 36 ms :[p0]
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-28 08:59:26] [INFO ] Invariant cache hit.
[2024-05-28 08:59:26] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 08:59:26] [INFO ] Invariant cache hit.
[2024-05-28 08:59:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-28 08:59:26] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-28 08:59:26] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 08:59:26] [INFO ] Invariant cache hit.
[2024-05-28 08:59:26] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 19/19 places, 20/20 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[p0]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[p0]
Stuttering acceptance computed with spot in 29 ms :[p0]
Stuttering acceptance computed with spot in 50 ms :[p0]
Product exploration explored 100000 steps with 0 reset in 36 ms.
Product exploration explored 100000 steps with 0 reset in 352 ms.
Built C files in :
/tmp/ltsmin1810266651069463695
[2024-05-28 08:59:27] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2024-05-28 08:59:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:59:27] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2024-05-28 08:59:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:59:27] [INFO ] Computing Do-Not-Accords matrix : 20 transitions.
[2024-05-28 08:59:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:59:27] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1810266651069463695
Running compilation step : cd /tmp/ltsmin1810266651069463695;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 183 ms.
Running link step : cd /tmp/ltsmin1810266651069463695;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1810266651069463695;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7191306220320872349.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-28 08:59:42] [INFO ] Invariant cache hit.
[2024-05-28 08:59:42] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-28 08:59:42] [INFO ] Invariant cache hit.
[2024-05-28 08:59:42] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-28 08:59:42] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-28 08:59:42] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-28 08:59:42] [INFO ] Invariant cache hit.
[2024-05-28 08:59:42] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 19/19 places, 20/20 transitions.
Built C files in :
/tmp/ltsmin18212513335971075181
[2024-05-28 08:59:42] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2024-05-28 08:59:42] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:59:42] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2024-05-28 08:59:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:59:42] [INFO ] Computing Do-Not-Accords matrix : 20 transitions.
[2024-05-28 08:59:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:59:42] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18212513335971075181
Running compilation step : cd /tmp/ltsmin18212513335971075181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 97 ms.
Running link step : cd /tmp/ltsmin18212513335971075181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18212513335971075181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10519669706273489966.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 08:59:57] [INFO ] Flatten gal took : 5 ms
[2024-05-28 08:59:57] [INFO ] Flatten gal took : 1 ms
[2024-05-28 08:59:58] [INFO ] Time to serialize gal into /tmp/LTL11870640617416420274.gal : 1 ms
[2024-05-28 08:59:58] [INFO ] Time to serialize properties into /tmp/LTL8553327374477763929.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11870640617416420274.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17668999614760847247.hoa' '-atoms' '/tmp/LTL8553327374477763929.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8553327374477763929.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17668999614760847247.hoa
Detected timeout of ITS tools.
[2024-05-28 09:00:13] [INFO ] Flatten gal took : 2 ms
[2024-05-28 09:00:13] [INFO ] Flatten gal took : 1 ms
[2024-05-28 09:00:13] [INFO ] Time to serialize gal into /tmp/LTL825285728314918414.gal : 1 ms
[2024-05-28 09:00:13] [INFO ] Time to serialize properties into /tmp/LTL13755830895838660992.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL825285728314918414.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13755830895838660992.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((p14<1)||(p164<1))"))))
Formula 0 simplified : GF!"((p14<1)||(p164<1))"
Detected timeout of ITS tools.
[2024-05-28 09:00:28] [INFO ] Flatten gal took : 4 ms
[2024-05-28 09:00:28] [INFO ] Applying decomposition
[2024-05-28 09:00:28] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13664730493876126120.txt' '-o' '/tmp/graph13664730493876126120.bin' '-w' '/tmp/graph13664730493876126120.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13664730493876126120.bin' '-l' '-1' '-v' '-w' '/tmp/graph13664730493876126120.weights' '-q' '0' '-e' '0.001'
[2024-05-28 09:00:28] [INFO ] Decomposing Gal with order
[2024-05-28 09:00:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:00:28] [INFO ] Flatten gal took : 24 ms
[2024-05-28 09:00:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 09:00:28] [INFO ] Time to serialize gal into /tmp/LTL15208364747407598418.gal : 2 ms
[2024-05-28 09:00:28] [INFO ] Time to serialize properties into /tmp/LTL7196523902766096143.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15208364747407598418.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7196523902766096143.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((u6.p14<1)||(u6.p164<1))"))))
Formula 0 simplified : GF!"((u6.p14<1)||(u6.p164<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17752374539321348661
[2024-05-28 09:00:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17752374539321348661
Running compilation step : cd /tmp/ltsmin17752374539321348661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 76 ms.
Running link step : cd /tmp/ltsmin17752374539321348661;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17752374539321348661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 2/ 8), 0.001: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.014: State length is 20, there are 24 groups
pins2lts-mc-linux64( 0/ 8), 0.014: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.014: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.014: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.014: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.099: [Blue] ~120 levels ~960 states ~3752 transitions
pins2lts-mc-linux64( 5/ 8), 0.149: [Blue] ~240 levels ~1920 states ~7592 transitions
pins2lts-mc-linux64( 5/ 8), 0.247: [Blue] ~480 levels ~3840 states ~15272 transitions
pins2lts-mc-linux64( 5/ 8), 0.326: [Blue] ~960 levels ~7680 states ~30632 transitions
pins2lts-mc-linux64( 5/ 8), 0.483: [Blue] ~1920 levels ~15360 states ~61352 transitions
pins2lts-mc-linux64( 5/ 8), 0.689: [Blue] ~3840 levels ~30720 states ~122792 transitions
pins2lts-mc-linux64( 5/ 8), 0.954: [Blue] ~7680 levels ~61440 states ~245672 transitions
pins2lts-mc-linux64( 5/ 8), 1.269: [Blue] ~15360 levels ~122880 states ~491432 transitions
pins2lts-mc-linux64( 5/ 8), 1.586: [Blue] ~30720 levels ~245760 states ~982952 transitions
pins2lts-mc-linux64( 5/ 8), 1.870: [Blue] ~61440 levels ~491520 states ~1965992 transitions
pins2lts-mc-linux64( 5/ 8), 2.307: [Blue] ~122880 levels ~983040 states ~3932072 transitions
pins2lts-mc-linux64( 5/ 8), 3.183: [Blue] ~245760 levels ~1966080 states ~7864232 transitions
pins2lts-mc-linux64( 5/ 8), 5.006: [Blue] ~491520 levels ~3932160 states ~15728552 transitions
pins2lts-mc-linux64( 3/ 8), 9.596: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 9.699:
pins2lts-mc-linux64( 0/ 8), 9.699: Explored 3967164 states 28356265 transitions, fanout: 7.148
pins2lts-mc-linux64( 0/ 8), 9.699: Total exploration time 9.660 sec (9.570 sec minimum, 9.614 sec on average)
pins2lts-mc-linux64( 0/ 8), 9.699: States per second: 410680, Transitions per second: 2935431
pins2lts-mc-linux64( 0/ 8), 9.699:
pins2lts-mc-linux64( 0/ 8), 9.699: State space has 23573253 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 9.699: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 9.699: blue states: 3967164 (16.83%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 9.699: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 9.699: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 9.699:
pins2lts-mc-linux64( 0/ 8), 9.700: Total memory used for local state coloring: 60.5MB
pins2lts-mc-linux64( 0/ 8), 9.700:
pins2lts-mc-linux64( 0/ 8), 9.700: Queue width: 8B, total height: 3967161, memory: 30.27MB
pins2lts-mc-linux64( 0/ 8), 9.700: Tree memory: 435.8MB, 19.4 B/state, compr.: 23.6%
pins2lts-mc-linux64( 0/ 8), 9.700: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 9.700: Stored 20 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 9.700: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 9.700: Est. total memory use: 466.1MB (~1054.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17752374539321348661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17752374539321348661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property SemanticWebServices-PT-S128P18-LTLFireability-13 finished in 87015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
[2024-05-28 09:00:53] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13087895776899535930
[2024-05-28 09:00:53] [INFO ] Applying decomposition
[2024-05-28 09:00:53] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-28 09:00:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:00:53] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-28 09:00:53] [INFO ] Flatten gal took : 3 ms
[2024-05-28 09:00:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:00:53] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-28 09:00:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:00:53] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13087895776899535930
Running compilation step : cd /tmp/ltsmin13087895776899535930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18084531737911511534.txt' '-o' '/tmp/graph18084531737911511534.bin' '-w' '/tmp/graph18084531737911511534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18084531737911511534.bin' '-l' '-1' '-v' '-w' '/tmp/graph18084531737911511534.weights' '-q' '0' '-e' '0.001'
[2024-05-28 09:00:53] [INFO ] Decomposing Gal with order
[2024-05-28 09:00:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:00:53] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-28 09:00:53] [INFO ] Flatten gal took : 18 ms
[2024-05-28 09:00:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-28 09:00:53] [INFO ] Time to serialize gal into /tmp/LTLFireability3331571163765170980.gal : 2 ms
[2024-05-28 09:00:53] [INFO ] Time to serialize properties into /tmp/LTLFireability6908352748385261084.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3331571163765170980.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6908352748385261084.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(!("((i5.u21.p14>=1)&&(i5.u21.p164>=1))")))))
Formula 0 simplified : GF"((i5.u21.p14>=1)&&(i5.u21.p164>=1))"
Compilation finished in 169 ms.
Running link step : cd /tmp/ltsmin13087895776899535930;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13087895776899535930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](!(LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.042: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.042: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.220: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.219: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.227: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.234: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.234: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.235: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.227: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.239: Initializing POR dependencies: labels 91, guards 90
pins2lts-mc-linux64( 2/ 8), 0.242: LTL layer: formula: <>([](!(LTLAPp0==true)))
pins2lts-mc-linux64( 2/ 8), 0.242: "<>([](!(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.242: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.235: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.269: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.276: There are 92 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.276: State length is 86, there are 94 groups
pins2lts-mc-linux64( 0/ 8), 0.276: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.276: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.276: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.276: Visible groups: 0 / 94, labels: 1 / 92
pins2lts-mc-linux64( 0/ 8), 0.276: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.276: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.306: [Blue] ~119 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 1/ 8), 0.324: [Blue] ~239 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 1/ 8), 0.349: [Blue] ~479 levels ~3840 states ~3840 transitions
pins2lts-mc-linux64( 1/ 8), 0.400: [Blue] ~959 levels ~7680 states ~7680 transitions
pins2lts-mc-linux64( 4/ 8), 0.504: [Blue] ~1920 levels ~15360 states ~15360 transitions
pins2lts-mc-linux64( 1/ 8), 0.645: [Blue] ~3839 levels ~30720 states ~30720 transitions
pins2lts-mc-linux64( 4/ 8), 0.874: [Blue] ~7680 levels ~61440 states ~61440 transitions
pins2lts-mc-linux64( 4/ 8), 1.208: [Blue] ~15360 levels ~122880 states ~122880 transitions
pins2lts-mc-linux64( 4/ 8), 1.689: [Blue] ~30720 levels ~245760 states ~245760 transitions
pins2lts-mc-linux64( 1/ 8), 2.446: [Blue] ~61439 levels ~491520 states ~491520 transitions
pins2lts-mc-linux64( 4/ 8), 3.473: [Blue] ~122880 levels ~983040 states ~983040 transitions
pins2lts-mc-linux64( 1/ 8), 5.234: [Blue] ~245759 levels ~1966080 states ~1966080 transitions
pins2lts-mc-linux64( 4/ 8), 8.588: [Blue] ~491520 levels ~3932160 states ~3932160 transitions
pins2lts-mc-linux64( 4/ 8), 15.618: [Blue] ~983040 levels ~7864320 states ~7864320 transitions
pins2lts-mc-linux64( 5/ 8), 26.136: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 26.399:
pins2lts-mc-linux64( 0/ 8), 26.400: Explored 7155387 states 7155389 transitions, fanout: 1.000
pins2lts-mc-linux64( 0/ 8), 26.400: Total exploration time 26.100 sec (25.860 sec minimum, 25.921 sec on average)
pins2lts-mc-linux64( 0/ 8), 26.400: States per second: 274153, Transitions per second: 274153
pins2lts-mc-linux64( 0/ 8), 26.400:
pins2lts-mc-linux64( 0/ 8), 26.400: State space has 21961365 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 26.400: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 26.400: blue states: 7155387 (32.58%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 26.400: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 26.400: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 26.400:
pins2lts-mc-linux64( 0/ 8), 26.400: Total memory used for local state coloring: 109.2MB
pins2lts-mc-linux64( 0/ 8), 26.400:
pins2lts-mc-linux64( 0/ 8), 26.400: Queue width: 8B, total height: 7155386, memory: 54.59MB
pins2lts-mc-linux64( 0/ 8), 26.400: Tree memory: 423.6MB, 20.2 B/state, compr.: 5.8%
pins2lts-mc-linux64( 0/ 8), 26.400: Tree fill ratio (roots/leafs): 16.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 26.400: Stored 91 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 26.400: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 26.400: Est. total memory use: 478.1MB (~1078.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13087895776899535930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](!(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13087895776899535930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](!(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-28 09:21:23] [INFO ] Flatten gal took : 5 ms
[2024-05-28 09:21:23] [INFO ] Time to serialize gal into /tmp/LTLFireability16455159998528720633.gal : 2 ms
[2024-05-28 09:21:23] [INFO ] Time to serialize properties into /tmp/LTLFireability6840411751277288278.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16455159998528720633.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6840411751277288278.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(G(!("((p14>=1)&&(p164>=1))")))))
Formula 0 simplified : GF"((p14>=1)&&(p164>=1))"
Detected timeout of ITS tools.
[2024-05-28 09:41:54] [INFO ] Flatten gal took : 5 ms
[2024-05-28 09:41:54] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-28 09:41:54] [INFO ] Transformed 85 places.
[2024-05-28 09:41:54] [INFO ] Transformed 90 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2024-05-28 09:41:54] [INFO ] Time to serialize gal into /tmp/LTLFireability11650115870457412155.gal : 2 ms
[2024-05-28 09:41:54] [INFO ] Time to serialize properties into /tmp/LTLFireability193130628243127060.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11650115870457412155.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability193130628243127060.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(!("((p14>=1)&&(p164>=1))")))))
Formula 0 simplified : GF"((p14>=1)&&(p164>=1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8847468 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16042900 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is SemanticWebServices-PT-S128P18, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r351-tall-171679102200353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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