fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r351-tall-171679102100317
Last Updated
July 7, 2024

About the Execution of 2023-gold for SemanticWebServices-PT-S064P12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15202.968 3600000.00 3955246.00 8335.70 TTFFFFFTFT?FFFTT normal

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-171679102100317.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-S064P12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679102100317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 12 02:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 02:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 02:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 117K 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-S064P12-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716879353081

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S064P12
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 06:55:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 06:55:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:55:54] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-28 06:55:54] [INFO ] Transformed 104 places.
[2024-05-28 06:55:54] [INFO ] Transformed 158 transitions.
[2024-05-28 06:55:54] [INFO ] Parsed PT model containing 104 places and 158 transitions and 863 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 77 transitions
Reduce redundant transitions removed 77 transitions.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 79/79 transitions.
Ensure Unique test removed 28 places
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 72 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 68 transition count 75
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 68 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 68 transition count 74
Applied a total of 39 rules in 14 ms. Remains 68 /102 variables (removed 34) and now considering 74/79 (removed 5) transitions.
[2024-05-28 06:55:55] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
// Phase 1: matrix 65 rows 68 cols
[2024-05-28 06:55:55] [INFO ] Computed 5 invariants in 4 ms
[2024-05-28 06:55:55] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-28 06:55:55] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
[2024-05-28 06:55:55] [INFO ] Invariant cache hit.
[2024-05-28 06:55:55] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 06:55:55] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-05-28 06:55:55] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
[2024-05-28 06:55:55] [INFO ] Invariant cache hit.
[2024-05-28 06:55:55] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/102 places, 74/79 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 68/102 places, 74/79 transitions.
Support contains 40 out of 68 places after structural reductions.
[2024-05-28 06:55:55] [INFO ] Flatten gal took : 18 ms
[2024-05-28 06:55:55] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:55:55] [INFO ] Input system was already deterministic with 74 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 28) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 06:55:56] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
[2024-05-28 06:55:56] [INFO ] Invariant cache hit.
[2024-05-28 06:55:56] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-28 06:55:56] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 154 edges and 68 vertex of which 62 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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(p0)))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 74/74 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 64 transition count 74
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 58 transition count 68
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 58 transition count 68
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 53 transition count 63
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 53 transition count 63
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 50 transition count 60
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 50 transition count 60
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 47 transition count 57
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 47 transition count 57
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 46 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 46 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 46 transition count 55
Applied a total of 41 rules in 10 ms. Remains 46 /68 variables (removed 22) and now considering 55/74 (removed 19) transitions.
[2024-05-28 06:55:56] [INFO ] Flow matrix only has 47 transitions (discarded 8 similar events)
// Phase 1: matrix 47 rows 46 cols
[2024-05-28 06:55:56] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 06:55:56] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-28 06:55:56] [INFO ] Flow matrix only has 47 transitions (discarded 8 similar events)
[2024-05-28 06:55:56] [INFO ] Invariant cache hit.
[2024-05-28 06:55:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-28 06:55:56] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-28 06:55:56] [INFO ] Flow matrix only has 47 transitions (discarded 8 similar events)
[2024-05-28 06:55:56] [INFO ] Invariant cache hit.
[2024-05-28 06:55:56] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/68 places, 55/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 213 ms. Remains : 46/68 places, 55/74 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 170 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s45 s27) (LEQ s9 s20) (LEQ 3 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 226 ms.
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 97 edges and 46 vertex of which 40 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-01 finished in 915 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' '!(G(F(p0)))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 74/74 transitions.
Graph (complete) has 154 edges and 68 vertex of which 62 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 50 transition count 63
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 50 transition count 63
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 44 transition count 57
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 44 transition count 57
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 32 place count 39 transition count 52
Iterating global reduction 0 with 5 rules applied. Total rules applied 37 place count 39 transition count 52
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 42 place count 34 transition count 47
Iterating global reduction 0 with 5 rules applied. Total rules applied 47 place count 34 transition count 47
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 52 place count 29 transition count 42
Iterating global reduction 0 with 5 rules applied. Total rules applied 57 place count 29 transition count 42
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 62 place count 29 transition count 37
Applied a total of 62 rules in 14 ms. Remains 29 /68 variables (removed 39) and now considering 37/74 (removed 37) transitions.
[2024-05-28 06:55:57] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 29 cols
[2024-05-28 06:55:57] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 06:55:57] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-28 06:55:57] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-05-28 06:55:57] [INFO ] Invariant cache hit.
[2024-05-28 06:55:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-28 06:55:57] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-28 06:55:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 06:55:57] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-05-28 06:55:57] [INFO ] Invariant cache hit.
[2024-05-28 06:55:57] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/68 places, 37/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 29/68 places, 37/74 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-02 finished in 228 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 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 74/74 transitions.
Graph (complete) has 154 edges and 68 vertex of which 62 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 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 49 transition count 62
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 49 transition count 62
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 23 place count 43 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 29 place count 43 transition count 56
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 34 place count 38 transition count 51
Iterating global reduction 0 with 5 rules applied. Total rules applied 39 place count 38 transition count 51
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 44 place count 33 transition count 46
Iterating global reduction 0 with 5 rules applied. Total rules applied 49 place count 33 transition count 46
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 54 place count 28 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 59 place count 28 transition count 41
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 64 place count 28 transition count 36
Applied a total of 64 rules in 10 ms. Remains 28 /68 variables (removed 40) and now considering 36/74 (removed 38) transitions.
[2024-05-28 06:55:57] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 28 cols
[2024-05-28 06:55:57] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 06:55:57] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 06:55:57] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2024-05-28 06:55:57] [INFO ] Invariant cache hit.
[2024-05-28 06:55:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-28 06:55:57] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-28 06:55:57] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 06:55:57] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2024-05-28 06:55:57] [INFO ] Invariant cache hit.
[2024-05-28 06:55:57] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/68 places, 36/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 28/68 places, 36/74 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s9 s8)], 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 47 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-03 finished in 167 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(G(p0))||G(p1)))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 74/74 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 64 transition count 74
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 11 place count 57 transition count 67
Iterating global reduction 1 with 7 rules applied. Total rules applied 18 place count 57 transition count 67
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 52 transition count 62
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 52 transition count 62
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 49 transition count 59
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 49 transition count 59
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 46 transition count 56
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 46 transition count 56
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 44 transition count 54
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 44 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 44 transition count 52
Applied a total of 46 rules in 8 ms. Remains 44 /68 variables (removed 24) and now considering 52/74 (removed 22) transitions.
[2024-05-28 06:55:57] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
// Phase 1: matrix 45 rows 44 cols
[2024-05-28 06:55:57] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 06:55:57] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-28 06:55:57] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2024-05-28 06:55:57] [INFO ] Invariant cache hit.
[2024-05-28 06:55:57] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-28 06:55:57] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-28 06:55:57] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2024-05-28 06:55:57] [INFO ] Invariant cache hit.
[2024-05-28 06:55:57] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/68 places, 52/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 44/68 places, 52/74 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(GT 2 s39), p0:(GT 2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 191 ms.
Product exploration explored 100000 steps with 0 reset in 328 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 92 edges and 44 vertex of which 38 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 3357 steps, including 1 resets, run visited all 2 properties in 10 ms. (steps per millisecond=335 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-28 06:55:59] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2024-05-28 06:55:59] [INFO ] Invariant cache hit.
[2024-05-28 06:55:59] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 06:55:59] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2024-05-28 06:55:59] [INFO ] Invariant cache hit.
[2024-05-28 06:55:59] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-28 06:55:59] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-28 06:55:59] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2024-05-28 06:55:59] [INFO ] Invariant cache hit.
[2024-05-28 06:55:59] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 44/44 places, 52/52 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 92 edges and 44 vertex of which 38 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 3656 steps, including 1 resets, run visited all 2 properties in 25 ms. (steps per millisecond=146 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 63 ms.
Product exploration explored 100000 steps with 0 reset in 195 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 52/52 transitions.
Graph (complete) has 92 edges and 44 vertex of which 38 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 37 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 37 transition count 48
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 35 transition count 46
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 35 transition count 46
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 10 place count 32 transition count 43
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 32 transition count 43
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 16 place count 29 transition count 40
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 29 transition count 40
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 22 place count 26 transition count 37
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 26 transition count 37
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 28 place count 26 transition count 34
Applied a total of 28 rules in 8 ms. Remains 26 /44 variables (removed 18) and now considering 34/52 (removed 18) transitions.
[2024-05-28 06:56:00] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 06:56:00] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
// Phase 1: matrix 29 rows 26 cols
[2024-05-28 06:56:00] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 06:56:00] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/44 places, 34/52 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39 ms. Remains : 26/44 places, 34/52 transitions.
Built C files in :
/tmp/ltsmin2108088269192965356
[2024-05-28 06:56:00] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2108088269192965356
Running compilation step : cd /tmp/ltsmin2108088269192965356;'/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 186 ms.
Running link step : cd /tmp/ltsmin2108088269192965356;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2108088269192965356;'/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' '--hoa' '/tmp/stateBased9943815714426531474.hoa' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer using automaton file : /tmp/stateBased9943815714426531474.hoa
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: 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( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.020: "(LTLAPp1==true)&&(LTLAPp0==true)" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.030: There are 55 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.030: State length is 45, there are 60 groups
pins2lts-mc-linux64( 0/ 8), 0.030: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.030: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.030: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.030: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.204: [Blue] ~120 levels ~960 states ~10416 transitions
pins2lts-mc-linux64( 3/ 8), 0.352: [Blue] ~240 levels ~1920 states ~20976 transitions
pins2lts-mc-linux64( 3/ 8), 0.614: [Blue] ~480 levels ~3840 states ~42096 transitions
pins2lts-mc-linux64( 3/ 8), 1.040: [Blue] ~960 levels ~7680 states ~84336 transitions
pins2lts-mc-linux64( 3/ 8), 1.567: [Blue] ~1920 levels ~15360 states ~168816 transitions
pins2lts-mc-linux64( 3/ 8), 2.259: [Blue] ~3840 levels ~30720 states ~337776 transitions
pins2lts-mc-linux64( 3/ 8), 3.009: [Blue] ~7680 levels ~61440 states ~675696 transitions
pins2lts-mc-linux64( 3/ 8), 3.737: [Blue] ~15360 levels ~122880 states ~1351536 transitions
pins2lts-mc-linux64( 3/ 8), 4.428: [Blue] ~30720 levels ~245760 states ~2703216 transitions
pins2lts-mc-linux64( 6/ 8), 5.500: [Blue] ~61438 levels ~491520 states ~6881056 transitions
pins2lts-mc-linux64( 6/ 8), 7.372: [Blue] ~122878 levels ~983040 states ~13762336 transitions
pins2lts-mc-linux64( 3/ 8), 12.381: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 12.596:
pins2lts-mc-linux64( 0/ 8), 12.596: Explored 1690463 states 22932808 transitions, fanout: 13.566
pins2lts-mc-linux64( 0/ 8), 12.596: Total exploration time 12.520 sec (12.350 sec minimum, 12.394 sec on average)
pins2lts-mc-linux64( 0/ 8), 12.596: States per second: 135021, Transitions per second: 1831694
pins2lts-mc-linux64( 0/ 8), 12.596:
pins2lts-mc-linux64( 0/ 8), 12.596: State space has 22225079 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 12.596: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 12.596: blue states: 1690463 (7.61%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 12.596: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 12.596: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 12.596:
pins2lts-mc-linux64( 0/ 8), 12.596: Total memory used for local state coloring: 25.8MB
pins2lts-mc-linux64( 0/ 8), 12.596:
pins2lts-mc-linux64( 0/ 8), 12.596: Queue width: 8B, total height: 1690461, memory: 12.90MB
pins2lts-mc-linux64( 0/ 8), 12.596: Tree memory: 425.6MB, 20.1 B/state, compr.: 11.0%
pins2lts-mc-linux64( 0/ 8), 12.596: Tree fill ratio (roots/leafs): 16.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 12.596: Stored 52 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 12.596: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 12.596: Est. total memory use: 438.5MB (~1036.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2108088269192965356;'/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' '--hoa' '/tmp/stateBased9943815714426531474.hoa' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2108088269192965356;'/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' '--hoa' '/tmp/stateBased9943815714426531474.hoa' '--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.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-28 06:56:13] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
// Phase 1: matrix 45 rows 44 cols
[2024-05-28 06:56:13] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 06:56:13] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 06:56:13] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2024-05-28 06:56:13] [INFO ] Invariant cache hit.
[2024-05-28 06:56:13] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-28 06:56:13] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-28 06:56:13] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2024-05-28 06:56:13] [INFO ] Invariant cache hit.
[2024-05-28 06:56:13] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 44/44 places, 52/52 transitions.
Built C files in :
/tmp/ltsmin11610990294595241245
[2024-05-28 06:56:13] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11610990294595241245
Running compilation step : cd /tmp/ltsmin11610990294595241245;'/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 107 ms.
Running link step : cd /tmp/ltsmin11610990294595241245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11610990294595241245;'/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' '--hoa' '/tmp/stateBased5229112451726851798.hoa' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.003: LTL layer using automaton file : /tmp/stateBased5229112451726851798.hoa
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.013: "(LTLAPp1==true)&&(LTLAPp0==true)" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.028: There are 55 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.028: State length is 45, there are 60 groups
pins2lts-mc-linux64( 0/ 8), 0.028: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.028: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.028: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.028: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.081: [Blue] ~120 levels ~960 states ~2968 transitions
pins2lts-mc-linux64( 4/ 8), 0.111: [Blue] ~240 levels ~1920 states ~5848 transitions
pins2lts-mc-linux64( 4/ 8), 0.186: [Blue] ~480 levels ~3840 states ~11608 transitions
pins2lts-mc-linux64( 4/ 8), 0.333: [Blue] ~960 levels ~7680 states ~23128 transitions
pins2lts-mc-linux64( 4/ 8), 0.598: [Blue] ~1920 levels ~15360 states ~46168 transitions
pins2lts-mc-linux64( 4/ 8), 1.063: [Blue] ~3840 levels ~30720 states ~92248 transitions
pins2lts-mc-linux64( 4/ 8), 1.739: [Blue] ~7680 levels ~61440 states ~184408 transitions
pins2lts-mc-linux64( 4/ 8), 2.431: [Blue] ~15360 levels ~122880 states ~368728 transitions
pins2lts-mc-linux64( 4/ 8), 3.119: [Blue] ~30720 levels ~245760 states ~737368 transitions
pins2lts-mc-linux64( 4/ 8), 3.846: [Blue] ~61440 levels ~491520 states ~1474648 transitions
pins2lts-mc-linux64( 4/ 8), 6.020: [Blue] ~122880 levels ~983040 states ~2949208 transitions
pins2lts-mc-linux64( 0/ 8), 7.393: [Blue] ~245759 levels ~1966080 states ~5903584 transitions
pins2lts-mc-linux64( 0/ 8), 9.444: [Blue] ~491519 levels ~3932160 states ~11801824 transitions
pins2lts-mc-linux64( 6/ 8), 14.264: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 14.612:
pins2lts-mc-linux64( 0/ 8), 14.612: Explored 3281690 states 29718609 transitions, fanout: 9.056
pins2lts-mc-linux64( 0/ 8), 14.612: Total exploration time 14.560 sec (14.240 sec minimum, 14.330 sec on average)
pins2lts-mc-linux64( 0/ 8), 14.613: States per second: 225391, Transitions per second: 2041113
pins2lts-mc-linux64( 0/ 8), 14.613:
pins2lts-mc-linux64( 0/ 8), 14.613: State space has 28420767 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 14.613: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 14.613: blue states: 3281690 (11.55%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 14.613: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 14.613: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 14.613:
pins2lts-mc-linux64( 0/ 8), 14.613: Total memory used for local state coloring: 50.1MB
pins2lts-mc-linux64( 0/ 8), 14.613:
pins2lts-mc-linux64( 0/ 8), 14.613: Queue width: 8B, total height: 3281689, memory: 25.04MB
pins2lts-mc-linux64( 0/ 8), 14.613: Tree memory: 472.8MB, 17.4 B/state, compr.: 9.6%
pins2lts-mc-linux64( 0/ 8), 14.613: Tree fill ratio (roots/leafs): 21.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 14.613: Stored 52 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 14.613: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 14.613: Est. total memory use: 497.9MB (~1049.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11610990294595241245;'/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' '--hoa' '/tmp/stateBased5229112451726851798.hoa' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11610990294595241245;'/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' '--hoa' '/tmp/stateBased5229112451726851798.hoa' '--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.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-28 06:56:28] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:56:28] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:56:28] [INFO ] Time to serialize gal into /tmp/LTL7451002987809208432.gal : 1 ms
[2024-05-28 06:56:28] [INFO ] Time to serialize properties into /tmp/LTL8670539872827050536.prop : 1 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/LTL7451002987809208432.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16569538167381090170.hoa' '-atoms' '/tmp/LTL8670539872827050536.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...318
Loading property file /tmp/LTL8670539872827050536.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16569538167381090170.hoa
Detected timeout of ITS tools.
[2024-05-28 06:56:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:56:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:56:43] [INFO ] Time to serialize gal into /tmp/LTL12221916893709102425.gal : 1 ms
[2024-05-28 06:56:43] [INFO ] Time to serialize properties into /tmp/LTL7883687369375429043.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/LTL12221916893709102425.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7883687369375429043.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...276
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("(p7<2)")))||(G("(p87<2)"))))))
Formula 0 simplified : XX(GF!"(p7<2)" & F!"(p87<2)")
Detected timeout of ITS tools.
[2024-05-28 06:56:58] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:56:58] [INFO ] Applying decomposition
[2024-05-28 06:56:58] [INFO ] Flatten gal took : 4 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/graph4334727659425046653.txt' '-o' '/tmp/graph4334727659425046653.bin' '-w' '/tmp/graph4334727659425046653.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4334727659425046653.bin' '-l' '-1' '-v' '-w' '/tmp/graph4334727659425046653.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:56:58] [INFO ] Decomposing Gal with order
[2024-05-28 06:56:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:56:58] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-28 06:56:58] [INFO ] Flatten gal took : 22 ms
[2024-05-28 06:56:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 2 ms.
[2024-05-28 06:56:58] [INFO ] Time to serialize gal into /tmp/LTL2064665377507762824.gal : 2 ms
[2024-05-28 06:56:58] [INFO ] Time to serialize properties into /tmp/LTL10118932870197066593.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/LTL2064665377507762824.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10118932870197066593.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 : !((X(X((F(G("(i5.i0.u15.p7<2)")))||(G("(i2.u11.p87<2)"))))))
Formula 0 simplified : XX(GF!"(i5.i0.u15.p7<2)" & F!"(i2.u11.p87<2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2106203793670646963
[2024-05-28 06:57:14] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2106203793670646963
Running compilation step : cd /tmp/ltsmin2106203793670646963;'/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 111 ms.
Running link step : cd /tmp/ltsmin2106203793670646963;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2106203793670646963;'/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' 'X(X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-04 finished in 91345 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' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 74/74 transitions.
Graph (complete) has 154 edges and 68 vertex of which 62 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 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 49 transition count 62
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 49 transition count 62
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 23 place count 43 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 29 place count 43 transition count 56
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 34 place count 38 transition count 51
Iterating global reduction 0 with 5 rules applied. Total rules applied 39 place count 38 transition count 51
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 43 place count 34 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 47 place count 34 transition count 47
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 51 place count 30 transition count 43
Iterating global reduction 0 with 4 rules applied. Total rules applied 55 place count 30 transition count 43
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 59 place count 30 transition count 39
Applied a total of 59 rules in 15 ms. Remains 30 /68 variables (removed 38) and now considering 39/74 (removed 35) transitions.
[2024-05-28 06:57:29] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
// Phase 1: matrix 33 rows 30 cols
[2024-05-28 06:57:29] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 06:57:29] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-28 06:57:29] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
[2024-05-28 06:57:29] [INFO ] Invariant cache hit.
[2024-05-28 06:57:29] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-28 06:57:29] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-28 06:57:29] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 06:57:29] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
[2024-05-28 06:57:29] [INFO ] Invariant cache hit.
[2024-05-28 06:57:29] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/68 places, 39/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 30/68 places, 39/74 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s19), p1:(LEQ 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 115 steps with 4 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-05 finished in 269 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 74/74 transitions.
Graph (complete) has 154 edges and 68 vertex of which 62 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 49 transition count 62
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 49 transition count 62
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 23 place count 43 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 29 place count 43 transition count 56
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 33 place count 39 transition count 52
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 39 transition count 52
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 40 place count 36 transition count 49
Iterating global reduction 0 with 3 rules applied. Total rules applied 43 place count 36 transition count 49
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 46 place count 33 transition count 46
Iterating global reduction 0 with 3 rules applied. Total rules applied 49 place count 33 transition count 46
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 52 place count 33 transition count 43
Applied a total of 52 rules in 13 ms. Remains 33 /68 variables (removed 35) and now considering 43/74 (removed 31) transitions.
[2024-05-28 06:57:29] [INFO ] Flow matrix only has 36 transitions (discarded 7 similar events)
// Phase 1: matrix 36 rows 33 cols
[2024-05-28 06:57:29] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 06:57:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 06:57:29] [INFO ] Flow matrix only has 36 transitions (discarded 7 similar events)
[2024-05-28 06:57:29] [INFO ] Invariant cache hit.
[2024-05-28 06:57:29] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:57:29] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-28 06:57:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 06:57:29] [INFO ] Flow matrix only has 36 transitions (discarded 7 similar events)
[2024-05-28 06:57:29] [INFO ] Invariant cache hit.
[2024-05-28 06:57:29] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/68 places, 43/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 33/68 places, 43/74 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s5 s2), p1:(GT 3 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-06 finished in 242 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((F(G(p0))||!(!p0 U p1))))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 74/74 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 64 transition count 74
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 58 transition count 68
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 58 transition count 68
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 52 transition count 62
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 52 transition count 62
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 48 transition count 58
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 48 transition count 58
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 44 transition count 54
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 44 transition count 54
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 41 transition count 51
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 41 transition count 51
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 41 transition count 48
Applied a total of 53 rules in 14 ms. Remains 41 /68 variables (removed 27) and now considering 48/74 (removed 26) transitions.
[2024-05-28 06:57:29] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 41 cols
[2024-05-28 06:57:29] [INFO ] Computed 1 invariants in 2 ms
[2024-05-28 06:57:29] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-28 06:57:29] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
[2024-05-28 06:57:29] [INFO ] Invariant cache hit.
[2024-05-28 06:57:29] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-28 06:57:29] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-28 06:57:29] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
[2024-05-28 06:57:29] [INFO ] Invariant cache hit.
[2024-05-28 06:57:29] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/68 places, 48/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 41/68 places, 48/74 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 3 s7), p1:(LEQ 2 s20)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 76 ms.
Product exploration explored 100000 steps with 33333 reset in 79 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 85 edges and 41 vertex of which 35 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-07 finished in 464 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((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 74/74 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 64 transition count 74
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 11 place count 57 transition count 67
Iterating global reduction 1 with 7 rules applied. Total rules applied 18 place count 57 transition count 67
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 51 transition count 61
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 51 transition count 61
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 47 transition count 57
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 47 transition count 57
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 45 transition count 55
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 45 transition count 55
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 44 transition count 54
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 44 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 44 transition count 53
Applied a total of 45 rules in 8 ms. Remains 44 /68 variables (removed 24) and now considering 53/74 (removed 21) transitions.
[2024-05-28 06:57:30] [INFO ] Flow matrix only has 45 transitions (discarded 8 similar events)
// Phase 1: matrix 45 rows 44 cols
[2024-05-28 06:57:30] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 06:57:30] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 06:57:30] [INFO ] Flow matrix only has 45 transitions (discarded 8 similar events)
[2024-05-28 06:57:30] [INFO ] Invariant cache hit.
[2024-05-28 06:57:30] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-28 06:57:30] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-28 06:57:30] [INFO ] Flow matrix only has 45 transitions (discarded 8 similar events)
[2024-05-28 06:57:30] [INFO ] Invariant cache hit.
[2024-05-28 06:57:30] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/68 places, 53/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 44/68 places, 53/74 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ 2 s31) (NOT (OR (LEQ s39 s37) (LEQ s39 s35)))), p0:(OR (LEQ s39 s37) (LEQ s39 s35))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1 reset in 84 ms.
Product exploration explored 100000 steps with 0 reset in 211 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 93 edges and 44 vertex of which 38 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 06:57:31] [INFO ] Flow matrix only has 45 transitions (discarded 8 similar events)
[2024-05-28 06:57:31] [INFO ] Invariant cache hit.
[2024-05-28 06:57:31] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-28 06:57:31] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 06:57:31] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-28 06:57:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-28 06:57:31] [INFO ] After 7ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-28 06:57:31] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-28 06:57:31] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 53/53 transitions.
Graph (complete) has 56 edges and 44 vertex of which 9 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 34 output transitions
Drop transitions removed 34 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 9 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 7 transition count 7
Applied a total of 14 rules in 5 ms. Remains 7 /44 variables (removed 37) and now considering 7/53 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 7/44 places, 7/53 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 176 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[p0, p0, false]
Stuttering acceptance computed with spot in 108 ms :[p0, p0, false]
[2024-05-28 06:57:31] [INFO ] Flow matrix only has 45 transitions (discarded 8 similar events)
[2024-05-28 06:57:31] [INFO ] Invariant cache hit.
[2024-05-28 06:57:31] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 06:57:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 06:57:31] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-28 06:57:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:57:31] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 06:57:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 06:57:31] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-28 06:57:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-28 06:57:31] [INFO ] [Nat]Added 36 Read/Feed constraints in 2 ms returned sat
[2024-05-28 06:57:31] [INFO ] Computed and/alt/rep : 49/61/41 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 06:57:31] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Could not prove EG p0
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 53/53 transitions.
Graph (complete) has 93 edges and 44 vertex of which 38 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 36 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 36 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 35 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 35 transition count 47
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7 place count 33 transition count 45
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 33 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 32 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 32 transition count 44
Applied a total of 11 rules in 13 ms. Remains 32 /44 variables (removed 12) and now considering 44/53 (removed 9) transitions.
[2024-05-28 06:57:31] [INFO ] Flow matrix only has 35 transitions (discarded 9 similar events)
// Phase 1: matrix 35 rows 32 cols
[2024-05-28 06:57:31] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 06:57:31] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 06:57:31] [INFO ] Flow matrix only has 35 transitions (discarded 9 similar events)
[2024-05-28 06:57:31] [INFO ] Invariant cache hit.
[2024-05-28 06:57:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-28 06:57:31] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-28 06:57:31] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 06:57:31] [INFO ] Flow matrix only has 35 transitions (discarded 9 similar events)
[2024-05-28 06:57:31] [INFO ] Invariant cache hit.
[2024-05-28 06:57:31] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/44 places, 44/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 32/44 places, 44/53 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 139 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[p0, p0, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :2
Finished Best-First random walk after 238 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=238 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[p0, p0, false]
Stuttering acceptance computed with spot in 120 ms :[p0, p0, false]
[2024-05-28 06:57:32] [INFO ] Flow matrix only has 35 transitions (discarded 9 similar events)
[2024-05-28 06:57:32] [INFO ] Invariant cache hit.
[2024-05-28 06:57:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 06:57:32] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-28 06:57:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:57:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 06:57:32] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-28 06:57:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-28 06:57:32] [INFO ] [Nat]Added 20 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:57:32] [INFO ] Computed and/alt/rep : 30/37/21 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 06:57:32] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 97 ms :[p0, p0, false]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-08 finished in 2810 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' '!((G(p0)||((F(p1) U p2)&&X(p3))))'
Support contains 8 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 74/74 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 64 transition count 74
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 59 transition count 69
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 59 transition count 69
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 55 transition count 65
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 55 transition count 65
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 53 transition count 63
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 53 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 52 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 52 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 51 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 51 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 51 transition count 60
Applied a total of 31 rules in 9 ms. Remains 51 /68 variables (removed 17) and now considering 60/74 (removed 14) transitions.
[2024-05-28 06:57:32] [INFO ] Flow matrix only has 52 transitions (discarded 8 similar events)
// Phase 1: matrix 52 rows 51 cols
[2024-05-28 06:57:32] [INFO ] Computed 1 invariants in 4 ms
[2024-05-28 06:57:32] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-28 06:57:32] [INFO ] Flow matrix only has 52 transitions (discarded 8 similar events)
[2024-05-28 06:57:32] [INFO ] Invariant cache hit.
[2024-05-28 06:57:33] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 06:57:33] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-28 06:57:33] [INFO ] Flow matrix only has 52 transitions (discarded 8 similar events)
[2024-05-28 06:57:33] [INFO ] Invariant cache hit.
[2024-05-28 06:57:33] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/68 places, 60/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 51/68 places, 60/74 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), true, (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 5}, { cond=p0, acceptance={} source=0 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (LEQ 1 s8) (LEQ s46 s24)), p2:(LEQ s22 s14), p1:(LEQ s24 s25), p3:(LEQ s33 s36)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 107 edges and 51 vertex of which 45 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p2 p1 p3), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p3), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 24 factoid took 19 ms. Reduced automaton from 9 states, 21 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-09 finished in 768 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)||G(p1))))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 74/74 transitions.
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 63 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 72
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 56 transition count 66
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 56 transition count 66
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 51 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 51 transition count 61
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 48 transition count 58
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 48 transition count 58
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 46 transition count 56
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 46 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 45 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 45 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 45 transition count 54
Applied a total of 37 rules in 14 ms. Remains 45 /68 variables (removed 23) and now considering 54/74 (removed 20) transitions.
[2024-05-28 06:57:33] [INFO ] Flow matrix only has 46 transitions (discarded 8 similar events)
// Phase 1: matrix 46 rows 45 cols
[2024-05-28 06:57:33] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 06:57:33] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 06:57:33] [INFO ] Flow matrix only has 46 transitions (discarded 8 similar events)
[2024-05-28 06:57:33] [INFO ] Invariant cache hit.
[2024-05-28 06:57:33] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-28 06:57:33] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-28 06:57:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 06:57:33] [INFO ] Flow matrix only has 46 transitions (discarded 8 similar events)
[2024-05-28 06:57:33] [INFO ] Invariant cache hit.
[2024-05-28 06:57:33] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/68 places, 54/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 45/68 places, 54/74 transitions.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s20 s7) (GT s31 s23) (GT s20 s7)), p1:(GT 2 s2)], nbAcceptance=2, 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 155 ms.
Product exploration explored 100000 steps with 0 reset in 267 ms.
Computed a total of 7 stabilizing places and 8 stable transitions
Graph (complete) has 97 edges and 45 vertex of which 40 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 90 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :1
Finished Best-First random walk after 4510 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1127 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 179 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Support contains 5 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-05-28 06:57:34] [INFO ] Flow matrix only has 46 transitions (discarded 8 similar events)
[2024-05-28 06:57:34] [INFO ] Invariant cache hit.
[2024-05-28 06:57:34] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 06:57:34] [INFO ] Flow matrix only has 46 transitions (discarded 8 similar events)
[2024-05-28 06:57:34] [INFO ] Invariant cache hit.
[2024-05-28 06:57:34] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-28 06:57:34] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-28 06:57:34] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 06:57:34] [INFO ] Flow matrix only has 46 transitions (discarded 8 similar events)
[2024-05-28 06:57:34] [INFO ] Invariant cache hit.
[2024-05-28 06:57:34] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 45/45 places, 54/54 transitions.
Computed a total of 7 stabilizing places and 8 stable transitions
Graph (complete) has 97 edges and 45 vertex of which 40 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 83 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 06:57:35] [INFO ] Flow matrix only has 46 transitions (discarded 8 similar events)
[2024-05-28 06:57:35] [INFO ] Invariant cache hit.
[2024-05-28 06:57:35] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 06:57:35] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 06:57:35] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 06:57:35] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-28 06:57:35] [INFO ] After 5ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 06:57:35] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-28 06:57:35] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 54/54 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 44 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 43 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 43 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 42 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 42 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 41 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 41 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 40 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 40 transition count 49
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 38 transition count 47
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 38 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 38 transition count 45
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 38 transition count 41
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 25 place count 34 transition count 40
Applied a total of 25 rules in 11 ms. Remains 34 /45 variables (removed 11) and now considering 40/54 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 34/45 places, 40/54 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished Best-First random walk after 1152 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1152 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 220 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 168 ms.
Product exploration explored 100000 steps with 0 reset in 213 ms.
Built C files in :
/tmp/ltsmin6681842126801399800
[2024-05-28 06:57:35] [INFO ] Computing symmetric may disable matrix : 54 transitions.
[2024-05-28 06:57:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:57:35] [INFO ] Computing symmetric may enable matrix : 54 transitions.
[2024-05-28 06:57:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:57:35] [INFO ] Computing Do-Not-Accords matrix : 54 transitions.
[2024-05-28 06:57:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:57:35] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6681842126801399800
Running compilation step : cd /tmp/ltsmin6681842126801399800;'/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 120 ms.
Running link step : cd /tmp/ltsmin6681842126801399800;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6681842126801399800;'/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/stateBased17357061529534061156.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-05-28 06:57:51] [INFO ] Flow matrix only has 46 transitions (discarded 8 similar events)
[2024-05-28 06:57:51] [INFO ] Invariant cache hit.
[2024-05-28 06:57:51] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-28 06:57:51] [INFO ] Flow matrix only has 46 transitions (discarded 8 similar events)
[2024-05-28 06:57:51] [INFO ] Invariant cache hit.
[2024-05-28 06:57:51] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-28 06:57:51] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-28 06:57:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 06:57:51] [INFO ] Flow matrix only has 46 transitions (discarded 8 similar events)
[2024-05-28 06:57:51] [INFO ] Invariant cache hit.
[2024-05-28 06:57:51] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 45/45 places, 54/54 transitions.
Built C files in :
/tmp/ltsmin13820094469311262345
[2024-05-28 06:57:51] [INFO ] Computing symmetric may disable matrix : 54 transitions.
[2024-05-28 06:57:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:57:51] [INFO ] Computing symmetric may enable matrix : 54 transitions.
[2024-05-28 06:57:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:57:51] [INFO ] Computing Do-Not-Accords matrix : 54 transitions.
[2024-05-28 06:57:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:57:51] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13820094469311262345
Running compilation step : cd /tmp/ltsmin13820094469311262345;'/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 122 ms.
Running link step : cd /tmp/ltsmin13820094469311262345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13820094469311262345;'/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/stateBased7751879285080280150.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 06:58:06] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:58:06] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:58:06] [INFO ] Time to serialize gal into /tmp/LTL13334930598772242024.gal : 0 ms
[2024-05-28 06:58:06] [INFO ] Time to serialize properties into /tmp/LTL4501843052136412508.prop : 1 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/LTL13334930598772242024.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3727419708670036378.hoa' '-atoms' '/tmp/LTL4501843052136412508.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...318
Loading property file /tmp/LTL4501843052136412508.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3727419708670036378.hoa
Detected timeout of ITS tools.
[2024-05-28 06:58:21] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:58:21] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:58:21] [INFO ] Time to serialize gal into /tmp/LTL18271566803735715464.gal : 1 ms
[2024-05-28 06:58:21] [INFO ] Time to serialize properties into /tmp/LTL14776924011428695283.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/LTL18271566803735715464.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14776924011428695283.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...277
Read 1 LTL properties
Checking formula 0 : !((F((G("(((p56>p20)&&(p70>p59))&&(p56>p20))"))||(G("(p3<2)")))))
Formula 0 simplified : G(F!"(((p56>p20)&&(p70>p59))&&(p56>p20))" & F!"(p3<2)")
Detected timeout of ITS tools.
[2024-05-28 06:58:36] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:58:36] [INFO ] Applying decomposition
[2024-05-28 06:58:36] [INFO ] Flatten gal took : 3 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/graph1946063963641253788.txt' '-o' '/tmp/graph1946063963641253788.bin' '-w' '/tmp/graph1946063963641253788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1946063963641253788.bin' '-l' '-1' '-v' '-w' '/tmp/graph1946063963641253788.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:58:36] [INFO ] Decomposing Gal with order
[2024-05-28 06:58:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:58:36] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-28 06:58:36] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:58:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 1 ms.
[2024-05-28 06:58:36] [INFO ] Time to serialize gal into /tmp/LTL5535931090817737411.gal : 1 ms
[2024-05-28 06:58:36] [INFO ] Time to serialize properties into /tmp/LTL10676576486828261365.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/LTL5535931090817737411.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10676576486828261365.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...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(((gu9.p56>gu9.p20)&&(gu10.p70>gu10.p59))&&(gu9.p56>gu9.p20))"))||(G("(gi2.gi0.gi0.gu12.p3<2)")))))
Formula 0 simplified : G(F!"(((gu9.p56>gu9.p20)&&(gu10.p70>gu10.p59))&&(gu9.p56>gu9.p20))" & F!"(gi2.gi0.gi0.gu12.p3<2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14047650674314903249
[2024-05-28 06:58:51] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14047650674314903249
Running compilation step : cd /tmp/ltsmin14047650674314903249;'/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 121 ms.
Running link step : cd /tmp/ltsmin14047650674314903249;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14047650674314903249;'/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))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
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.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: LTL layer: formula: <>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))
pins2lts-mc-linux64( 2/ 8), 0.003: "<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: There are 57 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.022: State length is 46, there are 62 groups
pins2lts-mc-linux64( 0/ 8), 0.022: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.022: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.022: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.022: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.076: [Blue] ~116 levels ~960 states ~4752 transitions
pins2lts-mc-linux64( 6/ 8), 0.119: [Blue] ~236 levels ~1920 states ~9552 transitions
pins2lts-mc-linux64( 6/ 8), 0.176: [Blue] ~476 levels ~3840 states ~19152 transitions
pins2lts-mc-linux64( 6/ 8), 0.294: [Blue] ~956 levels ~7680 states ~38352 transitions
pins2lts-mc-linux64( 1/ 8), 0.477: [Blue] ~1919 levels ~15360 states ~62888 transitions
pins2lts-mc-linux64( 1/ 8), 0.704: [Blue] ~3839 levels ~30720 states ~124328 transitions
pins2lts-mc-linux64( 1/ 8), 0.988: [Blue] ~7679 levels ~61440 states ~247208 transitions
pins2lts-mc-linux64( 1/ 8), 1.291: [Blue] ~15359 levels ~122880 states ~492968 transitions
pins2lts-mc-linux64( 1/ 8), 1.586: [Blue] ~30719 levels ~245760 states ~984488 transitions
pins2lts-mc-linux64( 1/ 8), 1.957: [Blue] ~61439 levels ~491520 states ~1967528 transitions
pins2lts-mc-linux64( 1/ 8), 2.657: [Blue] ~122879 levels ~983040 states ~3933608 transitions
pins2lts-mc-linux64( 6/ 8), 4.195: [Blue] ~245756 levels ~1966080 states ~9830352 transitions
pins2lts-mc-linux64( 6/ 8), 7.231: [Blue] ~491516 levels ~3932160 states ~19660752 transitions
pins2lts-mc-linux64( 3/ 8), 11.928: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 12.033:
pins2lts-mc-linux64( 0/ 8), 12.033: Explored 3178649 states 33862898 transitions, fanout: 10.653
pins2lts-mc-linux64( 0/ 8), 12.034: Total exploration time 11.990 sec (11.900 sec minimum, 11.944 sec on average)
pins2lts-mc-linux64( 0/ 8), 12.034: States per second: 265108, Transitions per second: 2824262
pins2lts-mc-linux64( 0/ 8), 12.034:
pins2lts-mc-linux64( 0/ 8), 12.034: State space has 33325730 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 12.034: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 12.034: blue states: 3178649 (9.54%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 12.034: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 12.034: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 12.034:
pins2lts-mc-linux64( 0/ 8), 12.034: Total memory used for local state coloring: 48.5MB
pins2lts-mc-linux64( 0/ 8), 12.034:
pins2lts-mc-linux64( 0/ 8), 12.034: Queue width: 8B, total height: 3178644, memory: 24.25MB
pins2lts-mc-linux64( 0/ 8), 12.034: Tree memory: 510.3MB, 16.1 B/state, compr.: 8.6%
pins2lts-mc-linux64( 0/ 8), 12.034: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 12.034: Stored 54 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 12.034: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 12.034: Est. total memory use: 534.5MB (~1048.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14047650674314903249;'/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))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14047650674314903249;'/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))||[]((LTLAPp1==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-S064P12-LTLCardinality-10 finished in 90120 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(G(p0)))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 74/74 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 64 transition count 74
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 11 place count 57 transition count 67
Iterating global reduction 1 with 7 rules applied. Total rules applied 18 place count 57 transition count 67
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 51 transition count 61
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 51 transition count 61
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 48 transition count 58
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 48 transition count 58
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 46 transition count 56
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 46 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 45 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 45 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 45 transition count 54
Applied a total of 43 rules in 6 ms. Remains 45 /68 variables (removed 23) and now considering 54/74 (removed 20) transitions.
[2024-05-28 06:59:03] [INFO ] Flow matrix only has 46 transitions (discarded 8 similar events)
// Phase 1: matrix 46 rows 45 cols
[2024-05-28 06:59:03] [INFO ] Computed 1 invariants in 2 ms
[2024-05-28 06:59:03] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-28 06:59:03] [INFO ] Flow matrix only has 46 transitions (discarded 8 similar events)
[2024-05-28 06:59:03] [INFO ] Invariant cache hit.
[2024-05-28 06:59:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-28 06:59:03] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-28 06:59:03] [INFO ] Flow matrix only has 46 transitions (discarded 8 similar events)
[2024-05-28 06:59:03] [INFO ] Invariant cache hit.
[2024-05-28 06:59:03] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 45/68 places, 54/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 45/68 places, 54/74 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GT 1 s12) (GT s11 s23) (LEQ s34 s30))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-11 finished in 206 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' '!((p0 U (p1&&X(F(p2)))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 74/74 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 64 transition count 74
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 58 transition count 68
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 58 transition count 68
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 53 transition count 63
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 53 transition count 63
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 50 transition count 60
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 50 transition count 60
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 48 transition count 58
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 48 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 47 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 47 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 47 transition count 56
Applied a total of 39 rules in 7 ms. Remains 47 /68 variables (removed 21) and now considering 56/74 (removed 18) transitions.
[2024-05-28 06:59:04] [INFO ] Flow matrix only has 48 transitions (discarded 8 similar events)
// Phase 1: matrix 48 rows 47 cols
[2024-05-28 06:59:04] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 06:59:04] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 06:59:04] [INFO ] Flow matrix only has 48 transitions (discarded 8 similar events)
[2024-05-28 06:59:04] [INFO ] Invariant cache hit.
[2024-05-28 06:59:04] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-28 06:59:04] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-28 06:59:04] [INFO ] Flow matrix only has 48 transitions (discarded 8 similar events)
[2024-05-28 06:59:04] [INFO ] Invariant cache hit.
[2024-05-28 06:59:04] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/68 places, 56/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 47/68 places, 56/74 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LEQ s36 s39) (AND (LEQ 1 s11) (GT s36 s39))), p0:(LEQ 3 s37), p2:(GT 1 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 99 edges and 47 vertex of which 41 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p2), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 19 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-15 finished in 386 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(G(p0))||G(p1)))))'
Found a Lengthening insensitive property : SemanticWebServices-PT-S064P12-LTLCardinality-04
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 68/68 places, 74/74 transitions.
Graph (complete) has 154 edges and 68 vertex of which 62 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 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 49 transition count 62
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 49 transition count 62
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 24 place count 42 transition count 55
Iterating global reduction 0 with 7 rules applied. Total rules applied 31 place count 42 transition count 55
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 37 place count 36 transition count 49
Iterating global reduction 0 with 6 rules applied. Total rules applied 43 place count 36 transition count 49
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 49 place count 30 transition count 43
Iterating global reduction 0 with 6 rules applied. Total rules applied 55 place count 30 transition count 43
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 61 place count 24 transition count 37
Iterating global reduction 0 with 6 rules applied. Total rules applied 67 place count 24 transition count 37
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 73 place count 24 transition count 31
Applied a total of 73 rules in 9 ms. Remains 24 /68 variables (removed 44) and now considering 31/74 (removed 43) transitions.
[2024-05-28 06:59:04] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 24 cols
[2024-05-28 06:59:04] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 06:59:04] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 06:59:04] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2024-05-28 06:59:04] [INFO ] Invariant cache hit.
[2024-05-28 06:59:04] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-28 06:59:04] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-28 06:59:04] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2024-05-28 06:59:04] [INFO ] Invariant cache hit.
[2024-05-28 06:59:04] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 24/68 places, 31/74 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 88 ms. Remains : 24/68 places, 31/74 transitions.
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(GT 2 s21), p0:(GT 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 0 ms.
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-04 finished in 352 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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)||G(p1))))'
[2024-05-28 06:59:04] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11038963407708873977
[2024-05-28 06:59:04] [INFO ] Computing symmetric may disable matrix : 74 transitions.
[2024-05-28 06:59:04] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:59:04] [INFO ] Computing symmetric may enable matrix : 74 transitions.
[2024-05-28 06:59:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:59:04] [INFO ] Applying decomposition
[2024-05-28 06:59:04] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:59:04] [INFO ] Computing Do-Not-Accords matrix : 74 transitions.
[2024-05-28 06:59:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:59:04] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11038963407708873977
Running compilation step : cd /tmp/ltsmin11038963407708873977;'/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/graph2993488720343420007.txt' '-o' '/tmp/graph2993488720343420007.bin' '-w' '/tmp/graph2993488720343420007.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2993488720343420007.bin' '-l' '-1' '-v' '-w' '/tmp/graph2993488720343420007.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:59:04] [INFO ] Decomposing Gal with order
[2024-05-28 06:59:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:59:04] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-28 06:59:04] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:59:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2024-05-28 06:59:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality1664933023584074433.gal : 1 ms
[2024-05-28 06:59:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality167542182297567215.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/LTLCardinality1664933023584074433.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality167542182297567215.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...296
Read 1 LTL properties
Checking formula 0 : !((F((G("(((gu10.p56>gu10.p20)&&(gu12.p70>gu12.p59))&&(gu10.p56>gu10.p20))"))||(G("(gi0.gi1.gi3.gu14.p3<2)")))))
Formula 0 simplified : G(F!"(((gu10.p56>gu10.p20)&&(gu12.p70>gu12.p59))&&(gu10.p56>gu10.p20))" & F!"(gi0.gi1.gi3.gu14.p3<2)")
Compilation finished in 155 ms.
Running link step : cd /tmp/ltsmin11038963407708873977;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin11038963407708873977;'/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' '<>(([]((LTLAPp2==true))||[]((LTLAPp3==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: Initializing POR dependencies: labels 78, guards 74
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.034: LTL layer: formula: <>(([]((LTLAPp2==true))||[]((LTLAPp3==true))))
pins2lts-mc-linux64( 1/ 8), 0.034: "<>(([]((LTLAPp2==true))||[]((LTLAPp3==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.034: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.069: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.074: There are 79 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.074: State length is 69, there are 82 groups
pins2lts-mc-linux64( 0/ 8), 0.074: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.074: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.074: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.074: Visible groups: 0 / 82, labels: 2 / 79
pins2lts-mc-linux64( 0/ 8), 0.074: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.074: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.085: [Blue] ~120 levels ~960 states ~1072 transitions
pins2lts-mc-linux64( 5/ 8), 0.108: [Blue] ~240 levels ~1920 states ~2024 transitions
pins2lts-mc-linux64( 5/ 8), 0.137: [Blue] ~480 levels ~3840 states ~3944 transitions
pins2lts-mc-linux64( 0/ 8), 0.205: [Blue] ~960 levels ~7680 states ~7792 transitions
pins2lts-mc-linux64( 4/ 8), 0.310: [Blue] ~1920 levels ~15360 states ~15464 transitions
pins2lts-mc-linux64( 6/ 8), 0.462: [Blue] ~3840 levels ~30720 states ~30824 transitions
pins2lts-mc-linux64( 6/ 8), 0.647: [Blue] ~7680 levels ~61440 states ~61544 transitions
pins2lts-mc-linux64( 5/ 8), 0.953: [Blue] ~15360 levels ~122880 states ~122984 transitions
pins2lts-mc-linux64( 5/ 8), 1.411: [Blue] ~30720 levels ~245760 states ~245864 transitions
pins2lts-mc-linux64( 4/ 8), 2.212: [Blue] ~61440 levels ~491520 states ~491624 transitions
pins2lts-mc-linux64( 5/ 8), 3.254: [Blue] ~122880 levels ~983040 states ~983144 transitions
pins2lts-mc-linux64( 5/ 8), 4.946: [Blue] ~245760 levels ~1966080 states ~1966184 transitions
pins2lts-mc-linux64( 4/ 8), 8.061: [Blue] ~491520 levels ~3932160 states ~3932264 transitions
pins2lts-mc-linux64( 6/ 8), 14.382: [Blue] ~983040 levels ~7864320 states ~7864424 transitions
pins2lts-mc-linux64( 2/ 8), 19.536: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 20.151:
pins2lts-mc-linux64( 0/ 8), 20.151: Explored 9295321 states 9295512 transitions, fanout: 1.000
pins2lts-mc-linux64( 0/ 8), 20.151: Total exploration time 20.050 sec (19.440 sec minimum, 19.757 sec on average)
pins2lts-mc-linux64( 0/ 8), 20.151: States per second: 463607, Transitions per second: 463617
pins2lts-mc-linux64( 0/ 8), 20.151:
pins2lts-mc-linux64( 0/ 8), 20.151: State space has 8109354 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 20.151: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 20.151: blue states: 9295321 (114.62%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 20.151: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 20.151: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 20.151:
pins2lts-mc-linux64( 0/ 8), 20.151: Total memory used for local state coloring: 141.8MB
pins2lts-mc-linux64( 0/ 8), 20.151:
pins2lts-mc-linux64( 0/ 8), 20.151: Queue width: 8B, total height: 9295321, memory: 70.92MB
pins2lts-mc-linux64( 0/ 8), 20.151: Tree memory: 317.9MB, 41.1 B/state, compr.: 14.8%
pins2lts-mc-linux64( 0/ 8), 20.151: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 20.151: Stored 74 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 20.151: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 20.151: Est. total memory use: 388.8MB (~1094.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11038963407708873977;'/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' '<>(([]((LTLAPp2==true))||[]((LTLAPp3==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11038963407708873977;'/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' '<>(([]((LTLAPp2==true))||[]((LTLAPp3==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 07:20:08] [INFO ] Flatten gal took : 4 ms
[2024-05-28 07:20:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality9365180568112320722.gal : 1 ms
[2024-05-28 07:20:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality15864231833345052175.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/LTLCardinality9365180568112320722.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15864231833345052175.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("(((p56>p20)&&(p70>p59))&&(p56>p20))"))||(G("(p3<2)")))))
Formula 0 simplified : G(F!"(((p56>p20)&&(p70>p59))&&(p56>p20))" & F!"(p3<2)")
Detected timeout of ITS tools.
[2024-05-28 07:41:12] [INFO ] Flatten gal took : 3 ms
[2024-05-28 07:41:12] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-28 07:41:12] [INFO ] Transformed 68 places.
[2024-05-28 07:41:12] [INFO ] Transformed 74 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 07:41:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality13954036768294249648.gal : 0 ms
[2024-05-28 07:41:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality3239372761571233563.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/LTLCardinality13954036768294249648.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3239372761571233563.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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("(((p56>p20)&&(p70>p59))&&(p56>p20))"))||(G("(p3<2)")))))
Formula 0 simplified : G(F!"(((p56>p20)&&(p70>p59))&&(p56>p20))" & F!"(p3<2)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3506204 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16039564 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-S064P12"
export BK_EXAMINATION="LTLCardinality"
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-S064P12, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r351-tall-171679102100317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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