Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r060-tall-165254772600860.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Diffusion2D-PT-D50N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772600860
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.5M
-rw-r--r-- 1 mcc users 6.0K Apr 30 05:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 30 05:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 05:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 05:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K May 9 07:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 7.3M May 10 09:33 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 Diffusion2D-PT-D50N100-LTLFireability-00
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-01
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-02
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-03
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-04
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-05
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-06
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-07
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-08
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-09
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-10
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-11
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-12
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-13
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-14
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652668550853

Running Version 202205111006
[2022-05-16 02:35:52] [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-16 02:35:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:35:52] [INFO ] Load time of PNML (sax parser for PT used): 552 ms
[2022-05-16 02:35:52] [INFO ] Transformed 2500 places.
[2022-05-16 02:35:52] [INFO ] Transformed 19404 transitions.
[2022-05-16 02:35:52] [INFO ] Parsed PT model containing 2500 places and 19404 transitions in 718 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N100-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N100-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N100-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 760 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:35:54] [INFO ] Computed 1 place invariants in 169 ms
[2022-05-16 02:35:54] [INFO ] Implicit Places using invariants in 561 ms returned []
Implicit Place search using SMT only with invariants took 588 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:35:54] [INFO ] Computed 1 place invariants in 101 ms
[2022-05-16 02:36:01] [INFO ] Dead Transitions using invariants and state equation in 7428 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Support contains 31 out of 2500 places after structural reductions.
[2022-05-16 02:36:02] [INFO ] Flatten gal took : 608 ms
[2022-05-16 02:36:03] [INFO ] Flatten gal took : 423 ms
[2022-05-16 02:36:04] [INFO ] Input system was already deterministic with 19404 transitions.
Incomplete random walk after 10013 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=154 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Interrupted probabilistic random walk after 101420 steps, run timeout after 3002 ms. (steps per millisecond=33 ) properties seen :{1=1}
Probabilistic random walk after 101420 steps, saw 84709 distinct states, run finished after 3004 ms. (steps per millisecond=33 ) properties seen :1
Running SMT prover for 28 properties.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:36:07] [INFO ] Computed 1 place invariants in 81 ms
[2022-05-16 02:36:09] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2022-05-16 02:36:27] [INFO ] After 17480ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13 real:15
[2022-05-16 02:36:32] [INFO ] After 22523ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :6 real:22
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-16 02:36:32] [INFO ] After 25059ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :6 real:22
[2022-05-16 02:36:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2022-05-16 02:36:52] [INFO ] After 17445ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2022-05-16 02:36:57] [INFO ] After 22774ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-16 02:36:57] [INFO ] After 25140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Fused 28 Parikh solutions to 22 different solutions.
Finished Parikh walk after 52738 steps, including 0 resets, run visited all 28 properties in 1902 ms. (steps per millisecond=27 )
Parikh walk visited 28 properties in 1915 ms.
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' '!(((p0 U p1)&&!(p2 U X(p2))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 534 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:37:00] [INFO ] Computed 1 place invariants in 78 ms
[2022-05-16 02:37:01] [INFO ] Implicit Places using invariants in 341 ms returned []
Implicit Place search using SMT only with invariants took 343 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:37:01] [INFO ] Computed 1 place invariants in 76 ms
[2022-05-16 02:37:08] [INFO ] Dead Transitions using invariants and state equation in 6930 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p1) p2), true, p2, p2, (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s2232 1), p0:(LT s2428 1), p2:(GEQ s573 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 13149 steps with 0 reset in 557 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-00 finished in 8772 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((X(p0)&&p1))) U p2)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19358 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 39 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19395 transitions
Reduce isomorphic transitions removed 19395 transitions.
Applied a total of 1 rules in 75 ms. Remains 4 /2500 variables (removed 2496) and now considering 9/19404 (removed 19395) transitions.
// Phase 1: matrix 9 rows 4 cols
[2022-05-16 02:37:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:37:09] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 9 rows 4 cols
[2022-05-16 02:37:09] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:37:09] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-16 02:37:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 4 cols
[2022-05-16 02:37:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:37:09] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2500 places, 9/19404 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/2500 places, 9/19404 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p2)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-01 finished in 216 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F((p0 U G(X(X(F(p1)))))))) U G(p2)))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 13 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 30 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2022-05-16 02:37:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:37:09] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-16 02:37:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:37:09] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-16 02:37:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-16 02:37:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:37:09] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p2), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s1 1), p1:(AND (GEQ s2 1) (GEQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-05 finished in 206 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X((X(G(p0))||G(F(p1))))))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19372 edges and 2500 vertex of which 2498 / 2500 are part of one of the 1 SCC in 11 ms
Free SCC test removed 2497 places
Ensure Unique test removed 19399 transitions
Reduce isomorphic transitions removed 19399 transitions.
Applied a total of 1 rules in 26 ms. Remains 3 /2500 variables (removed 2497) and now considering 5/19404 (removed 19399) transitions.
// Phase 1: matrix 5 rows 3 cols
[2022-05-16 02:37:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:37:09] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-16 02:37:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:37:09] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-16 02:37:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-16 02:37:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:37:09] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/2500 places, 5/19404 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/2500 places, 5/19404 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s1 1), p1:(LT s0 1)], 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 7 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-06 finished in 226 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(((F(p0)&&p1)||p2))&&!p1)))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 368 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:37:10] [INFO ] Computed 1 place invariants in 76 ms
[2022-05-16 02:37:10] [INFO ] Implicit Places using invariants in 321 ms returned []
Implicit Place search using SMT only with invariants took 329 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:37:10] [INFO ] Computed 1 place invariants in 75 ms
[2022-05-16 02:37:17] [INFO ] Dead Transitions using invariants and state equation in 6704 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s1190 1), p2:(GEQ s635 1), p0:(GEQ s1582 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 1 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-07 finished in 7637 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 18 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:37:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:37:17] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:37:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:37:17] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-16 02:37:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:37:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:37:17] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s0 1)], 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 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-08 finished in 141 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||(F(G(p1))&&!(p2 U p3))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 362 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:37:17] [INFO ] Computed 1 place invariants in 78 ms
[2022-05-16 02:37:18] [INFO ] Implicit Places using invariants in 291 ms returned []
Implicit Place search using SMT only with invariants took 292 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:37:18] [INFO ] Computed 1 place invariants in 82 ms
[2022-05-16 02:37:25] [INFO ] Dead Transitions using invariants and state equation in 6926 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 329 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p3), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p3), (NOT p1), p3]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=p3, acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 8}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=p1, acceptance={} source=8 dest: 8}, { cond=(NOT p1), acceptance={0} source=8 dest: 8}], [{ cond=p3, acceptance={} source=9 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p3:(GEQ s1549 1), p2:(AND (GEQ s1662 1) (LT s2043 1)), p0:(GEQ s598 1), p1:(LT s1662 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 5554 ms.
Stack based approach found an accepted trace after 4593 steps with 0 reset with depth 4594 and stack size 3467 in 114 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-09 finished in 13630 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(G(p0))))))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 16 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:37:31] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:37:31] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:37:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:37:31] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-16 02:37:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:37:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:37:31] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s0 1)], 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 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-11 finished in 133 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(X(G(p0)))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 347 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:37:31] [INFO ] Computed 1 place invariants in 84 ms
[2022-05-16 02:37:31] [INFO ] Implicit Places using invariants in 331 ms returned []
Implicit Place search using SMT only with invariants took 335 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:37:31] [INFO ] Computed 1 place invariants in 78 ms
[2022-05-16 02:37:38] [INFO ] Dead Transitions using invariants and state equation in 7037 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s1665 1) (LT s282 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 4135 steps with 0 reset in 100 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-12 finished in 7933 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(X(X(p0)))&&(G(X(p1))||p2)) U p0)))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 347 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:37:39] [INFO ] Computed 1 place invariants in 80 ms
[2022-05-16 02:37:39] [INFO ] Implicit Places using invariants in 326 ms returned []
Implicit Place search using SMT only with invariants took 327 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:37:39] [INFO ] Computed 1 place invariants in 75 ms
[2022-05-16 02:37:46] [INFO ] Dead Transitions using invariants and state equation in 6823 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-13 automaton TGBA Formula[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=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=true, acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s603 1), p2:(GEQ s1686 1), p1:(GEQ s1765 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-13 finished in 7719 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (!(p1 U p2) U X(p2))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 417 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:37:47] [INFO ] Computed 1 place invariants in 80 ms
[2022-05-16 02:37:47] [INFO ] Implicit Places using invariants in 313 ms returned []
Implicit Place search using SMT only with invariants took 314 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:37:47] [INFO ] Computed 1 place invariants in 76 ms
[2022-05-16 02:37:54] [INFO ] Dead Transitions using invariants and state equation in 6888 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 378 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), false, false, true, (NOT p0), p2, (AND (NOT p0) p2)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 6}], [{ cond=(NOT p2), acceptance={} source=1 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=6 dest: 10}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=p2, acceptance={} source=9 dest: 7}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=10 dest: 7}, { cond=(AND p2 p0), acceptance={} source=10 dest: 8}]], initial=0, aps=[p2:(GEQ s1128 1), p0:(LT s1599 1), p1:(GEQ s1243 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 34 reset in 2077 ms.
Stack based approach found an accepted trace after 98 steps with 0 reset with depth 99 and stack size 99 in 2 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-14 finished in 10123 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!(X(!G(p0)) U p1))))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 345 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:37:57] [INFO ] Computed 1 place invariants in 80 ms
[2022-05-16 02:37:57] [INFO ] Implicit Places using invariants in 329 ms returned []
Implicit Place search using SMT only with invariants took 330 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2022-05-16 02:37:57] [INFO ] Computed 1 place invariants in 76 ms
[2022-05-16 02:38:04] [INFO ] Dead Transitions using invariants and state equation in 7014 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, p1, p1]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s1437 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 14288 steps with 0 reset in 468 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-15 finished in 8308 ms.
All properties solved by simple procedures.
Total runtime 133202 ms.

BK_STOP 1652668685320

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="Diffusion2D-PT-D50N100"
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 Diffusion2D-PT-D50N100, 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 r060-tall-165254772600860"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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