Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572400564.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572400564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 6.0K Apr 30 02:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 30 02:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 30 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 30 02:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 110K May 10 09:34 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-LTLFireability-00
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-01
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-02
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-03
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-04
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-05
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-06
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-07
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-08
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-09
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-10
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-11
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-12
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-13
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-14
FORMULA_NAME RefineWMG-PT-050051-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653086414986

Running Version 202205111006
[2022-05-20 22:40:16] [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]
[2022-05-20 22:40:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:40:16] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2022-05-20 22:40:16] [INFO ] Transformed 254 places.
[2022-05-20 22:40:16] [INFO ] Transformed 203 transitions.
[2022-05-20 22:40:16] [INFO ] Parsed PT model containing 254 places and 203 transitions in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA RefineWMG-PT-050051-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 28 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:16] [INFO ] Computed 102 place invariants in 14 ms
[2022-05-20 22:40:16] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:16] [INFO ] Computed 102 place invariants in 4 ms
[2022-05-20 22:40:16] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:16] [INFO ] Computed 102 place invariants in 6 ms
[2022-05-20 22:40:17] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:17] [INFO ] Computed 102 place invariants in 4 ms
[2022-05-20 22:40:17] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Support contains 34 out of 254 places after structural reductions.
[2022-05-20 22:40:17] [INFO ] Flatten gal took : 43 ms
[2022-05-20 22:40:17] [INFO ] Flatten gal took : 17 ms
[2022-05-20 22:40:17] [INFO ] Input system was already deterministic with 203 transitions.
Support contains 30 out of 254 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10048 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 25) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:17] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:18] [INFO ] [Real]Absence check using 102 positive place invariants in 11 ms returned sat
[2022-05-20 22:40:18] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2022-05-20 22:40:18] [INFO ] [Nat]Absence check using 102 positive place invariants in 11 ms returned sat
[2022-05-20 22:40:18] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2022-05-20 22:40:18] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 54 ms.
[2022-05-20 22:40:18] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 626 steps, including 0 resets, run visited all 6 properties in 14 ms. (steps per millisecond=44 )
Parikh walk visited 6 properties in 15 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 16 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:18] [INFO ] Computed 102 place invariants in 3 ms
[2022-05-20 22:40:18] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:18] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:40:19] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:19] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:40:19] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:19] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:40:19] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-00 finished in 750 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G((F(X(p1))&&p0))))))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 10 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:19] [INFO ] Computed 102 place invariants in 8 ms
[2022-05-20 22:40:19] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:19] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:19] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:19] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:40:19] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:19] [INFO ] Computed 102 place invariants in 3 ms
[2022-05-20 22:40:20] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s102 1) (OR (LT s121 1) (LT s122 1) (LT s124 1))), p1:(LT s108 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, 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-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-01 finished in 776 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(X((F(p0)||F(p1))))&&!p0))))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 146 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 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 1 with 150 rules applied. Total rules applied 198 place count 58 transition count 58
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 45 rules applied. Total rules applied 243 place count 58 transition count 13
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 288 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 288 place count 13 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 292 place count 11 transition count 11
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 294 place count 10 transition count 10
Applied a total of 294 rules in 30 ms. Remains 10 /254 variables (removed 244) and now considering 10/203 (removed 193) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:40:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:40:20] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:40:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:40:20] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:40:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:40:20] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-20 22:40:20] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:40:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:40:20] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/254 places, 10/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/254 places, 10/203 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), p0]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s6 1), p1:(LT s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-02 finished in 235 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(X(p1))))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 11 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:20] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:20] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:20] [INFO ] Computed 102 place invariants in 3 ms
[2022-05-20 22:40:20] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:20] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:20] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:20] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:21] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(LT s153 1), p0:(OR (LT s202 1) (LT s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 301 reset in 816 ms.
Stack based approach found an accepted trace after 311 steps with 129 reset with depth 31 and stack size 31 in 2 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-05 finished in 1468 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F((X(G(p0))||F(G(p1))))))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 2 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 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 239 place count 60 transition count 15
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 283 place count 16 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 283 place count 16 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 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 34 ms. Remains 13 /254 variables (removed 241) and now considering 12/203 (removed 191) transitions.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:40:22] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:40:22] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:40:22] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:40:22] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:40:22] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:40:22] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-20 22:40:22] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:40:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:40:22] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/254 places, 12/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/254 places, 12/203 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s6 1), p0:(OR (LT s9 1) (LT s10 1) (LT s12 1))], nbAcceptance=2, 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 19 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-06 finished in 217 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||X(p1))))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-20 22:40:22] [INFO ] Computed 102 place invariants in 0 ms
[2022-05-20 22:40:22] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:22] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:22] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:22] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:22] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:22] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:22] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s185 1), p1:(GEQ s178 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1357 reset in 655 ms.
Stack based approach found an accepted trace after 49 steps with 0 reset with depth 50 and stack size 50 in 0 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-07 finished in 1267 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||p1)) U X(G(X(G(p1))))))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-20 22:40:23] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:23] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:23] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:40:23] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:23] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:40:23] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:23] [INFO ] Computed 102 place invariants in 4 ms
[2022-05-20 22:40:24] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=true, acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 6}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 3}]], initial=6, aps=[p0:(GEQ s248 1), p1:(GEQ s122 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25012 reset in 525 ms.
Product exploration explored 100000 steps with 24965 reset in 534 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 294 ms. Reduced automaton from 8 states, 13 edges and 2 AP to 8 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Finished random walk after 2918 steps, including 0 resets, run visited all 4 properties in 16 ms. (steps per millisecond=182 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 266 ms. Reduced automaton from 8 states, 13 edges and 2 AP to 8 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-20 22:40:26] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:26] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:26] [INFO ] Computed 102 place invariants in 5 ms
[2022-05-20 22:40:26] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:26] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:26] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:26] [INFO ] Computed 102 place invariants in 5 ms
[2022-05-20 22:40:27] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 292 ms. Reduced automaton from 8 states, 13 edges and 2 AP to 8 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Finished random walk after 4385 steps, including 1 resets, run visited all 4 properties in 10 ms. (steps per millisecond=438 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 774 ms. Reduced automaton from 8 states, 13 edges and 2 AP to 8 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 24919 reset in 489 ms.
Product exploration explored 100000 steps with 25058 reset in 707 ms.
Applying partial POR strategy [false, false, true, true, true, true, false, true]
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 146 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 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 98 place count 158 transition count 108
Deduced a syphon composed of 50 places in 0 ms
Applied a total of 98 rules in 23 ms. Remains 158 /254 variables (removed 96) and now considering 108/203 (removed 95) transitions.
// Phase 1: matrix 108 rows 158 cols
[2022-05-20 22:40:30] [INFO ] Computed 54 place invariants in 0 ms
[2022-05-20 22:40:30] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
[2022-05-20 22:40:31] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 108 rows 158 cols
[2022-05-20 22:40:31] [INFO ] Computed 54 place invariants in 0 ms
[2022-05-20 22:40:31] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/254 places, 108/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/254 places, 108/203 transitions.
Product exploration explored 100000 steps with 25136 reset in 923 ms.
Product exploration explored 100000 steps with 25036 reset in 783 ms.
Built C files in :
/tmp/ltsmin13673570799655098389
[2022-05-20 22:40:32] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13673570799655098389
Running compilation step : cd /tmp/ltsmin13673570799655098389;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 486 ms.
Running link step : cd /tmp/ltsmin13673570799655098389;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin13673570799655098389;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1301894701158093613.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 10 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:47] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:48] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:48] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:48] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:48] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:48] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:40:48] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:40:48] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Built C files in :
/tmp/ltsmin6027664527549989043
[2022-05-20 22:40:48] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6027664527549989043
Running compilation step : cd /tmp/ltsmin6027664527549989043;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 244 ms.
Running link step : cd /tmp/ltsmin6027664527549989043;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6027664527549989043;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12944339625095321857.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 22:41:03] [INFO ] Flatten gal took : 18 ms
[2022-05-20 22:41:03] [INFO ] Flatten gal took : 15 ms
[2022-05-20 22:41:03] [INFO ] Time to serialize gal into /tmp/LTL1664970071219906142.gal : 4 ms
[2022-05-20 22:41:03] [INFO ] Time to serialize properties into /tmp/LTL17568707146279155418.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1664970071219906142.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17568707146279155418.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1664970...267
Read 1 LTL properties
Checking formula 0 : !(((G((X("(p245>=1)"))||("(p119>=1)")))U(X(G(X(G("(p119>=1)")))))))
Formula 0 simplified : !(G("(p119>=1)" | X"(p245>=1)") U XGXG"(p119>=1)")
Detected timeout of ITS tools.
[2022-05-20 22:41:18] [INFO ] Flatten gal took : 11 ms
[2022-05-20 22:41:18] [INFO ] Applying decomposition
[2022-05-20 22:41:18] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7676694335681838047.txt' '-o' '/tmp/graph7676694335681838047.bin' '-w' '/tmp/graph7676694335681838047.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7676694335681838047.bin' '-l' '-1' '-v' '-w' '/tmp/graph7676694335681838047.weights' '-q' '0' '-e' '0.001'
[2022-05-20 22:41:18] [INFO ] Decomposing Gal with order
[2022-05-20 22:41:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:41:18] [INFO ] Flatten gal took : 56 ms
[2022-05-20 22:41:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 22:41:18] [INFO ] Time to serialize gal into /tmp/LTL1083083890423106666.gal : 6 ms
[2022-05-20 22:41:18] [INFO ] Time to serialize properties into /tmp/LTL11577619347128267913.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1083083890423106666.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11577619347128267913.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1083083...246
Read 1 LTL properties
Checking formula 0 : !(((G((X("(i28.i0.u119.p245>=1)"))||("(i13.i1.u59.p119>=1)")))U(X(G(X(G("(i13.i1.u59.p119>=1)")))))))
Formula 0 simplified : !(G("(i13.i1.u59.p119>=1)" | X"(i28.i0.u119.p245>=1)") U XGXG"(i13.i1.u59.p119>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16341648517226921750
[2022-05-20 22:41:33] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16341648517226921750
Running compilation step : cd /tmp/ltsmin16341648517226921750;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 423 ms.
Running link step : cd /tmp/ltsmin16341648517226921750;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16341648517226921750;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((X((LTLAPp0==true))||(LTLAPp1==true))) U X([](X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RefineWMG-PT-050051-LTLFireability-09 finished in 85529 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||X(p0)) U X((F((X(p0)&&p1))&&G(p0)))))'
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 12 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:41:49] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:41:49] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:41:49] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:41:49] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:41:49] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:41:49] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:41:49] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:41:49] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s236 1) (GEQ s237 1) (GEQ s239 1)), p1:(AND (GEQ s201 1) (GEQ s202 1) (GEQ s204 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-11 finished in 681 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0&&F(p1)))||G(!p1))))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 146 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 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 1 with 150 rules applied. Total rules applied 198 place count 58 transition count 58
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 45 rules applied. Total rules applied 243 place count 58 transition count 13
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 288 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 288 place count 13 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 292 place count 11 transition count 11
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 294 place count 10 transition count 10
Applied a total of 294 rules in 20 ms. Remains 10 /254 variables (removed 244) and now considering 10/203 (removed 193) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:41:49] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:41:49] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:41:49] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:41:49] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:41:49] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:41:49] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-20 22:41:49] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:41:49] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:41:49] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/254 places, 10/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/254 places, 10/203 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND p1 (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s8 1), p0:(GEQ s6 1)], nbAcceptance=2, 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-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-13 finished in 181 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!(p0 U F(p0)))||X(p1))))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 10 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:41:49] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:41:50] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:41:50] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:41:50] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:41:50] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:41:50] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:41:50] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:41:50] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s212 1), p1:(GEQ s188 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1357 reset in 670 ms.
Stack based approach found an accepted trace after 65 steps with 2 reset with depth 11 and stack size 11 in 1 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-14 finished in 1331 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(((G(F(p0))&&p1) U G(X(p2)))) U p3))'
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-20 22:41:51] [INFO ] Computed 102 place invariants in 3 ms
[2022-05-20 22:41:51] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:41:51] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:41:51] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:41:51] [INFO ] Computed 102 place invariants in 1 ms
[2022-05-20 22:41:51] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2022-05-20 22:41:51] [INFO ] Computed 102 place invariants in 2 ms
[2022-05-20 22:41:51] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 388 ms :[p3, true, (AND p2 p3), (AND p0 p2 p3), p2, (AND p3 p2 p0), (AND p2 p0), (AND p0 p2)]
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND p3 p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(OR (AND (NOT p1) p3) (AND p0 p3)), acceptance={} source=3 dest: 6}, { cond=(AND p1 p3), acceptance={} source=3 dest: 7}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}, { cond=(AND p3 p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 p2), acceptance={0} source=6 dest: 6}], [{ cond=(OR (NOT p1) p0), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(AND (GEQ s61 1) (GEQ s62 1) (GEQ s64 1)), p1:(OR (GEQ s173 1) (GEQ s4 5)), p2:(GEQ s42 1), p0:(GEQ s4 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 913 ms.
Stack based approach found an accepted trace after 3998 steps with 0 reset with depth 3999 and stack size 3960 in 38 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050051-LTLFireability-15 finished in 1972 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||p1)) U X(G(X(G(p1))))))'
Found a SL insensitive property : RefineWMG-PT-050051-LTLFireability-09
Stuttering acceptance computed with spot in 381 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 146 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 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 1 with 150 rules applied. Total rules applied 198 place count 58 transition count 58
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 45 rules applied. Total rules applied 243 place count 58 transition count 13
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 288 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 288 place count 13 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 292 place count 11 transition count 11
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 294 place count 10 transition count 10
Applied a total of 294 rules in 22 ms. Remains 10 /254 variables (removed 244) and now considering 10/203 (removed 193) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:41:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:41:53] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:41:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:41:53] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:41:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:41:53] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:41:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:41:53] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 10/254 places, 10/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/254 places, 10/203 transitions.
Running random walk in product with property : RefineWMG-PT-050051-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=true, acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 6}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 3}]], initial=6, aps=[p0:(GEQ s9 1), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25065 reset in 129 ms.
Product exploration explored 100000 steps with 24989 reset in 137 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 461 ms. Reduced automaton from 8 states, 13 edges and 2 AP to 8 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 364 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Finished random walk after 53 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 618 ms. Reduced automaton from 8 states, 13 edges and 2 AP to 8 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:41:56] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:41:56] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:41:56] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:41:56] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:41:56] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:41:56] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:41:56] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:41:56] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 433 ms. Reduced automaton from 8 states, 13 edges and 2 AP to 8 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 368 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Finished random walk after 156 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=78 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 462 ms. Reduced automaton from 8 states, 13 edges and 2 AP to 8 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 25051 reset in 114 ms.
Product exploration explored 100000 steps with 25064 reset in 108 ms.
Applying partial POR strategy [false, false, true, true, true, true, false, true]
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), false, (NOT p1), (AND (NOT p0) p1)]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:41:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:41:59] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2022-05-20 22:41:59] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-20 22:41:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:41:59] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 10/10 transitions.
Product exploration explored 100000 steps with 25045 reset in 144 ms.
Product exploration explored 100000 steps with 25127 reset in 132 ms.
Built C files in :
/tmp/ltsmin16321530608515628967
[2022-05-20 22:41:59] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16321530608515628967
Running compilation step : cd /tmp/ltsmin16321530608515628967;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 133 ms.
Running link step : cd /tmp/ltsmin16321530608515628967;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16321530608515628967;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9114849285566830766.hoa' '--buchi-type=spotba'
LTSmin run took 120 ms.
Treatment of property RefineWMG-PT-050051-LTLFireability-09 finished in 6832 ms.
FORMULA RefineWMG-PT-050051-LTLFireability-09 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-20 22:42:00] [INFO ] Flatten gal took : 12 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 103897 ms.

BK_STOP 1653086520175

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="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 RefineWMG-PT-050051, 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 r186-tajo-165281572400564"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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