About the Execution of ITS-Tools for SemanticWebServices-PT-S064P12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16092.899 | 3600000.00 | 3802815.00 | 29205.00 | FFTF??F?FFFFFFFF | 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-162132107700021.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-S064P12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132107700021
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 108K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 12 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 12 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 12 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.4K May 11 20:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 20:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 11 17:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 117K 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-S064P12-00
FORMULA_NAME SemanticWebServices-PT-S064P12-01
FORMULA_NAME SemanticWebServices-PT-S064P12-02
FORMULA_NAME SemanticWebServices-PT-S064P12-03
FORMULA_NAME SemanticWebServices-PT-S064P12-04
FORMULA_NAME SemanticWebServices-PT-S064P12-05
FORMULA_NAME SemanticWebServices-PT-S064P12-06
FORMULA_NAME SemanticWebServices-PT-S064P12-07
FORMULA_NAME SemanticWebServices-PT-S064P12-08
FORMULA_NAME SemanticWebServices-PT-S064P12-09
FORMULA_NAME SemanticWebServices-PT-S064P12-10
FORMULA_NAME SemanticWebServices-PT-S064P12-11
FORMULA_NAME SemanticWebServices-PT-S064P12-12
FORMULA_NAME SemanticWebServices-PT-S064P12-13
FORMULA_NAME SemanticWebServices-PT-S064P12-14
FORMULA_NAME SemanticWebServices-PT-S064P12-15
=== Now, execution of the tool begins
BK_START 1621404198128
Running Version 0
[2021-05-19 06:03:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 06:03:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 06:03:19] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2021-05-19 06:03:19] [INFO ] Transformed 104 places.
[2021-05-19 06:03:19] [INFO ] Transformed 158 transitions.
[2021-05-19 06:03:19] [INFO ] Parsed PT model containing 104 places and 158 transitions in 96 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-19 06:03:19] [INFO ] Initial state test concluded for 2 properties.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 77 transitions
Reduce redundant transitions removed 77 transitions.
FORMULA SemanticWebServices-PT-S064P12-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 79/79 transitions.
Ensure Unique test removed 18 places
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 82 transition count 79
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 77 transition count 74
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 77 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 75 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 75 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 74 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 74 transition count 71
Applied a total of 36 rules in 20 ms. Remains 74 /102 variables (removed 28) and now considering 71/79 (removed 8) transitions.
[2021-05-19 06:03:19] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
// Phase 1: matrix 62 rows 74 cols
[2021-05-19 06:03:19] [INFO ] Computed 15 place invariants in 12 ms
[2021-05-19 06:03:20] [INFO ] Implicit Places using invariants in 96 ms returned []
[2021-05-19 06:03:20] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
// Phase 1: matrix 62 rows 74 cols
[2021-05-19 06:03:20] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-19 06:03:20] [INFO ] State equation strengthened by 52 read => feed constraints.
[2021-05-19 06:03:20] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2021-05-19 06:03:20] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
// Phase 1: matrix 62 rows 74 cols
[2021-05-19 06:03:20] [INFO ] Computed 15 place invariants in 6 ms
[2021-05-19 06:03:20] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 74/102 places, 71/79 transitions.
[2021-05-19 06:03:20] [INFO ] Flatten gal took : 24 ms
[2021-05-19 06:03:20] [INFO ] Flatten gal took : 8 ms
[2021-05-19 06:03:20] [INFO ] Input system was already deterministic with 71 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=259 ) properties (out of 27) seen :24
Running SMT prover for 3 properties.
[2021-05-19 06:03:20] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
// Phase 1: matrix 62 rows 74 cols
[2021-05-19 06:03:20] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-19 06:03:20] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-19 06:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:03:20] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-19 06:03:20] [INFO ] State equation strengthened by 52 read => feed constraints.
[2021-05-19 06:03:20] [INFO ] [Real]Added 52 Read/Feed constraints in 5 ms returned sat
[2021-05-19 06:03:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 06:03:20] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 5 ms returned sat
[2021-05-19 06:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 06:03:20] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-19 06:03:20] [INFO ] [Nat]Added 52 Read/Feed constraints in 11 ms returned sat
[2021-05-19 06:03:20] [INFO ] Computed and/alt/rep : 66/99/57 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-19 06:03:21] [INFO ] Added : 48 causal constraints over 10 iterations in 85 ms. Result :sat
[2021-05-19 06:03:21] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-19 06:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:03:21] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-19 06:03:21] [INFO ] [Real]Added 52 Read/Feed constraints in 6 ms returned sat
[2021-05-19 06:03:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 06:03:21] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-19 06:03:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 06:03:21] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-19 06:03:21] [INFO ] [Nat]Added 52 Read/Feed constraints in 15 ms returned sat
[2021-05-19 06:03:21] [INFO ] Computed and/alt/rep : 66/99/57 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-19 06:03:21] [INFO ] Added : 48 causal constraints over 10 iterations in 64 ms. Result :sat
[2021-05-19 06:03:21] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 2 ms returned sat
[2021-05-19 06:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:03:21] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-19 06:03:21] [INFO ] [Real]Added 52 Read/Feed constraints in 4 ms returned sat
[2021-05-19 06:03:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 06:03:21] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-19 06:03:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 06:03:21] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-19 06:03:21] [INFO ] [Nat]Added 52 Read/Feed constraints in 4 ms returned sat
[2021-05-19 06:03:21] [INFO ] Computed and/alt/rep : 66/99/57 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-19 06:03:21] [INFO ] Added : 48 causal constraints over 10 iterations in 59 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&X((G(p0) U G(p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 74/74 places, 71/71 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 61 transition count 71
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 20 place count 54 transition count 64
Iterating global reduction 1 with 7 rules applied. Total rules applied 27 place count 54 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 54 transition count 63
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 50 transition count 59
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 50 transition count 59
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 47 transition count 56
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 47 transition count 56
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 44 transition count 53
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 44 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 44 transition count 52
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 52 place count 41 transition count 49
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 41 transition count 49
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 58 place count 41 transition count 46
Applied a total of 58 rules in 14 ms. Remains 41 /74 variables (removed 33) and now considering 46/71 (removed 25) transitions.
[2021-05-19 06:03:21] [INFO ] Flow matrix only has 41 transitions (discarded 5 similar events)
// Phase 1: matrix 41 rows 41 cols
[2021-05-19 06:03:21] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-19 06:03:21] [INFO ] Implicit Places using invariants in 18 ms returned []
[2021-05-19 06:03:21] [INFO ] Flow matrix only has 41 transitions (discarded 5 similar events)
// Phase 1: matrix 41 rows 41 cols
[2021-05-19 06:03:21] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-19 06:03:21] [INFO ] State equation strengthened by 32 read => feed constraints.
[2021-05-19 06:03:21] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2021-05-19 06:03:21] [INFO ] Flow matrix only has 41 transitions (discarded 5 similar events)
// Phase 1: matrix 41 rows 41 cols
[2021-05-19 06:03:21] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-19 06:03:21] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/74 places, 46/71 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1)), p1:(AND (GEQ s6 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P12-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-01 finished in 402 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 74/74 places, 71/71 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 61 transition count 71
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 20 place count 54 transition count 64
Iterating global reduction 1 with 7 rules applied. Total rules applied 27 place count 54 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 54 transition count 63
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 33 place count 49 transition count 58
Iterating global reduction 2 with 5 rules applied. Total rules applied 38 place count 49 transition count 58
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 46 transition count 55
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 46 transition count 55
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 43 transition count 52
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 43 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 43 transition count 51
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 54 place count 40 transition count 48
Iterating global reduction 3 with 3 rules applied. Total rules applied 57 place count 40 transition count 48
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 40 transition count 45
Applied a total of 60 rules in 9 ms. Remains 40 /74 variables (removed 34) and now considering 45/71 (removed 26) transitions.
[2021-05-19 06:03:21] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
// Phase 1: matrix 40 rows 40 cols
[2021-05-19 06:03:21] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 06:03:21] [INFO ] Implicit Places using invariants in 25 ms returned []
[2021-05-19 06:03:21] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
// Phase 1: matrix 40 rows 40 cols
[2021-05-19 06:03:21] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-19 06:03:21] [INFO ] State equation strengthened by 31 read => feed constraints.
[2021-05-19 06:03:21] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2021-05-19 06:03:21] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
// Phase 1: matrix 40 rows 40 cols
[2021-05-19 06:03:21] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-19 06:03:21] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/74 places, 45/71 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s19 1) (AND (GEQ s6 1) (GEQ s32 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 34731 reset in 212 ms.
Product exploration explored 100000 steps with 34739 reset in 154 ms.
Graph (complete) has 85 edges and 40 vertex of which 34 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 34758 reset in 178 ms.
Product exploration explored 100000 steps with 34775 reset in 153 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 40 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 40/40 places, 45/45 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 40 transition count 46
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 40 transition count 46
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 7 ms. Remains 40 /40 variables (removed 0) and now considering 46/45 (removed -1) transitions.
[2021-05-19 06:03:22] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-19 06:03:22] [INFO ] Flow matrix only has 41 transitions (discarded 5 similar events)
// Phase 1: matrix 41 rows 40 cols
[2021-05-19 06:03:22] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-19 06:03:22] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 46/45 transitions.
Product exploration explored 100000 steps with 34759 reset in 302 ms.
Product exploration explored 100000 steps with 34802 reset in 205 ms.
[2021-05-19 06:03:23] [INFO ] Flatten gal took : 3 ms
[2021-05-19 06:03:23] [INFO ] Flatten gal took : 3 ms
[2021-05-19 06:03:23] [INFO ] Time to serialize gal into /tmp/LTL1060986968748030177.gal : 1 ms
[2021-05-19 06:03:23] [INFO ] Time to serialize properties into /tmp/LTL9453476884249209172.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/LTL1060986968748030177.gal, -t, CGAL, -LTL, /tmp/LTL9453476884249209172.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/LTL1060986968748030177.gal -t CGAL -LTL /tmp/LTL9453476884249209172.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p57>=1)||((p13>=1)&&(p86>=1)))"))))
Formula 0 simplified : !XF"((p57>=1)||((p13>=1)&&(p86>=1)))"
Detected timeout of ITS tools.
[2021-05-19 06:03:38] [INFO ] Flatten gal took : 3 ms
[2021-05-19 06:03:38] [INFO ] Applying decomposition
[2021-05-19 06:03:38] [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/graph6321699543136239222.txt, -o, /tmp/graph6321699543136239222.bin, -w, /tmp/graph6321699543136239222.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/graph6321699543136239222.bin, -l, -1, -v, -w, /tmp/graph6321699543136239222.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 06:03:38] [INFO ] Decomposing Gal with order
[2021-05-19 06:03:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 06:03:38] [INFO ] Removed a total of 9 redundant transitions.
[2021-05-19 06:03:38] [INFO ] Flatten gal took : 47 ms
[2021-05-19 06:03:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 2 ms.
[2021-05-19 06:03:38] [INFO ] Time to serialize gal into /tmp/LTL12697014036381776154.gal : 1 ms
[2021-05-19 06:03:38] [INFO ] Time to serialize properties into /tmp/LTL2692173719757927108.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/LTL12697014036381776154.gal, -t, CGAL, -LTL, /tmp/LTL2692173719757927108.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/LTL12697014036381776154.gal -t CGAL -LTL /tmp/LTL2692173719757927108.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i4.u7.p57>=1)||((i3.u12.p13>=1)&&(i3.u5.p86>=1)))"))))
Formula 0 simplified : !XF"((i4.u7.p57>=1)||((i3.u12.p13>=1)&&(i3.u5.p86>=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10522147455405956998
[2021-05-19 06:03:53] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10522147455405956998
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/ltsmin10522147455405956998]
Compilation finished in 251 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10522147455405956998]
Link finished in 38 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(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin10522147455405956998]
LTSmin run took 528 ms.
FORMULA SemanticWebServices-PT-S064P12-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SemanticWebServices-PT-S064P12-02 finished in 32729 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)||(p1 U X(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 74/74 places, 71/71 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 62 transition count 71
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 18 place count 56 transition count 65
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 56 transition count 65
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 51 transition count 60
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 51 transition count 60
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 48 transition count 57
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 48 transition count 57
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 45 transition count 54
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 45 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 45 transition count 53
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 42 transition count 50
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 42 transition count 50
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 42 transition count 47
Applied a total of 56 rules in 8 ms. Remains 42 /74 variables (removed 32) and now considering 47/71 (removed 24) transitions.
[2021-05-19 06:03:54] [INFO ] Flow matrix only has 42 transitions (discarded 5 similar events)
// Phase 1: matrix 42 rows 42 cols
[2021-05-19 06:03:54] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 06:03:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-19 06:03:54] [INFO ] Flow matrix only has 42 transitions (discarded 5 similar events)
// Phase 1: matrix 42 rows 42 cols
[2021-05-19 06:03:54] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-19 06:03:54] [INFO ] State equation strengthened by 32 read => feed constraints.
[2021-05-19 06:03:54] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2021-05-19 06:03:54] [INFO ] Flow matrix only has 42 transitions (discarded 5 similar events)
// Phase 1: matrix 42 rows 42 cols
[2021-05-19 06:03:54] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 06:03:54] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/74 places, 47/71 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s21 1), p1:(OR (LT s7 1) (LT s12 1) (LT s35 1)), p2:(AND (GEQ s6 1) (GEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 5 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-03 finished in 199 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U X((F(p0)||G((X(G(p2))&&p1))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 74 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 74/74 places, 71/71 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 64 transition count 71
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 16 place count 58 transition count 65
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 58 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 58 transition count 64
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 26 place count 55 transition count 61
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 55 transition count 61
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 52 transition count 58
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 52 transition count 58
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 50 transition count 56
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 50 transition count 56
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 50 transition count 55
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 49 transition count 54
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 49 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 49 transition count 53
Applied a total of 43 rules in 8 ms. Remains 49 /74 variables (removed 25) and now considering 53/71 (removed 18) transitions.
[2021-05-19 06:03:54] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
// Phase 1: matrix 46 rows 49 cols
[2021-05-19 06:03:54] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-19 06:03:54] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-19 06:03:54] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
// Phase 1: matrix 46 rows 49 cols
[2021-05-19 06:03:54] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-19 06:03:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2021-05-19 06:03:54] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2021-05-19 06:03:54] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
// Phase 1: matrix 46 rows 49 cols
[2021-05-19 06:03:54] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-19 06:03:54] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 49/74 places, 53/71 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s35 1)), p1:(AND (GEQ s6 1) (GEQ s46 1) (GEQ s9 1) (GEQ s34 1)), p2:(AND (GEQ s7 1) (GEQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 134 ms.
Product exploration explored 100000 steps with 1 reset in 205 ms.
Graph (complete) has 114 edges and 49 vertex of which 43 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Knowledge obtained : [(NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 0 reset in 102 ms.
Product exploration explored 100000 steps with 3 reset in 190 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 8 out of 49 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 49/49 places, 53/53 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 49 transition count 54
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 49 transition count 54
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 4 ms. Remains 49 /49 variables (removed 0) and now considering 54/53 (removed -1) transitions.
[2021-05-19 06:03:56] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-19 06:03:56] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
// Phase 1: matrix 47 rows 49 cols
[2021-05-19 06:03:56] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-19 06:03:56] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 49/49 places, 54/53 transitions.
Product exploration explored 100000 steps with 3 reset in 142 ms.
Product exploration explored 100000 steps with 1 reset in 196 ms.
[2021-05-19 06:03:56] [INFO ] Flatten gal took : 2 ms
[2021-05-19 06:03:56] [INFO ] Flatten gal took : 2 ms
[2021-05-19 06:03:56] [INFO ] Time to serialize gal into /tmp/LTL7337403604251923388.gal : 1 ms
[2021-05-19 06:03:56] [INFO ] Time to serialize properties into /tmp/LTL9749096354810126109.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/LTL7337403604251923388.gal, -t, CGAL, -LTL, /tmp/LTL9749096354810126109.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/LTL7337403604251923388.gal -t CGAL -LTL /tmp/LTL9749096354810126109.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((p34>=1)&&(p75>=1))"))U(X((F("((p34>=1)&&(p75>=1))"))||(G(("((((p19>=1)&&(p96>=1))&&(p37>=1))&&(p71>=1))")&&(X(G("((p33>=1)&&(p103>=1))")))))))))
Formula 0 simplified : !(F"((p34>=1)&&(p75>=1))" U X(F"((p34>=1)&&(p75>=1))" | G("((((p19>=1)&&(p96>=1))&&(p37>=1))&&(p71>=1))" & XG"((p33>=1)&&(p103>=1))")))
Detected timeout of ITS tools.
[2021-05-19 06:04:11] [INFO ] Flatten gal took : 3 ms
[2021-05-19 06:04:11] [INFO ] Applying decomposition
[2021-05-19 06:04:11] [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/graph15654888143976958299.txt, -o, /tmp/graph15654888143976958299.bin, -w, /tmp/graph15654888143976958299.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/graph15654888143976958299.bin, -l, -1, -v, -w, /tmp/graph15654888143976958299.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 06:04:11] [INFO ] Decomposing Gal with order
[2021-05-19 06:04:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 06:04:11] [INFO ] Removed a total of 13 redundant transitions.
[2021-05-19 06:04:11] [INFO ] Flatten gal took : 4 ms
[2021-05-19 06:04:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 1 ms.
[2021-05-19 06:04:11] [INFO ] Time to serialize gal into /tmp/LTL14454486333555280957.gal : 8 ms
[2021-05-19 06:04:11] [INFO ] Time to serialize properties into /tmp/LTL7198342681354486909.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/LTL14454486333555280957.gal, -t, CGAL, -LTL, /tmp/LTL7198342681354486909.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/LTL14454486333555280957.gal -t CGAL -LTL /tmp/LTL7198342681354486909.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("((i5.u13.p34>=1)&&(i5.u13.p75>=1))"))U(X((F("((i5.u13.p34>=1)&&(i5.u13.p75>=1))"))||(G(("((((i3.u10.p19>=1)&&(i3.u10.p96>=1))&&(i2.i0.u11.p37>=1))&&(i2.i1.u6.p71>=1))")&&(X(G("((u2.p33>=1)&&(u2.p103>=1))")))))))))
Formula 0 simplified : !(F"((i5.u13.p34>=1)&&(i5.u13.p75>=1))" U X(F"((i5.u13.p34>=1)&&(i5.u13.p75>=1))" | G("((((i3.u10.p19>=1)&&(i3.u10.p96>=1))&&(i2.i0.u11.p37>=1))&&(i2.i1.u6.p71>=1))" & XG"((u2.p33>=1)&&(u2.p103>=1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11381624869865373695
[2021-05-19 06:04:26] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11381624869865373695
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/ltsmin11381624869865373695]
Compilation finished in 218 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11381624869865373695]
Link finished in 32 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)) U X((<>((LTLAPp0==true))||[]((X([]((LTLAPp2==true)))&&(LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11381624869865373695]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SemanticWebServices-PT-S064P12-04 finished in 46826 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 74/74 places, 71/71 transitions.
Ensure Unique test removed 13 places
Reduce places removed 14 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 60 transition count 68
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 58 transition count 68
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 11 place count 51 transition count 61
Iterating global reduction 0 with 7 rules applied. Total rules applied 18 place count 51 transition count 61
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 51 transition count 60
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 47 transition count 56
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 47 transition count 56
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 44 transition count 53
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 44 transition count 53
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 41 transition count 50
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 41 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 41 transition count 49
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 38 transition count 46
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 38 transition count 46
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 38 transition count 43
Applied a total of 49 rules in 11 ms. Remains 38 /74 variables (removed 36) and now considering 43/71 (removed 28) transitions.
[2021-05-19 06:04:41] [INFO ] Flow matrix only has 38 transitions (discarded 5 similar events)
// Phase 1: matrix 38 rows 38 cols
[2021-05-19 06:04:41] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 06:04:41] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-19 06:04:41] [INFO ] Flow matrix only has 38 transitions (discarded 5 similar events)
// Phase 1: matrix 38 rows 38 cols
[2021-05-19 06:04:41] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-19 06:04:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-19 06:04:41] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2021-05-19 06:04:41] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-19 06:04:41] [INFO ] Flow matrix only has 38 transitions (discarded 5 similar events)
// Phase 1: matrix 38 rows 38 cols
[2021-05-19 06:04:41] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-19 06:04:41] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 38/74 places, 43/71 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LT s12 1), p0:(AND (GEQ s3 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 132 ms.
Product exploration explored 100000 steps with 0 reset in 93 ms.
Graph (complete) has 84 edges and 38 vertex of which 34 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 105 ms.
Product exploration explored 100000 steps with 0 reset in 166 ms.
[2021-05-19 06:04:42] [INFO ] Flatten gal took : 2 ms
[2021-05-19 06:04:42] [INFO ] Flatten gal took : 2 ms
[2021-05-19 06:04:42] [INFO ] Time to serialize gal into /tmp/LTL2666458925656448442.gal : 1 ms
[2021-05-19 06:04:42] [INFO ] Time to serialize properties into /tmp/LTL1602274585823191325.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/LTL2666458925656448442.gal, -t, CGAL, -LTL, /tmp/LTL1602274585823191325.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/LTL2666458925656448442.gal -t CGAL -LTL /tmp/LTL1602274585823191325.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(p52<1)"))||("((p30>=1)&&(p81>=1))")))))
Formula 0 simplified : !GF("((p30>=1)&&(p81>=1))" | G"(p52<1)")
Detected timeout of ITS tools.
[2021-05-19 06:04:57] [INFO ] Flatten gal took : 2 ms
[2021-05-19 06:04:57] [INFO ] Applying decomposition
[2021-05-19 06:04:57] [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/graph4039416517887364154.txt, -o, /tmp/graph4039416517887364154.bin, -w, /tmp/graph4039416517887364154.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/graph4039416517887364154.bin, -l, -1, -v, -w, /tmp/graph4039416517887364154.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 06:04:57] [INFO ] Decomposing Gal with order
[2021-05-19 06:04:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 06:04:57] [INFO ] Removed a total of 11 redundant transitions.
[2021-05-19 06:04:57] [INFO ] Flatten gal took : 4 ms
[2021-05-19 06:04:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2021-05-19 06:04:57] [INFO ] Time to serialize gal into /tmp/LTL1293043526208544538.gal : 1 ms
[2021-05-19 06:04:57] [INFO ] Time to serialize properties into /tmp/LTL253427262898916331.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/LTL1293043526208544538.gal, -t, CGAL, -LTL, /tmp/LTL253427262898916331.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/LTL1293043526208544538.gal -t CGAL -LTL /tmp/LTL253427262898916331.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(u6.p52<1)"))||("((i4.u14.p30>=1)&&(i4.u14.p81>=1))")))))
Formula 0 simplified : !GF("((i4.u14.p30>=1)&&(i4.u14.p81>=1))" | G"(u6.p52<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5823108323085037979
[2021-05-19 06:05:12] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5823108323085037979
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/ltsmin5823108323085037979]
Compilation finished in 182 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5823108323085037979]
Link finished in 31 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/ltsmin5823108323085037979]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SemanticWebServices-PT-S064P12-05 finished in 45875 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 74/74 places, 71/71 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 61 transition count 71
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 55 transition count 65
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 55 transition count 65
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 50 transition count 60
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 50 transition count 60
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 46 transition count 56
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 46 transition count 56
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 42 transition count 52
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 42 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 42 transition count 51
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 38 transition count 47
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 38 transition count 47
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 64 place count 38 transition count 43
Applied a total of 64 rules in 4 ms. Remains 38 /74 variables (removed 36) and now considering 43/71 (removed 28) transitions.
[2021-05-19 06:05:27] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 38 cols
[2021-05-19 06:05:27] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-19 06:05:27] [INFO ] Implicit Places using invariants in 35 ms returned []
[2021-05-19 06:05:27] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 38 cols
[2021-05-19 06:05:27] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-19 06:05:27] [INFO ] State equation strengthened by 29 read => feed constraints.
[2021-05-19 06:05:27] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2021-05-19 06:05:27] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 38 cols
[2021-05-19 06:05:27] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-19 06:05:27] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 38/74 places, 43/71 transitions.
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-06 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=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s5 1) (OR (LT s6 1) (LT s11 1) (LT s32 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 74 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-06 finished in 165 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 74/74 places, 71/71 transitions.
Ensure Unique test removed 13 places
Reduce places removed 14 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 60 transition count 68
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 58 transition count 68
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 11 place count 51 transition count 61
Iterating global reduction 0 with 7 rules applied. Total rules applied 18 place count 51 transition count 61
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 51 transition count 60
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 46 transition count 55
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 46 transition count 55
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 42 transition count 51
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 42 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 38 transition count 47
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 38 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 38 transition count 46
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 35 transition count 43
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 35 transition count 43
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 55 place count 35 transition count 40
Applied a total of 55 rules in 9 ms. Remains 35 /74 variables (removed 39) and now considering 40/71 (removed 31) transitions.
[2021-05-19 06:05:27] [INFO ] Flow matrix only has 35 transitions (discarded 5 similar events)
// Phase 1: matrix 35 rows 35 cols
[2021-05-19 06:05:27] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 06:05:27] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-19 06:05:27] [INFO ] Flow matrix only has 35 transitions (discarded 5 similar events)
// Phase 1: matrix 35 rows 35 cols
[2021-05-19 06:05:27] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 06:05:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-19 06:05:27] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2021-05-19 06:05:27] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-19 06:05:27] [INFO ] Flow matrix only has 35 transitions (discarded 5 similar events)
// Phase 1: matrix 35 rows 35 cols
[2021-05-19 06:05:27] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 06:05:27] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 35/74 places, 40/71 transitions.
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s26 1)), p1:(GEQ s2 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 110 ms.
Product exploration explored 100000 steps with 0 reset in 121 ms.
Graph (complete) has 78 edges and 35 vertex of which 31 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 22 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 179 ms.
Product exploration explored 100000 steps with 0 reset in 245 ms.
[2021-05-19 06:05:28] [INFO ] Flatten gal took : 2 ms
[2021-05-19 06:05:28] [INFO ] Flatten gal took : 1 ms
[2021-05-19 06:05:28] [INFO ] Time to serialize gal into /tmp/LTL8536838099147967527.gal : 0 ms
[2021-05-19 06:05:28] [INFO ] Time to serialize properties into /tmp/LTL10014168354960080969.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/LTL8536838099147967527.gal, -t, CGAL, -LTL, /tmp/LTL10014168354960080969.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/LTL8536838099147967527.gal -t CGAL -LTL /tmp/LTL10014168354960080969.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((p15<1)||(p76<1))"))||(G("(p5>=1)")))))
Formula 0 simplified : !F(G"((p15<1)||(p76<1))" | G"(p5>=1)")
Detected timeout of ITS tools.
[2021-05-19 06:05:43] [INFO ] Flatten gal took : 1 ms
[2021-05-19 06:05:43] [INFO ] Applying decomposition
[2021-05-19 06:05:43] [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/graph12170026245228617589.txt, -o, /tmp/graph12170026245228617589.bin, -w, /tmp/graph12170026245228617589.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/graph12170026245228617589.bin, -l, -1, -v, -w, /tmp/graph12170026245228617589.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 06:05:43] [INFO ] Decomposing Gal with order
[2021-05-19 06:05:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 06:05:43] [INFO ] Removed a total of 7 redundant transitions.
[2021-05-19 06:05:43] [INFO ] Flatten gal took : 3 ms
[2021-05-19 06:05:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 0 ms.
[2021-05-19 06:05:43] [INFO ] Time to serialize gal into /tmp/LTL17020733874166897548.gal : 10 ms
[2021-05-19 06:05:43] [INFO ] Time to serialize properties into /tmp/LTL464829482836855122.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/LTL17020733874166897548.gal, -t, CGAL, -LTL, /tmp/LTL464829482836855122.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/LTL17020733874166897548.gal -t CGAL -LTL /tmp/LTL464829482836855122.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("((u7.p15<1)||(u7.p76<1))"))||(G("(i2.u1.p5>=1)")))))
Formula 0 simplified : !F(G"((u7.p15<1)||(u7.p76<1))" | G"(i2.u1.p5>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11800971980518827963
[2021-05-19 06:05:58] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11800971980518827963
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/ltsmin11800971980518827963]
Compilation finished in 176 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11800971980518827963]
Link finished in 31 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/ltsmin11800971980518827963]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: LTL layer: formula: <>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: "<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.000: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.189: There are 43 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.189: State length is 36, there are 48 groups
pins2lts-mc-linux64( 0/ 8), 0.189: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.189: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.189: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.189: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.255: [Blue] ~120 levels ~960 states ~2784 transitions
pins2lts-mc-linux64( 7/ 8), 0.263: [Blue] ~240 levels ~1920 states ~4704 transitions
pins2lts-mc-linux64( 7/ 8), 0.266: [Blue] ~480 levels ~3840 states ~8544 transitions
pins2lts-mc-linux64( 7/ 8), 0.268: [Blue] ~960 levels ~7680 states ~16224 transitions
pins2lts-mc-linux64( 7/ 8), 0.272: [Blue] ~1920 levels ~15360 states ~31584 transitions
pins2lts-mc-linux64( 7/ 8), 0.280: [Blue] ~3840 levels ~30720 states ~62304 transitions
pins2lts-mc-linux64( 7/ 8), 0.296: [Blue] ~7680 levels ~61440 states ~123744 transitions
pins2lts-mc-linux64( 7/ 8), 0.327: [Blue] ~15360 levels ~122880 states ~246624 transitions
pins2lts-mc-linux64( 7/ 8), 0.390: [Blue] ~30720 levels ~245760 states ~492384 transitions
pins2lts-mc-linux64( 7/ 8), 0.648: [Blue] ~61440 levels ~491520 states ~983904 transitions
pins2lts-mc-linux64( 7/ 8), 1.156: [Blue] ~122880 levels ~983040 states ~1966944 transitions
pins2lts-mc-linux64( 7/ 8), 2.207: [Blue] ~245760 levels ~1966080 states ~3933024 transitions
pins2lts-mc-linux64( 7/ 8), 4.330: [Blue] ~491520 levels ~3932160 states ~7865184 transitions
pins2lts-mc-linux64( 7/ 8), 8.578: [Blue] ~983040 levels ~7864320 states ~15729504 transitions
pins2lts-mc-linux64( 0/ 8), 14.565: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 14.737:
pins2lts-mc-linux64( 0/ 8), 14.737: Explored 3575156 states 27221609 transitions, fanout: 7.614
pins2lts-mc-linux64( 0/ 8), 14.737: Total exploration time 14.510 sec (14.350 sec minimum, 14.417 sec on average)
pins2lts-mc-linux64( 0/ 8), 14.737: States per second: 246393, Transitions per second: 1876058
pins2lts-mc-linux64( 0/ 8), 14.737:
pins2lts-mc-linux64( 0/ 8), 14.737: State space has 26402964 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 14.737: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 14.737: blue states: 3575156 (13.54%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 14.737: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 14.737: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 14.737:
pins2lts-mc-linux64( 0/ 8), 14.737: Total memory used for local state coloring: 54.6MB
pins2lts-mc-linux64( 0/ 8), 14.737:
pins2lts-mc-linux64( 0/ 8), 14.737: Queue width: 8B, total height: 3575156, memory: 27.28MB
pins2lts-mc-linux64( 0/ 8), 14.737: Tree memory: 457.4MB, 18.2 B/state, compr.: 12.4%
pins2lts-mc-linux64( 0/ 8), 14.737: Tree fill ratio (roots/leafs): 19.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 14.737: Stored 43 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 14.737: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 14.737: Est. total memory use: 484.7MB (~1051.3MB 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, --when, --ltl, <>(([]((LTLAPp0==true))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin11800971980518827963]
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, --when, --ltl, <>(([]((LTLAPp0==true))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin11800971980518827963]
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)
Treatment of property SemanticWebServices-PT-S064P12-07 finished in 45908 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(!p0)||X((p1||X(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 74/74 places, 71/71 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 62 transition count 71
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 18 place count 56 transition count 65
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 56 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 56 transition count 64
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 29 place count 52 transition count 60
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 52 transition count 60
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 48 transition count 56
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 48 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 45 place count 44 transition count 52
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 44 transition count 52
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 44 transition count 51
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 42 transition count 49
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 42 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 42 transition count 47
Applied a total of 56 rules in 3 ms. Remains 42 /74 variables (removed 32) and now considering 47/71 (removed 24) transitions.
[2021-05-19 06:06:13] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 42 cols
[2021-05-19 06:06:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 06:06:13] [INFO ] Implicit Places using invariants in 16 ms returned []
[2021-05-19 06:06:13] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 42 cols
[2021-05-19 06:06:13] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 06:06:13] [INFO ] State equation strengthened by 32 read => feed constraints.
[2021-05-19 06:06:13] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2021-05-19 06:06:13] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 42 cols
[2021-05-19 06:06:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 06:06:13] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/74 places, 47/71 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) p0), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), p0]
Running random walk in product with property : SemanticWebServices-PT-S064P12-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(AND (GEQ s6 1) (GEQ s31 1)), p2:(AND (GEQ s7 1) (GEQ s38 1)), p0:(GEQ s20 1)], 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P12-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-08 finished in 249 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 74/74 places, 71/71 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 61 transition count 71
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 56 transition count 66
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 56 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 56 transition count 65
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 52 transition count 61
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 52 transition count 61
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 49 transition count 58
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 49 transition count 58
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 46 transition count 55
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 46 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 46 transition count 54
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 48 place count 43 transition count 51
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 43 transition count 51
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 54 place count 43 transition count 48
Applied a total of 54 rules in 3 ms. Remains 43 /74 variables (removed 31) and now considering 48/71 (removed 23) transitions.
[2021-05-19 06:06:13] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
// Phase 1: matrix 43 rows 43 cols
[2021-05-19 06:06:13] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 06:06:13] [INFO ] Implicit Places using invariants in 12 ms returned []
[2021-05-19 06:06:13] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
// Phase 1: matrix 43 rows 43 cols
[2021-05-19 06:06:13] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 06:06:13] [INFO ] State equation strengthened by 34 read => feed constraints.
[2021-05-19 06:06:13] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2021-05-19 06:06:13] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
// Phase 1: matrix 43 rows 43 cols
[2021-05-19 06:06:13] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 06:06:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 43/74 places, 48/71 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s28 1) (AND (GEQ s6 1) (GEQ s31 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 116 steps with 2 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-09 finished in 145 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 74/74 places, 71/71 transitions.
Ensure Unique test removed 14 places
Reduce places removed 15 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 59 transition count 68
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 57 transition count 68
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 10 place count 51 transition count 62
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 51 transition count 62
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 51 transition count 61
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 47 transition count 57
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 47 transition count 57
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 44 transition count 54
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 44 transition count 54
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 41 transition count 51
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 41 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 37 transition count 47
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 37 transition count 47
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 37 transition count 43
Applied a total of 49 rules in 7 ms. Remains 37 /74 variables (removed 37) and now considering 43/71 (removed 28) transitions.
[2021-05-19 06:06:13] [INFO ] Flow matrix only has 38 transitions (discarded 5 similar events)
// Phase 1: matrix 38 rows 37 cols
[2021-05-19 06:06:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 06:06:13] [INFO ] Implicit Places using invariants in 13 ms returned []
[2021-05-19 06:06:13] [INFO ] Flow matrix only has 38 transitions (discarded 5 similar events)
// Phase 1: matrix 38 rows 37 cols
[2021-05-19 06:06:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 06:06:13] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-19 06:06:13] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-05-19 06:06:13] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-19 06:06:13] [INFO ] Flow matrix only has 38 transitions (discarded 5 similar events)
// Phase 1: matrix 38 rows 37 cols
[2021-05-19 06:06:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-19 06:06:13] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/74 places, 43/71 transitions.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s7 1), p1:(AND (GEQ s10 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 117 ms.
Product exploration explored 100000 steps with 0 reset in 137 ms.
Graph (complete) has 79 edges and 37 vertex of which 33 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 114 ms.
Product exploration explored 100000 steps with 0 reset in 109 ms.
[2021-05-19 06:06:14] [INFO ] Flatten gal took : 1 ms
[2021-05-19 06:06:14] [INFO ] Flatten gal took : 1 ms
[2021-05-19 06:06:14] [INFO ] Time to serialize gal into /tmp/LTL10223567292112522597.gal : 1 ms
[2021-05-19 06:06:14] [INFO ] Time to serialize properties into /tmp/LTL9598193926317915759.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/LTL10223567292112522597.gal, -t, CGAL, -LTL, /tmp/LTL9598193926317915759.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/LTL10223567292112522597.gal -t CGAL -LTL /tmp/LTL9598193926317915759.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p46>=1)"))&&(F(G("((p51>=1)&&(p60>=1))")))))
Formula 0 simplified : !(F"(p46>=1)" & FG"((p51>=1)&&(p60>=1))")
Detected timeout of ITS tools.
[2021-05-19 06:06:29] [INFO ] Flatten gal took : 2 ms
[2021-05-19 06:06:29] [INFO ] Applying decomposition
[2021-05-19 06:06:29] [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/graph7627379346860352499.txt, -o, /tmp/graph7627379346860352499.bin, -w, /tmp/graph7627379346860352499.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/graph7627379346860352499.bin, -l, -1, -v, -w, /tmp/graph7627379346860352499.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 06:06:29] [INFO ] Decomposing Gal with order
[2021-05-19 06:06:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 06:06:29] [INFO ] Removed a total of 8 redundant transitions.
[2021-05-19 06:06:29] [INFO ] Flatten gal took : 3 ms
[2021-05-19 06:06:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2021-05-19 06:06:29] [INFO ] Time to serialize gal into /tmp/LTL14917457659306895628.gal : 0 ms
[2021-05-19 06:06:29] [INFO ] Time to serialize properties into /tmp/LTL13566377411582773008.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/LTL14917457659306895628.gal, -t, CGAL, -LTL, /tmp/LTL13566377411582773008.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/LTL14917457659306895628.gal -t CGAL -LTL /tmp/LTL13566377411582773008.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(i5.u3.p46>=1)"))&&(F(G("((i1.u4.p51>=1)&&(i3.u9.p60>=1))")))))
Formula 0 simplified : !(F"(i5.u3.p46>=1)" & FG"((i1.u4.p51>=1)&&(i3.u9.p60>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1913876926644652086
[2021-05-19 06:06:44] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1913876926644652086
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/ltsmin1913876926644652086]
Compilation finished in 181 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1913876926644652086]
Link finished in 32 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/ltsmin1913876926644652086]
LTSmin run took 195 ms.
FORMULA SemanticWebServices-PT-S064P12-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SemanticWebServices-PT-S064P12-10 finished in 31227 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 74/74 places, 71/71 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 62 transition count 71
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 57 transition count 66
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 57 transition count 66
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 53 transition count 62
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 53 transition count 62
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 50 transition count 59
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 50 transition count 59
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 47 transition count 56
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 47 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 47 transition count 55
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 44 transition count 52
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 44 transition count 52
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 44 transition count 49
Applied a total of 52 rules in 3 ms. Remains 44 /74 variables (removed 30) and now considering 49/71 (removed 22) transitions.
[2021-05-19 06:06:45] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
// Phase 1: matrix 44 rows 44 cols
[2021-05-19 06:06:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 06:06:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2021-05-19 06:06:45] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
// Phase 1: matrix 44 rows 44 cols
[2021-05-19 06:06:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 06:06:45] [INFO ] State equation strengthened by 34 read => feed constraints.
[2021-05-19 06:06:45] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2021-05-19 06:06:45] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
// Phase 1: matrix 44 rows 44 cols
[2021-05-19 06:06:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 06:06:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 44/74 places, 49/71 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s9 1) (GEQ s37 1)), p1:(AND (GEQ s7 1) (GEQ s31 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-11 finished in 151 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 74/74 places, 71/71 transitions.
Ensure Unique test removed 13 places
Reduce places removed 14 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 60 transition count 68
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 58 transition count 68
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 10 place count 52 transition count 62
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 52 transition count 62
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 52 transition count 61
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 48 transition count 57
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 48 transition count 57
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 45 transition count 54
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 45 transition count 54
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 42 transition count 51
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 42 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 42 transition count 50
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 40 transition count 48
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 40 transition count 48
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 40 transition count 46
Applied a total of 44 rules in 8 ms. Remains 40 /74 variables (removed 34) and now considering 46/71 (removed 25) transitions.
[2021-05-19 06:06:45] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
// Phase 1: matrix 40 rows 40 cols
[2021-05-19 06:06:45] [INFO ] Computed 2 place invariants in 69 ms
[2021-05-19 06:06:45] [INFO ] Implicit Places using invariants in 106 ms returned []
[2021-05-19 06:06:45] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
// Phase 1: matrix 40 rows 40 cols
[2021-05-19 06:06:45] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 06:06:45] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-19 06:06:45] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2021-05-19 06:06:45] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-19 06:06:45] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
// Phase 1: matrix 40 rows 40 cols
[2021-05-19 06:06:45] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-19 06:06:45] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/74 places, 46/71 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s36 1))], 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 2 reset in 138 ms.
Product exploration explored 100000 steps with 0 reset in 176 ms.
Graph (complete) has 89 edges and 40 vertex of which 36 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)]
Product exploration explored 100000 steps with 2 reset in 83 ms.
Product exploration explored 100000 steps with 1 reset in 184 ms.
[2021-05-19 06:06:46] [INFO ] Flatten gal took : 2 ms
[2021-05-19 06:06:46] [INFO ] Flatten gal took : 1 ms
[2021-05-19 06:06:46] [INFO ] Time to serialize gal into /tmp/LTL12577548997725710853.gal : 0 ms
[2021-05-19 06:06:46] [INFO ] Time to serialize properties into /tmp/LTL103156493864399205.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/LTL12577548997725710853.gal, -t, CGAL, -LTL, /tmp/LTL103156493864399205.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/LTL12577548997725710853.gal -t CGAL -LTL /tmp/LTL103156493864399205.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((p21>=1)&&(p92>=1))")))
Formula 0 simplified : !F"((p21>=1)&&(p92>=1))"
Detected timeout of ITS tools.
[2021-05-19 06:07:01] [INFO ] Flatten gal took : 1 ms
[2021-05-19 06:07:01] [INFO ] Applying decomposition
[2021-05-19 06:07:01] [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/graph11844074973488755656.txt, -o, /tmp/graph11844074973488755656.bin, -w, /tmp/graph11844074973488755656.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/graph11844074973488755656.bin, -l, -1, -v, -w, /tmp/graph11844074973488755656.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 06:07:01] [INFO ] Decomposing Gal with order
[2021-05-19 06:07:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 06:07:01] [INFO ] Removed a total of 9 redundant transitions.
[2021-05-19 06:07:01] [INFO ] Flatten gal took : 3 ms
[2021-05-19 06:07:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 0 ms.
[2021-05-19 06:07:01] [INFO ] Time to serialize gal into /tmp/LTL7791212693996471477.gal : 1 ms
[2021-05-19 06:07:01] [INFO ] Time to serialize properties into /tmp/LTL12414031346318067304.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/LTL7791212693996471477.gal, -t, CGAL, -LTL, /tmp/LTL12414031346318067304.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/LTL7791212693996471477.gal -t CGAL -LTL /tmp/LTL12414031346318067304.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F("((i4.u14.p21>=1)&&(i4.u14.p92>=1))")))
Formula 0 simplified : !F"((i4.u14.p21>=1)&&(i4.u14.p92>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11844091184316922765
[2021-05-19 06:07:16] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11844091184316922765
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/ltsmin11844091184316922765]
Compilation finished in 189 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11844091184316922765]
Link finished in 32 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/ltsmin11844091184316922765]
LTSmin run took 191 ms.
FORMULA SemanticWebServices-PT-S064P12-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SemanticWebServices-PT-S064P12-12 finished in 31315 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X((X(p2)||G(p3)||p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 74/74 places, 71/71 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 61 transition count 71
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 55 transition count 65
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 55 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 55 transition count 64
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 51 transition count 60
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 51 transition count 60
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 47 transition count 56
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 47 transition count 56
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 44 transition count 53
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 44 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 44 transition count 52
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 42 transition count 50
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 42 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 42 transition count 48
Applied a total of 55 rules in 3 ms. Remains 42 /74 variables (removed 32) and now considering 48/71 (removed 23) transitions.
[2021-05-19 06:07:16] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 42 cols
[2021-05-19 06:07:16] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 06:07:16] [INFO ] Implicit Places using invariants in 29 ms returned []
[2021-05-19 06:07:16] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 42 cols
[2021-05-19 06:07:16] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 06:07:16] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-19 06:07:16] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2021-05-19 06:07:16] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 42 cols
[2021-05-19 06:07:16] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 06:07:16] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/74 places, 48/71 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (OR (NOT p0) (NOT p3))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p3 p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p3 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}, { cond=(OR (NOT p0) (AND (NOT p3) (NOT p2))), acceptance={} source=2 dest: 5}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(OR (NOT p0) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LT s13 1), p1:(OR (LT s6 1) (LT s37 1)), p3:(LT s9 1), p2:(AND (GEQ s6 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 128 ms.
Product exploration explored 100000 steps with 0 reset in 231 ms.
Graph (complete) has 90 edges and 42 vertex of which 36 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Knowledge obtained : [p0, p1, p3, (NOT p2)]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (OR (NOT p0) (NOT p3))]
Entered a terminal (fully accepting) state of product in 11 steps with 1 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-13 finished in 1030 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||G(p1)))||(F(G(p0)) U p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 74/74 places, 71/71 transitions.
Ensure Unique test removed 13 places
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 61 transition count 69
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 59 transition count 69
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 11 place count 52 transition count 62
Iterating global reduction 0 with 7 rules applied. Total rules applied 18 place count 52 transition count 62
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 52 transition count 61
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 47 transition count 56
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 47 transition count 56
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 43 transition count 52
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 43 transition count 52
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 40 transition count 49
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 40 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 40 transition count 48
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 37 transition count 45
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 37 transition count 45
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 53 place count 37 transition count 42
Applied a total of 53 rules in 7 ms. Remains 37 /74 variables (removed 37) and now considering 42/71 (removed 29) transitions.
[2021-05-19 06:07:17] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
// Phase 1: matrix 37 rows 37 cols
[2021-05-19 06:07:17] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-19 06:07:17] [INFO ] Implicit Places using invariants in 22 ms returned []
[2021-05-19 06:07:17] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
// Phase 1: matrix 37 rows 37 cols
[2021-05-19 06:07:17] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-19 06:07:17] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-19 06:07:17] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2021-05-19 06:07:17] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-19 06:07:17] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
// Phase 1: matrix 37 rows 37 cols
[2021-05-19 06:07:17] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-19 06:07:17] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/74 places, 42/71 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s32 1)), p1:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 151 ms.
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-14 finished in 310 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(F(p1))&&p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 74/74 places, 71/71 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 62 transition count 71
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 57 transition count 66
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 57 transition count 66
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 53 transition count 62
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 53 transition count 62
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 50 transition count 59
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 50 transition count 59
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 47 transition count 56
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 47 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 47 transition count 55
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 44 transition count 52
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 44 transition count 52
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 44 transition count 49
Applied a total of 52 rules in 5 ms. Remains 44 /74 variables (removed 30) and now considering 49/71 (removed 22) transitions.
[2021-05-19 06:07:17] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
// Phase 1: matrix 44 rows 44 cols
[2021-05-19 06:07:17] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 06:07:17] [INFO ] Implicit Places using invariants in 13 ms returned []
[2021-05-19 06:07:17] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
// Phase 1: matrix 44 rows 44 cols
[2021-05-19 06:07:17] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 06:07:17] [INFO ] State equation strengthened by 34 read => feed constraints.
[2021-05-19 06:07:17] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2021-05-19 06:07:18] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
// Phase 1: matrix 44 rows 44 cols
[2021-05-19 06:07:18] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 06:07:18] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 44/74 places, 49/71 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s32 1)), p0:(AND (GEQ s6 1) (GEQ s9 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 112 ms.
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-15 finished in 320 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4933740742824596263
[2021-05-19 06:07:18] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2021-05-19 06:07:18] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-19 06:07:18] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2021-05-19 06:07:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-19 06:07:18] [INFO ] Applying decomposition
[2021-05-19 06:07:18] [INFO ] Flatten gal took : 2 ms
[2021-05-19 06:07:18] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2021-05-19 06:07:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-19 06:07:18] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4933740742824596263
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/ltsmin4933740742824596263]
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/graph15399721948245957682.txt, -o, /tmp/graph15399721948245957682.bin, -w, /tmp/graph15399721948245957682.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/graph15399721948245957682.bin, -l, -1, -v, -w, /tmp/graph15399721948245957682.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 06:07:18] [INFO ] Decomposing Gal with order
[2021-05-19 06:07:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 06:07:18] [INFO ] Removed a total of 17 redundant transitions.
[2021-05-19 06:07:18] [INFO ] Flatten gal took : 9 ms
[2021-05-19 06:07:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 1 ms.
[2021-05-19 06:07:18] [INFO ] Time to serialize gal into /tmp/LTLFireability2994966886402478528.gal : 37 ms
[2021-05-19 06:07:18] [INFO ] Time to serialize properties into /tmp/LTLFireability10930427872309930933.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/LTLFireability2994966886402478528.gal, -t, CGAL, -LTL, /tmp/LTLFireability10930427872309930933.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/LTLFireability2994966886402478528.gal -t CGAL -LTL /tmp/LTLFireability10930427872309930933.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !(((F("((i8.u12.p34>=1)&&(i8.u12.p75>=1))"))U(X((F("((i8.u12.p34>=1)&&(i8.u12.p75>=1))"))||(G(("((((i5.u10.p19>=1)&&(i5.u10.p96>=1))&&(i3.u5.p37>=1))&&(i3.u0.p71>=1))")&&(X(G("((u11.p33>=1)&&(u11.p103>=1))")))))))))
Formula 0 simplified : !(F"((i8.u12.p34>=1)&&(i8.u12.p75>=1))" U X(F"((i8.u12.p34>=1)&&(i8.u12.p75>=1))" | G("((((i5.u10.p19>=1)&&(i5.u10.p96>=1))&&(i3.u5.p37>=1))&&(i3.u0.p71>=1))" & XG"((u11.p33>=1)&&(u11.p103>=1))")))
Compilation finished in 365 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4933740742824596263]
Link finished in 32 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)) U X((<>((LTLAPp0==true))||[]((X([]((LTLAPp2==true)))&&(LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4933740742824596263]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: LTL layer: formula: (<>((LTLAPp0==true)) U X((<>((LTLAPp0==true))||[]((X([]((LTLAPp2==true)))&&(LTLAPp1==true))))))
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: "(<>((LTLAPp0==true)) U X((<>((LTLAPp0==true))||[]((X([]((LTLAPp2==true)))&&(LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: buchi has 5 states
pins2lts-mc-linux64( 0/ 8), 0.012: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.067: DFS-FIFO for weak LTL, using special progress label 79
pins2lts-mc-linux64( 0/ 8), 0.067: There are 80 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.067: State length is 75, there are 80 groups
pins2lts-mc-linux64( 0/ 8), 0.067: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.067: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.067: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.067: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.569: ~119 levels ~960 states ~5296 transitions
pins2lts-mc-linux64( 0/ 8), 0.573: ~239 levels ~1920 states ~10736 transitions
pins2lts-mc-linux64( 0/ 8), 0.577: ~479 levels ~3840 states ~22240 transitions
pins2lts-mc-linux64( 0/ 8), 0.599: ~959 levels ~7680 states ~44808 transitions
pins2lts-mc-linux64( 0/ 8), 0.626: ~1919 levels ~15360 states ~90784 transitions
pins2lts-mc-linux64( 0/ 8), 0.672: ~3839 levels ~30720 states ~182664 transitions
pins2lts-mc-linux64( 0/ 8), 0.845: ~7679 levels ~61440 states ~364784 transitions
pins2lts-mc-linux64( 0/ 8), 1.221: ~15359 levels ~122880 states ~733048 transitions
pins2lts-mc-linux64( 0/ 8), 1.817: ~30719 levels ~245760 states ~1467008 transitions
pins2lts-mc-linux64( 0/ 8), 3.137: ~61439 levels ~491520 states ~2939480 transitions
pins2lts-mc-linux64( 0/ 8), 5.246: ~122879 levels ~983040 states ~5888600 transitions
pins2lts-mc-linux64( 0/ 8), 9.262: ~245759 levels ~1966080 states ~11778240 transitions
pins2lts-mc-linux64( 0/ 8), 18.532: ~491519 levels ~3932160 states ~23574720 transitions
pins2lts-mc-linux64( 0/ 8), 35.781: ~983039 levels ~7864320 states ~47167680 transitions
pins2lts-mc-linux64( 0/ 8), 38.384, file ../../../src/pins2lts-mc/algorithm/ltl.h, line 73: assertion "res != FSET_FULL" failed: ECD table full
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
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, --when, --ltl, (<>((LTLAPp0==true)) U X((<>((LTLAPp0==true))||[]((X([]((LTLAPp2==true)))&&(LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4933740742824596263]
134
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, --when, --ltl, (<>((LTLAPp0==true)) U X((<>((LTLAPp0==true))||[]((X([]((LTLAPp2==true)))&&(LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4933740742824596263]
134
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 06:28:37] [INFO ] Flatten gal took : 2 ms
[2021-05-19 06:28:37] [INFO ] Time to serialize gal into /tmp/LTLFireability305547178481245921.gal : 0 ms
[2021-05-19 06:28:37] [INFO ] Time to serialize properties into /tmp/LTLFireability7682215116812018330.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/LTLFireability305547178481245921.gal, -t, CGAL, -LTL, /tmp/LTLFireability7682215116812018330.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/LTLFireability305547178481245921.gal -t CGAL -LTL /tmp/LTLFireability7682215116812018330.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !(((F("((p34>=1)&&(p75>=1))"))U(X((F("((p34>=1)&&(p75>=1))"))||(G(("((((p19>=1)&&(p96>=1))&&(p37>=1))&&(p71>=1))")&&(X(G("((p33>=1)&&(p103>=1))")))))))))
Formula 0 simplified : !(F"((p34>=1)&&(p75>=1))" U X(F"((p34>=1)&&(p75>=1))" | G("((((p19>=1)&&(p96>=1))&&(p37>=1))&&(p71>=1))" & XG"((p33>=1)&&(p103>=1))")))
Detected timeout of ITS tools.
[2021-05-19 06:49:57] [INFO ] Flatten gal took : 8 ms
[2021-05-19 06:49:57] [INFO ] Input system was already deterministic with 71 transitions.
[2021-05-19 06:49:57] [INFO ] Transformed 74 places.
[2021-05-19 06:49:57] [INFO ] Transformed 71 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 06:49:57] [INFO ] Time to serialize gal into /tmp/LTLFireability1892010829998778220.gal : 1 ms
[2021-05-19 06:49:57] [INFO ] Time to serialize properties into /tmp/LTLFireability17433993138517416610.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/LTLFireability1892010829998778220.gal, -t, CGAL, -LTL, /tmp/LTLFireability17433993138517416610.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/LTLFireability1892010829998778220.gal -t CGAL -LTL /tmp/LTLFireability17433993138517416610.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("((p34>=1)&&(p75>=1))"))U(X((F("((p34>=1)&&(p75>=1))"))||(G(("((((p19>=1)&&(p96>=1))&&(p37>=1))&&(p71>=1))")&&(X(G("((p33>=1)&&(p103>=1))")))))))))
Formula 0 simplified : !(F"((p34>=1)&&(p75>=1))" U X(F"((p34>=1)&&(p75>=1))" | G("((((p19>=1)&&(p96>=1))&&(p37>=1))&&(p71>=1))" & XG"((p33>=1)&&(p103>=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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-S064P12"
export BK_EXAMINATION="LTLFireability"
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-S064P12, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-162132107700021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S064P12.tgz
mv SemanticWebServices-PT-S064P12 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;