About the Execution of ITS-Tools for RefineWMG-PT-050051
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16241.495 | 3600000.00 | 6414087.00 | 81484.90 | TFTFF?TTFFFFFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416200684.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 RefineWMG-PT-050051, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416200684
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 110K May 5 16:51 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 RefineWMG-PT-050051-00
FORMULA_NAME RefineWMG-PT-050051-01
FORMULA_NAME RefineWMG-PT-050051-02
FORMULA_NAME RefineWMG-PT-050051-03
FORMULA_NAME RefineWMG-PT-050051-04
FORMULA_NAME RefineWMG-PT-050051-05
FORMULA_NAME RefineWMG-PT-050051-06
FORMULA_NAME RefineWMG-PT-050051-07
FORMULA_NAME RefineWMG-PT-050051-08
FORMULA_NAME RefineWMG-PT-050051-09
FORMULA_NAME RefineWMG-PT-050051-10
FORMULA_NAME RefineWMG-PT-050051-11
FORMULA_NAME RefineWMG-PT-050051-12
FORMULA_NAME RefineWMG-PT-050051-13
FORMULA_NAME RefineWMG-PT-050051-14
FORMULA_NAME RefineWMG-PT-050051-15
=== Now, execution of the tool begins
BK_START 1621264320945
Running Version 0
[2021-05-17 15:12:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 15:12:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:12:02] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2021-05-17 15:12:02] [INFO ] Transformed 254 places.
[2021-05-17 15:12:02] [INFO ] Transformed 203 transitions.
[2021-05-17 15:12:02] [INFO ] Parsed PT model containing 254 places and 203 transitions in 85 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 15:12:02] [INFO ] Initial state test concluded for 6 properties.
FORMULA RefineWMG-PT-050051-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 21 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:02] [INFO ] Computed 102 place invariants in 20 ms
[2021-05-17 15:12:03] [INFO ] Dead Transitions using invariants and state equation in 273 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:03] [INFO ] Computed 102 place invariants in 5 ms
[2021-05-17 15:12:03] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:03] [INFO ] Computed 102 place invariants in 5 ms
[2021-05-17 15:12:03] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:03] [INFO ] Computed 102 place invariants in 10 ms
[2021-05-17 15:12:03] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
[2021-05-17 15:12:03] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 15:12:03] [INFO ] Flatten gal took : 60 ms
FORMULA RefineWMG-PT-050051-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 15:12:03] [INFO ] Flatten gal took : 23 ms
[2021-05-17 15:12:03] [INFO ] Input system was already deterministic with 203 transitions.
Incomplete random walk after 100034 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=416 ) properties (out of 22) seen :12
Running SMT prover for 10 properties.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:04] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:12:04] [INFO ] [Real]Absence check using 102 positive place invariants in 12 ms returned sat
[2021-05-17 15:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:04] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-17 15:12:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:04] [INFO ] [Nat]Absence check using 102 positive place invariants in 18 ms returned sat
[2021-05-17 15:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:04] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2021-05-17 15:12:04] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-17 15:12:04] [INFO ] Added : 124 causal constraints over 25 iterations in 361 ms. Result :sat
[2021-05-17 15:12:04] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2021-05-17 15:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:04] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-17 15:12:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:04] [INFO ] [Nat]Absence check using 102 positive place invariants in 17 ms returned sat
[2021-05-17 15:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:04] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2021-05-17 15:12:04] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-17 15:12:05] [INFO ] Added : 30 causal constraints over 6 iterations in 92 ms. Result :sat
[2021-05-17 15:12:05] [INFO ] [Real]Absence check using 102 positive place invariants in 12 ms returned sat
[2021-05-17 15:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:05] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2021-05-17 15:12:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:05] [INFO ] [Nat]Absence check using 102 positive place invariants in 20 ms returned sat
[2021-05-17 15:12:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:05] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2021-05-17 15:12:05] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 14 ms.
[2021-05-17 15:12:05] [INFO ] Added : 49 causal constraints over 10 iterations in 154 ms. Result :sat
[2021-05-17 15:12:05] [INFO ] [Real]Absence check using 102 positive place invariants in 18 ms returned sat
[2021-05-17 15:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:05] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-17 15:12:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:05] [INFO ] [Nat]Absence check using 102 positive place invariants in 21 ms returned sat
[2021-05-17 15:12:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:05] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-17 15:12:05] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-17 15:12:06] [INFO ] Added : 77 causal constraints over 16 iterations in 284 ms. Result :sat
[2021-05-17 15:12:06] [INFO ] [Real]Absence check using 102 positive place invariants in 17 ms returned sat
[2021-05-17 15:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:06] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-17 15:12:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:06] [INFO ] [Nat]Absence check using 102 positive place invariants in 51 ms returned sat
[2021-05-17 15:12:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:06] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2021-05-17 15:12:06] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 17 ms.
[2021-05-17 15:12:06] [INFO ] Added : 102 causal constraints over 21 iterations in 338 ms. Result :sat
[2021-05-17 15:12:06] [INFO ] [Real]Absence check using 102 positive place invariants in 14 ms returned sat
[2021-05-17 15:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:06] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-17 15:12:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:07] [INFO ] [Nat]Absence check using 102 positive place invariants in 21 ms returned sat
[2021-05-17 15:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:07] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-17 15:12:07] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-17 15:12:07] [INFO ] Added : 118 causal constraints over 24 iterations in 344 ms. Result :sat
[2021-05-17 15:12:07] [INFO ] [Real]Absence check using 102 positive place invariants in 20 ms returned sat
[2021-05-17 15:12:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:07] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-17 15:12:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:07] [INFO ] [Nat]Absence check using 102 positive place invariants in 15 ms returned sat
[2021-05-17 15:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:07] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-17 15:12:07] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-17 15:12:07] [INFO ] Added : 22 causal constraints over 5 iterations in 71 ms. Result :sat
[2021-05-17 15:12:07] [INFO ] [Real]Absence check using 102 positive place invariants in 14 ms returned sat
[2021-05-17 15:12:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:07] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-17 15:12:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:07] [INFO ] [Nat]Absence check using 102 positive place invariants in 20 ms returned sat
[2021-05-17 15:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:08] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-17 15:12:08] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-17 15:12:08] [INFO ] Added : 75 causal constraints over 15 iterations in 300 ms. Result :sat
[2021-05-17 15:12:08] [INFO ] [Real]Absence check using 102 positive place invariants in 17 ms returned sat
[2021-05-17 15:12:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:08] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-17 15:12:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:08] [INFO ] [Nat]Absence check using 102 positive place invariants in 16 ms returned sat
[2021-05-17 15:12:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:08] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-17 15:12:08] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-17 15:12:08] [INFO ] Added : 98 causal constraints over 20 iterations in 242 ms. Result :sat
[2021-05-17 15:12:09] [INFO ] [Real]Absence check using 102 positive place invariants in 40 ms returned sat
[2021-05-17 15:12:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:09] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2021-05-17 15:12:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:12:09] [INFO ] [Nat]Absence check using 102 positive place invariants in 14 ms returned sat
[2021-05-17 15:12:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:12:09] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2021-05-17 15:12:09] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-17 15:12:09] [INFO ] Added : 91 causal constraints over 19 iterations in 281 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 145 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 3 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 195 place count 60 transition count 59
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 40 rules applied. Total rules applied 235 place count 60 transition count 19
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 41 rules applied. Total rules applied 276 place count 20 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 277 place count 19 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 277 place count 19 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 283 place count 16 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 285 place count 15 transition count 14
Applied a total of 285 rules in 30 ms. Remains 15 /254 variables (removed 239) and now considering 14/203 (removed 189) transitions.
// Phase 1: matrix 14 rows 15 cols
[2021-05-17 15:12:09] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 15:12:09] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
// Phase 1: matrix 14 rows 15 cols
[2021-05-17 15:12:09] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 15:12:09] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 14 rows 15 cols
[2021-05-17 15:12:09] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 15:12:09] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2021-05-17 15:12:09] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 14 rows 15 cols
[2021-05-17 15:12:09] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 15:12:09] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/254 places, 14/203 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050051-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s6 s11), p1:(GT s13 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 4 ms.
FORMULA RefineWMG-PT-050051-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-01 finished in 411 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 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 145 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 1 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 195 place count 60 transition count 59
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 1 with 43 rules applied. Total rules applied 238 place count 60 transition count 16
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 281 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 281 place count 17 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 287 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 289 place count 13 transition count 12
Applied a total of 289 rules in 19 ms. Remains 13 /254 variables (removed 241) and now considering 12/203 (removed 191) transitions.
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 15:12:10] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 15:12:10] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 15:12:10] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 15:12:10] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 15:12:10] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 15:12:11] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
[2021-05-17 15:12:11] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 15:12:11] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 15:12:11] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/254 places, 12/203 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050051-03 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:(LEQ 2 s9), p0:(LEQ s11 s6)], 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 371 ms.
Product exploration explored 100000 steps with 0 reset in 262 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 99 ms.
Product exploration explored 100000 steps with 0 reset in 185 ms.
[2021-05-17 15:12:12] [INFO ] Flatten gal took : 2 ms
[2021-05-17 15:12:12] [INFO ] Flatten gal took : 1 ms
[2021-05-17 15:12:12] [INFO ] Time to serialize gal into /tmp/LTL17700372386728523968.gal : 1 ms
[2021-05-17 15:12:12] [INFO ] Time to serialize properties into /tmp/LTL11261446575790842917.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/LTL17700372386728523968.gal, -t, CGAL, -LTL, /tmp/LTL11261446575790842917.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/LTL17700372386728523968.gal -t CGAL -LTL /tmp/LTL11261446575790842917.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p209<=p80)")||(G("(p168>=2)"))))))
Formula 0 simplified : !GF("(p209<=p80)" | G"(p168>=2)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1016 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.1802,237052,1,0,157,1.04166e+06,33,102,757,1.50936e+06,376
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RefineWMG-PT-050051-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property RefineWMG-PT-050051-03 finished in 13697 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||(X(X(p1))&&F(p2))||X(X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 13 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:23] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:12:24] [INFO ] Dead Transitions using invariants and state equation in 163 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:24] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:12:24] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:24] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:12:24] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:12:24] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:12:24] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : RefineWMG-PT-050051-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GT s131 s153), p2:(GT s223 s40), p1:(AND (GT s223 s40) (GT s146 s232))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 680 ms.
Product exploration explored 100000 steps with 1 reset in 770 ms.
Knowledge obtained : [p0, (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Product exploration explored 100000 steps with 2 reset in 638 ms.
Product exploration explored 100000 steps with 2 reset in 732 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Support contains 6 out of 254 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 141 edges and 254 vertex of which 94 / 254 are part of one of the 47 SCC in 1 ms
Free SCC test removed 47 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 160 transition count 110
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 94 place count 160 transition count 110
Deduced a syphon composed of 47 places in 1 ms
Applied a total of 94 rules in 22 ms. Remains 160 /254 variables (removed 94) and now considering 110/203 (removed 93) transitions.
// Phase 1: matrix 110 rows 160 cols
[2021-05-17 15:12:28] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-17 15:12:28] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
[2021-05-17 15:12:28] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 110 rows 160 cols
[2021-05-17 15:12:28] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-17 15:12:28] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/254 places, 110/203 transitions.
Product exploration explored 100000 steps with 0 reset in 824 ms.
Product exploration explored 100000 steps with 1 reset in 1020 ms.
[2021-05-17 15:12:30] [INFO ] Flatten gal took : 15 ms
[2021-05-17 15:12:30] [INFO ] Flatten gal took : 15 ms
[2021-05-17 15:12:30] [INFO ] Time to serialize gal into /tmp/LTL7338429381482929862.gal : 9 ms
[2021-05-17 15:12:30] [INFO ] Time to serialize properties into /tmp/LTL5139511263983702082.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/LTL7338429381482929862.gal, -t, CGAL, -LTL, /tmp/LTL5139511263983702082.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/LTL7338429381482929862.gal -t CGAL -LTL /tmp/LTL5139511263983702082.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((("(p128>p150)")||(X(X(G("((p220>p37)&&(p143>p229))")))))||((X(X("((p220>p37)&&(p143>p229))")))&&(F("(p220>p37)"))))))
Formula 0 simplified : !G("(p128>p150)" | XXG"((p220>p37)&&(p143>p229))" | (XX"((p220>p37)&&(p143>p229))" & F"(p220>p37)"))
Detected timeout of ITS tools.
[2021-05-17 15:12:45] [INFO ] Flatten gal took : 11 ms
[2021-05-17 15:12:45] [INFO ] Applying decomposition
[2021-05-17 15:12:45] [INFO ] Flatten gal took : 30 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/graph14368718893148708533.txt, -o, /tmp/graph14368718893148708533.bin, -w, /tmp/graph14368718893148708533.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/graph14368718893148708533.bin, -l, -1, -v, -w, /tmp/graph14368718893148708533.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:12:46] [INFO ] Decomposing Gal with order
[2021-05-17 15:12:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:12:46] [INFO ] Flatten gal took : 75 ms
[2021-05-17 15:12:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-17 15:12:46] [INFO ] Time to serialize gal into /tmp/LTL11307409535870088317.gal : 6 ms
[2021-05-17 15:12:46] [INFO ] Time to serialize properties into /tmp/LTL4068097143140731839.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/LTL11307409535870088317.gal, -t, CGAL, -LTL, /tmp/LTL4068097143140731839.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/LTL11307409535870088317.gal -t CGAL -LTL /tmp/LTL4068097143140731839.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((("(gu74.p128>gu74.p150)")||(X(X(G("((gu20.p220>gu20.p37)&&(gu112.p143>gu112.p229))")))))||((X(X("((gu20.p220>gu20.p37)&&(gu112.p143>gu112.p229))")))&&(F("(gu20.p220>gu20.p37)"))))))
Formula 0 simplified : !G("(gu74.p128>gu74.p150)" | XXG"((gu20.p220>gu20.p37)&&(gu112.p143>gu112.p229))" | (XX"((gu20.p220>gu20.p37)&&(gu112.p143>gu112.p229))" & F"(gu20.p220>gu20.p37)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2910607784528393062
[2021-05-17 15:13:01] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2910607784528393062
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/ltsmin2910607784528393062]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin2910607784528393062] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin2910607784528393062] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property RefineWMG-PT-050051-05 finished in 38859 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 23 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:02] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:13:02] [INFO ] Dead Transitions using invariants and state equation in 182 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:02] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:03] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:03] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:13:03] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:03] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:03] [INFO ] Dead Transitions using invariants and state equation in 184 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050051-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s189 s114), p1:(LEQ s200 s174)], 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 50000 reset in 406 ms.
Product exploration explored 100000 steps with 50000 reset in 417 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 490 ms.
Product exploration explored 100000 steps with 50000 reset in 599 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 254 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 149 edges and 254 vertex of which 100 / 254 are part of one of the 50 SCC in 1 ms
Free SCC test removed 50 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 154 transition count 104
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 99 place count 154 transition count 104
Deduced a syphon composed of 49 places in 1 ms
Applied a total of 99 rules in 21 ms. Remains 154 /254 variables (removed 100) and now considering 104/203 (removed 99) transitions.
// Phase 1: matrix 104 rows 154 cols
[2021-05-17 15:13:05] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 15:13:05] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
[2021-05-17 15:13:05] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 104 rows 154 cols
[2021-05-17 15:13:05] [INFO ] Computed 52 place invariants in 13 ms
[2021-05-17 15:13:05] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 1 iterations. Remains : 154/254 places, 104/203 transitions.
Product exploration explored 100000 steps with 50000 reset in 870 ms.
Product exploration explored 100000 steps with 50000 reset in 802 ms.
[2021-05-17 15:13:07] [INFO ] Flatten gal took : 8 ms
[2021-05-17 15:13:07] [INFO ] Flatten gal took : 8 ms
[2021-05-17 15:13:07] [INFO ] Time to serialize gal into /tmp/LTL3932434408298012448.gal : 2 ms
[2021-05-17 15:13:07] [INFO ] Time to serialize properties into /tmp/LTL15539432996401260889.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/LTL3932434408298012448.gal, -t, CGAL, -LTL, /tmp/LTL15539432996401260889.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/LTL3932434408298012448.gal -t CGAL -LTL /tmp/LTL15539432996401260889.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(p186>p111)")||(X(F("(p197<=p171)"))))))
Formula 0 simplified : !F("(p186>p111)" | XF"(p197<=p171)")
Detected timeout of ITS tools.
[2021-05-17 15:13:22] [INFO ] Flatten gal took : 36 ms
[2021-05-17 15:13:22] [INFO ] Applying decomposition
[2021-05-17 15:13:22] [INFO ] Flatten gal took : 14 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/graph16070090381337622755.txt, -o, /tmp/graph16070090381337622755.bin, -w, /tmp/graph16070090381337622755.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/graph16070090381337622755.bin, -l, -1, -v, -w, /tmp/graph16070090381337622755.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:13:22] [INFO ] Decomposing Gal with order
[2021-05-17 15:13:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:13:22] [INFO ] Flatten gal took : 29 ms
[2021-05-17 15:13:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 15:13:22] [INFO ] Time to serialize gal into /tmp/LTL14991929040130974989.gal : 16 ms
[2021-05-17 15:13:22] [INFO ] Time to serialize properties into /tmp/LTL1897038663265949420.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/LTL14991929040130974989.gal, -t, CGAL, -LTL, /tmp/LTL1897038663265949420.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/LTL14991929040130974989.gal -t CGAL -LTL /tmp/LTL1897038663265949420.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(gu90.p186>gu90.p111)")||(X(F("(gu96.p197<=gu96.p171)"))))))
Formula 0 simplified : !F("(gu90.p186>gu90.p111)" | XF"(gu96.p197<=gu96.p171)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2646500986200649884
[2021-05-17 15:13:38] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2646500986200649884
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/ltsmin2646500986200649884]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin2646500986200649884] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin2646500986200649884] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property RefineWMG-PT-050051-06 finished in 36364 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 4 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:39] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:39] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:39] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:13:39] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:39] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:39] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:39] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:39] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : RefineWMG-PT-050051-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GT 3 s208), p0:(LEQ 3 s59)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 458 steps with 0 reset in 3 ms.
FORMULA RefineWMG-PT-050051-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-08 finished in 685 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(X(X(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:39] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:39] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:39] [INFO ] Computed 102 place invariants in 4 ms
[2021-05-17 15:13:39] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:39] [INFO ] Computed 102 place invariants in 5 ms
[2021-05-17 15:13:40] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:40] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:13:40] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 318 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-050051-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}], [{ cond=p0, acceptance={} source=5 dest: 9}, { cond=(NOT p0), acceptance={} source=5 dest: 10}], [{ cond=true, acceptance={} source=6 dest: 4}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p0, acceptance={} source=8 dest: 2}, { cond=(NOT p0), acceptance={} source=8 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 10}], [{ cond=(NOT p1), acceptance={} source=10 dest: 4}]], initial=8, aps=[p1:(LEQ 3 s4), p0:(LEQ s42 s217)], 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 111 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-050051-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-09 finished in 808 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 149 edges and 254 vertex of which 100 / 254 are part of one of the 50 SCC in 1 ms
Free SCC test removed 50 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 154 transition count 104
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 197 place count 56 transition count 55
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 1 with 44 rules applied. Total rules applied 241 place count 56 transition count 11
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 45 rules applied. Total rules applied 286 place count 12 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 287 place count 11 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 287 place count 11 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 289 place count 10 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 291 place count 9 transition count 8
Applied a total of 291 rules in 11 ms. Remains 9 /254 variables (removed 245) and now considering 8/203 (removed 195) transitions.
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 15:13:40] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:13:40] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 15:13:40] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:13:40] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 15:13:40] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:13:40] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-05-17 15:13:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 15:13:40] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:13:40] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/254 places, 8/203 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s8 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050051-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-10 finished in 133 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0))&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 1 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:40] [INFO ] Computed 102 place invariants in 0 ms
[2021-05-17 15:13:40] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:40] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:40] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:40] [INFO ] Computed 102 place invariants in 0 ms
[2021-05-17 15:13:41] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:41] [INFO ] Computed 102 place invariants in 9 ms
[2021-05-17 15:13:41] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : RefineWMG-PT-050051-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s128 s207), p0:(OR (AND (GT 1 s149) (LEQ 1 s149)) (LEQ s137 s123))], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050051-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-11 finished in 550 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:41] [INFO ] Computed 102 place invariants in 0 ms
[2021-05-17 15:13:41] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:41] [INFO ] Computed 102 place invariants in 0 ms
[2021-05-17 15:13:41] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:41] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:41] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:41] [INFO ] Computed 102 place invariants in 0 ms
[2021-05-17 15:13:41] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s204)], 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 4 reset in 574 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 0 ms.
FORMULA RefineWMG-PT-050051-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-12 finished in 1038 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 4 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:42] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:42] [INFO ] Dead Transitions using invariants and state equation in 157 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:42] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:42] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:42] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:42] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:13:42] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:13:42] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-050051-13 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LEQ s208 s127) (LEQ 3 s196)), p1:(AND (GT s69 s102) (LEQ 2 s141))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 402 ms.
Product exploration explored 100000 steps with 50000 reset in 397 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 368 ms.
Product exploration explored 100000 steps with 50000 reset in 409 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 254 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 142 edges and 254 vertex of which 94 / 254 are part of one of the 47 SCC in 1 ms
Free SCC test removed 47 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 160 transition count 110
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 95 place count 160 transition count 110
Deduced a syphon composed of 48 places in 0 ms
Applied a total of 95 rules in 14 ms. Remains 160 /254 variables (removed 94) and now considering 110/203 (removed 93) transitions.
// Phase 1: matrix 110 rows 160 cols
[2021-05-17 15:13:44] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-17 15:13:45] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
[2021-05-17 15:13:45] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 110 rows 160 cols
[2021-05-17 15:13:45] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-17 15:13:45] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/254 places, 110/203 transitions.
Product exploration explored 100000 steps with 50000 reset in 442 ms.
Product exploration explored 100000 steps with 50000 reset in 442 ms.
[2021-05-17 15:13:46] [INFO ] Flatten gal took : 6 ms
[2021-05-17 15:13:46] [INFO ] Flatten gal took : 6 ms
[2021-05-17 15:13:46] [INFO ] Time to serialize gal into /tmp/LTL15416436070613984074.gal : 1 ms
[2021-05-17 15:13:46] [INFO ] Time to serialize properties into /tmp/LTL10248425063308765931.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/LTL15416436070613984074.gal, -t, CGAL, -LTL, /tmp/LTL10248425063308765931.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/LTL15416436070613984074.gal -t CGAL -LTL /tmp/LTL10248425063308765931.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((p66>p99)&&(p138>=2))")))||("((p205<=p124)&&(p193>=3))"))))
Formula 0 simplified : !X("((p205<=p124)&&(p193>=3))" | XG"((p66>p99)&&(p138>=2))")
Detected timeout of ITS tools.
[2021-05-17 15:14:01] [INFO ] Flatten gal took : 19 ms
[2021-05-17 15:14:01] [INFO ] Applying decomposition
[2021-05-17 15:14:01] [INFO ] Flatten gal took : 15 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/graph10914063805787682046.txt, -o, /tmp/graph10914063805787682046.bin, -w, /tmp/graph10914063805787682046.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/graph10914063805787682046.bin, -l, -1, -v, -w, /tmp/graph10914063805787682046.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:14:01] [INFO ] Decomposing Gal with order
[2021-05-17 15:14:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:14:01] [INFO ] Flatten gal took : 26 ms
[2021-05-17 15:14:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 15:14:01] [INFO ] Time to serialize gal into /tmp/LTL9742947732894409721.gal : 2 ms
[2021-05-17 15:14:01] [INFO ] Time to serialize properties into /tmp/LTL18064936998733702929.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/LTL9742947732894409721.gal, -t, CGAL, -LTL, /tmp/LTL18064936998733702929.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/LTL9742947732894409721.gal -t CGAL -LTL /tmp/LTL18064936998733702929.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((gu34.p66>gu34.p99)&&(gi3.gi0.gi0.gi1.gu67.p138>=2))")))||("((gu100.p205<=gu100.p124)&&(gi5.gi0.gi0.gi0.gu93.p193>=3))"))))
Formula 0 simplified : !X("((gu100.p205<=gu100.p124)&&(gi5.gi0.gi0.gi0.gu93.p193>=3))" | XG"((gu34.p66>gu34.p99)&&(gi3.gi0.gi0.gi1.gu67.p138>=2))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17587844284260332534
[2021-05-17 15:14:16] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17587844284260332534
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/ltsmin17587844284260332534]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin17587844284260332534] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running 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/ltsmin17587844284260332534] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property RefineWMG-PT-050051-13 finished in 35075 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))&&F((p1||X((p0 U p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 6 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:14:17] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:14:17] [INFO ] Dead Transitions using invariants and state equation in 160 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:14:17] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:14:17] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:14:17] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 15:14:17] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 15:14:17] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 15:14:17] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-050051-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s217 s231), p0:(GT s207 s41), p2:(AND (GT s207 s41) (LEQ s217 s231))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 684 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 0 ms.
FORMULA RefineWMG-PT-050051-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-14 finished in 1382 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2785580995605037384
[2021-05-17 15:14:18] [INFO ] Applying decomposition
[2021-05-17 15:14:18] [INFO ] Computing symmetric may disable matrix : 203 transitions.
[2021-05-17 15:14:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 15:14:18] [INFO ] Computing symmetric may enable matrix : 203 transitions.
[2021-05-17 15:14:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 15:14:18] [INFO ] Flatten gal took : 7 ms
[2021-05-17 15:14:18] [INFO ] Computing Do-Not-Accords matrix : 203 transitions.
[2021-05-17 15:14:18] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph7909592352188008658.txt, -o, /tmp/graph7909592352188008658.bin, -w, /tmp/graph7909592352188008658.weights], workingDir=null]
[2021-05-17 15:14:18] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2785580995605037384
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/ltsmin2785580995605037384]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7909592352188008658.bin, -l, -1, -v, -w, /tmp/graph7909592352188008658.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:14:18] [INFO ] Decomposing Gal with order
[2021-05-17 15:14:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:14:18] [INFO ] Flatten gal took : 16 ms
[2021-05-17 15:14:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 15:14:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality12074006663813241461.gal : 2 ms
[2021-05-17 15:14:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality4440067090234556484.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/LTLCardinality12074006663813241461.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4440067090234556484.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/LTLCardinality12074006663813241461.gal -t CGAL -LTL /tmp/LTLCardinality4440067090234556484.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((G(("(gi5.gu71.p128>gi5.gu71.p150)")||((X(X(!("((gu105.p220<=gu105.p37)||(gu68.p143<=gu68.p229))"))))U(((F("(gu105.p220>gu105.p37)"))&&(X(X(!("((gu105.p220<=gu105.p37)||(gu68.p143<=gu68.p229))")))))||(G(X(X(!("((gu105.p220<=gu105.p37)||(gu68.p143<=gu68.p229))"))))))))))
Formula 0 simplified : !G("(gi5.gu71.p128>gi5.gu71.p150)" | (XX!"((gu105.p220<=gu105.p37)||(gu68.p143<=gu68.p229))" U ((XX!"((gu105.p220<=gu105.p37)||(gu68.p143<=gu68.p229))" & F"(gu105.p220>gu105.p37)") | GXX!"((gu105.p220<=gu105.p37)||(gu68.p143<=gu68.p229))")))
Compilation finished in 870 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2785580995605037384]
Link finished in 76 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)||(X(X((LTLAPp1==true)))&&<>((LTLAPp2==true)))||X(X([]((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2785580995605037384]
WARNING : LTSmin timed out (>327 s) on command 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)||(X(X((LTLAPp1==true)))&&<>((LTLAPp2==true)))||X(X([]((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2785580995605037384]
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, <>(((LTLAPp3==true)||X(<>((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2785580995605037384]
LTSmin run took 1474 ms.
FORMULA RefineWMG-PT-050051-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
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(((LTLAPp5==true)||X([]((LTLAPp6==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2785580995605037384]
LTSmin run took 827 ms.
FORMULA RefineWMG-PT-050051-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 2616 s
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)||(X(X((LTLAPp1==true)))&&<>((LTLAPp2==true)))||X(X([]((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2785580995605037384]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.059: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.432: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.431: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.432: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.443: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.443: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.432: LTL layer: formula: [](((LTLAPp0==true)||(X(X((LTLAPp1==true)))&&<>((LTLAPp2==true)))||X(X([]((LTLAPp1==true))))))
pins2lts-mc-linux64( 5/ 8), 0.448: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.449: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.449: "[](((LTLAPp0==true)||(X(X((LTLAPp1==true)))&&<>((LTLAPp2==true)))||X(X([]((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.449: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.450: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.460: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.023: DFS-FIFO for weak LTL, using special progress label 211
pins2lts-mc-linux64( 0/ 8), 1.023: There are 212 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.023: State length is 255, there are 213 groups
pins2lts-mc-linux64( 0/ 8), 1.023: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.023: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.023: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.023: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 2.441: ~1 levels ~960 states ~50752 transitions
pins2lts-mc-linux64( 4/ 8), 2.520: ~1 levels ~1920 states ~101656 transitions
pins2lts-mc-linux64( 4/ 8), 2.657: ~1 levels ~3840 states ~204976 transitions
pins2lts-mc-linux64( 4/ 8), 2.908: ~1 levels ~7680 states ~412152 transitions
pins2lts-mc-linux64( 4/ 8), 3.564: ~1 levels ~15360 states ~825936 transitions
pins2lts-mc-linux64( 4/ 8), 4.779: ~1 levels ~30720 states ~1654208 transitions
pins2lts-mc-linux64( 0/ 8), 6.959: ~1 levels ~61440 states ~3326368 transitions
pins2lts-mc-linux64( 1/ 8), 10.290: ~1 levels ~122880 states ~6707112 transitions
pins2lts-mc-linux64( 7/ 8), 18.567: ~1 levels ~245760 states ~13479816 transitions
pins2lts-mc-linux64( 4/ 8), 35.048: ~1 levels ~491520 states ~26893344 transitions
pins2lts-mc-linux64( 7/ 8), 67.783: ~1 levels ~983040 states ~54447024 transitions
pins2lts-mc-linux64( 0/ 8), 127.422: ~1 levels ~1966080 states ~108751760 transitions
pins2lts-mc-linux64( 0/ 8), 226.360: ~1 levels ~3932160 states ~218119176 transitions
pins2lts-mc-linux64( 0/ 8), 424.172: ~1 levels ~7864320 states ~438550928 transitions
pins2lts-mc-linux64( 3/ 8), 630.800: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 630.881:
pins2lts-mc-linux64( 0/ 8), 630.881: mean standard work distribution: 3.2% (states) 3.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 630.881:
pins2lts-mc-linux64( 0/ 8), 630.881: Explored 10714176 states 601087180 transitions, fanout: 56.102
pins2lts-mc-linux64( 0/ 8), 630.881: Total exploration time 629.840 sec (629.750 sec minimum, 629.790 sec on average)
pins2lts-mc-linux64( 0/ 8), 630.881: States per second: 17011, Transitions per second: 954349
pins2lts-mc-linux64( 0/ 8), 630.881:
pins2lts-mc-linux64( 0/ 8), 630.881: Progress states detected: 134216913
pins2lts-mc-linux64( 0/ 8), 630.881: Redundant explorations: -92.0173
pins2lts-mc-linux64( 0/ 8), 630.881:
pins2lts-mc-linux64( 0/ 8), 630.881: Queue width: 8B, total height: 156393008, memory: 1193.18MB
pins2lts-mc-linux64( 0/ 8), 630.881: Tree memory: 1060.5MB, 8.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 630.881: Tree fill ratio (roots/leafs): 99.0%/14.0%
pins2lts-mc-linux64( 0/ 8), 630.881: Stored 222 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 630.881: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 630.881: Est. total memory use: 2253.6MB (~2217.2MB 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)||(X(X((LTLAPp1==true)))&&<>((LTLAPp2==true)))||X(X([]((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2785580995605037384]
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)||(X(X((LTLAPp1==true)))&&<>((LTLAPp2==true)))||X(X([]((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2785580995605037384]
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:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-17 15:35:04] [INFO ] Flatten gal took : 8 ms
[2021-05-17 15:35:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality2048015051494834979.gal : 1 ms
[2021-05-17 15:35:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality2116418005634561992.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/LTLCardinality2048015051494834979.gal, -t, CGAL, -LTL, /tmp/LTLCardinality2116418005634561992.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/LTLCardinality2048015051494834979.gal -t CGAL -LTL /tmp/LTLCardinality2116418005634561992.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(("(p128>p150)")||((X(X(!("((p220<=p37)||(p143<=p229))"))))U(((F("(p220>p37)"))&&(X(X(!("((p220<=p37)||(p143<=p229))")))))||(G(X(X(!("((p220<=p37)||(p143<=p229))"))))))))))
Formula 0 simplified : !G("(p128>p150)" | (XX!"((p220<=p37)||(p143<=p229))" U ((XX!"((p220<=p37)||(p143<=p229))" & F"(p220>p37)") | GXX!"((p220<=p37)||(p143<=p229))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-17 15:55:50] [INFO ] Flatten gal took : 208 ms
[2021-05-17 15:55:51] [INFO ] Input system was already deterministic with 203 transitions.
[2021-05-17 15:55:51] [INFO ] Transformed 254 places.
[2021-05-17 15:55:51] [INFO ] Transformed 203 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-17 15:55:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality16208395627383375972.gal : 7 ms
[2021-05-17 15:55:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality15047778222028026636.ltl : 5 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/LTLCardinality16208395627383375972.gal, -t, CGAL, -LTL, /tmp/LTLCardinality15047778222028026636.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/LTLCardinality16208395627383375972.gal -t CGAL -LTL /tmp/LTLCardinality15047778222028026636.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("(p128>p150)")||((X(X(!("((p220<=p37)||(p143<=p229))"))))U(((F("(p220>p37)"))&&(X(X(!("((p220<=p37)||(p143<=p229))")))))||(G(X(X(!("((p220<=p37)||(p143<=p229))"))))))))))
Formula 0 simplified : !G("(p128>p150)" | (XX!"((p220<=p37)||(p143<=p229))" U ((XX!"((p220<=p37)||(p143<=p229))" & F"(p220>p37)") | GXX!"((p220<=p37)||(p143<=p229))")))
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-050051"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is RefineWMG-PT-050051, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089416200684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-050051.tgz
mv RefineWMG-PT-050051 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;