Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 6.3K Apr 29 11:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 29 11:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 11:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 11:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K May 9 09:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 09:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 09:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 33K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1653170716699

Running Version 202205111006
[2022-05-21 22:05:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 22:05:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 22:05:18] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2022-05-21 22:05:18] [INFO ] Transformed 52 places.
[2022-05-21 22:05:18] [INFO ] Transformed 42 transitions.
[2022-05-21 22:05:18] [INFO ] Parsed PT model containing 52 places and 42 transitions in 163 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA TriangularGrid-PT-2011-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-2011-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 10 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:18] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-21 22:05:18] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:18] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-21 22:05:18] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:18] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-21 22:05:18] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Support contains 30 out of 52 places after structural reductions.
[2022-05-21 22:05:18] [INFO ] Flatten gal took : 25 ms
[2022-05-21 22:05:18] [INFO ] Flatten gal took : 9 ms
[2022-05-21 22:05:18] [INFO ] Input system was already deterministic with 42 transitions.
Finished random walk after 31 steps, including 0 resets, run visited all 21 properties in 27 ms. (steps per millisecond=1 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:19] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:19] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:19] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-21 22:05:19] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:19] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:19] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : TriangularGrid-PT-2011-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s15 1) (LT s24 1)), p0:(AND (GEQ s15 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA TriangularGrid-PT-2011-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-LTLFireability-00 finished in 499 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(F(G(!G(p0))) U !X(!F(p0)))))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:19] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:19] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:19] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-21 22:05:19] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:19] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-21 22:05:19] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, p0, p0, p0]
Running random walk in product with property : TriangularGrid-PT-2011-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s33 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 2 ms.
FORMULA TriangularGrid-PT-2011-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-LTLFireability-01 finished in 331 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U p1))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:19] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:20] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:20] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:20] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:20] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-21 22:05:20] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : TriangularGrid-PT-2011-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s15 1) (GEQ s24 1)), p0:(AND (GEQ s13 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 2 ms.
FORMULA TriangularGrid-PT-2011-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-LTLFireability-02 finished in 300 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||G(p1)))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:20] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-21 22:05:20] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:20] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-21 22:05:20] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:20] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:20] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-2011-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (LT s12 1) (LT s19 1)), p1:(OR (LT s5 1) (LT s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 32849 reset in 315 ms.
Product exploration explored 100000 steps with 32836 reset in 208 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 240 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 52 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:21] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 22:05:21] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:21] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 22:05:22] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:22] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:22] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 32769 reset in 193 ms.
Product exploration explored 100000 steps with 32790 reset in 205 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 8 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2022-05-21 22:05:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:23] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 22:05:23] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Product exploration explored 100000 steps with 32891 reset in 324 ms.
Product exploration explored 100000 steps with 32927 reset in 317 ms.
Built C files in :
/tmp/ltsmin2655594940008752961
[2022-05-21 22:05:24] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2655594940008752961
Running compilation step : cd /tmp/ltsmin2655594940008752961;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 204 ms.
Running link step : cd /tmp/ltsmin2655594940008752961;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2655594940008752961;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2485608225393576278.hoa' '--buchi-type=spotba'
LTSmin run took 231 ms.
FORMULA TriangularGrid-PT-2011-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-2011-LTLFireability-03 finished in 4334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F(G((G((X(p1)&&p0))||p1)))))))'
Support contains 2 out of 52 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:24] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:24] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:24] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-21 22:05:24] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2022-05-21 22:05:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:24] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-21 22:05:24] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Running random walk in product with property : TriangularGrid-PT-2011-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s44 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 322 steps with 0 reset in 2 ms.
FORMULA TriangularGrid-PT-2011-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-LTLFireability-04 finished in 202 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&F((G(F(p1))&&(F(p2) U p1))))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:24] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:24] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:24] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:24] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:24] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 22:05:24] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-2011-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s15 1) (GEQ s18 1)), p1:(AND (GEQ s14 1) (GEQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13393 steps with 768 reset in 36 ms.
FORMULA TriangularGrid-PT-2011-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-LTLFireability-05 finished in 371 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!p0 U G((F(p0) U X(p1)))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:25] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:25] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:25] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:25] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:25] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:25] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 201 ms :[p1, false, (AND p0 p1), p1, (AND p0 p1)]
Running random walk in product with property : TriangularGrid-PT-2011-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0, 1} source=2 dest: 3}, { cond=(NOT p0), acceptance={1} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s14 1) (GEQ s36 1)), p1:(AND (GEQ s13 1) (GEQ s17 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 32868 reset in 195 ms.
Product exploration explored 100000 steps with 32693 reset in 218 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 630 ms. Reduced automaton from 5 states, 17 edges and 2 AP to 5 states, 17 edges and 2 AP.
Stuttering acceptance computed with spot in 199 ms :[p1, false, (AND p0 p1), p1, (AND p0 p1)]
Finished random walk after 56 steps, including 0 resets, run visited all 6 properties in 12 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 p1)), (F p1), (F (AND (NOT p0) p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 812 ms. Reduced automaton from 5 states, 17 edges and 2 AP to 5 states, 17 edges and 2 AP.
Stuttering acceptance computed with spot in 182 ms :[p1, false, (AND p0 p1), p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 215 ms :[p1, false, (AND p0 p1), p1, (AND p0 p1)]
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:28] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:28] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:28] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-21 22:05:28] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:28] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:28] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 658 ms. Reduced automaton from 5 states, 17 edges and 2 AP to 5 states, 17 edges and 2 AP.
Stuttering acceptance computed with spot in 209 ms :[p1, false, (AND p0 p1), p1, (AND p0 p1)]
Finished random walk after 182 steps, including 0 resets, run visited all 6 properties in 12 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 p1)), (F p1), (F (AND (NOT p0) p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 773 ms. Reduced automaton from 5 states, 17 edges and 2 AP to 5 states, 17 edges and 2 AP.
Stuttering acceptance computed with spot in 198 ms :[p1, false, (AND p0 p1), p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 282 ms :[p1, false, (AND p0 p1), p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 185 ms :[p1, false, (AND p0 p1), p1, (AND p0 p1)]
Product exploration explored 100000 steps with 32825 reset in 194 ms.
Product exploration explored 100000 steps with 32794 reset in 204 ms.
Built C files in :
/tmp/ltsmin4916344970477629608
[2022-05-21 22:05:30] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4916344970477629608
Running compilation step : cd /tmp/ltsmin4916344970477629608;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 121 ms.
Running link step : cd /tmp/ltsmin4916344970477629608;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4916344970477629608;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3514070658147356977.hoa' '--buchi-type=spotba'
LTSmin run took 126 ms.
FORMULA TriangularGrid-PT-2011-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-2011-LTLFireability-06 finished in 6091 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((F(p0) U !p1))||X(p2)||!p2)))'
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:31] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-21 22:05:31] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:31] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:31] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2022-05-21 22:05:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:31] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:31] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 250 ms :[false, (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), p1, p1]
Running random walk in product with property : TriangularGrid-PT-2011-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (LT s12 1) (LT s22 1)), p1:(AND (GEQ s1 1) (GEQ s44 1)), p0:(AND (GEQ s15 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 26049 reset in 207 ms.
Stack based approach found an accepted trace after 60415 steps with 15847 reset with depth 88 and stack size 88 in 133 ms.
FORMULA TriangularGrid-PT-2011-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-2011-LTLFireability-07 finished in 748 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:32] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:32] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:32] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 22:05:32] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2022-05-21 22:05:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:32] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-21 22:05:32] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-2011-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 153 reset in 227 ms.
Stack based approach found an accepted trace after 2013 steps with 1 reset with depth 1386 and stack size 1386 in 6 ms.
FORMULA TriangularGrid-PT-2011-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-2011-LTLFireability-08 finished in 433 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0)) U X(X((F(p1)||p2)))))'
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:32] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-21 22:05:32] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:32] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-21 22:05:32] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:32] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:32] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-2011-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s15 1) (GEQ s21 1)), p2:(AND (GEQ s13 1) (GEQ s23 1)), p1:(AND (GEQ s13 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4195 reset in 288 ms.
Stack based approach found an accepted trace after 44543 steps with 1861 reset with depth 38 and stack size 38 in 116 ms.
FORMULA TriangularGrid-PT-2011-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-2011-LTLFireability-09 finished in 793 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(X(X(G(p0)))))&&p1)))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:33] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-21 22:05:33] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:33] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:33] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2022-05-21 22:05:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:33] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-21 22:05:33] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-2011-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s30 1) (LT s39 1)), p0:(OR (LT s14 1) (LT s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 147 reset in 214 ms.
Stack based approach found an accepted trace after 626 steps with 0 reset with depth 627 and stack size 627 in 1 ms.
FORMULA TriangularGrid-PT-2011-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-2011-LTLFireability-10 finished in 467 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||X((F(p2)&&p1)))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:33] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:33] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:33] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:33] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:33] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-21 22:05:33] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : TriangularGrid-PT-2011-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s46 1)), p0:(OR (LT s13 1) (LT s20 1)), p2:(AND (GEQ s4 1) (GEQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-2011-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-LTLFireability-12 finished in 318 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(X(G(F(!p0)))) U F(p0))) U (p1 U p2)))'
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:34] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-21 22:05:34] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:34] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-21 22:05:34] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2022-05-21 22:05:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:34] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 22:05:34] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-2011-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s13 1) (GEQ s23 1)), p1:(AND (GEQ s12 1) (GEQ s22 1)), p0:(AND (GEQ s26 1) (GEQ s35 1))], nbAcceptance=0, 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 98883 steps with 6281 reset in 223 ms.
FORMULA TriangularGrid-PT-2011-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-LTLFireability-13 finished in 442 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||F(X(G(G(F(p1)))))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:34] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:34] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:34] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-21 22:05:34] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2022-05-21 22:05:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:34] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:34] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-2011-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s48 1)), p1:(OR (LT s15 1) (LT s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 894 reset in 247 ms.
Product exploration explored 100000 steps with 971 reset in 271 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 245 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 219 steps, including 1 resets, run visited all 2 properties in 4 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 260 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:35] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-21 22:05:35] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:35] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 22:05:36] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2022-05-21 22:05:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2022-05-21 22:05:36] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-21 22:05:36] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 25 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 217 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 901 reset in 225 ms.
Product exploration explored 100000 steps with 908 reset in 246 ms.
Built C files in :
/tmp/ltsmin11616430115368339351
[2022-05-21 22:05:37] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2022-05-21 22:05:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 22:05:37] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2022-05-21 22:05:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 22:05:37] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2022-05-21 22:05:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 22:05:37] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11616430115368339351
Running compilation step : cd /tmp/ltsmin11616430115368339351;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 130 ms.
Running link step : cd /tmp/ltsmin11616430115368339351;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin11616430115368339351;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10872803749663932311.hoa' '--buchi-type=spotba'
LTSmin run took 126 ms.
FORMULA TriangularGrid-PT-2011-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-2011-LTLFireability-15 finished in 3112 ms.
All properties solved by simple procedures.
Total runtime 19694 ms.

BK_STOP 1653170737684

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

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