fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r311-tall-162132107700036
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for SemanticWebServices-PT-S064P18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14761.296 3600000.00 3848588.00 16931.70 F?FTTFF?FT?FFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r311-tall-162132107700036.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SemanticWebServices-PT-S064P18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132107700036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 12 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 12 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 12 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.2K May 11 20:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 20:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 11 17:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 17:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 12 04:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 8 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 173K May 12 08:13 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-S064P18-00
FORMULA_NAME SemanticWebServices-PT-S064P18-01
FORMULA_NAME SemanticWebServices-PT-S064P18-02
FORMULA_NAME SemanticWebServices-PT-S064P18-03
FORMULA_NAME SemanticWebServices-PT-S064P18-04
FORMULA_NAME SemanticWebServices-PT-S064P18-05
FORMULA_NAME SemanticWebServices-PT-S064P18-06
FORMULA_NAME SemanticWebServices-PT-S064P18-07
FORMULA_NAME SemanticWebServices-PT-S064P18-08
FORMULA_NAME SemanticWebServices-PT-S064P18-09
FORMULA_NAME SemanticWebServices-PT-S064P18-10
FORMULA_NAME SemanticWebServices-PT-S064P18-11
FORMULA_NAME SemanticWebServices-PT-S064P18-12
FORMULA_NAME SemanticWebServices-PT-S064P18-13
FORMULA_NAME SemanticWebServices-PT-S064P18-14
FORMULA_NAME SemanticWebServices-PT-S064P18-15

=== Now, execution of the tool begins

BK_START 1621411420134

Running Version 0
[2021-05-19 08:03:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-19 08:03:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 08:03:42] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2021-05-19 08:03:42] [INFO ] Transformed 154 places.
[2021-05-19 08:03:42] [INFO ] Transformed 236 transitions.
[2021-05-19 08:03:42] [INFO ] Parsed PT model containing 154 places and 236 transitions in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-19 08:03:42] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 122 transitions
Reduce redundant transitions removed 122 transitions.
FORMULA SemanticWebServices-PT-S064P18-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 112/112 transitions.
Ensure Unique test removed 47 places
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 103 transition count 112
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 98 transition count 107
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 98 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 95 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 95 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 94 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 94 transition count 103
Applied a total of 67 rules in 24 ms. Remains 94 /152 variables (removed 58) and now considering 103/112 (removed 9) transitions.
[2021-05-19 08:03:42] [INFO ] Flow matrix only has 94 transitions (discarded 9 similar events)
// Phase 1: matrix 94 rows 94 cols
[2021-05-19 08:03:42] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-19 08:03:42] [INFO ] Implicit Places using invariants in 101 ms returned []
[2021-05-19 08:03:42] [INFO ] Flow matrix only has 94 transitions (discarded 9 similar events)
// Phase 1: matrix 94 rows 94 cols
[2021-05-19 08:03:42] [INFO ] Computed 3 place invariants in 18 ms
[2021-05-19 08:03:42] [INFO ] State equation strengthened by 84 read => feed constraints.
[2021-05-19 08:03:42] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2021-05-19 08:03:42] [INFO ] Flow matrix only has 94 transitions (discarded 9 similar events)
// Phase 1: matrix 94 rows 94 cols
[2021-05-19 08:03:42] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 08:03:42] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Finished structural reductions, in 1 iterations. Remains : 94/152 places, 103/112 transitions.
[2021-05-19 08:03:42] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-19 08:03:42] [INFO ] Flatten gal took : 28 ms
FORMULA SemanticWebServices-PT-S064P18-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P18-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 08:03:42] [INFO ] Flatten gal took : 11 ms
[2021-05-19 08:03:42] [INFO ] Input system was already deterministic with 103 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 455 ms. (steps per millisecond=219 ) properties (out of 25) seen :20
Running SMT prover for 5 properties.
[2021-05-19 08:03:43] [INFO ] Flow matrix only has 94 transitions (discarded 9 similar events)
// Phase 1: matrix 94 rows 94 cols
[2021-05-19 08:03:43] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-19 08:03:43] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-19 08:03:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 08:03:43] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2021-05-19 08:03:43] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-19 08:03:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 08:03:43] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-19 08:03:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 08:03:43] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-19 08:03:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 08:03:43] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-19 08:03:43] [INFO ] State equation strengthened by 84 read => feed constraints.
[2021-05-19 08:03:43] [INFO ] [Nat]Added 84 Read/Feed constraints in 5 ms returned sat
[2021-05-19 08:03:43] [INFO ] Computed and/alt/rep : 98/116/89 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-19 08:03:43] [INFO ] Added : 80 causal constraints over 16 iterations in 138 ms. Result :sat
[2021-05-19 08:03:43] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-19 08:03:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 08:03:43] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-19 08:03:43] [INFO ] [Real]Added 84 Read/Feed constraints in 14 ms returned sat
[2021-05-19 08:03:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 08:03:43] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-19 08:03:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 08:03:43] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-19 08:03:43] [INFO ] [Nat]Added 84 Read/Feed constraints in 6 ms returned sat
[2021-05-19 08:03:43] [INFO ] Computed and/alt/rep : 98/116/89 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-19 08:03:43] [INFO ] Added : 80 causal constraints over 16 iterations in 115 ms. Result :sat
[2021-05-19 08:03:44] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-19 08:03:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 08:03:44] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-19 08:03:44] [INFO ] [Real]Added 84 Read/Feed constraints in 5 ms returned sat
[2021-05-19 08:03:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 08:03:44] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-19 08:03:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 08:03:44] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-19 08:03:44] [INFO ] [Nat]Added 84 Read/Feed constraints in 6 ms returned sat
[2021-05-19 08:03:44] [INFO ] Computed and/alt/rep : 98/116/89 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-19 08:03:44] [INFO ] Added : 80 causal constraints over 16 iterations in 107 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA SemanticWebServices-PT-S064P18-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (p1&&G(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 103/103 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 92 transition count 103
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 86 transition count 97
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 86 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 86 transition count 96
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 20 place count 81 transition count 91
Iterating global reduction 2 with 5 rules applied. Total rules applied 25 place count 81 transition count 91
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 30 place count 76 transition count 86
Iterating global reduction 2 with 5 rules applied. Total rules applied 35 place count 76 transition count 86
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 72 transition count 82
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 72 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 69 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 68 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 68 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 67 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 67 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 67 transition count 76
Applied a total of 54 rules in 35 ms. Remains 67 /94 variables (removed 27) and now considering 76/103 (removed 27) transitions.
[2021-05-19 08:03:44] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
// Phase 1: matrix 68 rows 67 cols
[2021-05-19 08:03:44] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:03:44] [INFO ] Implicit Places using invariants in 27 ms returned []
[2021-05-19 08:03:44] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
// Phase 1: matrix 68 rows 67 cols
[2021-05-19 08:03:44] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:03:44] [INFO ] State equation strengthened by 59 read => feed constraints.
[2021-05-19 08:03:44] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2021-05-19 08:03:44] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
// Phase 1: matrix 68 rows 67 cols
[2021-05-19 08:03:44] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 08:03:44] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 67/94 places, 76/103 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P18-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s2 s43), p1:(LEQ 3 s30)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-00 finished in 413 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(!p0)||G(F((p1 U (p2||G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 103/103 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 91 transition count 100
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 100
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 11 place count 82 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 18 place count 82 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 82 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 77 transition count 87
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 77 transition count 87
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 72 transition count 82
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 72 transition count 82
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 68 transition count 78
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 68 transition count 78
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 65 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 65 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 63 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 63 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 62 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 61 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 61 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 61 transition count 70
Applied a total of 62 rules in 29 ms. Remains 61 /94 variables (removed 33) and now considering 70/103 (removed 33) transitions.
[2021-05-19 08:03:44] [INFO ] Flow matrix only has 62 transitions (discarded 8 similar events)
// Phase 1: matrix 62 rows 61 cols
[2021-05-19 08:03:44] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:03:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2021-05-19 08:03:44] [INFO ] Flow matrix only has 62 transitions (discarded 8 similar events)
// Phase 1: matrix 62 rows 61 cols
[2021-05-19 08:03:44] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:03:44] [INFO ] State equation strengthened by 46 read => feed constraints.
[2021-05-19 08:03:44] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2021-05-19 08:03:44] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-19 08:03:44] [INFO ] Flow matrix only has 62 transitions (discarded 8 similar events)
// Phase 1: matrix 62 rows 61 cols
[2021-05-19 08:03:44] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 08:03:44] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/94 places, 70/103 transitions.
Stuttering acceptance computed with spot in 57 ms :[false, false]
Running random walk in product with property : SemanticWebServices-PT-S064P18-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 2} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={2} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GT 2 s8) (GT 1 s47)), p1:(GT 1 s47), p0:(LEQ 1 s30)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 310 ms.
Product exploration explored 100000 steps with 1 reset in 453 ms.
Graph (complete) has 130 edges and 61 vertex of which 57 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Knowledge obtained : [p2, p1, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[false, false]
Product exploration explored 100000 steps with 0 reset in 245 ms.
Product exploration explored 100000 steps with 0 reset in 263 ms.
[2021-05-19 08:03:46] [INFO ] Flatten gal took : 5 ms
[2021-05-19 08:03:46] [INFO ] Flatten gal took : 4 ms
[2021-05-19 08:03:46] [INFO ] Time to serialize gal into /tmp/LTL14868239619638653967.gal : 2 ms
[2021-05-19 08:03:46] [INFO ] Time to serialize properties into /tmp/LTL10371404268026390265.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14868239619638653967.gal, -t, CGAL, -LTL, /tmp/LTL10371404268026390265.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14868239619638653967.gal -t CGAL -LTL /tmp/LTL10371404268026390265.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(((G("(p85>=1)"))||(G("(p85<1)")))||(G(F(("(p117<1)")U(("((p31<2)&&(p117<1))")||(G("(p117<1)")))))))))
Formula 0 simplified : !F(G"(p85>=1)" | G"(p85<1)" | GF("(p117<1)" U ("((p31<2)&&(p117<1))" | G"(p117<1)")))
Detected timeout of ITS tools.
[2021-05-19 08:04:01] [INFO ] Flatten gal took : 3 ms
[2021-05-19 08:04:01] [INFO ] Applying decomposition
[2021-05-19 08:04:01] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17859039407980414490.txt, -o, /tmp/graph17859039407980414490.bin, -w, /tmp/graph17859039407980414490.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17859039407980414490.bin, -l, -1, -v, -w, /tmp/graph17859039407980414490.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 08:04:01] [INFO ] Decomposing Gal with order
[2021-05-19 08:04:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 08:04:01] [INFO ] Removed a total of 10 redundant transitions.
[2021-05-19 08:04:01] [INFO ] Flatten gal took : 94 ms
[2021-05-19 08:04:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 3 ms.
[2021-05-19 08:04:01] [INFO ] Time to serialize gal into /tmp/LTL855036009448895357.gal : 6 ms
[2021-05-19 08:04:01] [INFO ] Time to serialize properties into /tmp/LTL16599461036312692689.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL855036009448895357.gal, -t, CGAL, -LTL, /tmp/LTL16599461036312692689.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL855036009448895357.gal -t CGAL -LTL /tmp/LTL16599461036312692689.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(((G("(i2.u3.p85>=1)"))||(G("(i2.u3.p85<1)")))||(G(F(("(i4.u11.p117<1)")U(("((i7.u22.p31<2)&&(i4.u11.p117<1))")||(G("(i4.u11.p117<1)")))))))))
Formula 0 simplified : !F(G"(i2.u3.p85>=1)" | G"(i2.u3.p85<1)" | GF("(i4.u11.p117<1)" U ("((i7.u22.p31<2)&&(i4.u11.p117<1))" | G"(i4.u11.p117<1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12578598957581227780
[2021-05-19 08:04:16] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12578598957581227780
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12578598957581227780]
Compilation finished in 343 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12578598957581227780]
Link finished in 46 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(([]((LTLAPp0==true))||[](!(LTLAPp0==true))||[](<>(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12578598957581227780]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SemanticWebServices-PT-S064P18-01 finished in 47309 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X(G((G(p0) U X(p1)))) U (G(p0) U !p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 103/103 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 92 transition count 103
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 88 transition count 99
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 88 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 88 transition count 98
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 14 place count 85 transition count 95
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 85 transition count 95
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 82 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 82 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 80 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 80 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 78 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 78 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 76 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 76 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 75 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 75 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 74 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 74 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 74 transition count 83
Applied a total of 40 rules in 12 ms. Remains 74 /94 variables (removed 20) and now considering 83/103 (removed 20) transitions.
[2021-05-19 08:04:32] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
// Phase 1: matrix 75 rows 74 cols
[2021-05-19 08:04:32] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:04:32] [INFO ] Implicit Places using invariants in 18 ms returned []
[2021-05-19 08:04:32] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
// Phase 1: matrix 75 rows 74 cols
[2021-05-19 08:04:32] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:04:32] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-19 08:04:32] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2021-05-19 08:04:32] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
// Phase 1: matrix 75 rows 74 cols
[2021-05-19 08:04:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 08:04:32] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 74/94 places, 83/103 transitions.
Stuttering acceptance computed with spot in 290 ms :[p1, p1, p1, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 8}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(LEQ 1 s22), p0:(LEQ s13 s39)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 166 ms.
Product exploration explored 100000 steps with 33333 reset in 156 ms.
Graph (complete) has 153 edges and 74 vertex of which 68 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 248 ms :[p1, p1, p1, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 100 ms.
Product exploration explored 100000 steps with 33333 reset in 104 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 240 ms :[p1, p1, p1, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0)]
Support contains 3 out of 74 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 74/74 places, 83/83 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 74 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 74 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 84/83 (removed -1) transitions.
[2021-05-19 08:04:33] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-19 08:04:33] [INFO ] Flow matrix only has 76 transitions (discarded 8 similar events)
// Phase 1: matrix 76 rows 74 cols
[2021-05-19 08:04:33] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 08:04:33] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 74/74 places, 84/83 transitions.
Product exploration explored 100000 steps with 33333 reset in 128 ms.
Product exploration explored 100000 steps with 33333 reset in 161 ms.
[2021-05-19 08:04:33] [INFO ] Flatten gal took : 3 ms
[2021-05-19 08:04:33] [INFO ] Flatten gal took : 3 ms
[2021-05-19 08:04:33] [INFO ] Time to serialize gal into /tmp/LTL4635322652258452203.gal : 1 ms
[2021-05-19 08:04:33] [INFO ] Time to serialize properties into /tmp/LTL16664587398482352837.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4635322652258452203.gal, -t, CGAL, -LTL, /tmp/LTL16664587398482352837.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4635322652258452203.gal -t CGAL -LTL /tmp/LTL16664587398482352837.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((X(G((G("(p48<=p89)"))U(X("(p66>=1)")))))U((G("(p48<=p89)"))U("(p66<1)"))))))
Formula 0 simplified : !XX(XG(G"(p48<=p89)" U X"(p66>=1)") U (G"(p48<=p89)" U "(p66<1)"))
Detected timeout of ITS tools.
[2021-05-19 08:04:48] [INFO ] Flatten gal took : 3 ms
[2021-05-19 08:04:48] [INFO ] Applying decomposition
[2021-05-19 08:04:49] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14555851647834235018.txt, -o, /tmp/graph14555851647834235018.bin, -w, /tmp/graph14555851647834235018.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14555851647834235018.bin, -l, -1, -v, -w, /tmp/graph14555851647834235018.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 08:04:49] [INFO ] Decomposing Gal with order
[2021-05-19 08:04:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 08:04:49] [INFO ] Removed a total of 18 redundant transitions.
[2021-05-19 08:04:49] [INFO ] Flatten gal took : 7 ms
[2021-05-19 08:04:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 2 ms.
[2021-05-19 08:04:49] [INFO ] Time to serialize gal into /tmp/LTL6372735156403319438.gal : 1 ms
[2021-05-19 08:04:49] [INFO ] Time to serialize properties into /tmp/LTL17227111030756039251.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6372735156403319438.gal, -t, CGAL, -LTL, /tmp/LTL17227111030756039251.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6372735156403319438.gal -t CGAL -LTL /tmp/LTL17227111030756039251.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((X(G((G("(gu7.p48<=gu7.p89)"))U(X("(gi1.gi2.gi3.gu5.p66>=1)")))))U((G("(gu7.p48<=gu7.p89)"))U("(gi1.gi2.gi3.gu5.p66<1)"))))))
Formula 0 simplified : !XX(XG(G"(gu7.p48<=gu7.p89)" U X"(gi1.gi2.gi3.gu5.p66>=1)") U (G"(gu7.p48<=gu7.p89)" U "(gi1.gi2.gi3.gu5.p66<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7362481296366237549
[2021-05-19 08:05:04] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7362481296366237549
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7362481296366237549]
Compilation finished in 310 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7362481296366237549]
Link finished in 39 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X((X([](([]((LTLAPp0==true)) U X((LTLAPp1==true))))) U ([]((LTLAPp0==true)) U !(LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7362481296366237549]
LTSmin run took 814 ms.
FORMULA SemanticWebServices-PT-S064P18-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SemanticWebServices-PT-S064P18-03 finished in 33270 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U X((p0&&X((X(p1) U ((p1&&X(p1))||X(G(p1)))))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 103/103 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 92 transition count 103
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 85 transition count 96
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 85 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 85 transition count 95
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 23 place count 79 transition count 89
Iterating global reduction 2 with 6 rules applied. Total rules applied 29 place count 79 transition count 89
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 35 place count 73 transition count 83
Iterating global reduction 2 with 6 rules applied. Total rules applied 41 place count 73 transition count 83
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 46 place count 68 transition count 78
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 68 transition count 78
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 64 transition count 74
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 64 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 62 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 60 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 60 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 59 transition count 68
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 59 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 59 transition count 67
Applied a total of 71 rules in 12 ms. Remains 59 /94 variables (removed 35) and now considering 67/103 (removed 36) transitions.
[2021-05-19 08:05:05] [INFO ] Flow matrix only has 60 transitions (discarded 7 similar events)
// Phase 1: matrix 60 rows 59 cols
[2021-05-19 08:05:05] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:05:05] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-19 08:05:05] [INFO ] Flow matrix only has 60 transitions (discarded 7 similar events)
// Phase 1: matrix 60 rows 59 cols
[2021-05-19 08:05:05] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:05:05] [INFO ] State equation strengthened by 51 read => feed constraints.
[2021-05-19 08:05:05] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2021-05-19 08:05:05] [INFO ] Flow matrix only has 60 transitions (discarded 7 similar events)
// Phase 1: matrix 60 rows 59 cols
[2021-05-19 08:05:05] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-19 08:05:05] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 59/94 places, 67/103 transitions.
Stuttering acceptance computed with spot in 408 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-05 automaton TGBA [mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}, { cond=p0, acceptance={0, 1} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={1} source=2 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}, { cond=p0, acceptance={0, 1} source=2 dest: 3}, { cond=p0, acceptance={1} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 5}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 8}], [{ cond=p0, acceptance={0, 1} source=4 dest: 9}, { cond=true, acceptance={1} source=4 dest: 10}, { cond=(NOT p1), acceptance={1} source=4 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=6 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 8}], [{ cond=(AND p0 p1), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=8 dest: 10}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 10}, { cond=(NOT p1), acceptance={1} source=8 dest: 11}, { cond=(AND p0 p1), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=9 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=9 dest: 3}], [{ cond=(NOT p1), acceptance={1} source=10 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=10 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=10 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=11 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=11 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=11 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=11 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=11 dest: 9}, { cond=(AND p0 p1), acceptance={0} source=11 dest: 9}, { cond=(NOT p1), acceptance={1} source=11 dest: 10}, { cond=p1, acceptance={} source=11 dest: 10}, { cond=(NOT p1), acceptance={1} source=11 dest: 11}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=12 dest: 9}, { cond=(NOT p1), acceptance={1} source=12 dest: 10}, { cond=(NOT p1), acceptance={1} source=12 dest: 11}]], initial=0, aps=[p0:(LEQ 2 s53), p1:(GT s56 s8)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 120 ms.
Product exploration explored 100000 steps with 0 reset in 335 ms.
Graph (complete) has 122 edges and 59 vertex of which 53 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 161 ms.
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-05 finished in 1641 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 103/103 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 91 transition count 100
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 100
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 9 place count 84 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 14 place count 84 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 84 transition count 94
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 80 transition count 90
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 80 transition count 90
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 76 transition count 86
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 76 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 73 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 73 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 71 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 71 transition count 81
Applied a total of 41 rules in 15 ms. Remains 71 /94 variables (removed 23) and now considering 81/103 (removed 22) transitions.
[2021-05-19 08:05:06] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
// Phase 1: matrix 72 rows 71 cols
[2021-05-19 08:05:06] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:05:06] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-19 08:05:06] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
// Phase 1: matrix 72 rows 71 cols
[2021-05-19 08:05:06] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:05:06] [INFO ] State equation strengthened by 55 read => feed constraints.
[2021-05-19 08:05:06] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2021-05-19 08:05:06] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-19 08:05:06] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
// Phase 1: matrix 72 rows 71 cols
[2021-05-19 08:05:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 08:05:07] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 71/94 places, 81/103 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-07 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s69 s56), p1:(AND (GT s69 s56) (GT s12 s34))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 323 ms.
Product exploration explored 100000 steps with 1 reset in 305 ms.
Graph (complete) has 151 edges and 71 vertex of which 67 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 90 ms.
Product exploration explored 100000 steps with 0 reset in 118 ms.
[2021-05-19 08:05:08] [INFO ] Flatten gal took : 7 ms
[2021-05-19 08:05:08] [INFO ] Flatten gal took : 2 ms
[2021-05-19 08:05:08] [INFO ] Time to serialize gal into /tmp/LTL10370008791987992383.gal : 0 ms
[2021-05-19 08:05:08] [INFO ] Time to serialize properties into /tmp/LTL17931161090444853525.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10370008791987992383.gal, -t, CGAL, -LTL, /tmp/LTL17931161090444853525.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10370008791987992383.gal -t CGAL -LTL /tmp/LTL17931161090444853525.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(p148<=p120)"))||(F(G("((p148>p120)&&(p56>p84))")))))
Formula 0 simplified : !(G"(p148<=p120)" | FG"((p148>p120)&&(p56>p84))")
Detected timeout of ITS tools.
[2021-05-19 08:05:23] [INFO ] Flatten gal took : 7 ms
[2021-05-19 08:05:23] [INFO ] Applying decomposition
[2021-05-19 08:05:23] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph629481616860015317.txt, -o, /tmp/graph629481616860015317.bin, -w, /tmp/graph629481616860015317.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph629481616860015317.bin, -l, -1, -v, -w, /tmp/graph629481616860015317.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 08:05:23] [INFO ] Decomposing Gal with order
[2021-05-19 08:05:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 08:05:23] [INFO ] Removed a total of 14 redundant transitions.
[2021-05-19 08:05:23] [INFO ] Flatten gal took : 5 ms
[2021-05-19 08:05:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 1 ms.
[2021-05-19 08:05:23] [INFO ] Time to serialize gal into /tmp/LTL1411095297813294774.gal : 1 ms
[2021-05-19 08:05:23] [INFO ] Time to serialize properties into /tmp/LTL13162203312459998932.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1411095297813294774.gal, -t, CGAL, -LTL, /tmp/LTL13162203312459998932.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1411095297813294774.gal -t CGAL -LTL /tmp/LTL13162203312459998932.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(gu28.p148<=gu28.p120)"))||(F(G("((gu28.p148>gu28.p120)&&(gu11.p56>gu11.p84))")))))
Formula 0 simplified : !(G"(gu28.p148<=gu28.p120)" | FG"((gu28.p148>gu28.p120)&&(gu11.p56>gu11.p84))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6448073374463337047
[2021-05-19 08:05:38] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6448073374463337047
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6448073374463337047]
Compilation finished in 309 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6448073374463337047]
Link finished in 34 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp0==true))||<>([]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin6448073374463337047]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SemanticWebServices-PT-S064P18-07 finished in 46304 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&(p1||X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 103/103 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 92 transition count 103
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 86 transition count 97
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 86 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 86 transition count 96
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 20 place count 81 transition count 91
Iterating global reduction 2 with 5 rules applied. Total rules applied 25 place count 81 transition count 91
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 29 place count 77 transition count 87
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 77 transition count 87
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 74 transition count 84
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 74 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 72 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 72 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 71 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 71 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 70 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 70 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 69 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 69 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 69 transition count 78
Applied a total of 50 rules in 30 ms. Remains 69 /94 variables (removed 25) and now considering 78/103 (removed 25) transitions.
[2021-05-19 08:05:53] [INFO ] Flow matrix only has 70 transitions (discarded 8 similar events)
// Phase 1: matrix 70 rows 69 cols
[2021-05-19 08:05:53] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:05:53] [INFO ] Implicit Places using invariants in 17 ms returned []
[2021-05-19 08:05:53] [INFO ] Flow matrix only has 70 transitions (discarded 8 similar events)
// Phase 1: matrix 70 rows 69 cols
[2021-05-19 08:05:53] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:05:53] [INFO ] State equation strengthened by 61 read => feed constraints.
[2021-05-19 08:05:53] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2021-05-19 08:05:53] [INFO ] Flow matrix only has 70 transitions (discarded 8 similar events)
// Phase 1: matrix 70 rows 69 cols
[2021-05-19 08:05:53] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:05:53] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 69/94 places, 78/103 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-08 automaton TGBA [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=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 3 s9), p1:(LEQ 2 s47)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-08 finished in 250 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 103/103 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 91 transition count 100
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 100
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 10 place count 83 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 83 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 83 transition count 93
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 78 transition count 88
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 78 transition count 88
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 73 transition count 83
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 73 transition count 83
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 69 transition count 79
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 69 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 65 transition count 75
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 65 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 63 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 63 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 61 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 61 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 61 transition count 70
Applied a total of 62 rules in 25 ms. Remains 61 /94 variables (removed 33) and now considering 70/103 (removed 33) transitions.
[2021-05-19 08:05:53] [INFO ] Flow matrix only has 62 transitions (discarded 8 similar events)
// Phase 1: matrix 62 rows 61 cols
[2021-05-19 08:05:53] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:05:53] [INFO ] Implicit Places using invariants in 14 ms returned []
[2021-05-19 08:05:53] [INFO ] Flow matrix only has 62 transitions (discarded 8 similar events)
// Phase 1: matrix 62 rows 61 cols
[2021-05-19 08:05:53] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-19 08:05:53] [INFO ] State equation strengthened by 46 read => feed constraints.
[2021-05-19 08:05:53] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2021-05-19 08:05:53] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-19 08:05:53] [INFO ] Flow matrix only has 62 transitions (discarded 8 similar events)
// Phase 1: matrix 62 rows 61 cols
[2021-05-19 08:05:53] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:05:53] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/94 places, 70/103 transitions.
Stuttering acceptance computed with spot in 54 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-10 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s5 s57), p1:(LEQ 2 s49)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 172 ms.
Product exploration explored 100000 steps with 0 reset in 359 ms.
Graph (complete) has 130 edges and 61 vertex of which 57 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 244 ms.
Product exploration explored 100000 steps with 0 reset in 334 ms.
[2021-05-19 08:05:54] [INFO ] Flatten gal took : 2 ms
[2021-05-19 08:05:54] [INFO ] Flatten gal took : 2 ms
[2021-05-19 08:05:54] [INFO ] Time to serialize gal into /tmp/LTL10754262780316137589.gal : 1 ms
[2021-05-19 08:05:54] [INFO ] Time to serialize properties into /tmp/LTL11615214339875974454.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10754262780316137589.gal, -t, CGAL, -LTL, /tmp/LTL11615214339875974454.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10754262780316137589.gal -t CGAL -LTL /tmp/LTL11615214339875974454.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(p15<=p143)")&&(G("(p123>=2)")))))
Formula 0 simplified : !F("(p15<=p143)" & G"(p123>=2)")
Detected timeout of ITS tools.
[2021-05-19 08:06:09] [INFO ] Flatten gal took : 2 ms
[2021-05-19 08:06:09] [INFO ] Applying decomposition
[2021-05-19 08:06:09] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7898741178001235943.txt, -o, /tmp/graph7898741178001235943.bin, -w, /tmp/graph7898741178001235943.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7898741178001235943.bin, -l, -1, -v, -w, /tmp/graph7898741178001235943.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 08:06:09] [INFO ] Decomposing Gal with order
[2021-05-19 08:06:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 08:06:09] [INFO ] Removed a total of 12 redundant transitions.
[2021-05-19 08:06:09] [INFO ] Flatten gal took : 5 ms
[2021-05-19 08:06:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 0 ms.
[2021-05-19 08:06:09] [INFO ] Time to serialize gal into /tmp/LTL3767728525081167707.gal : 1 ms
[2021-05-19 08:06:09] [INFO ] Time to serialize properties into /tmp/LTL12339393357519602456.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3767728525081167707.gal, -t, CGAL, -LTL, /tmp/LTL12339393357519602456.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3767728525081167707.gal -t CGAL -LTL /tmp/LTL12339393357519602456.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(gu23.p15<=gu23.p143)")&&(G("(gi0.gi4.gu13.p123>=2)")))))
Formula 0 simplified : !F("(gu23.p15<=gu23.p143)" & G"(gi0.gi4.gu13.p123>=2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13367110487474150206
[2021-05-19 08:06:24] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13367110487474150206
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13367110487474150206]
Compilation finished in 275 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13367110487474150206]
Link finished in 39 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(((LTLAPp0==true)&&[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin13367110487474150206]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SemanticWebServices-PT-S064P18-10 finished in 46514 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 103/103 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 91 transition count 100
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 100
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 11 place count 82 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 18 place count 82 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 82 transition count 92
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 76 transition count 86
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 76 transition count 86
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 70 transition count 80
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 70 transition count 80
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 65 transition count 75
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 65 transition count 75
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 61 transition count 71
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 59 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 59 transition count 69
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 57 transition count 67
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 57 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 57 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 56 transition count 65
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 56 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 56 transition count 64
Applied a total of 73 rules in 24 ms. Remains 56 /94 variables (removed 38) and now considering 64/103 (removed 39) transitions.
[2021-05-19 08:06:39] [INFO ] Flow matrix only has 57 transitions (discarded 7 similar events)
// Phase 1: matrix 57 rows 56 cols
[2021-05-19 08:06:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 08:06:40] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-19 08:06:40] [INFO ] Flow matrix only has 57 transitions (discarded 7 similar events)
// Phase 1: matrix 57 rows 56 cols
[2021-05-19 08:06:40] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-19 08:06:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-19 08:06:40] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2021-05-19 08:06:40] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-19 08:06:40] [INFO ] Flow matrix only has 57 transitions (discarded 7 similar events)
// Phase 1: matrix 57 rows 56 cols
[2021-05-19 08:06:40] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 08:06:40] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 56/94 places, 64/103 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s51)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 207 ms.
Product exploration explored 100000 steps with 0 reset in 273 ms.
Graph (complete) has 119 edges and 56 vertex of which 52 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-11 finished in 700 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 103/103 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 91 transition count 100
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 100
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 11 place count 82 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 18 place count 82 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 82 transition count 92
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 76 transition count 86
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 76 transition count 86
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 71 transition count 81
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 71 transition count 81
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 67 transition count 77
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 67 transition count 77
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 64 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 64 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 63 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 63 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 62 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 62 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 62 transition count 71
Applied a total of 60 rules in 16 ms. Remains 62 /94 variables (removed 32) and now considering 71/103 (removed 32) transitions.
[2021-05-19 08:06:40] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
// Phase 1: matrix 63 rows 62 cols
[2021-05-19 08:06:40] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-19 08:06:40] [INFO ] Implicit Places using invariants in 17 ms returned []
[2021-05-19 08:06:40] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
// Phase 1: matrix 63 rows 62 cols
[2021-05-19 08:06:40] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 08:06:40] [INFO ] State equation strengthened by 47 read => feed constraints.
[2021-05-19 08:06:40] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2021-05-19 08:06:40] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-19 08:06:40] [INFO ] Flow matrix only has 63 transitions (discarded 8 similar events)
// Phase 1: matrix 63 rows 62 cols
[2021-05-19 08:06:40] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:06:40] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/94 places, 71/103 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT s5 s50) (LEQ 1 s56))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3 reset in 200 ms.
Product exploration explored 100000 steps with 1 reset in 311 ms.
Graph (complete) has 132 edges and 62 vertex of which 58 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 218 ms.
Stuttering criterion allowed to conclude after 135 steps with 4 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-12 finished in 945 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 103/103 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 92 transition count 103
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 85 transition count 96
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 85 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 85 transition count 95
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 80 transition count 90
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 80 transition count 90
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 32 place count 75 transition count 85
Iterating global reduction 2 with 5 rules applied. Total rules applied 37 place count 75 transition count 85
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 41 place count 71 transition count 81
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 71 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 68 transition count 78
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 68 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 66 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 66 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 64 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 64 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 64 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 63 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 63 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 63 transition count 71
Applied a total of 63 rules in 11 ms. Remains 63 /94 variables (removed 31) and now considering 71/103 (removed 32) transitions.
[2021-05-19 08:06:41] [INFO ] Flow matrix only has 64 transitions (discarded 7 similar events)
// Phase 1: matrix 64 rows 63 cols
[2021-05-19 08:06:41] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:06:41] [INFO ] Implicit Places using invariants in 17 ms returned []
[2021-05-19 08:06:41] [INFO ] Flow matrix only has 64 transitions (discarded 7 similar events)
// Phase 1: matrix 64 rows 63 cols
[2021-05-19 08:06:41] [INFO ] Computed 1 place invariants in 11 ms
[2021-05-19 08:06:41] [INFO ] State equation strengthened by 55 read => feed constraints.
[2021-05-19 08:06:41] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2021-05-19 08:06:41] [INFO ] Flow matrix only has 64 transitions (discarded 7 similar events)
// Phase 1: matrix 64 rows 63 cols
[2021-05-19 08:06:41] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:06:41] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/94 places, 71/103 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P18-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GT 1 s13), p0:(GT s62 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-13 finished in 243 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 103/103 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 91 transition count 100
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 100
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 11 place count 82 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 18 place count 82 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 82 transition count 92
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 76 transition count 86
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 76 transition count 86
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 70 transition count 80
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 70 transition count 80
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 66 transition count 76
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 66 transition count 76
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 62 transition count 72
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 60 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 60 transition count 70
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 58 transition count 68
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 58 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 58 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 57 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 57 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 57 transition count 65
Applied a total of 71 rules in 19 ms. Remains 57 /94 variables (removed 37) and now considering 65/103 (removed 38) transitions.
[2021-05-19 08:06:41] [INFO ] Flow matrix only has 58 transitions (discarded 7 similar events)
// Phase 1: matrix 58 rows 57 cols
[2021-05-19 08:06:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 08:06:41] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-19 08:06:41] [INFO ] Flow matrix only has 58 transitions (discarded 7 similar events)
// Phase 1: matrix 58 rows 57 cols
[2021-05-19 08:06:41] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:06:41] [INFO ] State equation strengthened by 43 read => feed constraints.
[2021-05-19 08:06:41] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2021-05-19 08:06:41] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-19 08:06:41] [INFO ] Flow matrix only has 58 transitions (discarded 7 similar events)
// Phase 1: matrix 58 rows 57 cols
[2021-05-19 08:06:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 08:06:41] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 57/94 places, 65/103 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 1 s12) (LEQ s37 s45))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 172 ms.
Product exploration explored 100000 steps with 0 reset in 277 ms.
Graph (complete) has 121 edges and 57 vertex of which 53 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 144 ms.
Product exploration explored 100000 steps with 0 reset in 340 ms.
[2021-05-19 08:06:42] [INFO ] Flatten gal took : 2 ms
[2021-05-19 08:06:42] [INFO ] Flatten gal took : 2 ms
[2021-05-19 08:06:42] [INFO ] Time to serialize gal into /tmp/LTL8405946361846537456.gal : 1 ms
[2021-05-19 08:06:42] [INFO ] Time to serialize properties into /tmp/LTL5205385351325162951.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8405946361846537456.gal, -t, CGAL, -LTL, /tmp/LTL5205385351325162951.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8405946361846537456.gal -t CGAL -LTL /tmp/LTL5205385351325162951.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((p57>=1)&&(p101<=p116))"))))
Formula 0 simplified : !FG"((p57>=1)&&(p101<=p116))"
Detected timeout of ITS tools.
[2021-05-19 08:06:58] [INFO ] Flatten gal took : 2 ms
[2021-05-19 08:06:58] [INFO ] Applying decomposition
[2021-05-19 08:06:58] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11407029532220204663.txt, -o, /tmp/graph11407029532220204663.bin, -w, /tmp/graph11407029532220204663.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11407029532220204663.bin, -l, -1, -v, -w, /tmp/graph11407029532220204663.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 08:06:58] [INFO ] Decomposing Gal with order
[2021-05-19 08:06:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 08:06:58] [INFO ] Removed a total of 10 redundant transitions.
[2021-05-19 08:06:58] [INFO ] Flatten gal took : 3 ms
[2021-05-19 08:06:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 1 ms.
[2021-05-19 08:06:58] [INFO ] Time to serialize gal into /tmp/LTL190946505003018683.gal : 1 ms
[2021-05-19 08:06:58] [INFO ] Time to serialize properties into /tmp/LTL12849921580704040446.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL190946505003018683.gal, -t, CGAL, -LTL, /tmp/LTL12849921580704040446.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL190946505003018683.gal -t CGAL -LTL /tmp/LTL12849921580704040446.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((gi0.gi1.gi0.gu6.p57>=1)&&(gu16.p101<=gu16.p116))"))))
Formula 0 simplified : !FG"((gi0.gi1.gi0.gu6.p57>=1)&&(gu16.p101<=gu16.p116))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16198481733241063891
[2021-05-19 08:07:13] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16198481733241063891
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16198481733241063891]
Compilation finished in 255 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16198481733241063891]
Link finished in 46 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin16198481733241063891]
LTSmin run took 395 ms.
FORMULA SemanticWebServices-PT-S064P18-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SemanticWebServices-PT-S064P18-14 finished in 31944 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(!p0)&&F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 103/103 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 91 transition count 100
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 100
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 11 place count 82 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 18 place count 82 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 82 transition count 92
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 76 transition count 86
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 76 transition count 86
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 70 transition count 80
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 70 transition count 80
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 65 transition count 75
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 65 transition count 75
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 61 transition count 71
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 59 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 59 transition count 69
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 57 transition count 67
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 57 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 57 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 56 transition count 65
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 56 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 56 transition count 64
Applied a total of 73 rules in 9 ms. Remains 56 /94 variables (removed 38) and now considering 64/103 (removed 39) transitions.
[2021-05-19 08:07:13] [INFO ] Flow matrix only has 57 transitions (discarded 7 similar events)
// Phase 1: matrix 57 rows 56 cols
[2021-05-19 08:07:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 08:07:13] [INFO ] Implicit Places using invariants in 21 ms returned []
[2021-05-19 08:07:13] [INFO ] Flow matrix only has 57 transitions (discarded 7 similar events)
// Phase 1: matrix 57 rows 56 cols
[2021-05-19 08:07:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 08:07:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-19 08:07:13] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2021-05-19 08:07:13] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-19 08:07:13] [INFO ] Flow matrix only has 57 transitions (discarded 7 similar events)
// Phase 1: matrix 57 rows 56 cols
[2021-05-19 08:07:13] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-19 08:07:13] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 56/94 places, 64/103 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, p0, (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 s9)], 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]]
Product exploration explored 100000 steps with 0 reset in 128 ms.
Product exploration explored 100000 steps with 0 reset in 308 ms.
Graph (complete) has 119 edges and 56 vertex of which 52 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 129 ms :[true, p0, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 115 ms.
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-15 finished in 909 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7937602978975638468
[2021-05-19 08:07:14] [INFO ] Applying decomposition
[2021-05-19 08:07:14] [INFO ] Computing symmetric may disable matrix : 103 transitions.
[2021-05-19 08:07:14] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-19 08:07:14] [INFO ] Computing symmetric may enable matrix : 103 transitions.
[2021-05-19 08:07:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-19 08:07:14] [INFO ] Flatten gal took : 2 ms
[2021-05-19 08:07:14] [INFO ] Computing Do-Not-Accords matrix : 103 transitions.
[2021-05-19 08:07:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-19 08:07:14] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7937602978975638468
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7937602978975638468]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8535070215401177401.txt, -o, /tmp/graph8535070215401177401.bin, -w, /tmp/graph8535070215401177401.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8535070215401177401.bin, -l, -1, -v, -w, /tmp/graph8535070215401177401.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 08:07:14] [INFO ] Decomposing Gal with order
[2021-05-19 08:07:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 08:07:14] [INFO ] Removed a total of 19 redundant transitions.
[2021-05-19 08:07:14] [INFO ] Flatten gal took : 10 ms
[2021-05-19 08:07:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 1 ms.
[2021-05-19 08:07:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality17114477473433427147.gal : 1 ms
[2021-05-19 08:07:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality17823104328921192253.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality17114477473433427147.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17823104328921192253.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality17114477473433427147.gal -t CGAL -LTL /tmp/LTLCardinality17823104328921192253.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((F(((G("(gi2.gi2.gi6.gu5.p85>=1)"))||(G("(gi2.gi2.gi6.gu5.p85<1)")))||(G(F(("(gi2.gi2.gi0.gu4.p117<1)")U(("((gi2.gi0.gi1.gu3.p31<2)&&(gi2.gi2.gi0.gu4.p117<1))")||(G("(gi2.gi2.gi0.gu4.p117<1)")))))))))
Formula 0 simplified : !F(G"(gi2.gi2.gi6.gu5.p85>=1)" | G"(gi2.gi2.gi6.gu5.p85<1)" | GF("(gi2.gi2.gi0.gu4.p117<1)" U ("((gi2.gi0.gi1.gu3.p31<2)&&(gi2.gi2.gi0.gu4.p117<1))" | G"(gi2.gi2.gi0.gu4.p117<1)")))
Compilation finished in 434 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7937602978975638468]
Link finished in 41 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp0==true))||[](!(LTLAPp0==true))||[](<>(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7937602978975638468]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: Initializing POR dependencies: labels 110, guards 103
pins2lts-mc-linux64( 3/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.033: LTL layer: formula: <>(([]((LTLAPp0==true))||[](!(LTLAPp0==true))||[](<>(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))))))
pins2lts-mc-linux64( 1/ 8), 0.033: "<>(([]((LTLAPp0==true))||[](!(LTLAPp0==true))||[](<>(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.033: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.041: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.041: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.088: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.139: There are 111 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.139: State length is 95, there are 115 groups
pins2lts-mc-linux64( 0/ 8), 0.139: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.139: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.139: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.139: Visible groups: 3 / 115, labels: 3 / 111
pins2lts-mc-linux64( 0/ 8), 0.139: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.139: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.316: [Blue] ~120 levels ~960 states ~1080 transitions
pins2lts-mc-linux64( 1/ 8), 0.355: [Blue] ~240 levels ~1920 states ~2040 transitions
pins2lts-mc-linux64( 1/ 8), 0.390: [Blue] ~480 levels ~3840 states ~3960 transitions
pins2lts-mc-linux64( 3/ 8), 0.415: [Blue] ~960 levels ~7680 states ~7800 transitions
pins2lts-mc-linux64( 5/ 8), 0.439: [Blue] ~1920 levels ~15360 states ~15480 transitions
pins2lts-mc-linux64( 0/ 8), 0.511: [Blue] ~3840 levels ~30720 states ~30832 transitions
pins2lts-mc-linux64( 5/ 8), 0.630: [Blue] ~7680 levels ~61440 states ~61560 transitions
pins2lts-mc-linux64( 3/ 8), 0.898: [Blue] ~15360 levels ~122880 states ~123000 transitions
pins2lts-mc-linux64( 3/ 8), 1.424: [Blue] ~30720 levels ~245760 states ~245880 transitions
pins2lts-mc-linux64( 3/ 8), 2.553: [Blue] ~61440 levels ~491520 states ~491640 transitions
pins2lts-mc-linux64( 3/ 8), 4.787: [Blue] ~122880 levels ~983040 states ~983160 transitions
pins2lts-mc-linux64( 0/ 8), 8.953: [Blue] ~245760 levels ~1966080 states ~1966192 transitions
pins2lts-mc-linux64( 0/ 8), 17.264: [Blue] ~491520 levels ~3932160 states ~3932272 transitions
pins2lts-mc-linux64( 0/ 8), 33.980: [Blue] ~983040 levels ~7864320 states ~7864432 transitions
pins2lts-mc-linux64( 1/ 8), 39.364: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 39.757:
pins2lts-mc-linux64( 0/ 8), 39.757: Explored 8050638 states 8050793 transitions, fanout: 1.000
pins2lts-mc-linux64( 0/ 8), 39.757: Total exploration time 39.580 sec (39.180 sec minimum, 39.332 sec on average)
pins2lts-mc-linux64( 0/ 8), 39.757: States per second: 203402, Transitions per second: 203406
pins2lts-mc-linux64( 0/ 8), 39.757:
pins2lts-mc-linux64( 0/ 8), 39.757: State space has 8050679 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 39.757: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 39.757: blue states: 8050638 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 39.757: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 39.757: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 39.757:
pins2lts-mc-linux64( 0/ 8), 39.757: Total memory used for local state coloring: 122.8MB
pins2lts-mc-linux64( 0/ 8), 39.757:
pins2lts-mc-linux64( 0/ 8), 39.757: Queue width: 8B, total height: 8050638, memory: 61.42MB
pins2lts-mc-linux64( 0/ 8), 39.757: Tree memory: 317.4MB, 41.3 B/state, compr.: 10.8%
pins2lts-mc-linux64( 0/ 8), 39.757: Tree fill ratio (roots/leafs): 5.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 39.757: Stored 103 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 39.757: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 39.757: Est. total memory use: 378.8MB (~1085.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp0==true))||[](!(LTLAPp0==true))||[](<>(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7937602978975638468]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp0==true))||[](!(LTLAPp0==true))||[](<>(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7937602978975638468]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-19 08:28:25] [INFO ] Flatten gal took : 3 ms
[2021-05-19 08:28:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality16098770316904486892.gal : 1 ms
[2021-05-19 08:28:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality4247906454331352446.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality16098770316904486892.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4247906454331352446.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality16098770316904486892.gal -t CGAL -LTL /tmp/LTLCardinality4247906454331352446.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((F(((G("(p85>=1)"))||(G("(p85<1)")))||(G(F(("(p117<1)")U(("((p31<2)&&(p117<1))")||(G("(p117<1)")))))))))
Formula 0 simplified : !F(G"(p85>=1)" | G"(p85<1)" | GF("(p117<1)" U ("((p31<2)&&(p117<1))" | G"(p117<1)")))
Detected timeout of ITS tools.
[2021-05-19 08:49:35] [INFO ] Flatten gal took : 2 ms
[2021-05-19 08:49:35] [INFO ] Input system was already deterministic with 103 transitions.
[2021-05-19 08:49:35] [INFO ] Transformed 94 places.
[2021-05-19 08:49:35] [INFO ] Transformed 103 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-19 08:49:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality9538468150928945469.gal : 0 ms
[2021-05-19 08:49:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality10344386435704700229.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality9538468150928945469.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10344386435704700229.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality9538468150928945469.gal -t CGAL -LTL /tmp/LTLCardinality10344386435704700229.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(((G("(p85>=1)"))||(G("(p85<1)")))||(G(F(("(p117<1)")U(("((p31<2)&&(p117<1))")||(G("(p117<1)")))))))))
Formula 0 simplified : !F(G"(p85>=1)" | G"(p85<1)" | GF("(p117<1)" U ("((p31<2)&&(p117<1))" | G"(p117<1)")))

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SemanticWebServices-PT-S064P18, 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 r311-tall-162132107700036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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