Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 27 06:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 06:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 07:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 07:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rwxr-xr-x 1 mcc users 469K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-00
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-01
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-02
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-03
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-04
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-05
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-06
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-07
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-08
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-09
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-10
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-11
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-12
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-13
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-14
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-15

=== Now, execution of the tool begins

BK_START 1620928436015

Running Version 0
[2021-05-13 17:53:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 17:53:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 17:53:58] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2021-05-13 17:53:58] [INFO ] Transformed 81 places.
[2021-05-13 17:53:58] [INFO ] Transformed 1632 transitions.
[2021-05-13 17:53:58] [INFO ] Parsed PT model containing 81 places and 1632 transitions in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 17:53:58] [INFO ] Initial state test concluded for 4 properties.
FORMULA NeighborGrid-PT-d4n3m2c23-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 21 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:58] [INFO ] Computed 1 place invariants in 32 ms
[2021-05-13 17:53:58] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:58] [INFO ] Computed 1 place invariants in 13 ms
[2021-05-13 17:53:58] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:53:58] [INFO ] Computed 1 place invariants in 17 ms
[2021-05-13 17:53:59] [INFO ] Dead Transitions using invariants and state equation in 595 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
[2021-05-13 17:53:59] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-13 17:53:59] [INFO ] Flatten gal took : 104 ms
FORMULA NeighborGrid-PT-d4n3m2c23-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d4n3m2c23-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 17:53:59] [INFO ] Flatten gal took : 73 ms
[2021-05-13 17:53:59] [INFO ] Input system was already deterministic with 1632 transitions.
Finished random walk after 483 steps, including 0 resets, run visited all 22 properties in 30 ms. (steps per millisecond=16 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X((X(G(p0)) U (p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 81 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 8 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:00] [INFO ] Computed 1 place invariants in 7 ms
[2021-05-13 17:54:00] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:00] [INFO ] Computed 1 place invariants in 7 ms
[2021-05-13 17:54:00] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:00] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-13 17:54:00] [INFO ] Dead Transitions using invariants and state equation in 527 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s25 1), p2:(GEQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 117 steps with 0 reset in 23 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-00 finished in 1054 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((p1&&G(p2))||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1458 edges and 81 vertex of which 77 / 81 are part of one of the 1 SCC in 5 ms
Free SCC test removed 76 places
Ensure Unique test removed 1619 transitions
Reduce isomorphic transitions removed 1619 transitions.
Applied a total of 1 rules in 15 ms. Remains 5 /81 variables (removed 76) and now considering 13/1632 (removed 1619) transitions.
// Phase 1: matrix 13 rows 5 cols
[2021-05-13 17:54:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:54:01] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 13 rows 5 cols
[2021-05-13 17:54:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:54:01] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-13 17:54:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 5 cols
[2021-05-13 17:54:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:54:01] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/81 places, 13/1632 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LT s0 1), p0:(OR (LT s4 1) (LT s2 1)), p2:(OR (LT s1 1) (LT s2 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 NeighborGrid-PT-d4n3m2c23-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-01 finished in 165 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1552 edges and 81 vertex of which 79 / 81 are part of one of the 1 SCC in 2 ms
Free SCC test removed 78 places
Ensure Unique test removed 1625 transitions
Reduce isomorphic transitions removed 1625 transitions.
Applied a total of 1 rules in 5 ms. Remains 3 /81 variables (removed 78) and now considering 7/1632 (removed 1625) transitions.
// Phase 1: matrix 7 rows 3 cols
[2021-05-13 17:54:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:54:01] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2021-05-13 17:54:01] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:54:01] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-13 17:54:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2021-05-13 17:54:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:54:01] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/81 places, 7/1632 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s0 1) (LT s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-03 finished in 95 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1500 edges and 81 vertex of which 79 / 81 are part of one of the 1 SCC in 2 ms
Free SCC test removed 78 places
Ensure Unique test removed 1627 transitions
Reduce isomorphic transitions removed 1627 transitions.
Applied a total of 1 rules in 7 ms. Remains 3 /81 variables (removed 78) and now considering 5/1632 (removed 1627) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:54:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:54:01] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:54:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:54:01] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-13 17:54:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:54:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:54:01] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/81 places, 5/1632 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s0 1), p1:(LT s1 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 NeighborGrid-PT-d4n3m2c23-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-05 finished in 116 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||(X(X(p1))&&G(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 7 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:01] [INFO ] Computed 1 place invariants in 13 ms
[2021-05-13 17:54:01] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:01] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-13 17:54:01] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:01] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-13 17:54:02] [INFO ] Dead Transitions using invariants and state equation in 539 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-06 automaton TGBA [mat=[[{ cond=(AND p2 p1), acceptance={} source=0 dest: 3}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=0 dest: 7}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 6}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 7}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=1 dest: 8}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 7}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 0}, { cond=(AND p0 p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 3}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=4, aps=[p2:(LT s31 1), p1:(GEQ s58 1), p0:(GEQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 329 steps with 0 reset in 34 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-06 finished in 1056 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 7 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:02] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:54:02] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:02] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:54:02] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:02] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:54:03] [INFO ] Dead Transitions using invariants and state equation in 449 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-07 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s34 1) (LT s32 1)), p0:(GEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33447 reset in 4386 ms.
Product exploration explored 100000 steps with 33420 reset in 4329 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 33331 reset in 4233 ms.
Product exploration explored 100000 steps with 33138 reset in 4286 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Support contains 2 out of 81 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1534 edges and 81 vertex of which 79 / 81 are part of one of the 1 SCC in 1 ms
Free SCC test removed 78 places
Ensure Unique test removed 1625 transitions
Reduce isomorphic transitions removed 1625 transitions.
Applied a total of 1 rules in 4 ms. Remains 3 /81 variables (removed 78) and now considering 7/1632 (removed 1625) transitions.
[2021-05-13 17:54:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2021-05-13 17:54:20] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:54:21] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/81 places, 7/1632 transitions.
Entered a terminal (fully accepting) state of product in 7535 steps with 2530 reset in 186 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-07 finished in 18720 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:21] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:54:21] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:21] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:54:21] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:21] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:54:21] [INFO ] Dead Transitions using invariants and state equation in 452 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 398 steps with 0 reset in 40 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-08 finished in 766 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:21] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-13 17:54:21] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:21] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:54:22] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:22] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:54:22] [INFO ] Dead Transitions using invariants and state equation in 455 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LT s43 1), p0:(LT s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], 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 NeighborGrid-PT-d4n3m2c23-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-10 finished in 770 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:22] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:54:22] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:22] [INFO ] Computed 1 place invariants in 19 ms
[2021-05-13 17:54:22] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:22] [INFO ] Computed 1 place invariants in 7 ms
[2021-05-13 17:54:23] [INFO ] Dead Transitions using invariants and state equation in 440 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LT s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 270 reset in 6273 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 5 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-11 finished in 7064 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0) U p1)&&X(F(!p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:29] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-13 17:54:29] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:29] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:54:30] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
// Phase 1: matrix 1632 rows 81 cols
[2021-05-13 17:54:30] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-13 17:54:30] [INFO ] Dead Transitions using invariants and state equation in 434 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 1632/1632 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p1), p1]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-12 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s6 1), p0:(GEQ s59 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 132 reset in 6035 ms.
Stack based approach found an accepted trace after 167 steps with 0 reset with depth 168 and stack size 168 in 11 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-12 finished in 6809 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1612 edges and 81 vertex of which 80 / 81 are part of one of the 1 SCC in 2 ms
Free SCC test removed 79 places
Ensure Unique test removed 1629 transitions
Reduce isomorphic transitions removed 1629 transitions.
Applied a total of 1 rules in 5 ms. Remains 2 /81 variables (removed 79) and now considering 3/1632 (removed 1629) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:54:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:54:36] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:54:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:54:36] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-13 17:54:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:54:36] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:54:36] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/81 places, 3/1632 transitions.
Stuttering acceptance computed with spot in 29 ms :[true, (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-13 finished in 71 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U (p1&&G(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1444 edges and 81 vertex of which 77 / 81 are part of one of the 1 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 1621 transitions
Reduce isomorphic transitions removed 1621 transitions.
Applied a total of 1 rules in 4 ms. Remains 5 /81 variables (removed 76) and now considering 11/1632 (removed 1621) transitions.
// Phase 1: matrix 11 rows 5 cols
[2021-05-13 17:54:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:54:36] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 11 rows 5 cols
[2021-05-13 17:54:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:54:36] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-13 17:54:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 5 cols
[2021-05-13 17:54:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:54:36] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/81 places, 11/1632 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-14 automaton TGBA [mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s1 1), p2:(OR (GEQ s2 1) (GEQ s3 1)), p0:(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 18 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-14 finished in 122 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1600 edges and 81 vertex of which 80 / 81 are part of one of the 1 SCC in 1 ms
Free SCC test removed 79 places
Ensure Unique test removed 1629 transitions
Reduce isomorphic transitions removed 1629 transitions.
Applied a total of 1 rules in 5 ms. Remains 2 /81 variables (removed 79) and now considering 3/1632 (removed 1629) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:54:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:54:36] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:54:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:54:36] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-13 17:54:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:54:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:54:36] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/81 places, 3/1632 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d4n3m2c23-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d4n3m2c23-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d4n3m2c23-15 finished in 95 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620928477947

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeighborGrid-PT-d4n3m2c23"
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 NeighborGrid-PT-d4n3m2c23, 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 r140-tall-162089127300101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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