Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r004-smll-171620118300332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Anderson-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118300332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 15:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 15:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 302K May 18 16:42 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 Anderson-PT-06-LTLFireability-00
FORMULA_NAME Anderson-PT-06-LTLFireability-01
FORMULA_NAME Anderson-PT-06-LTLFireability-02
FORMULA_NAME Anderson-PT-06-LTLFireability-03
FORMULA_NAME Anderson-PT-06-LTLFireability-04
FORMULA_NAME Anderson-PT-06-LTLFireability-05
FORMULA_NAME Anderson-PT-06-LTLFireability-06
FORMULA_NAME Anderson-PT-06-LTLFireability-07
FORMULA_NAME Anderson-PT-06-LTLFireability-08
FORMULA_NAME Anderson-PT-06-LTLFireability-09
FORMULA_NAME Anderson-PT-06-LTLFireability-10
FORMULA_NAME Anderson-PT-06-LTLFireability-11
FORMULA_NAME Anderson-PT-06-LTLFireability-12
FORMULA_NAME Anderson-PT-06-LTLFireability-13
FORMULA_NAME Anderson-PT-06-LTLFireability-14
FORMULA_NAME Anderson-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716425501453

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-23 00:51:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 00:51:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:51:43] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2024-05-23 00:51:43] [INFO ] Transformed 229 places.
[2024-05-23 00:51:43] [INFO ] Transformed 600 transitions.
[2024-05-23 00:51:43] [INFO ] Found NUPN structural information;
[2024-05-23 00:51:43] [INFO ] Parsed PT model containing 229 places and 600 transitions and 2280 arcs in 404 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 98 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Anderson-PT-06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 600/600 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 197 transition count 478
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 197 transition count 478
Applied a total of 64 rules in 67 ms. Remains 197 /229 variables (removed 32) and now considering 478/600 (removed 122) transitions.
// Phase 1: matrix 478 rows 197 cols
[2024-05-23 00:51:44] [INFO ] Computed 15 invariants in 45 ms
[2024-05-23 00:51:45] [INFO ] Implicit Places using invariants in 637 ms returned []
[2024-05-23 00:51:45] [INFO ] Invariant cache hit.
[2024-05-23 00:51:45] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:51:46] [INFO ] Implicit Places using invariants and state equation in 1365 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2024-05-23 00:51:46] [INFO ] Invariant cache hit.
[2024-05-23 00:51:46] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-05-23 00:51:51] [INFO ] Deduced a trap composed of 122 places in 244 ms of which 29 ms to minimize.
[2024-05-23 00:51:51] [INFO ] Deduced a trap composed of 98 places in 234 ms of which 4 ms to minimize.
[2024-05-23 00:51:52] [INFO ] Deduced a trap composed of 124 places in 221 ms of which 3 ms to minimize.
[2024-05-23 00:51:52] [INFO ] Deduced a trap composed of 73 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:51:53] [INFO ] Deduced a trap composed of 59 places in 216 ms of which 4 ms to minimize.
[2024-05-23 00:51:53] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 4 ms to minimize.
[2024-05-23 00:51:53] [INFO ] Deduced a trap composed of 42 places in 242 ms of which 14 ms to minimize.
[2024-05-23 00:51:53] [INFO ] Deduced a trap composed of 66 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:51:54] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 3 ms to minimize.
[2024-05-23 00:51:54] [INFO ] Deduced a trap composed of 103 places in 260 ms of which 4 ms to minimize.
[2024-05-23 00:51:54] [INFO ] Deduced a trap composed of 93 places in 222 ms of which 3 ms to minimize.
[2024-05-23 00:51:54] [INFO ] Deduced a trap composed of 82 places in 270 ms of which 3 ms to minimize.
[2024-05-23 00:51:55] [INFO ] Deduced a trap composed of 78 places in 233 ms of which 3 ms to minimize.
[2024-05-23 00:51:55] [INFO ] Deduced a trap composed of 78 places in 263 ms of which 3 ms to minimize.
[2024-05-23 00:51:55] [INFO ] Deduced a trap composed of 74 places in 271 ms of which 4 ms to minimize.
[2024-05-23 00:51:56] [INFO ] Deduced a trap composed of 76 places in 278 ms of which 3 ms to minimize.
[2024-05-23 00:51:56] [INFO ] Deduced a trap composed of 69 places in 284 ms of which 4 ms to minimize.
[2024-05-23 00:51:56] [INFO ] Deduced a trap composed of 65 places in 226 ms of which 4 ms to minimize.
[2024-05-23 00:51:56] [INFO ] Deduced a trap composed of 65 places in 181 ms of which 4 ms to minimize.
[2024-05-23 00:51:56] [INFO ] Deduced a trap composed of 61 places in 234 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-05-23 00:51:57] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:51:58] [INFO ] Deduced a trap composed of 65 places in 214 ms of which 4 ms to minimize.
[2024-05-23 00:51:58] [INFO ] Deduced a trap composed of 55 places in 213 ms of which 3 ms to minimize.
[2024-05-23 00:51:58] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 3 ms to minimize.
[2024-05-23 00:51:58] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:51:59] [INFO ] Deduced a trap composed of 81 places in 225 ms of which 4 ms to minimize.
[2024-05-23 00:51:59] [INFO ] Deduced a trap composed of 100 places in 165 ms of which 4 ms to minimize.
[2024-05-23 00:51:59] [INFO ] Deduced a trap composed of 73 places in 243 ms of which 5 ms to minimize.
[2024-05-23 00:51:59] [INFO ] Deduced a trap composed of 94 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:52:00] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 2 ms to minimize.
[2024-05-23 00:52:00] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:52:00] [INFO ] Deduced a trap composed of 79 places in 214 ms of which 3 ms to minimize.
[2024-05-23 00:52:00] [INFO ] Deduced a trap composed of 55 places in 224 ms of which 4 ms to minimize.
[2024-05-23 00:52:00] [INFO ] Deduced a trap composed of 61 places in 197 ms of which 3 ms to minimize.
[2024-05-23 00:52:01] [INFO ] Deduced a trap composed of 88 places in 219 ms of which 7 ms to minimize.
[2024-05-23 00:52:01] [INFO ] Deduced a trap composed of 63 places in 223 ms of which 3 ms to minimize.
[2024-05-23 00:52:01] [INFO ] Deduced a trap composed of 77 places in 291 ms of which 4 ms to minimize.
[2024-05-23 00:52:02] [INFO ] Deduced a trap composed of 131 places in 287 ms of which 4 ms to minimize.
[2024-05-23 00:52:02] [INFO ] Deduced a trap composed of 98 places in 210 ms of which 2 ms to minimize.
[2024-05-23 00:52:02] [INFO ] Deduced a trap composed of 105 places in 188 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-05-23 00:52:07] [INFO ] Deduced a trap composed of 106 places in 209 ms of which 4 ms to minimize.
[2024-05-23 00:52:07] [INFO ] Deduced a trap composed of 116 places in 252 ms of which 3 ms to minimize.
[2024-05-23 00:52:07] [INFO ] Deduced a trap composed of 109 places in 254 ms of which 3 ms to minimize.
[2024-05-23 00:52:08] [INFO ] Deduced a trap composed of 56 places in 248 ms of which 3 ms to minimize.
[2024-05-23 00:52:08] [INFO ] Deduced a trap composed of 61 places in 263 ms of which 3 ms to minimize.
[2024-05-23 00:52:08] [INFO ] Deduced a trap composed of 56 places in 264 ms of which 4 ms to minimize.
[2024-05-23 00:52:09] [INFO ] Deduced a trap composed of 107 places in 316 ms of which 3 ms to minimize.
[2024-05-23 00:52:09] [INFO ] Deduced a trap composed of 80 places in 274 ms of which 4 ms to minimize.
[2024-05-23 00:52:09] [INFO ] Deduced a trap composed of 68 places in 258 ms of which 3 ms to minimize.
[2024-05-23 00:52:10] [INFO ] Deduced a trap composed of 89 places in 247 ms of which 3 ms to minimize.
[2024-05-23 00:52:10] [INFO ] Deduced a trap composed of 75 places in 253 ms of which 4 ms to minimize.
[2024-05-23 00:52:10] [INFO ] Deduced a trap composed of 111 places in 265 ms of which 4 ms to minimize.
[2024-05-23 00:52:10] [INFO ] Deduced a trap composed of 121 places in 263 ms of which 3 ms to minimize.
[2024-05-23 00:52:11] [INFO ] Deduced a trap composed of 85 places in 257 ms of which 4 ms to minimize.
[2024-05-23 00:52:11] [INFO ] Deduced a trap composed of 108 places in 252 ms of which 4 ms to minimize.
[2024-05-23 00:52:11] [INFO ] Deduced a trap composed of 122 places in 260 ms of which 4 ms to minimize.
[2024-05-23 00:52:12] [INFO ] Deduced a trap composed of 85 places in 275 ms of which 4 ms to minimize.
[2024-05-23 00:52:12] [INFO ] Deduced a trap composed of 130 places in 256 ms of which 4 ms to minimize.
[2024-05-23 00:52:12] [INFO ] Deduced a trap composed of 144 places in 268 ms of which 3 ms to minimize.
[2024-05-23 00:52:12] [INFO ] Deduced a trap composed of 149 places in 251 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 472 unsolved
[2024-05-23 00:52:14] [INFO ] Deduced a trap composed of 133 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:52:14] [INFO ] Deduced a trap composed of 127 places in 219 ms of which 3 ms to minimize.
[2024-05-23 00:52:14] [INFO ] Deduced a trap composed of 73 places in 257 ms of which 4 ms to minimize.
[2024-05-23 00:52:15] [INFO ] Deduced a trap composed of 97 places in 282 ms of which 5 ms to minimize.
[2024-05-23 00:52:15] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 4 ms to minimize.
[2024-05-23 00:52:15] [INFO ] Deduced a trap composed of 81 places in 261 ms of which 3 ms to minimize.
[2024-05-23 00:52:15] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 4 ms to minimize.
[2024-05-23 00:52:16] [INFO ] Deduced a trap composed of 60 places in 240 ms of which 4 ms to minimize.
[2024-05-23 00:52:16] [INFO ] Deduced a trap composed of 97 places in 272 ms of which 4 ms to minimize.
[2024-05-23 00:52:16] [INFO ] Deduced a trap composed of 134 places in 261 ms of which 4 ms to minimize.
[2024-05-23 00:52:17] [INFO ] Deduced a trap composed of 97 places in 276 ms of which 4 ms to minimize.
[2024-05-23 00:52:17] [INFO ] Deduced a trap composed of 95 places in 259 ms of which 3 ms to minimize.
[2024-05-23 00:52:17] [INFO ] Deduced a trap composed of 95 places in 268 ms of which 4 ms to minimize.
SMT process timed out in 31280ms, After SMT, problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 31331ms
Starting structural reductions in LTL mode, iteration 1 : 197/229 places, 478/600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33500 ms. Remains : 197/229 places, 478/600 transitions.
Support contains 50 out of 197 places after structural reductions.
[2024-05-23 00:52:18] [INFO ] Flatten gal took : 95 ms
[2024-05-23 00:52:18] [INFO ] Flatten gal took : 56 ms
[2024-05-23 00:52:18] [INFO ] Input system was already deterministic with 478 transitions.
RANDOM walk for 40000 steps (8 resets) in 2717 ms. (14 steps per ms) remains 16/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 6/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 3/6 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 3/3 properties
[2024-05-23 00:52:19] [INFO ] Invariant cache hit.
[2024-05-23 00:52:19] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/91 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 95/186 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 11/197 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 478/675 variables, 197/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/675 variables, 30/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/675 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/675 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 242 constraints, problems are : Problem set: 0 solved, 3 unsolved in 845 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 197/197 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/91 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 95/186 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 11/197 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 00:52:20] [INFO ] Deduced a trap composed of 56 places in 198 ms of which 4 ms to minimize.
[2024-05-23 00:52:20] [INFO ] Deduced a trap composed of 100 places in 200 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 00:52:21] [INFO ] Deduced a trap composed of 91 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:52:21] [INFO ] Deduced a trap composed of 70 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:52:21] [INFO ] Deduced a trap composed of 117 places in 242 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 00:52:21] [INFO ] Deduced a trap composed of 111 places in 189 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 478/675 variables, 197/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/675 variables, 30/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/675 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/675 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/675 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 675/675 variables, and 251 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2291 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 197/197 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 3171ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1134 ms.
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 478/478 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 0 place count 197 transition count 449
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 58 place count 168 transition count 449
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 83 place count 143 transition count 234
Iterating global reduction 0 with 25 rules applied. Total rules applied 108 place count 143 transition count 234
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 142 transition count 233
Applied a total of 110 rules in 64 ms. Remains 142 /197 variables (removed 55) and now considering 233/478 (removed 245) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 142/197 places, 233/478 transitions.
RANDOM walk for 40000 steps (8 resets) in 326 ms. (122 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
// Phase 1: matrix 233 rows 142 cols
[2024-05-23 00:52:24] [INFO ] Computed 15 invariants in 28 ms
[2024-05-23 00:52:24] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/135 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/142 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 233/375 variables, 142/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 30/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/375 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/135 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/142 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 233/375 variables, 142/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 30/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/375 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 626ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 233/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 140 transition count 211
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 140 transition count 211
Applied a total of 4 rules in 26 ms. Remains 140 /142 variables (removed 2) and now considering 211/233 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 140/142 places, 211/233 transitions.
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11295 steps, run visited all 1 properties in 94 ms. (steps per millisecond=120 )
Probabilistic random walk after 11295 steps, saw 7516 distinct states, run finished after 102 ms. (steps per millisecond=110 ) properties seen :1
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(p1 U (p2||G(p1)))))'
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 173 transition count 264
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 173 transition count 264
Applied a total of 48 rules in 10 ms. Remains 173 /197 variables (removed 24) and now considering 264/478 (removed 214) transitions.
// Phase 1: matrix 264 rows 173 cols
[2024-05-23 00:52:25] [INFO ] Computed 15 invariants in 6 ms
[2024-05-23 00:52:25] [INFO ] Implicit Places using invariants in 316 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 318 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 172/197 places, 264/478 transitions.
Applied a total of 0 rules in 4 ms. Remains 172 /172 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 333 ms. Remains : 172/197 places, 264/478 transitions.
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 288 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 40 in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-00 finished in 1071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(!p0) U X(p1)) U p2)))'
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 172 transition count 263
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 172 transition count 263
Applied a total of 50 rules in 9 ms. Remains 172 /197 variables (removed 25) and now considering 263/478 (removed 215) transitions.
// Phase 1: matrix 263 rows 172 cols
[2024-05-23 00:52:26] [INFO ] Computed 15 invariants in 4 ms
[2024-05-23 00:52:26] [INFO ] Implicit Places using invariants in 275 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 277 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 171/197 places, 263/478 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 290 ms. Remains : 171/197 places, 263/478 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (NOT p2), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : Anderson-PT-06-LTLFireability-01
Product exploration explored 100000 steps with 27243 reset in 282 ms.
Product exploration explored 100000 steps with 27321 reset in 277 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 7 factoid took 267 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(NOT p2), (NOT p2), (NOT p1), (AND p0 (NOT p1)), p0]
RANDOM walk for 40000 steps (8 resets) in 398 ms. (100 steps per ms) remains 4/5 properties
BEST_FIRST walk for 2201 steps (0 resets) in 20 ms. (104 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p0), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (OR p2 (NOT p0)))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 397 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (NOT p2), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 273 ms :[(NOT p2), (NOT p2), (NOT p1), (AND p0 (NOT p1)), p0]
// Phase 1: matrix 263 rows 171 cols
[2024-05-23 00:52:29] [INFO ] Computed 14 invariants in 6 ms
[2024-05-23 00:52:29] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-05-23 00:52:29] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 37 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p0), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (OR p2 (NOT p0)))), (F (NOT p1)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 7 factoid took 462 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-06-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-06-LTLFireability-01 finished in 3606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))||(p1&&X(p2)))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 171 transition count 252
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 171 transition count 252
Applied a total of 52 rules in 8 ms. Remains 171 /197 variables (removed 26) and now considering 252/478 (removed 226) transitions.
// Phase 1: matrix 252 rows 171 cols
[2024-05-23 00:52:30] [INFO ] Computed 15 invariants in 3 ms
[2024-05-23 00:52:30] [INFO ] Implicit Places using invariants in 241 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 243 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/197 places, 252/478 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 258 ms. Remains : 170/197 places, 252/478 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 300 ms.
Product exploration explored 100000 steps with 50000 reset in 305 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X p2), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 23 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-06-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-06-LTLFireability-02 finished in 1140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((X(F(p1))||G(p2))))))'
Support contains 6 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 171 transition count 262
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 171 transition count 262
Applied a total of 52 rules in 13 ms. Remains 171 /197 variables (removed 26) and now considering 262/478 (removed 216) transitions.
// Phase 1: matrix 262 rows 171 cols
[2024-05-23 00:52:31] [INFO ] Computed 15 invariants in 5 ms
[2024-05-23 00:52:31] [INFO ] Implicit Places using invariants in 302 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 311 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/197 places, 262/478 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 331 ms. Remains : 170/197 places, 262/478 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-03
Product exploration explored 100000 steps with 52 reset in 260 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 40 in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-03 finished in 886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((!p0 U (p1||G(!p0)))) U X(G(p2))))))'
Support contains 4 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 172 transition count 273
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 172 transition count 273
Applied a total of 50 rules in 11 ms. Remains 172 /197 variables (removed 25) and now considering 273/478 (removed 205) transitions.
// Phase 1: matrix 273 rows 172 cols
[2024-05-23 00:52:32] [INFO ] Computed 15 invariants in 6 ms
[2024-05-23 00:52:32] [INFO ] Implicit Places using invariants in 297 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 299 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 171/197 places, 273/478 transitions.
Applied a total of 0 rules in 6 ms. Remains 171 /171 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 317 ms. Remains : 171/197 places, 273/478 transitions.
Stuttering acceptance computed with spot in 311 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 226 ms.
Stack based approach found an accepted trace after 66 steps with 0 reset with depth 67 and stack size 67 in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-04 finished in 879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(p1)))||(p2 U (p3||G(p2)))))'
Support contains 6 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 171 transition count 252
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 171 transition count 252
Applied a total of 52 rules in 8 ms. Remains 171 /197 variables (removed 26) and now considering 252/478 (removed 226) transitions.
// Phase 1: matrix 252 rows 171 cols
[2024-05-23 00:52:33] [INFO ] Computed 15 invariants in 3 ms
[2024-05-23 00:52:33] [INFO ] Implicit Places using invariants in 361 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 363 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/197 places, 252/478 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 376 ms. Remains : 170/197 places, 252/478 transitions.
Stuttering acceptance computed with spot in 331 ms :[true, (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) p1 p0), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p3) p2 (NOT p0) p1))), (X (X (NOT p2))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT p3))), (X (X p1)), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 25 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-06-LTLFireability-05 finished in 1300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p1)))))'
Support contains 4 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 171 transition count 262
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 171 transition count 262
Applied a total of 52 rules in 7 ms. Remains 171 /197 variables (removed 26) and now considering 262/478 (removed 216) transitions.
// Phase 1: matrix 262 rows 171 cols
[2024-05-23 00:52:34] [INFO ] Computed 15 invariants in 2 ms
[2024-05-23 00:52:34] [INFO ] Implicit Places using invariants in 315 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 317 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/197 places, 262/478 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 327 ms. Remains : 170/197 places, 262/478 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-07
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-06-LTLFireability-07 finished in 532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((F(p1)&&p0)))&&((p2 U p3)||X(p4))))'
Support contains 10 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 174 transition count 295
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 174 transition count 295
Applied a total of 46 rules in 8 ms. Remains 174 /197 variables (removed 23) and now considering 295/478 (removed 183) transitions.
// Phase 1: matrix 295 rows 174 cols
[2024-05-23 00:52:34] [INFO ] Computed 15 invariants in 3 ms
[2024-05-23 00:52:35] [INFO ] Implicit Places using invariants in 312 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 314 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/197 places, 295/478 transitions.
Applied a total of 0 rules in 4 ms. Remains 173 /173 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 327 ms. Remains : 173/197 places, 295/478 transitions.
Stuttering acceptance computed with spot in 405 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p3) (NOT p4))), (OR (NOT p0) (NOT p1)), (AND p0 (NOT p4)), (OR (AND p2 (NOT p3) (NOT p4)) (AND p0 (NOT p3) (NOT p4))), true, (NOT p1), (NOT p3)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-06-LTLFireability-09 finished in 772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(p0) U G(p1))&&X((p2||(p3 U p4))))))'
Support contains 7 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 172 transition count 263
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 172 transition count 263
Applied a total of 50 rules in 9 ms. Remains 172 /197 variables (removed 25) and now considering 263/478 (removed 215) transitions.
// Phase 1: matrix 263 rows 172 cols
[2024-05-23 00:52:35] [INFO ] Computed 15 invariants in 3 ms
[2024-05-23 00:52:35] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-23 00:52:35] [INFO ] Invariant cache hit.
[2024-05-23 00:52:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:52:36] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-23 00:52:36] [INFO ] Invariant cache hit.
[2024-05-23 00:52:36] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:52:39] [INFO ] Deduced a trap composed of 74 places in 169 ms of which 3 ms to minimize.
[2024-05-23 00:52:39] [INFO ] Deduced a trap composed of 81 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:52:40] [INFO ] Deduced a trap composed of 63 places in 213 ms of which 3 ms to minimize.
[2024-05-23 00:52:40] [INFO ] Deduced a trap composed of 96 places in 188 ms of which 3 ms to minimize.
[2024-05-23 00:52:40] [INFO ] Deduced a trap composed of 53 places in 195 ms of which 3 ms to minimize.
[2024-05-23 00:52:41] [INFO ] Deduced a trap composed of 89 places in 183 ms of which 2 ms to minimize.
[2024-05-23 00:52:41] [INFO ] Deduced a trap composed of 72 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:52:41] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 2 ms to minimize.
[2024-05-23 00:52:41] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 3 ms to minimize.
[2024-05-23 00:52:42] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 3 ms to minimize.
[2024-05-23 00:52:42] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 2 ms to minimize.
[2024-05-23 00:52:42] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2024-05-23 00:52:42] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:52:43] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 3 ms to minimize.
[2024-05-23 00:52:44] [INFO ] Deduced a trap composed of 67 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:52:44] [INFO ] Deduced a trap composed of 84 places in 180 ms of which 4 ms to minimize.
[2024-05-23 00:52:45] [INFO ] Deduced a trap composed of 117 places in 205 ms of which 4 ms to minimize.
[2024-05-23 00:52:45] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 3 ms to minimize.
[2024-05-23 00:52:46] [INFO ] Deduced a trap composed of 56 places in 195 ms of which 3 ms to minimize.
[2024-05-23 00:52:46] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:52:46] [INFO ] Deduced a trap composed of 61 places in 202 ms of which 3 ms to minimize.
[2024-05-23 00:52:46] [INFO ] Deduced a trap composed of 93 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:52:47] [INFO ] Deduced a trap composed of 53 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:52:47] [INFO ] Deduced a trap composed of 56 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:52:47] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:52:47] [INFO ] Deduced a trap composed of 78 places in 184 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:52:50] [INFO ] Deduced a trap composed of 107 places in 206 ms of which 3 ms to minimize.
[2024-05-23 00:52:50] [INFO ] Deduced a trap composed of 87 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:52:50] [INFO ] Deduced a trap composed of 90 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:52:51] [INFO ] Deduced a trap composed of 73 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:52:51] [INFO ] Deduced a trap composed of 113 places in 159 ms of which 3 ms to minimize.
[2024-05-23 00:52:51] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:52:52] [INFO ] Deduced a trap composed of 90 places in 205 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 263/435 variables, 172/220 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 30/250 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 257 unsolved
(s58 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 (/ 11.0 12.0))
(s22 (/ 1.0 12.0))
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 435/435 variables, and 250 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 172/172 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:53:08] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 3 ms to minimize.
[2024-05-23 00:53:09] [INFO ] Deduced a trap composed of 78 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:53:09] [INFO ] Deduced a trap composed of 70 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:53:10] [INFO ] Deduced a trap composed of 60 places in 178 ms of which 3 ms to minimize.
[2024-05-23 00:53:10] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:53:11] [INFO ] Deduced a trap composed of 59 places in 189 ms of which 4 ms to minimize.
[2024-05-23 00:53:11] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 3 ms to minimize.
[2024-05-23 00:53:11] [INFO ] Deduced a trap composed of 73 places in 190 ms of which 3 ms to minimize.
[2024-05-23 00:53:11] [INFO ] Deduced a trap composed of 118 places in 146 ms of which 3 ms to minimize.
[2024-05-23 00:53:11] [INFO ] Deduced a trap composed of 113 places in 136 ms of which 3 ms to minimize.
[2024-05-23 00:53:12] [INFO ] Deduced a trap composed of 87 places in 172 ms of which 3 ms to minimize.
[2024-05-23 00:53:12] [INFO ] Deduced a trap composed of 109 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:53:12] [INFO ] Deduced a trap composed of 97 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:53:12] [INFO ] Deduced a trap composed of 52 places in 169 ms of which 3 ms to minimize.
[2024-05-23 00:53:13] [INFO ] Deduced a trap composed of 77 places in 164 ms of which 3 ms to minimize.
[2024-05-23 00:53:13] [INFO ] Deduced a trap composed of 71 places in 199 ms of which 3 ms to minimize.
[2024-05-23 00:53:13] [INFO ] Deduced a trap composed of 73 places in 194 ms of which 3 ms to minimize.
[2024-05-23 00:53:14] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 18/66 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:53:15] [INFO ] Deduced a trap composed of 66 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:53:16] [INFO ] Deduced a trap composed of 45 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:53:16] [INFO ] Deduced a trap composed of 70 places in 168 ms of which 3 ms to minimize.
[2024-05-23 00:53:16] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:53:17] [INFO ] Deduced a trap composed of 88 places in 167 ms of which 4 ms to minimize.
[2024-05-23 00:53:17] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:53:19] [INFO ] Deduced a trap composed of 80 places in 210 ms of which 4 ms to minimize.
[2024-05-23 00:53:20] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:53:21] [INFO ] Deduced a trap composed of 84 places in 208 ms of which 3 ms to minimize.
[2024-05-23 00:53:21] [INFO ] Deduced a trap composed of 77 places in 204 ms of which 3 ms to minimize.
[2024-05-23 00:53:22] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:53:22] [INFO ] Deduced a trap composed of 61 places in 160 ms of which 2 ms to minimize.
[2024-05-23 00:53:22] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:53:24] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 3 ms to minimize.
[2024-05-23 00:53:24] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:53:24] [INFO ] Deduced a trap composed of 102 places in 187 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:53:28] [INFO ] Deduced a trap composed of 78 places in 194 ms of which 4 ms to minimize.
[2024-05-23 00:53:28] [INFO ] Deduced a trap composed of 82 places in 197 ms of which 3 ms to minimize.
[2024-05-23 00:53:28] [INFO ] Deduced a trap composed of 119 places in 208 ms of which 3 ms to minimize.
[2024-05-23 00:53:29] [INFO ] Deduced a trap composed of 117 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:53:29] [INFO ] Deduced a trap composed of 98 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:53:29] [INFO ] Deduced a trap composed of 79 places in 188 ms of which 4 ms to minimize.
[2024-05-23 00:53:29] [INFO ] Deduced a trap composed of 90 places in 186 ms of which 4 ms to minimize.
[2024-05-23 00:53:29] [INFO ] Deduced a trap composed of 95 places in 195 ms of which 3 ms to minimize.
[2024-05-23 00:53:30] [INFO ] Deduced a trap composed of 100 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:53:30] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:53:30] [INFO ] Deduced a trap composed of 71 places in 164 ms of which 3 ms to minimize.
[2024-05-23 00:53:31] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 2 ms to minimize.
[2024-05-23 00:53:32] [INFO ] Deduced a trap composed of 72 places in 165 ms of which 3 ms to minimize.
[2024-05-23 00:53:32] [INFO ] Deduced a trap composed of 68 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:53:32] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 15/97 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:53:34] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:53:34] [INFO ] Deduced a trap composed of 59 places in 202 ms of which 3 ms to minimize.
[2024-05-23 00:53:35] [INFO ] Deduced a trap composed of 63 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:53:35] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 4 ms to minimize.
[2024-05-23 00:53:35] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 3 ms to minimize.
[2024-05-23 00:53:36] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 172/435 variables, and 103 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/172 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/257 constraints, Known Traps: 88/88 constraints]
After SMT, in 60408ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60416ms
Starting structural reductions in LTL mode, iteration 1 : 172/197 places, 263/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61518 ms. Remains : 172/197 places, 263/478 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p4))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p4)), true, (NOT p4)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 216 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-10 finished in 62107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 6 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 0 place count 197 transition count 449
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 58 place count 168 transition count 449
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 84 place count 142 transition count 233
Iterating global reduction 0 with 26 rules applied. Total rules applied 110 place count 142 transition count 233
Applied a total of 110 rules in 36 ms. Remains 142 /197 variables (removed 55) and now considering 233/478 (removed 245) transitions.
// Phase 1: matrix 233 rows 142 cols
[2024-05-23 00:53:37] [INFO ] Computed 15 invariants in 3 ms
[2024-05-23 00:53:38] [INFO ] Implicit Places using invariants in 351 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 353 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/197 places, 233/478 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 141 transition count 211
Reduce places removed 22 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 28 rules applied. Total rules applied 50 place count 119 transition count 205
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 56 place count 113 transition count 205
Applied a total of 56 rules in 24 ms. Remains 113 /141 variables (removed 28) and now considering 205/233 (removed 28) transitions.
// Phase 1: matrix 205 rows 113 cols
[2024-05-23 00:53:38] [INFO ] Computed 14 invariants in 2 ms
[2024-05-23 00:53:38] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-23 00:53:38] [INFO ] Invariant cache hit.
[2024-05-23 00:53:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:53:38] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/197 places, 205/478 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1142 ms. Remains : 113/197 places, 205/478 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-11
Product exploration explored 100000 steps with 253 reset in 223 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-11 finished in 1498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U p1))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 171 transition count 252
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 171 transition count 252
Applied a total of 52 rules in 8 ms. Remains 171 /197 variables (removed 26) and now considering 252/478 (removed 226) transitions.
// Phase 1: matrix 252 rows 171 cols
[2024-05-23 00:53:39] [INFO ] Computed 15 invariants in 3 ms
[2024-05-23 00:53:39] [INFO ] Implicit Places using invariants in 355 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 357 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/197 places, 252/478 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 370 ms. Remains : 170/197 places, 252/478 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-06-LTLFireability-12 finished in 570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(p1 U X(p2))) U p2))'
Support contains 6 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 172 transition count 273
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 172 transition count 273
Applied a total of 50 rules in 8 ms. Remains 172 /197 variables (removed 25) and now considering 273/478 (removed 205) transitions.
// Phase 1: matrix 273 rows 172 cols
[2024-05-23 00:53:39] [INFO ] Computed 15 invariants in 3 ms
[2024-05-23 00:53:40] [INFO ] Implicit Places using invariants in 342 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 343 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 171/197 places, 273/478 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 355 ms. Remains : 171/197 places, 273/478 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-06-LTLFireability-13 finished in 550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0||F(G(p1))) U (G(!p2)||(!p2&&F(!p1))))))'
Support contains 6 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 170 transition count 251
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 170 transition count 251
Applied a total of 54 rules in 7 ms. Remains 170 /197 variables (removed 27) and now considering 251/478 (removed 227) transitions.
// Phase 1: matrix 251 rows 170 cols
[2024-05-23 00:53:40] [INFO ] Computed 15 invariants in 3 ms
[2024-05-23 00:53:40] [INFO ] Implicit Places using invariants in 288 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 289 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/197 places, 251/478 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 299 ms. Remains : 169/197 places, 251/478 transitions.
Stuttering acceptance computed with spot in 231 ms :[p2, p2, (NOT p1), (AND p2 p1)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 266 ms.
Product exploration explored 100000 steps with 50000 reset in 276 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 20 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-06-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-06-LTLFireability-14 finished in 1134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 6 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 197 transition count 448
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 167 transition count 448
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 86 place count 141 transition count 232
Iterating global reduction 0 with 26 rules applied. Total rules applied 112 place count 141 transition count 232
Applied a total of 112 rules in 28 ms. Remains 141 /197 variables (removed 56) and now considering 232/478 (removed 246) transitions.
// Phase 1: matrix 232 rows 141 cols
[2024-05-23 00:53:41] [INFO ] Computed 15 invariants in 2 ms
[2024-05-23 00:53:41] [INFO ] Implicit Places using invariants in 320 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 322 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/197 places, 232/478 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 140 transition count 210
Reduce places removed 22 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 28 rules applied. Total rules applied 50 place count 118 transition count 204
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 56 place count 112 transition count 204
Applied a total of 56 rules in 21 ms. Remains 112 /140 variables (removed 28) and now considering 204/232 (removed 28) transitions.
// Phase 1: matrix 204 rows 112 cols
[2024-05-23 00:53:41] [INFO ] Computed 14 invariants in 2 ms
[2024-05-23 00:53:42] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-23 00:53:42] [INFO ] Invariant cache hit.
[2024-05-23 00:53:42] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:53:42] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/197 places, 204/478 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1075 ms. Remains : 112/197 places, 204/478 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 293 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-15 finished in 1571 ms.
All properties solved by simple procedures.
Total runtime 119584 ms.

BK_STOP 1716425623142

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Anderson-PT-06"
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-5568"
echo " Executing tool itstools"
echo " Input is Anderson-PT-06, 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 r004-smll-171620118300332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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