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-162038144100557.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-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038144100557
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 236K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 866K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 246K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M 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 37K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 31K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 105K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 61K Mar 22 12:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Mar 22 12:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K 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 279K 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-05-00
FORMULA_NAME CSRepetitions-PT-05-01
FORMULA_NAME CSRepetitions-PT-05-02
FORMULA_NAME CSRepetitions-PT-05-03
FORMULA_NAME CSRepetitions-PT-05-04
FORMULA_NAME CSRepetitions-PT-05-05
FORMULA_NAME CSRepetitions-PT-05-06
FORMULA_NAME CSRepetitions-PT-05-07
FORMULA_NAME CSRepetitions-PT-05-08
FORMULA_NAME CSRepetitions-PT-05-09
FORMULA_NAME CSRepetitions-PT-05-10
FORMULA_NAME CSRepetitions-PT-05-11
FORMULA_NAME CSRepetitions-PT-05-12
FORMULA_NAME CSRepetitions-PT-05-13
FORMULA_NAME CSRepetitions-PT-05-14
FORMULA_NAME CSRepetitions-PT-05-15

=== Now, execution of the tool begins

BK_START 1620552446012

Running Version 0
[2021-05-09 09:27:28] [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:27:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 09:27:28] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2021-05-09 09:27:28] [INFO ] Transformed 206 places.
[2021-05-09 09:27:28] [INFO ] Transformed 325 transitions.
[2021-05-09 09:27:28] [INFO ] Parsed PT model containing 206 places and 325 transitions in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 09:27:28] [INFO ] Initial state test concluded for 1 properties.
Support contains 206 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 61 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:29] [INFO ] Computed 30 place invariants in 19 ms
[2021-05-09 09:27:29] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:29] [INFO ] Computed 30 place invariants in 26 ms
[2021-05-09 09:27:29] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-09 09:27:29] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:29] [INFO ] Computed 30 place invariants in 3 ms
[2021-05-09 09:27:29] [INFO ] Dead Transitions using invariants and state equation in 236 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
[2021-05-09 09:27:29] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 09:27:29] [INFO ] Flatten gal took : 80 ms
FORMULA CSRepetitions-PT-05-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 09:27:29] [INFO ] Flatten gal took : 41 ms
[2021-05-09 09:27:30] [INFO ] Input system was already deterministic with 325 transitions.
Finished random walk after 7066 steps, including 111 resets, run visited all 30 properties in 47 ms. (steps per millisecond=150 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 180 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 30 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:30] [INFO ] Computed 30 place invariants in 4 ms
[2021-05-09 09:27:30] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:30] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-09 09:27:30] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2021-05-09 09:27:30] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:30] [INFO ] Computed 30 place invariants in 5 ms
[2021-05-09 09:27:30] [INFO ] Dead Transitions using invariants and state equation in 185 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-05-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), 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:(AND (OR (LT s169 1) (LT s187 1)) (OR (LT s100 1) (LT s183 1)) (OR (LT s42 1) (LT s187 1)) (OR (LT s100 1) (LT s122 1)) (OR (LT s38 1) (LT s192 1)) (OR (LT s178 1) (LT s187 1)) (OR (LT s38 1) (LT s62 1)) (OR (LT s82 1) (LT s191 1)) (OR (LT s169 1) (LT s191 1)) (OR (LT s42 1) (LT s191 1)) (OR (LT s100 1) (LT s179 1)) (OR (LT s4 1) (LT s61 1)) (OR (LT s31 1) (LT s191 1)) (OR (LT s61 1) (LT s100 1)) (OR (LT s178 1) (LT s191 1)) (OR (LT s4 1) (LT s20 1)) (OR (LT s38 1) (LT s82 1)) (OR (LT s100 1) (LT s106 1)) (OR (LT s31 1) (LT s187 1)) (OR (LT s82 1) (LT s187 1)) (OR (LT s111 1) (LT s191 1)) (OR (LT s111 1) (LT s187 1)) (OR (LT s72 1) (LT s100 1)) (OR (LT s4 1) (LT s106 1)) (OR (LT s23 1) (LT s100 1)) (OR (LT s20 1) (LT s191 1)) (OR (LT s4 1) (LT s179 1)) (OR (LT s4 1) (LT s183 1)) (OR (LT s4 1) (LT s122 1)) (OR (LT s38 1) (LT s183 1)) (OR (LT s38 1) (LT s179 1)) (OR (LT s122 1) (LT s191 1)) (OR (LT s62 1) (LT s187 1)) (OR (LT s122 1) (LT s187 1)) (OR (LT s62 1) (LT s191 1)) (OR (LT s100 1) (LT s192 1)) (OR (LT s38 1) (LT s106 1)) (OR (LT s38 1) (LT s45 1)) (OR (LT s20 1) (LT s187 1)) (OR (LT s4 1) (LT s45 1)) (OR (LT s145 1) (LT s191 1)) (OR (LT s38 1) (LT s197 1)) (OR (LT s38 1) (LT s67 1)) (OR (LT s4 1) (LT s62 1)) (OR (LT s31 1) (LT s38 1)) (OR (LT s100 1) (LT s178 1)) (OR (LT s107 1) (LT s191 1)) (OR (LT s4 1) (LT s192 1)) (OR (LT s20 1) (LT s38 1)) (OR (LT s4 1) (LT s82 1)) (OR (LT s15 1) (LT s100 1)) (OR (LT s107 1) (LT s187 1)) (OR (LT s145 1) (LT s187 1)) (OR (LT s4 1) (LT s107 1)) (OR (LT s4 1) (LT s42 1)) (OR (LT s67 1) (LT s100 1)) (OR (LT s42 1) (LT s100 1)) (OR (LT s38 1) (LT s111 1)) (OR (LT s4 1) (LT s111 1)) (OR (LT s38 1) (LT s42 1)) (OR (LT s38 1) (LT s107 1)) (OR (LT s179 1) (LT s191 1)) (OR (LT s38 1) (LT s137 1)) (OR (LT s38 1) (LT s72 1)) (OR (LT s38 1) (LT s133 1)) (OR (LT s20 1) (LT s100 1)) (OR (LT s31 1) (LT s100 1)) (OR (LT s72 1) (LT s191 1)) (OR (LT s4 1) (LT s67 1)) (OR (LT s23 1) (LT s191 1)) (OR (LT s61 1) (LT s187 1)) (OR (LT s72 1) (LT s187 1)) (OR (LT s23 1) (LT s187 1)) (OR (LT s61 1) (LT s191 1)) (OR (LT s38 1) (LT s153 1)) (OR (LT s100 1) (LT s169 1)) (OR (LT s38 1) (LT s145 1)) (OR (LT s4 1) (LT s197 1)) (OR (LT s179 1) (LT s187 1)) (OR (LT s15 1) (LT s38 1)) (OR (LT s191 1) (LT s197 1)) (OR (LT s38 1) (LT s169 1)) (OR (LT s62 1) (LT s100 1)) (OR (LT s187 1) (LT s197 1)) (OR (LT s100 1) (LT s153 1)) (OR (LT s137 1) (LT s187 1)) (OR (LT s137 1) (LT s191 1)) (OR (LT s82 1) (LT s100 1)) (OR (LT s100 1) (LT s145 1)) (OR (LT s4 1) (LT s31 1)) (OR (LT s100 1) (LT s133 1)) (OR (LT s100 1) (LT s137 1)) (OR (LT s45 1) (LT s187 1)) (OR (LT s4 1) (LT s169 1)) (OR (LT s45 1) (LT s191 1)) (OR (LT s45 1) (LT s100 1)) (OR (LT s4 1) (LT s137 1)) (OR (LT s4 1) (LT s72 1)) (OR (LT s106 1) (LT s191 1)) (OR (LT s4 1) (LT s133 1)) (OR (LT s106 1) (LT s187 1)) (OR (LT s67 1) (LT s191 1)) (OR (LT s100 1) (LT s111 1)) (OR (LT s38 1) (LT s61 1)) (OR (LT s38 1) (LT s122 1)) (OR (LT s153 1) (LT s187 1)) (OR (LT s4 1) (LT s153 1)) (OR (LT s4 1) (LT s23 1)) (OR (LT s100 1) (LT s107 1)) (OR (LT s187 1) (LT s192 1)) (OR (LT s183 1) (LT s187 1)) (OR (LT s4 1) (LT s145 1)) (OR (LT s183 1) (LT s191 1)) (OR (LT s153 1) (LT s191 1)) (OR (LT s4 1) (LT s15 1)) (OR (LT s15 1) (LT s187 1)) (OR (LT s23 1) (LT s38 1)) (OR (LT s191 1) (LT s192 1)) (OR (LT s15 1) (LT s191 1)) (OR (LT s4 1) (LT s178 1)) (OR (LT s133 1) (LT s187 1)) (OR (LT s133 1) (LT s191 1)) (OR (LT s100 1) (LT s197 1)) (OR (LT s67 1) (LT s187 1)) (OR (LT s38 1) (LT s178 1))), p1:(OR (AND (GEQ s169 1) (GEQ s187 1)) (AND (GEQ s100 1) (GEQ s183 1)) (AND (GEQ s42 1) (GEQ s187 1)) (AND (GEQ s100 1) (GEQ s122 1)) (AND (GEQ s38 1) (GEQ s192 1)) (AND (GEQ s178 1) (GEQ s187 1)) (AND (GEQ s38 1) (GEQ s62 1)) (AND (GEQ s82 1) (GEQ s191 1)) (AND (GEQ s169 1) (GEQ s191 1)) (AND (GEQ s42 1) (GEQ s191 1)) (AND (GEQ s100 1) (GEQ s179 1)) (AND (GEQ s4 1) (GEQ s61 1)) (AND (GEQ s31 1) (GEQ s191 1)) (AND (GEQ s61 1) (GEQ s100 1)) (AND (GEQ s178 1) (GEQ s191 1)) (AND (GEQ s4 1) (GEQ s20 1)) (AND (GEQ s38 1) (GEQ s82 1)) (AND (GEQ s100 1) (GEQ s106 1)) (AND (GEQ s31 1) (GEQ s187 1)) (AND (GEQ s82 1) (GEQ s187 1)) (AND (GEQ s111 1) (GEQ s191 1)) (AND (GEQ s111 1) (GEQ s187 1)) (AND (GEQ s72 1) (GEQ s100 1)) (AND (GEQ s4 1) (GEQ s106 1)) (AND (GEQ s23 1) (GEQ s100 1)) (AND (GEQ s20 1) (GEQ s191 1)) (AND (GEQ s4 1) (GEQ s179 1)) (AND (GEQ s4 1) (GEQ s183 1)) (AND (GEQ s4 1) (GEQ s122 1)) (AND (GEQ s38 1) (GEQ s183 1)) (AND (GEQ s38 1) (GEQ s179 1)) (AND (GEQ s122 1) (GEQ s191 1)) (AND (GEQ s62 1) (GEQ s187 1)) (AND (GEQ s122 1) (GEQ s187 1)) (AND (GEQ s62 1) (GEQ s191 1)) (AND (GEQ s100 1) (GEQ s192 1)) (AND (GEQ s38 1) (GEQ s106 1)) (AND (GEQ s38 1) (GEQ s45 1)) (AND (GEQ s20 1) (GEQ s187 1)) (AND (GEQ s4 1) (GEQ s45 1)) (AND (GEQ s145 1) (GEQ s191 1)) (AND (GEQ s38 1) (GEQ s197 1)) (AND (GEQ s38 1) (GEQ s67 1)) (AND (GEQ s4 1) (GEQ s62 1)) (AND (GEQ s31 1) (GEQ s38 1)) (AND (GEQ s100 1) (GEQ s178 1)) (AND (GEQ s107 1) (GEQ s191 1)) (AND (GEQ s4 1) (GEQ s192 1)) (AND (GEQ s20 1) (GEQ s38 1)) (AND (GEQ s4 1) (GEQ s82 1)) (AND (GEQ s15 1) (GEQ s100 1)) (AND (GEQ s107 1) (GEQ s187 1)) (AND (GEQ s145 1) (GEQ s187 1)) (AND (GEQ s4 1) (GEQ s107 1)) (AND (GEQ s4 1) (GEQ s42 1)) (AND (GEQ s67 1) (GEQ s100 1)) (AND (GEQ s42 1) (GEQ s100 1)) (AND (GEQ s38 1) (GEQ s111 1)) (AND (GEQ s4 1) (GEQ s111 1)) (AND (GEQ s38 1) (GEQ s42 1)) (AND (GEQ s38 1) (GEQ s107 1)) (AND (GEQ s179 1) (GEQ s191 1)) (AND (GEQ s38 1) (GEQ s137 1)) (AND (GEQ s38 1) (GEQ s72 1)) (AND (GEQ s38 1) (GEQ s133 1)) (AND (GEQ s20 1) (GEQ s100 1)) (AND (GEQ s31 1) (GEQ s100 1)) (AND (GEQ s72 1) (GEQ s191 1)) (AND (GEQ s4 1) (GEQ s67 1)) (AND (GEQ s23 1) (GEQ s191 1)) (AND (GEQ s61 1) (GEQ s187 1)) (AND (GEQ s72 1) (GEQ s187 1)) (AND (GEQ s23 1) (GEQ s187 1)) (AND (GEQ s61 1) (GEQ s191 1)) (AND (GEQ s38 1) (GEQ s153 1)) (AND (GEQ s100 1) (GEQ s169 1)) (AND (GEQ s38 1) (GEQ s145 1)) (AND (GEQ s4 1) (GEQ s197 1)) (AND (GEQ s179 1) (GEQ s187 1)) (AND (GEQ s15 1) (GEQ s38 1)) (AND (GEQ s191 1) (GEQ s197 1)) (AND (GEQ s38 1) (GEQ s169 1)) (AND (GEQ s62 1) (GEQ s100 1)) (AND (GEQ s187 1) (GEQ s197 1)) (AND (GEQ s100 1) (GEQ s153 1)) (AND (GEQ s137 1) (GEQ s187 1)) (AND (GEQ s137 1) (GEQ s191 1)) (AND (GEQ s82 1) (GEQ s100 1)) (AND (GEQ s100 1) (GEQ s145 1)) (AND (GEQ s4 1) (GEQ s31 1)) (AND (GEQ s100 1) (GEQ s133 1)) (AND (GEQ s100 1) (GEQ s137 1)) (AND (GEQ s45 1) (GEQ s187 1)) (AND (GEQ s4 1) (GEQ s169 1)) (AND (GEQ s45 1) (GEQ s191 1)) (AND (GEQ s45 1) (GEQ s100 1)) (AND (GEQ s4 1) (GEQ s137 1)) (AND (GEQ s4 1) (GEQ s72 1)) (AND (GEQ s106 1) (GEQ s191 1)) (AND (GEQ s4 1) (GEQ s133 1)) (AND (GEQ s106 1) (GEQ s187 1)) (AND (GEQ s67 1) (GEQ s191 1)) (AND (GEQ s100 1) (GEQ s111 1)) (AND (GEQ s38 1) (GEQ s61 1)) (AND (GEQ s38 1) (GEQ s122 1)) (AND (GEQ s153 1) (GEQ s187 1)) (AND (GEQ s4 1) (GEQ s153 1)) (AND (GEQ s4 1) (GEQ s23 1)) (AND (GEQ s100 1) (GEQ s107 1)) (AND (GEQ s187 1) (GEQ s192 1)) (AND (GEQ s183 1) (GEQ s187 1)) (AND (GEQ s4 1) (GEQ s145 1)) (AND (GEQ s183 1) (GEQ s191 1)) (AND (GEQ s153 1) (GEQ s191 1)) (AND (GEQ s4 1) (GEQ s15 1)) (AND (GEQ s15 1) (GEQ s187 1)) (AND (GEQ s23 1) (GEQ s38 1)) (AND (GEQ s191 1) (GEQ s192 1)) (AND (GEQ s15 1) (GEQ s191 1)) (AND (GEQ s4 1) (GEQ s178 1)) (AND (GEQ s133 1) (GEQ s187 1)) (AND (GEQ s133 1) (GEQ s191 1)) (AND (GEQ s100 1) (GEQ s197 1)) (AND (GEQ s67 1) (GEQ s187 1)) (AND (GEQ s38 1) (GEQ s178 1)) (AND (GEQ s53 1) (GEQ s203 1)) (AND (GEQ s46 1) (GEQ s109 1)) (AND (GEQ s60 1) (GEQ s167 1)) (AND (GEQ s32 1) (GEQ s63 1)) (AND (GEQ s26 1) (GEQ s40 1)) (AND (GEQ s11 1) (GEQ s110 1)) (AND (GEQ s123 1) (GEQ s156 1)) (AND (GEQ s126 1) (GEQ s202 1)) (AND (GEQ s5 1) (GEQ s136 1)) (AND (GEQ s134 1) (GEQ s160 1)) (AND (GEQ s143 1) (GEQ s148 1)) (AND (GEQ s48 1) (GEQ s60 1)) (AND (GEQ s63 1) (GEQ s87 1)) (AND (GEQ s28 1) (GEQ s35 1)) (AND (GEQ s17 1) (GEQ s146 1)) (AND (GEQ s41 1) (GEQ s149 1)) (AND (GEQ s3 1) (GEQ s108 1)) (AND (GEQ s105 1) (GEQ s136 1)) (AND (GEQ s102 1) (GEQ s158 1)) (AND (GEQ s3 1) (GEQ s51 1)) (AND (GEQ s116 1) (GEQ s143 1)) (AND (GEQ s46 1) (GEQ s57 1)) (AND (GEQ s41 1) (GEQ s121 1)) (AND (GEQ s128 1) (GEQ s152 1)) (AND (GEQ s88 1) (GEQ s181 1)) (AND (GEQ s3 1) (GEQ s124 1)) (AND (GEQ s70 1) (GEQ s136 1)) (AND (GEQ s46 1) (GEQ s112 1)) (AND (GEQ s73 1) (GEQ s84 1)) (AND (GEQ s63 1) (GEQ s74 1)) (AND (GEQ s146 1) (GEQ s150 1)) (AND (GEQ s36 1) (GEQ s53 1)) (AND (GEQ s14 1) (GEQ s68 1)) (AND (GEQ s126 1) (GEQ s140 1)) (AND (GEQ s35 1) (GEQ s165 1)) (AND (GEQ s16 1) (GEQ s41 1)) (AND (GEQ s11 1) (GEQ s22 1)) (AND (GEQ s14 1) (GEQ s64 1)) (AND (GEQ s162 1) (GEQ s181 1)) (AND (GEQ s60 1) (GEQ s117 1)) (AND (GEQ s143 1) (GEQ s159 1)) (AND (GEQ s9 1) (GEQ s134 1)) (AND (GEQ s101 1) (GEQ s161 1)) (AND (GEQ s3 1) (GEQ s93 1)) (AND (GEQ s146 1) (GEQ s174 1)) (AND (GEQ s1 1) (GEQ s198 1)) (AND (GEQ s40 1) (GEQ s193 1)) (AND (GEQ s40 1) (GEQ s71 1)) (AND (GEQ s113 1) (GEQ s196 1)) (AND (GEQ s102 1) (GEQ s118 1)) (AND (GEQ s18 1) (GEQ s102 1)) (AND (GEQ s134 1) (GEQ s195 1)) (AND (GEQ s101 1) (GEQ s173 1)) (AND (GEQ s78 1) (GEQ s198 1)) (AND (GEQ s46 1) (GEQ s170 1)) (AND (GEQ s91 1) (GEQ s134 1)) (AND (GEQ s135 1) (GEQ s181 1)) (AND (GEQ s37 1) (GEQ s182 1)) (AND (GEQ s73 1) (GEQ s154 1)) (AND (GEQ s139 1) (GEQ s182 1)) (AND (GEQ s35 1) (GEQ s95 1)) (AND (GEQ s126 1) (GEQ s200 1)) (AND (GEQ s33 1) (GEQ s136 1)) (AND (GEQ s73 1) (GEQ s144 1)) (AND (GEQ s14 1) (GEQ s69 1)) (AND (GEQ s47 1) (GEQ s113 1)) (AND (GEQ s104 1) (GEQ s119 1)) (AND (GEQ s94 1) (GEQ s182 1)) (AND (GEQ s2 1) (GEQ s35 1)) (AND (GEQ s73 1) (GEQ s189 1)) (AND (GEQ s11 1) (GEQ s157 1)) (AND (GEQ s77 1) (GEQ s123 1)) (AND (GEQ s85 1) (GEQ s198 1)) (AND (GEQ s182 1) (GEQ s205 1)) (AND (GEQ s103 1) (GEQ s182 1)) (AND (GEQ s123 1) (GEQ s199 1)) (AND (GEQ s90 1) (GEQ s143 1)) (AND (GEQ s41 1) (GEQ s147 1)) (AND (GEQ s113 1) (GEQ s120 1)) (AND (GEQ s92 1) (GEQ s101 1)) (AND (GEQ s35 1) (GEQ s201 1)) (AND (GEQ s53 1) (GEQ s55 1)) (AND (GEQ s83 1) (GEQ s198 1)) (AND (GEQ s53 1) (GEQ s132 1)) (AND (GEQ s79 1) (GEQ s126 1)) (AND (GEQ s46 1) (GEQ s175 1)) (AND (GEQ s143 1) (GEQ s186 1)) (AND (GEQ s11 1) (GEQ s166 1)) (AND (GEQ s6 1) (GEQ s41 1)) (AND (GEQ s10 1) (GEQ s152 1)) (AND (GEQ s12 1) (GEQ s123 1)) (AND (GEQ s27 1) (GEQ s63 1)) (AND (GEQ s30 1) (GEQ s152 1)) (AND (GEQ s119 1) (GEQ s180 1)) (AND (GEQ s102 1) (GEQ s190 1)) (AND (GEQ s21 1) (GEQ s152 1)) (AND (GEQ s43 1) (GEQ s60 1)) (AND (GEQ s127 1) (GEQ s136 1)) (AND (GEQ s76 1) (GEQ s134 1)) (AND (GEQ s101 1) (GEQ s204 1)) (AND (GEQ s24 1) (GEQ s102 1)) (AND (GEQ s81 1) (GEQ s198 1)) (AND (GEQ s53 1) (GEQ s163 1)) (AND (GEQ s146 1) (GEQ s172 1)) (AND (GEQ s34 1) (GEQ s181 1)) (AND (GEQ s14 1) (GEQ s176 1)) (AND (GEQ s7 1) (GEQ s152 1)) (AND (GEQ s54 1) (GEQ s113 1)) (AND (GEQ s89 1) (GEQ s123 1)) (AND (GEQ s14 1) (GEQ s168 1)) (AND (GEQ s97 1) (GEQ s101 1)) (AND (GEQ s59 1) (GEQ s63 1)) (AND (GEQ s58 1) (GEQ s126 1)) (AND (GEQ s49 1) (GEQ s73 1)) (AND (GEQ s114 1) (GEQ s119 1)) (AND (GEQ s3 1) (GEQ s50 1)) (AND (GEQ s119 1) (GEQ s155 1)) (AND (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s65 1) (GEQ s146 1)) (AND (GEQ s80 1) (GEQ s119 1)) (AND (GEQ s181 1) (GEQ s194 1)) (AND (GEQ s60 1) (GEQ s98 1)) (AND (GEQ s11 1) (GEQ s125 1)) (AND (GEQ s40 1) (GEQ s142 1)) (AND (GEQ s113 1) (GEQ s129 1)))], 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 67 steps with 0 reset in 4 ms.
FORMULA CSRepetitions-PT-05-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-01 finished in 697 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 175 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 7 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:31] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:31] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:31] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:31] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-09 09:27:31] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2021-05-09 09:27:31] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:31] [INFO ] Computed 30 place invariants in 3 ms
[2021-05-09 09:27:31] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-05-02 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s67 1) (GEQ s192 1) (GEQ s197 1) (GEQ s133 1) (GEQ s72 1) (GEQ s137 1) (GEQ s15 1) (GEQ s82 1) (GEQ s145 1) (GEQ s20 1) (GEQ s23 1) (GEQ s153 1) (GEQ s31 1) (GEQ s106 1) (GEQ s107 1) (GEQ s169 1) (GEQ s42 1) (GEQ s45 1) (GEQ s111 1) (GEQ s179 1) (GEQ s178 1) (GEQ s183 1) (GEQ s122 1) (GEQ s61 1) (GEQ s62 1)), p1:(OR (AND (GEQ s53 1) (GEQ s203 1)) (AND (GEQ s46 1) (GEQ s109 1)) (AND (GEQ s60 1) (GEQ s167 1)) (AND (GEQ s32 1) (GEQ s63 1)) (AND (GEQ s26 1) (GEQ s40 1)) (AND (GEQ s11 1) (GEQ s110 1)) (AND (GEQ s123 1) (GEQ s156 1)) (AND (GEQ s126 1) (GEQ s202 1)) (AND (GEQ s5 1) (GEQ s136 1)) (AND (GEQ s134 1) (GEQ s160 1)) (AND (GEQ s143 1) (GEQ s148 1)) (AND (GEQ s48 1) (GEQ s60 1)) (AND (GEQ s63 1) (GEQ s87 1)) (AND (GEQ s28 1) (GEQ s35 1)) (AND (GEQ s17 1) (GEQ s146 1)) (AND (GEQ s41 1) (GEQ s149 1)) (AND (GEQ s3 1) (GEQ s108 1)) (AND (GEQ s105 1) (GEQ s136 1)) (AND (GEQ s102 1) (GEQ s158 1)) (AND (GEQ s3 1) (GEQ s51 1)) (AND (GEQ s116 1) (GEQ s143 1)) (AND (GEQ s46 1) (GEQ s57 1)) (AND (GEQ s41 1) (GEQ s121 1)) (AND (GEQ s128 1) (GEQ s152 1)) (AND (GEQ s88 1) (GEQ s181 1)) (AND (GEQ s3 1) (GEQ s124 1)) (AND (GEQ s70 1) (GEQ s136 1)) (AND (GEQ s46 1) (GEQ s112 1)) (AND (GEQ s73 1) (GEQ s84 1)) (AND (GEQ s63 1) (GEQ s74 1)) (AND (GEQ s146 1) (GEQ s150 1)) (AND (GEQ s36 1) (GEQ s53 1)) (AND (GEQ s14 1) (GEQ s68 1)) (AND (GEQ s126 1) (GEQ s140 1)) (AND (GEQ s35 1) (GEQ s165 1)) (AND (GEQ s16 1) (GEQ s41 1)) (AND (GEQ s11 1) (GEQ s22 1)) (AND (GEQ s14 1) (GEQ s64 1)) (AND (GEQ s162 1) (GEQ s181 1)) (AND (GEQ s60 1) (GEQ s117 1)) (AND (GEQ s143 1) (GEQ s159 1)) (AND (GEQ s9 1) (GEQ s134 1)) (AND (GEQ s101 1) (GEQ s161 1)) (AND (GEQ s3 1) (GEQ s93 1)) (AND (GEQ s146 1) (GEQ s174 1)) (AND (GEQ s1 1) (GEQ s198 1)) (AND (GEQ s40 1) (GEQ s193 1)) (AND (GEQ s40 1) (GEQ s71 1)) (AND (GEQ s113 1) (GEQ s196 1)) (AND (GEQ s102 1) (GEQ s118 1)) (AND (GEQ s18 1) (GEQ s102 1)) (AND (GEQ s134 1) (GEQ s195 1)) (AND (GEQ s101 1) (GEQ s173 1)) (AND (GEQ s78 1) (GEQ s198 1)) (AND (GEQ s46 1) (GEQ s170 1)) (AND (GEQ s91 1) (GEQ s134 1)) (AND (GEQ s135 1) (GEQ s181 1)) (AND (GEQ s37 1) (GEQ s182 1)) (AND (GEQ s73 1) (GEQ s154 1)) (AND (GEQ s139 1) (GEQ s182 1)) (AND (GEQ s35 1) (GEQ s95 1)) (AND (GEQ s126 1) (GEQ s200 1)) (AND (GEQ s33 1) (GEQ s136 1)) (AND (GEQ s73 1) (GEQ s144 1)) (AND (GEQ s14 1) (GEQ s69 1)) (AND (GEQ s47 1) (GEQ s113 1)) (AND (GEQ s104 1) (GEQ s119 1)) (AND (GEQ s94 1) (GEQ s182 1)) (AND (GEQ s2 1) (GEQ s35 1)) (AND (GEQ s73 1) (GEQ s189 1)) (AND (GEQ s11 1) (GEQ s157 1)) (AND (GEQ s77 1) (GEQ s123 1)) (AND (GEQ s85 1) (GEQ s198 1)) (AND (GEQ s182 1) (GEQ s205 1)) (AND (GEQ s103 1) (GEQ s182 1)) (AND (GEQ s123 1) (GEQ s199 1)) (AND (GEQ s90 1) (GEQ s143 1)) (AND (GEQ s41 1) (GEQ s147 1)) (AND (GEQ s113 1) (GEQ s120 1)) (AND (GEQ s92 1) (GEQ s101 1)) (AND (GEQ s35 1) (GEQ s201 1)) (AND (GEQ s53 1) (GEQ s55 1)) (AND (GEQ s83 1) (GEQ s198 1)) (AND (GEQ s53 1) (GEQ s132 1)) (AND (GEQ s79 1) (GEQ s126 1)) (AND (GEQ s46 1) (GEQ s175 1)) (AND (GEQ s143 1) (GEQ s186 1)) (AND (GEQ s11 1) (GEQ s166 1)) (AND (GEQ s6 1) (GEQ s41 1)) (AND (GEQ s10 1) (GEQ s152 1)) (AND (GEQ s12 1) (GEQ s123 1)) (AND (GEQ s27 1) (GEQ s63 1)) (AND (GEQ s30 1) (GEQ s152 1)) (AND (GEQ s119 1) (GEQ s180 1)) (AND (GEQ s102 1) (GEQ s190 1)) (AND (GEQ s21 1) (GEQ s152 1)) (AND (GEQ s43 1) (GEQ s60 1)) (AND (GEQ s127 1) (GEQ s136 1)) (AND (GEQ s76 1) (GEQ s134 1)) (AND (GEQ s101 1) (GEQ s204 1)) (AND (GEQ s24 1) (GEQ s102 1)) (AND (GEQ s81 1) (GEQ s198 1)) (AND (GEQ s53 1) (GEQ s163 1)) (AND (GEQ s146 1) (GEQ s172 1)) (AND (GEQ s34 1) (GEQ s181 1)) (AND (GEQ s14 1) (GEQ s176 1)) (AND (GEQ s7 1) (GEQ s152 1)) (AND (GEQ s54 1) (GEQ s113 1)) (AND (GEQ s89 1) (GEQ s123 1)) (AND (GEQ s14 1) (GEQ s168 1)) (AND (GEQ s97 1) (GEQ s101 1)) (AND (GEQ s59 1) (GEQ s63 1)) (AND (GEQ s58 1) (GEQ s126 1)) (AND (GEQ s49 1) (GEQ s73 1)) (AND (GEQ s114 1) (GEQ s119 1)) (AND (GEQ s3 1) (GEQ s50 1)) (AND (GEQ s119 1) (GEQ s155 1)) (AND (GEQ s13 1) (GEQ s40 1)) (AND (GEQ s65 1) (GEQ s146 1)) (AND (GEQ s80 1) (GEQ s119 1)) (AND (GEQ s181 1) (GEQ s194 1)) (AND (GEQ s60 1) (GEQ s98 1)) (AND (GEQ s11 1) (GEQ s125 1)) (AND (GEQ s40 1) (GEQ s142 1)) (AND (GEQ s113 1) (GEQ s129 1)))], nbAcceptance=2, 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 111 steps with 0 reset in 29 ms.
FORMULA CSRepetitions-PT-05-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-02 finished in 410 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||F(p1))))], workingDir=/home/mcc/execution]
Support contains 51 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 22 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:31] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:31] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:31] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:31] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-09 09:27:31] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2021-05-09 09:27:31] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:31] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:31] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-05-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s86 1) (LT s123 1)) (OR (LT s73 1) (LT s86 1)) (OR (LT s86 1) (LT s126 1)) (OR (LT s86 1) (LT s198 1)) (OR (LT s53 1) (LT s86 1)) (OR (LT s86 1) (LT s136 1)) (OR (LT s86 1) (LT s134 1)) (OR (LT s11 1) (LT s86 1)) (OR (LT s86 1) (LT s113 1)) (OR (LT s86 1) (LT s181 1)) (OR (LT s3 1) (LT s86 1)) (OR (LT s46 1) (LT s86 1)) (OR (LT s63 1) (LT s86 1)) (OR (LT s86 1) (LT s119 1)) (OR (LT s86 1) (LT s182 1)) (OR (LT s41 1) (LT s86 1)) (OR (LT s86 1) (LT s101 1)) (OR (LT s86 1) (LT s102 1)) (OR (LT s40 1) (LT s86 1)) (OR (LT s60 1) (LT s86 1)) (OR (LT s86 1) (LT s143 1)) (OR (LT s35 1) (LT s86 1)) (OR (LT s86 1) (LT s146 1)) (OR (LT s86 1) (LT s152 1)) (OR (LT s14 1) (LT s86 1))), p1:(AND (LT s0 1) (LT s130 1) (LT s131 1) (LT s66 1) (LT s8 1) (LT s138 1) (LT s75 1) (LT s141 1) (LT s19 1) (LT s151 1) (LT s25 1) (LT s29 1) (LT s96 1) (LT s99 1) (LT s39 1) (LT s164 1) (LT s171 1) (LT s44 1) (LT s115 1) (LT s177 1) (LT s52 1) (LT s56 1) (LT s185 1) (LT s184 1) (LT s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1349 reset in 640 ms.
Stack based approach found an accepted trace after 10582 steps with 140 reset with depth 42 and stack size 42 in 67 ms.
FORMULA CSRepetitions-PT-05-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-03 finished in 1248 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((X(G(!p1)) U G(!p1))||p0))))], workingDir=/home/mcc/execution]
Support contains 25 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 25 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:32] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:32] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:32] [INFO ] Computed 30 place invariants in 3 ms
[2021-05-09 09:27:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-09 09:27:33] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2021-05-09 09:27:33] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:33] [INFO ] Computed 30 place invariants in 3 ms
[2021-05-09 09:27:33] [INFO ] Dead Transitions using invariants and state equation in 404 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-05-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s0 1) (LT s130 1) (LT s131 1) (LT s66 1) (LT s8 1) (LT s138 1) (LT s75 1) (LT s141 1) (LT s19 1) (LT s151 1) (LT s25 1) (LT s29 1) (LT s96 1) (LT s99 1) (LT s39 1) (LT s164 1) (LT s171 1) (LT s44 1) (LT s115 1) (LT s177 1) (LT s52 1) (LT s56 1) (LT s185 1) (LT s184 1) (LT s188 1)), p0:(OR (GEQ s0 1) (GEQ s130 1) (GEQ s131 1) (GEQ s66 1) (GEQ s8 1) (GEQ s138 1) (GEQ s75 1) (GEQ s141 1) (GEQ s19 1) (GEQ s151 1) (GEQ s25 1) (GEQ s29 1) (GEQ s96 1) (GEQ s99 1) (GEQ s39 1) (GEQ s164 1) (GEQ s171 1) (GEQ s44 1) (GEQ s115 1) (GEQ s177 1) (GEQ s52 1) (GEQ s56 1) (GEQ s185 1) (GEQ s184 1) (GEQ s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 91 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-05-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-04 finished in 985 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(!p0))))], workingDir=/home/mcc/execution]
Support contains 30 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:33] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 09:27:33] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:33] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:33] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-09 09:27:34] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:34] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 09:27:34] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, p0, p0, p0]
Running random walk in product with property : CSRepetitions-PT-05-05 automaton TGBA [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 (OR (LT s169 1) (LT s187 1)) (OR (LT s100 1) (LT s183 1)) (OR (LT s42 1) (LT s187 1)) (OR (LT s100 1) (LT s122 1)) (OR (LT s38 1) (LT s192 1)) (OR (LT s178 1) (LT s187 1)) (OR (LT s38 1) (LT s62 1)) (OR (LT s82 1) (LT s191 1)) (OR (LT s169 1) (LT s191 1)) (OR (LT s42 1) (LT s191 1)) (OR (LT s100 1) (LT s179 1)) (OR (LT s4 1) (LT s61 1)) (OR (LT s31 1) (LT s191 1)) (OR (LT s61 1) (LT s100 1)) (OR (LT s178 1) (LT s191 1)) (OR (LT s4 1) (LT s20 1)) (OR (LT s38 1) (LT s82 1)) (OR (LT s100 1) (LT s106 1)) (OR (LT s31 1) (LT s187 1)) (OR (LT s82 1) (LT s187 1)) (OR (LT s111 1) (LT s191 1)) (OR (LT s111 1) (LT s187 1)) (OR (LT s72 1) (LT s100 1)) (OR (LT s4 1) (LT s106 1)) (OR (LT s23 1) (LT s100 1)) (OR (LT s20 1) (LT s191 1)) (OR (LT s4 1) (LT s179 1)) (OR (LT s4 1) (LT s183 1)) (OR (LT s4 1) (LT s122 1)) (OR (LT s38 1) (LT s183 1)) (OR (LT s38 1) (LT s179 1)) (OR (LT s122 1) (LT s191 1)) (OR (LT s62 1) (LT s187 1)) (OR (LT s122 1) (LT s187 1)) (OR (LT s62 1) (LT s191 1)) (OR (LT s100 1) (LT s192 1)) (OR (LT s38 1) (LT s106 1)) (OR (LT s38 1) (LT s45 1)) (OR (LT s20 1) (LT s187 1)) (OR (LT s4 1) (LT s45 1)) (OR (LT s145 1) (LT s191 1)) (OR (LT s38 1) (LT s197 1)) (OR (LT s38 1) (LT s67 1)) (OR (LT s4 1) (LT s62 1)) (OR (LT s31 1) (LT s38 1)) (OR (LT s100 1) (LT s178 1)) (OR (LT s107 1) (LT s191 1)) (OR (LT s4 1) (LT s192 1)) (OR (LT s20 1) (LT s38 1)) (OR (LT s4 1) (LT s82 1)) (OR (LT s15 1) (LT s100 1)) (OR (LT s107 1) (LT s187 1)) (OR (LT s145 1) (LT s187 1)) (OR (LT s4 1) (LT s107 1)) (OR (LT s4 1) (LT s42 1)) (OR (LT s67 1) (LT s100 1)) (OR (LT s42 1) (LT s100 1)) (OR (LT s38 1) (LT s111 1)) (OR (LT s4 1) (LT s111 1)) (OR (LT s38 1) (LT s42 1)) (OR (LT s38 1) (LT s107 1)) (OR (LT s179 1) (LT s191 1)) (OR (LT s38 1) (LT s137 1)) (OR (LT s38 1) (LT s72 1)) (OR (LT s38 1) (LT s133 1)) (OR (LT s20 1) (LT s100 1)) (OR (LT s31 1) (LT s100 1)) (OR (LT s72 1) (LT s191 1)) (OR (LT s4 1) (LT s67 1)) (OR (LT s23 1) (LT s191 1)) (OR (LT s61 1) (LT s187 1)) (OR (LT s72 1) (LT s187 1)) (OR (LT s23 1) (LT s187 1)) (OR (LT s61 1) (LT s191 1)) (OR (LT s38 1) (LT s153 1)) (OR (LT s100 1) (LT s169 1)) (OR (LT s38 1) (LT s145 1)) (OR (LT s4 1) (LT s197 1)) (OR (LT s179 1) (LT s187 1)) (OR (LT s15 1) (LT s38 1)) (OR (LT s191 1) (LT s197 1)) (OR (LT s38 1) (LT s169 1)) (OR (LT s62 1) (LT s100 1)) (OR (LT s187 1) (LT s197 1)) (OR (LT s100 1) (LT s153 1)) (OR (LT s137 1) (LT s187 1)) (OR (LT s137 1) (LT s191 1)) (OR (LT s82 1) (LT s100 1)) (OR (LT s100 1) (LT s145 1)) (OR (LT s4 1) (LT s31 1)) (OR (LT s100 1) (LT s133 1)) (OR (LT s100 1) (LT s137 1)) (OR (LT s45 1) (LT s187 1)) (OR (LT s4 1) (LT s169 1)) (OR (LT s45 1) (LT s191 1)) (OR (LT s45 1) (LT s100 1)) (OR (LT s4 1) (LT s137 1)) (OR (LT s4 1) (LT s72 1)) (OR (LT s106 1) (LT s191 1)) (OR (LT s4 1) (LT s133 1)) (OR (LT s106 1) (LT s187 1)) (OR (LT s67 1) (LT s191 1)) (OR (LT s100 1) (LT s111 1)) (OR (LT s38 1) (LT s61 1)) (OR (LT s38 1) (LT s122 1)) (OR (LT s153 1) (LT s187 1)) (OR (LT s4 1) (LT s153 1)) (OR (LT s4 1) (LT s23 1)) (OR (LT s100 1) (LT s107 1)) (OR (LT s187 1) (LT s192 1)) (OR (LT s183 1) (LT s187 1)) (OR (LT s4 1) (LT s145 1)) (OR (LT s183 1) (LT s191 1)) (OR (LT s153 1) (LT s191 1)) (OR (LT s4 1) (LT s15 1)) (OR (LT s15 1) (LT s187 1)) (OR (LT s23 1) (LT s38 1)) (OR (LT s191 1) (LT s192 1)) (OR (LT s15 1) (LT s191 1)) (OR (LT s4 1) (LT s178 1)) (OR (LT s133 1) (LT s187 1)) (OR (LT s133 1) (LT s191 1)) (OR (LT s100 1) (LT s197 1)) (OR (LT s67 1) (LT s187 1)) (OR (LT s38 1) (LT s178 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-05-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-05 finished in 541 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(!p0)&&X(((F(!p2)||p1)&&G(!p3)))))], workingDir=/home/mcc/execution]
Support contains 76 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:34] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 09:27:34] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:34] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-09 09:27:34] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:34] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 09:27:34] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR p0 p3 (AND (NOT p1) p2)), p0, (OR p3 (AND (NOT p1) p2)), true, p2, p3]
Running random walk in product with property : CSRepetitions-PT-05-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=p3, acceptance={} source=5 dest: 3}, { cond=(NOT p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s86 1) (LT s123 1)) (OR (LT s73 1) (LT s86 1)) (OR (LT s86 1) (LT s126 1)) (OR (LT s86 1) (LT s198 1)) (OR (LT s53 1) (LT s86 1)) (OR (LT s86 1) (LT s136 1)) (OR (LT s86 1) (LT s134 1)) (OR (LT s11 1) (LT s86 1)) (OR (LT s86 1) (LT s113 1)) (OR (LT s86 1) (LT s181 1)) (OR (LT s3 1) (LT s86 1)) (OR (LT s46 1) (LT s86 1)) (OR (LT s63 1) (LT s86 1)) (OR (LT s86 1) (LT s119 1)) (OR (LT s86 1) (LT s182 1)) (OR (LT s41 1) (LT s86 1)) (OR (LT s86 1) (LT s101 1)) (OR (LT s86 1) (LT s102 1)) (OR (LT s40 1) (LT s86 1)) (OR (LT s60 1) (LT s86 1)) (OR (LT s86 1) (LT s143 1)) (OR (LT s35 1) (LT s86 1)) (OR (LT s86 1) (LT s146 1)) (OR (LT s86 1) (LT s152 1)) (OR (LT s14 1) (LT s86 1))), p3:(OR (GEQ s67 1) (GEQ s192 1) (GEQ s197 1) (GEQ s133 1) (GEQ s72 1) (GEQ s137 1) (GEQ s15 1) (GEQ s82 1) (GEQ s145 1) (GEQ s20 1) (GEQ s23 1) (GEQ s153 1) (GEQ s31 1) (GEQ s106 1) (GEQ s107 1) (GEQ s169 1) (GEQ s42 1) (GEQ s45 1) (GEQ s111 1) (GEQ s179 1) (GEQ s178 1) (GEQ s183 1) (GEQ s122 1) (GEQ s61 1) (GEQ s62 1)), p1:(OR (GEQ s67 1) (GEQ s192 1) (GEQ s197 1) (GEQ s133 1) (GEQ s72 1) (GEQ s137 1) (GEQ s15 1) (GEQ s82 1) (GEQ s145 1) (GEQ s20 1) (GEQ s23 1) (GEQ s153 1) (GEQ s31 1) (GEQ s106 1) (GEQ s107 1) (GEQ s169 1) (GEQ s42 1) (GEQ s45 1) (GEQ s111 1) (GEQ s179 1) (GEQ s178 1) (GEQ s183 1) (GEQ s122 1) (GEQ s61 1) (GEQ s62 1)), p2:(AND (LT s0 1) (LT s130 1) (LT s131 1) (LT s66 1) (LT s8 1) (LT s138 1) (LT s75 1) (LT s141 1) (LT s19 1) (LT s151 1) (LT s25 1) (LT s29 1) (LT s96 1) (LT s99 1) (LT s39 1) (LT s164 1) (LT s171 1) (LT s44 1) (LT s115 1) (LT s177 1) (LT s52 1) (LT s56 1) (LT s185 1) (LT s184 1) (LT s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-05-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-06 finished in 489 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F((G(p1)||p0)) U (p2||F(G(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 76 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 22 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:34] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 09:27:34] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:34] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 09:27:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-09 09:27:35] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:35] [INFO ] Computed 30 place invariants in 7 ms
[2021-05-09 09:27:35] [INFO ] Dead Transitions using invariants and state equation in 243 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), false]
Running random walk in product with property : CSRepetitions-PT-05-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (LT s0 1) (LT s130 1) (LT s131 1) (LT s66 1) (LT s8 1) (LT s138 1) (LT s75 1) (LT s141 1) (LT s19 1) (LT s151 1) (LT s25 1) (LT s29 1) (LT s96 1) (LT s99 1) (LT s39 1) (LT s164 1) (LT s171 1) (LT s44 1) (LT s115 1) (LT s177 1) (LT s52 1) (LT s56 1) (LT s185 1) (LT s184 1) (LT s188 1)), p0:(OR (AND (GEQ s86 1) (GEQ s123 1)) (AND (GEQ s73 1) (GEQ s86 1)) (AND (GEQ s86 1) (GEQ s126 1)) (AND (GEQ s86 1) (GEQ s198 1)) (AND (GEQ s53 1) (GEQ s86 1)) (AND (GEQ s86 1) (GEQ s136 1)) (AND (GEQ s86 1) (GEQ s134 1)) (AND (GEQ s11 1) (GEQ s86 1)) (AND (GEQ s86 1) (GEQ s113 1)) (AND (GEQ s86 1) (GEQ s181 1)) (AND (GEQ s3 1) (GEQ s86 1)) (AND (GEQ s46 1) (GEQ s86 1)) (AND (GEQ s63 1) (GEQ s86 1)) (AND (GEQ s86 1) (GEQ s119 1)) (AND (GEQ s86 1) (GEQ s182 1)) (AND (GEQ s41 1) (GEQ s86 1)) (AND (GEQ s86 1) (GEQ s101 1)) (AND (GEQ s86 1) (GEQ s102 1)) (AND (GEQ s40 1) (GEQ s86 1)) (AND (GEQ s60 1) (GEQ s86 1)) (AND (GEQ s86 1) (GEQ s143 1)) (AND (GEQ s35 1) (GEQ s86 1)) (AND (GEQ s86 1) (GEQ s146 1)) (AND (GEQ s86 1) (GEQ s152 1)) (AND (GEQ s14 1) (GEQ s86 1))), p1:(OR (GEQ s67 1) (GEQ s192 1) (GEQ s197 1) (GEQ s133 1) (GEQ s72 1) (GEQ s137 1) (GEQ s15 1) (GEQ s82 1) (GEQ s145 1) (GEQ s20 1) (GEQ s23 1) (GEQ s153 1) (GEQ s31 1) (GEQ s106 1) (GEQ s107 1) (GEQ s169 1) (GEQ s42 1) (GEQ s45 1) (GEQ s111 1) (GEQ s179 1) (GEQ s178 1) (GEQ s183 1) (GEQ s122 1) (GEQ s61 1) (GEQ s62 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2895 reset in 712 ms.
Stack based approach found an accepted trace after 9261 steps with 271 reset with depth 7 and stack size 7 in 101 ms.
FORMULA CSRepetitions-PT-05-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-07 finished in 1569 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 17 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:36] [INFO ] Computed 30 place invariants in 3 ms
[2021-05-09 09:27:36] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:36] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 09:27:36] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-09 09:27:36] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:36] [INFO ] Computed 30 place invariants in 3 ms
[2021-05-09 09:27:36] [INFO ] Dead Transitions using invariants and state equation in 225 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-05-08 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s86 1) (GEQ s143 1)), p1:(AND (GEQ s4 1) (GEQ s197 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-05-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-08 finished in 807 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0&&X(G((X(G(p2))||p1))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 13 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:37] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 09:27:37] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:37] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-09 09:27:37] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:37] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:37] [INFO ] Dead Transitions using invariants and state equation in 189 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : CSRepetitions-PT-05-09 automaton TGBA [mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=1, aps=[p0:(OR (LT s11 1) (LT s125 1)), p2:(AND (GEQ s86 1) (GEQ s119 1)), p1:(OR (LT s11 1) (LT s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 149 steps with 2 reset in 1 ms.
FORMULA CSRepetitions-PT-05-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-09 finished in 834 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:37] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:38] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:38] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:38] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-09 09:27:38] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:38] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:38] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-05-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s38 1) (GEQ s107 1)), p0:(OR (LT s86 1) (LT s102 1) (AND (GEQ s38 1) (GEQ s107 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-05-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-10 finished in 728 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0||X((p1&&F(p2)))))&&F(p3)))], workingDir=/home/mcc/execution]
Support contains 6 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:38] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 09:27:38] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:38] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 09:27:38] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-09 09:27:38] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:39] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 09:27:39] [INFO ] Dead Transitions using invariants and state equation in 126 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p3), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-05-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (GEQ s4 1) (GEQ s61 1)), p0:(AND (GEQ s33 1) (GEQ s136 1)), p1:(GEQ s61 1), p2:(AND (GEQ s86 1) (GEQ s134 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-05-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-11 finished in 650 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0&&X((X(p1)&&F(p2))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:39] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:39] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:39] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 09:27:39] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-09 09:27:39] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:39] [INFO ] Computed 30 place invariants in 0 ms
[2021-05-09 09:27:39] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-05-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}], [{ cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s23 1)), p2:(AND (GEQ s73 1) (GEQ s154 1)), p1:(GEQ s23 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-05-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-12 finished in 610 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(X(F((G(p1)||p0))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:39] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:40] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:40] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 09:27:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-09 09:27:40] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:40] [INFO ] Computed 30 place invariants in 0 ms
[2021-05-09 09:27:40] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-05-13 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(OR (LT s72 1) (LT s187 1)), p0:(OR (LT s72 1) (LT s187 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16460 reset in 251 ms.
Product exploration explored 100000 steps with 16425 reset in 407 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 16485 reset in 259 ms.
Product exploration explored 100000 steps with 16475 reset in 263 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 206 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 206/206 places, 325/325 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 206 transition count 325
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 25 rules in 37 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2021-05-09 09:27:42] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:42] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:42] [INFO ] Dead Transitions using invariants and state equation in 185 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Product exploration explored 100000 steps with 16507 reset in 1012 ms.
Stack based approach found an accepted trace after 31106 steps with 5135 reset with depth 17 and stack size 12 in 289 ms.
FORMULA CSRepetitions-PT-05-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-13 finished in 4000 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(X(F((p1&&G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 15 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:43] [INFO ] Computed 30 place invariants in 3 ms
[2021-05-09 09:27:44] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:44] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 09:27:44] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-09 09:27:44] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:44] [INFO ] Computed 30 place invariants in 3 ms
[2021-05-09 09:27:44] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-05-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s86 1) (GEQ s182 1) (GEQ s131 1)), p1:(OR (LT s86 1) (LT s182 1)), p2:(GEQ s183 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 151 steps with 2 reset in 2 ms.
FORMULA CSRepetitions-PT-05-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-14 finished in 724 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(p0)&&G(p1)) U (p2 U p3)))], workingDir=/home/mcc/execution]
Support contains 6 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:44] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:44] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:44] [INFO ] Computed 30 place invariants in 2 ms
[2021-05-09 09:27:44] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-09 09:27:44] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2021-05-09 09:27:44] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 09:27:45] [INFO ] Dead Transitions using invariants and state equation in 177 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p3), true, (AND p1 (NOT p0)), (NOT p1), (NOT p3), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : CSRepetitions-PT-05-15 automaton TGBA [mat=[[{ cond=(AND (NOT p3) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=0 dest: 4}, { cond=(AND (NOT p3) p2 p1), acceptance={0} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=5 dest: 4}]], initial=0, aps=[p3:(GEQ s197 1), p1:(AND (GEQ s86 1) (GEQ s143 1)), p2:(OR (LT s4 1) (LT s122 1)), p0:(LT s96 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 146 steps with 1 reset in 1 ms.
FORMULA CSRepetitions-PT-05-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-15 finished in 789 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620552465734

--------------------
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
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ 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-05"
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-05, 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-162038144100557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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