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-162089127300093.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-d3n3m1t11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127300093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K 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.8K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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.1K Mar 27 06:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 25 07:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 07:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 46K 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-d3n3m1t11-00
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-01
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-02
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-03
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-04
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-05
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-06
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-07
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-08
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-09
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-10
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-11
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-12
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-13
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-14
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-15

=== Now, execution of the tool begins

BK_START 1620928075654

Running Version 0
[2021-05-13 17:48:05] [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:48:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 17:48:05] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2021-05-13 17:48:05] [INFO ] Transformed 27 places.
[2021-05-13 17:48:05] [INFO ] Transformed 162 transitions.
[2021-05-13 17:48:05] [INFO ] Parsed PT model containing 27 places and 162 transitions in 75 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Support contains 21 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 9 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:06] [INFO ] Computed 1 place invariants in 11 ms
[2021-05-13 17:48:06] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:06] [INFO ] Computed 1 place invariants in 9 ms
[2021-05-13 17:48:06] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:06] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-13 17:48:06] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 162/162 transitions.
[2021-05-13 17:48:06] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-13 17:48:06] [INFO ] Flatten gal took : 32 ms
FORMULA NeighborGrid-PT-d3n3m1t11-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d3n3m1t11-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d3n3m1t11-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d3n3m1t11-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d3n3m1t11-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d3n3m1t11-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 17:48:06] [INFO ] Flatten gal took : 9 ms
[2021-05-13 17:48:06] [INFO ] Input system was already deterministic with 162 transitions.
Finished random walk after 100 steps, including 0 resets, run visited all 13 properties in 4 ms. (steps per millisecond=25 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0&&X(p1))) U X(p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:06] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-13 17:48:06] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:06] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-13 17:48:06] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:06] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-13 17:48:06] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 162/162 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p2), (NOT p2), (NOT p2), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s20 1), p2:(LT s4 1), p1:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA NeighborGrid-PT-d3n3m1t11-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-00 finished in 505 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(F((G(p0)||(p0&&G(F(p1))))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 4 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:07] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:07] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:07] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:07] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:07] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-13 17:48:07] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 162/162 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p1:(LT s26 1), p0:(LT s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1691 reset in 735 ms.
Stack based approach found an accepted trace after 251 steps with 4 reset with depth 44 and stack size 44 in 2 ms.
FORMULA NeighborGrid-PT-d3n3m1t11-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-01 finished in 1136 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0&&G(p1)) U (X(p0)&&(p0 U p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 4 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-13 17:48:08] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 162/162 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p2)), true, (NOT p0), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-04 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND p0 (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s25 1), p0:(GEQ s11 1), p1:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 155 steps with 75 reset in 2 ms.
FORMULA NeighborGrid-PT-d3n3m1t11-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-04 finished in 295 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Graph (trivial) has 138 edges and 27 vertex of which 25 / 27 are part of one of the 1 SCC in 3 ms
Free SCC test removed 24 places
Ensure Unique test removed 157 transitions
Reduce isomorphic transitions removed 157 transitions.
Applied a total of 1 rules in 10 ms. Remains 3 /27 variables (removed 24) and now considering 5/162 (removed 157) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-13 17:48:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-13 17:48:08] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/27 places, 5/162 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s1 1), p0:(GEQ 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 33 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d3n3m1t11-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-05 finished in 113 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Graph (trivial) has 150 edges and 27 vertex of which 26 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 159 transitions
Reduce isomorphic transitions removed 159 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /27 variables (removed 25) and now considering 3/162 (removed 159) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-13 17:48:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/27 places, 3/162 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ 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 NeighborGrid-PT-d3n3m1t11-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-07 finished in 60 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 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 162/162 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-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 s17 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 11 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d3n3m1t11-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-08 finished in 180 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(!p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Graph (trivial) has 150 edges and 27 vertex of which 26 / 27 are part of one of the 1 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 159 transitions
Reduce isomorphic transitions removed 159 transitions.
Applied a total of 1 rules in 2 ms. Remains 2 /27 variables (removed 25) and now considering 3/162 (removed 159) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-13 17:48:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:08] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/27 places, 3/162 transitions.
Stuttering acceptance computed with spot in 22 ms :[p0]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-11 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 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 NeighborGrid-PT-d3n3m1t11-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-11 finished in 60 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 8 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 7 ms
[2021-05-13 17:48:08] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 27 cols
[2021-05-13 17:48:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:09] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 162/162 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LT s4 1), p0:(LT s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d3n3m1t11-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-13 finished in 193 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Graph (trivial) has 150 edges and 27 vertex of which 26 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 159 transitions
Reduce isomorphic transitions removed 159 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /27 variables (removed 25) and now considering 3/162 (removed 159) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:48:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:09] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:48:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:09] [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:48:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:48:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:09] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/27 places, 3/162 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} 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 0 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d3n3m1t11-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-14 finished in 59 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 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 162/162 transitions.
Graph (trivial) has 150 edges and 27 vertex of which 26 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 159 transitions
Reduce isomorphic transitions removed 159 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /27 variables (removed 25) and now considering 3/162 (removed 159) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:48:09] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:48:09] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:48:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:09] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-13 17:48:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:48:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:48:09] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/27 places, 3/162 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d3n3m1t11-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-d3n3m1t11-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d3n3m1t11-15 finished in 87 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620928100698

--------------------
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-d3n3m1t11"
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-d3n3m1t11, 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-162089127300093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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