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.r273-smll-162123879700156.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r273-smll-162123879700156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K May 10 09:44 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.7K Apr 26 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 26 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 26 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 26 05:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 26 05:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rwxr-xr-x 1 mcc users 33K May 5 16:52 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-00
FORMULA_NAME TriangularGrid-PT-2011-01
FORMULA_NAME TriangularGrid-PT-2011-02
FORMULA_NAME TriangularGrid-PT-2011-03
FORMULA_NAME TriangularGrid-PT-2011-04
FORMULA_NAME TriangularGrid-PT-2011-05
FORMULA_NAME TriangularGrid-PT-2011-06
FORMULA_NAME TriangularGrid-PT-2011-07
FORMULA_NAME TriangularGrid-PT-2011-08
FORMULA_NAME TriangularGrid-PT-2011-09
FORMULA_NAME TriangularGrid-PT-2011-10
FORMULA_NAME TriangularGrid-PT-2011-11
FORMULA_NAME TriangularGrid-PT-2011-12
FORMULA_NAME TriangularGrid-PT-2011-13
FORMULA_NAME TriangularGrid-PT-2011-14
FORMULA_NAME TriangularGrid-PT-2011-15

=== Now, execution of the tool begins

BK_START 1621449429964

Running Version 0
[2021-05-19 18:37:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-19 18:37:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 18:37:13] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2021-05-19 18:37:13] [INFO ] Transformed 52 places.
[2021-05-19 18:37:13] [INFO ] Transformed 42 transitions.
[2021-05-19 18:37:13] [INFO ] Parsed PT model containing 52 places and 42 transitions in 116 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2021-05-19 18:37:13] [INFO ] Initial state test concluded for 4 properties.
FORMULA TriangularGrid-PT-2011-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-2011-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 52 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 13 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:13] [INFO ] Computed 23 place invariants in 16 ms
[2021-05-19 18:37:14] [INFO ] Implicit Places using invariants in 187 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:14] [INFO ] Computed 23 place invariants in 11 ms
[2021-05-19 18:37:14] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:14] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-19 18:37:14] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
[2021-05-19 18:37:14] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-19 18:37:14] [INFO ] Flatten gal took : 46 ms
FORMULA TriangularGrid-PT-2011-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-2011-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 18:37:14] [INFO ] Flatten gal took : 18 ms
[2021-05-19 18:37:14] [INFO ] Input system was already deterministic with 42 transitions.
Incomplete random walk after 100000 steps, including 157 resets, run finished after 554 ms. (steps per millisecond=180 ) properties (out of 28) seen :23
Running SMT prover for 5 properties.
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:15] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-19 18:37:15] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned unsat
[2021-05-19 18:37:15] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned unsat
[2021-05-19 18:37:15] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned unsat
[2021-05-19 18:37:15] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned unsat
[2021-05-19 18:37:15] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 11 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:15] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-19 18:37:15] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:15] [INFO ] Computed 23 place invariants in 6 ms
[2021-05-19 18:37:15] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2021-05-19 18:37:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:15] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-19 18:37:15] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-2011-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s14 s12), p1:(GT s50 s44)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 546 steps with 0 reset in 15 ms.
FORMULA TriangularGrid-PT-2011-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-00 finished in 745 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 52 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 18:37:16] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-19 18:37:16] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:16] [INFO ] Computed 23 place invariants in 6 ms
[2021-05-19 18:37:16] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2021-05-19 18:37:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:16] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-19 18:37:16] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-2011-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s31)], 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 2505 steps with 3 reset in 26 ms.
FORMULA TriangularGrid-PT-2011-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-01 finished in 350 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||G(p1)))&&X(F(p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 18:37:16] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-19 18:37:16] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:16] [INFO ] Computed 23 place invariants in 9 ms
[2021-05-19 18:37:16] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:16] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-19 18:37:16] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : TriangularGrid-PT-2011-02 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=p0, acceptance={} source=0 dest: 3}, { cond=(OR p0 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s10 s28), p1:(LEQ s21 s51), p2:(AND (GT s31 s3) (GT s10 s28))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 104 steps with 1 reset in 1 ms.
FORMULA TriangularGrid-PT-2011-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-02 finished in 627 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&X((p0 U ((p1 U (p2||G(p1)))||G(p0))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 18:37:17] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-19 18:37:17] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:17] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-19 18:37:17] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:17] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-19 18:37:17] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 277 ms :[true, (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-2011-03 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: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(LEQ 3 s7), p2:(AND (LEQ s49 s21) (LEQ 1 s8)), p1:(LEQ 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-2011-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-03 finished in 518 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||(p1&&G(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 6 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:17] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-19 18:37:17] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:17] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-19 18:37:17] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2021-05-19 18:37:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:17] [INFO ] Computed 23 place invariants in 9 ms
[2021-05-19 18:37:17] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
[2021-05-19 18:37:17] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : TriangularGrid-PT-2011-04 automaton TGBA [mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GT 3 s8), p2:(LEQ s0 s36), p0:(AND (LEQ s47 s33) (LEQ s0 s36))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 209 steps with 0 reset in 3 ms.
FORMULA TriangularGrid-PT-2011-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-04 finished in 444 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0&&X(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 18:37:18] [INFO ] Computed 23 place invariants in 6 ms
[2021-05-19 18:37:18] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:18] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-19 18:37:18] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:18] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-19 18:37:18] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-2011-06 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s31 s37), p1:(LEQ s8 s35)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6667 reset in 533 ms.
Stack based approach found an accepted trace after 30644 steps with 2091 reset with depth 113 and stack size 113 in 164 ms.
FORMULA TriangularGrid-PT-2011-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-06 finished in 1158 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((G((p0||X(F((p0&&F(p1)))))) U !p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 18:37:19] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-19 18:37:19] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:19] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-19 18:37:19] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:19] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-19 18:37:19] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 332 ms :[p0, false, p0, (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-2011-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=p0, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={1} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={1} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=6 dest: 5}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 1 s29), p1:(LEQ s20 s11)], nbAcceptance=2, 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]]
Product exploration explored 100000 steps with 5013 reset in 703 ms.
Product exploration explored 100000 steps with 5117 reset in 497 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 328 ms :[p0, false, p0, (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 4974 reset in 536 ms.
Product exploration explored 100000 steps with 5163 reset in 521 ms.
Applying partial POR strategy [true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 313 ms :[p0, false, p0, (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 52 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, 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.
[2021-05-19 18:37:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:23] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-19 18:37:23] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Product exploration explored 100000 steps with 5146 reset in 705 ms.
Product exploration explored 100000 steps with 5005 reset in 338 ms.
[2021-05-19 18:37:24] [INFO ] Flatten gal took : 9 ms
[2021-05-19 18:37:24] [INFO ] Flatten gal took : 8 ms
[2021-05-19 18:37:24] [INFO ] Time to serialize gal into /tmp/LTL14375139867352675754.gal : 2 ms
[2021-05-19 18:37:24] [INFO ] Time to serialize properties into /tmp/LTL2896603107873861860.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14375139867352675754.gal, -t, CGAL, -LTL, /tmp/LTL2896603107873861860.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14375139867352675754.gal -t CGAL -LTL /tmp/LTL2896603107873861860.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G((G(("(pil2_2_1>=1)")||(X(F(("(pil2_2_1>=1)")&&(F("(pi2_2_1<=pb3_2_3)")))))))U("(pil2_2_1<1)")))))
Formula 0 simplified : !FG(G("(pil2_2_1>=1)" | XF("(pil2_2_1>=1)" & F"(pi2_2_1<=pb3_2_3)")) U "(pil2_2_1<1)")
Reverse transition relation is NOT exact ! Due to transitions t33, t35, t38, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/39/3/42
Computing Next relation with stutter on 99 deadlock states
4 unique states visited
2 strongly connected components in search stack
8 transitions explored
3 items max in DFS search stack
64 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.678328,33952,1,0,93,97072,127,40,1762,90420,127
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA TriangularGrid-PT-2011-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property TriangularGrid-PT-2011-07 finished in 5877 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 18:37:25] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-19 18:37:25] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:25] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-19 18:37:25] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:25] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-19 18:37:25] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-2011-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4286 reset in 379 ms.
Stack based approach found an accepted trace after 5877 steps with 238 reset with depth 28 and stack size 28 in 19 ms.
FORMULA TriangularGrid-PT-2011-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-09 finished in 720 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 18:37:25] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-19 18:37:25] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:25] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-19 18:37:26] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2021-05-19 18:37:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:26] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-19 18:37:26] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 81 ms :[p0, p0]
Running random walk in product with property : TriangularGrid-PT-2011-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6479 reset in 246 ms.
Stack based approach found an accepted trace after 30606 steps with 1948 reset with depth 65 and stack size 65 in 81 ms.
FORMULA TriangularGrid-PT-2011-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-10 finished in 702 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0||(p1 U (p2||G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 18:37:26] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-19 18:37:26] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:26] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-19 18:37:26] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:26] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-19 18:37:26] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : TriangularGrid-PT-2011-11 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(OR p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(AND (GT 2 s31) (GT s39 s46)), p1:(GT s39 s46), p0:(GT s42 s19)], 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 2 steps with 0 reset in 1 ms.
FORMULA TriangularGrid-PT-2011-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-11 finished in 457 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 18:37:27] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-19 18:37:27] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:27] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-19 18:37:27] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2021-05-19 18:37:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:27] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-19 18:37:27] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-2011-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s27 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8530 reset in 427 ms.
Stack based approach found an accepted trace after 75942 steps with 6407 reset with depth 9 and stack size 9 in 375 ms.
FORMULA TriangularGrid-PT-2011-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-14 finished in 1163 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 6 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:28] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-19 18:37:28] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:28] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-19 18:37:28] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2021-05-19 18:37:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 52 cols
[2021-05-19 18:37:28] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-19 18:37:28] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 42/42 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-2011-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s31 s9)], 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 610 steps with 0 reset in 2 ms.
FORMULA TriangularGrid-PT-2011-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-2011-15 finished in 321 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621449449880

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="TriangularGrid-PT-2011"
export BK_EXAMINATION="LTLCardinality"
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 LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r273-smll-162123879700156"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;