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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K 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.3K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 06:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Mar 25 07:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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 11K 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-d2n3m1c12-00
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-01
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-02
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-03
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-04
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-05
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-06
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-07
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-08
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-09
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-10
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-11
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-12
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-13
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-14
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-15

=== Now, execution of the tool begins

BK_START 1620927278058

Running Version 0
[2021-05-13 17:34:39] [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:34:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 17:34:39] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2021-05-13 17:34:39] [INFO ] Transformed 9 places.
[2021-05-13 17:34:39] [INFO ] Transformed 40 transitions.
[2021-05-13 17:34:39] [INFO ] Parsed PT model containing 9 places and 40 transitions in 57 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:34:39] [INFO ] Initial state test concluded for 1 properties.
FORMULA NeighborGrid-PT-d2n3m1c12-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 17 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:39] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-13 17:34:39] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:39] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:39] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:39] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-13 17:34:39] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
[2021-05-13 17:34:40] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-13 17:34:40] [INFO ] Flatten gal took : 19 ms
FORMULA NeighborGrid-PT-d2n3m1c12-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 17:34:40] [INFO ] Flatten gal took : 4 ms
[2021-05-13 17:34:40] [INFO ] Input system was already deterministic with 40 transitions.
Finished random walk after 74 steps, including 0 resets, run visited all 9 properties in 3 ms. (steps per millisecond=24 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F((p0&&X(G(p1)))) U p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:40] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:40] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:40] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:40] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:40] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:40] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s5 1), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 18 reset in 312 ms.
Stack based approach found an accepted trace after 136 steps with 3 reset with depth 128 and stack size 122 in 1 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-00 finished in 688 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(G((p0||X(G(p0))))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:40] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:40] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:40] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:40] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:40] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:40] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}], [{ cond=true, acceptance={1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={1} source=3 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s4 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 198 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-01 finished in 363 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G((p0 U p1)) U G(p0))&&X(X(G(!p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:41] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:41] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:41] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:41] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:41] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) p2), true, (AND p0 (NOT p1)), p2, (NOT p0), (NOT p1), p2]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-03 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}, { cond=(OR p0 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 1}, { cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s1 1), p1:(GEQ s7 1), p2:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-03 finished in 245 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:41] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:41] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:41] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:41] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:41] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1 1), p1:(GEQ s6 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-04 finished in 157 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0)||(p1&&X(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:41] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:41] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:41] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-05 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s3 1), p1:(GEQ s1 1), p2:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-05 finished in 190 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U X(!p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:41] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:41] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:41] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:41] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-13 17:34:41] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
Stuttering acceptance computed with spot in 105 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (AND (GEQ s5 1) (GEQ s1 1))), p1:(GEQ s1 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 11552 reset in 223 ms.
Stack based approach found an accepted trace after 81 steps with 8 reset with depth 6 and stack size 6 in 1 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-06 finished in 392 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((!p0||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Graph (trivial) has 26 edges and 9 vertex of which 7 / 9 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Applied a total of 1 rules in 9 ms. Remains 3 /9 variables (removed 6) and now considering 7/40 (removed 33) transitions.
// Phase 1: matrix 7 rows 3 cols
[2021-05-13 17:34:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:42] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2021-05-13 17:34:42] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:42] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-13 17:34:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2021-05-13 17:34:42] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:42] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/9 places, 7/40 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-07 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1), p1:(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 2 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-07 finished in 115 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||X(p1)))&&(p2 U p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:42] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:42] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-13 17:34:42] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:42] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:42] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-08 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s8 1), p1:(GEQ s3 1), p2:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 3 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-08 finished in 160 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:42] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:42] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:42] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:42] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-13 17:34:42] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
Stuttering acceptance computed with spot in 72 ms :[p0, p0, p0]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-09 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s6 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][false, false, false]]
Product exploration explored 100000 steps with 5155 reset in 209 ms.
Stack based approach found an accepted trace after 35 steps with 2 reset with depth 15 and stack size 15 in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-09 finished in 343 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0)) U (p0&&X(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:42] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:42] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:42] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s6 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-11 finished in 139 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((!p0 U X((!p1||F(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:42] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:42] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:42] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:34:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:43] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p2) p1)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(LT s4 1), p2:(GEQ s0 1), p1:(GEQ s7 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 38843 reset in 147 ms.
Stack based approach found an accepted trace after 16 steps with 7 reset with depth 3 and stack size 3 in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-12 finished in 306 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Graph (trivial) has 30 edges and 9 vertex of which 8 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Applied a total of 1 rules in 0 ms. Remains 2 /9 variables (removed 7) and now considering 3/40 (removed 37) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:34:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:43] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:34:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:43] [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:34:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:34:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:43] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/9 places, 3/40 transitions.
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-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 1 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-13 finished in 71 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 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Graph (trivial) has 30 edges and 9 vertex of which 8 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Applied a total of 1 rules in 0 ms. Remains 2 /9 variables (removed 7) and now considering 3/40 (removed 37) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:34:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:43] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:34:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:43] [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:34:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 17:34:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:43] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/9 places, 3/40 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-14 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-d2n3m1c12-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-14 finished in 55 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U !p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Graph (trivial) has 22 edges and 9 vertex of which 7 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Applied a total of 1 rules in 1 ms. Remains 3 /9 variables (removed 6) and now considering 7/40 (removed 33) transitions.
// Phase 1: matrix 7 rows 3 cols
[2021-05-13 17:34:43] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:43] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2021-05-13 17:34:43] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 17:34:43] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-13 17:34:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2021-05-13 17:34:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 17:34:43] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/9 places, 7/40 transitions.
Stuttering acceptance computed with spot in 59 ms :[p1, true, p1]
Running random walk in product with property : NeighborGrid-PT-d2n3m1c12-15 automaton TGBA [mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], 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, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d2n3m1c12-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d2n3m1c12-15 finished in 97 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620927284492

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

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