Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 36K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 36K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 174K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.5K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 26K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620552053731

Running Version 0
[2021-05-09 09:20:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 09:20:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 09:20:55] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-09 09:20:55] [INFO ] Transformed 23 places.
[2021-05-09 09:20:55] [INFO ] Transformed 28 transitions.
[2021-05-09 09:20:55] [INFO ] Parsed PT model containing 23 places and 28 transitions in 57 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 09:20:55] [INFO ] Initial state test concluded for 3 properties.
Support contains 23 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 6 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:56] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-09 09:20:56] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:56] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:20:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:20:56] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:56] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:20:56] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
[2021-05-09 09:20:56] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2021-05-09 09:20:56] [INFO ] Flatten gal took : 25 ms
FORMULA CSRepetitions-PT-02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 09:20:56] [INFO ] Flatten gal took : 7 ms
[2021-05-09 09:20:56] [INFO ] Input system was already deterministic with 28 transitions.
Finished random walk after 34 steps, including 2 resets, run visited all 16 properties in 2 ms. (steps per millisecond=17 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((X(F((G(p2)||p1)))||p0))))], workingDir=/home/mcc/execution]
Support contains 18 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 7 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:56] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:20:56] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:56] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 09:20:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:20:56] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2021-05-09 09:20:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:56] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:20:56] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-02-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s13 1)) (AND (GEQ s14 1) (GEQ s15 1)) (AND (GEQ s10 1) (GEQ s11 1)) (AND (GEQ s5 1) (GEQ s14 1)) (AND (GEQ s2 1) (GEQ s9 1)) (AND (GEQ s7 1) (GEQ s12 1)) (AND (GEQ s1 1) (GEQ s12 1)) (AND (GEQ s10 1) (GEQ s18 1))), p1:(OR (AND (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s17 1) (GEQ s19 1)) (AND (GEQ s0 1) (GEQ s17 1)) (AND (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s4 1) (GEQ s17 1)) (AND (GEQ s8 1) (GEQ s19 1)) (AND (GEQ s0 1) (GEQ s8 1)) (AND (GEQ s8 1) (GEQ s16 1))), p2:(OR (AND (GEQ s9 1) (GEQ s13 1)) (AND (GEQ s14 1) (GEQ s15 1)) (AND (GEQ s10 1) (GEQ s11 1)) (AND (GEQ s5 1) (GEQ s14 1)) (AND (GEQ s2 1) (GEQ s9 1)) (AND (GEQ s7 1) (GEQ s12 1)) (AND (GEQ s1 1) (GEQ s12 1)) (AND (GEQ s10 1) (GEQ s18 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 37 steps with 3 reset in 3 ms.
FORMULA CSRepetitions-PT-02-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-01 finished in 381 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 5 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:56] [INFO ] Computed 6 place invariants in 9 ms
[2021-05-09 09:20:57] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:57] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-09 09:20:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:20:57] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2021-05-09 09:20:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:57] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 09:20:57] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s13 1)) (AND (GEQ s14 1) (GEQ s15 1)) (AND (GEQ s10 1) (GEQ s11 1)) (AND (GEQ s5 1) (GEQ s14 1)) (AND (GEQ s2 1) (GEQ s9 1)) (AND (GEQ s7 1) (GEQ s12 1)) (AND (GEQ s1 1) (GEQ s12 1)) (AND (GEQ s10 1) (GEQ s18 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 24 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-02-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-02 finished in 176 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G((F(p2)||p1)))&&p0)))], workingDir=/home/mcc/execution]
Support contains 21 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:57] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:20:57] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:57] [INFO ] Computed 6 place invariants in 9 ms
[2021-05-09 09:20:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:20:57] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:57] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 09:20:57] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-02-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (GEQ s16 1) (GEQ s0 1) (GEQ s19 1) (GEQ s4 1)) (OR (AND (GEQ s9 1) (GEQ s13 1)) (AND (GEQ s14 1) (GEQ s15 1)) (AND (GEQ s10 1) (GEQ s11 1)) (AND (GEQ s5 1) (GEQ s14 1)) (AND (GEQ s2 1) (GEQ s9 1)) (AND (GEQ s7 1) (GEQ s12 1)) (AND (GEQ s1 1) (GEQ s12 1)) (AND (GEQ s10 1) (GEQ s18 1)))), p1:(OR (AND (GEQ s14 1) (GEQ s20 1)) (AND (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s10 1) (GEQ s20 1)) (AND (GEQ s12 1) (GEQ s20 1)) (GEQ s3 1) (GEQ s21 1) (GEQ s6 1) (GEQ s22 1)), p2:(AND (LT s16 1) (LT s0 1) (LT s19 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-02-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-03 finished in 254 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((p0&&G(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:57] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:20:57] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:57] [INFO ] Computed 6 place invariants in 8 ms
[2021-05-09 09:20:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:20:57] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:57] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:20:57] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-02-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (GEQ s3 1) (GEQ s21 1) (GEQ s6 1) (GEQ s22 1)), p1:(OR (GEQ s3 1) (GEQ s21 1) (GEQ s6 1) (GEQ s22 1) (GEQ s3 1) (GEQ s21 1) (GEQ s6 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 61 steps with 3 reset in 1 ms.
FORMULA CSRepetitions-PT-02-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-04 finished in 414 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||((!p1 U p0)&&X(p0))))], workingDir=/home/mcc/execution]
Support contains 13 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:57] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:20:57] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:57] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:20:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:20:57] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:57] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:20:57] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-06 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s14 1) (GEQ s20 1)) (AND (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s10 1) (GEQ s20 1)) (AND (GEQ s12 1) (GEQ s20 1))), p1:(OR (AND (GEQ s9 1) (GEQ s13 1)) (AND (GEQ s14 1) (GEQ s15 1)) (AND (GEQ s10 1) (GEQ s11 1)) (AND (GEQ s5 1) (GEQ s14 1)) (AND (GEQ s2 1) (GEQ s9 1)) (AND (GEQ s7 1) (GEQ s12 1)) (AND (GEQ s1 1) (GEQ s12 1)) (AND (GEQ s10 1) (GEQ s18 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Product exploration explored 100000 steps with 50000 reset in 238 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Support contains 13 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2021-05-09 09:20:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:20:59] [INFO ] Computed 6 place invariants in 14 ms
[2021-05-09 09:20:59] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Product exploration explored 100000 steps with 50000 reset in 377 ms.
Product exploration explored 100000 steps with 50000 reset in 383 ms.
[2021-05-09 09:21:00] [INFO ] Flatten gal took : 23 ms
[2021-05-09 09:21:00] [INFO ] Flatten gal took : 6 ms
[2021-05-09 09:21:00] [INFO ] Time to serialize gal into /tmp/LTL6040548612179473581.gal : 20 ms
[2021-05-09 09:21:00] [INFO ] Time to serialize properties into /tmp/LTL5316099434716248683.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/LTL6040548612179473581.gal, -t, CGAL, -LTL, /tmp/LTL5316099434716248683.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/LTL6040548612179473581.gal -t CGAL -LTL /tmp/LTL5316099434716248683.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(G("(((((Client_Sending_4>=1)&&(RequestBufferSlots>=1))||((Client_Sending_1>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_2>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_3>=1)&&(RequestBufferSlots>=1)))")))||((("(((((((((Client_Sending_1<1)||(Server_Anwering_1_1<1))&&((Client_Sending_4<1)||(Server_Anwering_4_2<1)))&&((Client_Sending_2<1)||(Server_Anwering_2_1<1)))&&((Server_Anwering_4_1<1)||(Client_Sending_4<1)))&&((Server_Anwering_1_2<1)||(Client_Sending_1<1)))&&((Server_Anwering_3_1<1)||(Client_Sending_3<1)))&&((Server_Anwering_3_2<1)||(Client_Sending_3<1)))&&((Client_Sending_2<1)||(Server_Anwering_2_2<1)))")U("(((((Client_Sending_4>=1)&&(RequestBufferSlots>=1))||((Client_Sending_1>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_2>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_3>=1)&&(RequestBufferSlots>=1)))"))&&(X("(((((Client_Sending_4>=1)&&(RequestBufferSlots>=1))||((Client_Sending_1>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_2>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_3>=1)&&(RequestBufferSlots>=1)))")))))
Formula 0 simplified : !(XG"(((((Client_Sending_4>=1)&&(RequestBufferSlots>=1))||((Client_Sending_1>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_2>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_3>=1)&&(RequestBufferSlots>=1)))" | (("(((((((((Client_Sending_1<1)||(Server_Anwering_1_1<1))&&((Client_Sending_4<1)||(Server_Anwering_4_2<1)))&&((Client_Sending_2<1)||(Server_Anwering_2_1<1)))&&((Server_Anwering_4_1<1)||(Client_Sending_4<1)))&&((Server_Anwering_1_2<1)||(Client_Sending_1<1)))&&((Server_Anwering_3_1<1)||(Client_Sending_3<1)))&&((Server_Anwering_3_2<1)||(Client_Sending_3<1)))&&((Client_Sending_2<1)||(Server_Anwering_2_2<1)))" U "(((((Client_Sending_4>=1)&&(RequestBufferSlots>=1))||((Client_Sending_1>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_2>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_3>=1)&&(RequestBufferSlots>=1)))") & X"(((((Client_Sending_4>=1)&&(RequestBufferSlots>=1))||((Client_Sending_1>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_2>=1)&&(RequestBufferSlots>=1)))||((Client_Sending_3>=1)&&(RequestBufferSlots>=1)))"))
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t6, t8, t12, t13, t14, t16, t17, t19, t21, t23, t24, t26, t27, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/12/16/28
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
7 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.096252,19252,1,0,85,13873,85,33,839,13066,71
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-02-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CSRepetitions-PT-02-06 finished in 2907 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((X(!p1)||p0) U X(G((!p1 U p2))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:21:00] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:21:00] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:21:00] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:21:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:21:00] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:21:00] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:21:00] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 420 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), true, (NOT p2), (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-02-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(OR p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 5}, { cond=(AND p2 p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 5}, { cond=(OR p2 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(OR (GEQ s3 1) (GEQ s21 1) (GEQ s6 1) (GEQ s22 1)), p1:(AND (LT s16 1) (LT s0 1) (LT s19 1) (LT s4 1)), p0:(OR (GEQ s3 1) (GEQ s21 1) (GEQ s6 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-02-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-07 finished in 574 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F((X(G(p1))&&p0))||X(G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:21:01] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:21:01] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:21:01] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 09:21:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:21:01] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:21:01] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:21:01] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-02-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 3}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s20 1)), p1:(AND (GEQ s12 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-02-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-08 finished in 328 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:21:01] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:21:01] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:21:01] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-09 09:21:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:21:01] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:21:01] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:21:01] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-02-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-10 finished in 208 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:21:01] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:21:01] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:21:01] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:21:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:21:01] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:21:01] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:21:01] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Running random walk in product with property : CSRepetitions-PT-02-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 30690 reset in 167 ms.
Stack based approach found an accepted trace after 669 steps with 226 reset with depth 8 and stack size 8 in 2 ms.
FORMULA CSRepetitions-PT-02-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-11 finished in 399 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 17 transition count 25
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 13 transition count 21
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 13 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 11 transition count 19
Applied a total of 21 rules in 11 ms. Remains 11 /23 variables (removed 12) and now considering 19/28 (removed 9) transitions.
[2021-05-09 09:21:02] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 11 cols
[2021-05-09 09:21:02] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 09:21:02] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-09 09:21:02] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 11 cols
[2021-05-09 09:21:02] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 09:21:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 09:21:02] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2021-05-09 09:21:02] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 09:21:02] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 11 cols
[2021-05-09 09:21:02] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 09:21:02] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/23 places, 19/28 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 3 reset in 0 ms.
FORMULA CSRepetitions-PT-02-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-13 finished in 145 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||G(p1)))&&X(((!p1&&F(!p2))||G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:21:02] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 09:21:02] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:21:02] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:21:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 09:21:02] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 09:21:02] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 09:21:02] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) p1), true, (NOT p1), (AND (NOT p1) (NOT p0)), p1, (AND p2 p1), p2]
Running random walk in product with property : CSRepetitions-PT-02-15 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=p1, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s6 1), p1:(AND (GEQ s8 1) (GEQ s16 1)), p2:(AND (GEQ s10 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-02-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-15 finished in 388 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620552063049

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-PT-02"
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 CSRepetitions-PT-02, 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 r026-tajo-162038144000533"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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