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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 12 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 12 15:35 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 185K 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-05-LTLFireability-00
FORMULA_NAME Anderson-PT-05-LTLFireability-01
FORMULA_NAME Anderson-PT-05-LTLFireability-02
FORMULA_NAME Anderson-PT-05-LTLFireability-03
FORMULA_NAME Anderson-PT-05-LTLFireability-04
FORMULA_NAME Anderson-PT-05-LTLFireability-05
FORMULA_NAME Anderson-PT-05-LTLFireability-06
FORMULA_NAME Anderson-PT-05-LTLFireability-07
FORMULA_NAME Anderson-PT-05-LTLFireability-08
FORMULA_NAME Anderson-PT-05-LTLFireability-09
FORMULA_NAME Anderson-PT-05-LTLFireability-10
FORMULA_NAME Anderson-PT-05-LTLFireability-11
FORMULA_NAME Anderson-PT-05-LTLFireability-12
FORMULA_NAME Anderson-PT-05-LTLFireability-13
FORMULA_NAME Anderson-PT-05-LTLFireability-14
FORMULA_NAME Anderson-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716423784762

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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-23 00:23:07] [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:23:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:23:07] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2024-05-23 00:23:07] [INFO ] Transformed 161 places.
[2024-05-23 00:23:07] [INFO ] Transformed 365 transitions.
[2024-05-23 00:23:07] [INFO ] Found NUPN structural information;
[2024-05-23 00:23:07] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 453 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-05-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 365/365 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 141 transition count 297
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 141 transition count 297
Applied a total of 40 rules in 97 ms. Remains 141 /161 variables (removed 20) and now considering 297/365 (removed 68) transitions.
// Phase 1: matrix 297 rows 141 cols
[2024-05-23 00:23:08] [INFO ] Computed 13 invariants in 50 ms
[2024-05-23 00:23:08] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-05-23 00:23:08] [INFO ] Invariant cache hit.
[2024-05-23 00:23:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:23:09] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1427 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-23 00:23:09] [INFO ] Invariant cache hit.
[2024-05-23 00:23:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-23 00:23:13] [INFO ] Deduced a trap composed of 64 places in 278 ms of which 30 ms to minimize.
[2024-05-23 00:23:13] [INFO ] Deduced a trap composed of 54 places in 223 ms of which 3 ms to minimize.
[2024-05-23 00:23:13] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:23:14] [INFO ] Deduced a trap composed of 59 places in 155 ms of which 3 ms to minimize.
[2024-05-23 00:23:14] [INFO ] Deduced a trap composed of 61 places in 154 ms of which 3 ms to minimize.
[2024-05-23 00:23:14] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 2 ms to minimize.
[2024-05-23 00:23:14] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:23:14] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 3 ms to minimize.
[2024-05-23 00:23:15] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 3 ms to minimize.
[2024-05-23 00:23:15] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 4 ms to minimize.
[2024-05-23 00:23:15] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 3 ms to minimize.
[2024-05-23 00:23:15] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2024-05-23 00:23:16] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 4 ms to minimize.
[2024-05-23 00:23:16] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:23:16] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:23:16] [INFO ] Deduced a trap composed of 75 places in 163 ms of which 3 ms to minimize.
[2024-05-23 00:23:16] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:23:16] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:23:16] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:23:16] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-23 00:23:17] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 3 ms to minimize.
[2024-05-23 00:23:17] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 3 ms to minimize.
[2024-05-23 00:23:17] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2024-05-23 00:23:17] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-05-23 00:23:18] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:23:18] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 3 ms to minimize.
[2024-05-23 00:23:18] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 3 ms to minimize.
[2024-05-23 00:23:18] [INFO ] Deduced a trap composed of 67 places in 120 ms of which 2 ms to minimize.
[2024-05-23 00:23:18] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:23:18] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:23:18] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 3 ms to minimize.
[2024-05-23 00:23:19] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 3 ms to minimize.
[2024-05-23 00:23:19] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:23:19] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:23:19] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 10 ms to minimize.
[2024-05-23 00:23:19] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 3 ms to minimize.
[2024-05-23 00:23:19] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:23:20] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:23:20] [INFO ] Deduced a trap composed of 66 places in 143 ms of which 3 ms to minimize.
[2024-05-23 00:23:20] [INFO ] Deduced a trap composed of 63 places in 182 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-23 00:23:23] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:23:23] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:23:23] [INFO ] Deduced a trap composed of 99 places in 173 ms of which 2 ms to minimize.
[2024-05-23 00:23:24] [INFO ] Deduced a trap composed of 80 places in 166 ms of which 2 ms to minimize.
[2024-05-23 00:23:24] [INFO ] Deduced a trap composed of 78 places in 164 ms of which 3 ms to minimize.
[2024-05-23 00:23:24] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:23:25] [INFO ] Deduced a trap composed of 87 places in 160 ms of which 3 ms to minimize.
[2024-05-23 00:23:25] [INFO ] Deduced a trap composed of 72 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:23:25] [INFO ] Deduced a trap composed of 81 places in 163 ms of which 2 ms to minimize.
[2024-05-23 00:23:25] [INFO ] Deduced a trap composed of 78 places in 170 ms of which 6 ms to minimize.
[2024-05-23 00:23:25] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 4 ms to minimize.
[2024-05-23 00:23:26] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 2 ms to minimize.
[2024-05-23 00:23:26] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 2 ms to minimize.
[2024-05-23 00:23:26] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 3 ms to minimize.
[2024-05-23 00:23:26] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 3 ms to minimize.
[2024-05-23 00:23:26] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 2 ms to minimize.
[2024-05-23 00:23:27] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 7 ms to minimize.
[2024-05-23 00:23:27] [INFO ] Deduced a trap composed of 97 places in 176 ms of which 3 ms to minimize.
[2024-05-23 00:23:27] [INFO ] Deduced a trap composed of 100 places in 165 ms of which 2 ms to minimize.
[2024-05-23 00:23:27] [INFO ] Deduced a trap composed of 84 places in 176 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-23 00:23:28] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 3 ms to minimize.
[2024-05-23 00:23:28] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 2 ms to minimize.
[2024-05-23 00:23:28] [INFO ] Deduced a trap composed of 70 places in 155 ms of which 3 ms to minimize.
[2024-05-23 00:23:29] [INFO ] Deduced a trap composed of 62 places in 148 ms of which 2 ms to minimize.
[2024-05-23 00:23:29] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 3 ms to minimize.
[2024-05-23 00:23:29] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 2 ms to minimize.
[2024-05-23 00:23:29] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 3 ms to minimize.
[2024-05-23 00:23:30] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 3 ms to minimize.
[2024-05-23 00:23:30] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 2 ms to minimize.
[2024-05-23 00:23:30] [INFO ] Deduced a trap composed of 63 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:23:30] [INFO ] Deduced a trap composed of 61 places in 166 ms of which 2 ms to minimize.
[2024-05-23 00:23:30] [INFO ] Deduced a trap composed of 61 places in 193 ms of which 2 ms to minimize.
[2024-05-23 00:23:31] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 2 ms to minimize.
[2024-05-23 00:23:31] [INFO ] Deduced a trap composed of 97 places in 156 ms of which 3 ms to minimize.
[2024-05-23 00:23:31] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 2 ms to minimize.
[2024-05-23 00:23:31] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 3 ms to minimize.
[2024-05-23 00:23:32] [INFO ] Deduced a trap composed of 75 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:23:32] [INFO ] Deduced a trap composed of 56 places in 190 ms of which 2 ms to minimize.
[2024-05-23 00:23:32] [INFO ] Deduced a trap composed of 67 places in 178 ms of which 2 ms to minimize.
[2024-05-23 00:23:32] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-23 00:23:33] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 3 ms to minimize.
[2024-05-23 00:23:33] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:23:34] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 2 ms to minimize.
[2024-05-23 00:23:35] [INFO ] Deduced a trap composed of 58 places in 139 ms of which 2 ms to minimize.
[2024-05-23 00:23:35] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
[2024-05-23 00:23:35] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 3 ms to minimize.
[2024-05-23 00:23:35] [INFO ] Deduced a trap composed of 79 places in 161 ms of which 2 ms to minimize.
[2024-05-23 00:23:36] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 3 ms to minimize.
[2024-05-23 00:23:36] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 3 ms to minimize.
[2024-05-23 00:23:36] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:23:36] [INFO ] Deduced a trap composed of 73 places in 182 ms of which 2 ms to minimize.
[2024-05-23 00:23:37] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 2 ms to minimize.
[2024-05-23 00:23:37] [INFO ] Deduced a trap composed of 57 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:23:37] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:23:38] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 2 ms to minimize.
[2024-05-23 00:23:38] [INFO ] Deduced a trap composed of 64 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:23:38] [INFO ] Deduced a trap composed of 56 places in 224 ms of which 3 ms to minimize.
[2024-05-23 00:23:38] [INFO ] Deduced a trap composed of 67 places in 148 ms of which 3 ms to minimize.
[2024-05-23 00:23:38] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 19/112 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 141/438 variables, and 112 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/141 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 99/99 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 99/112 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-23 00:23:42] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 2 ms to minimize.
[2024-05-23 00:23:43] [INFO ] Deduced a trap composed of 71 places in 145 ms of which 3 ms to minimize.
[2024-05-23 00:23:43] [INFO ] Deduced a trap composed of 73 places in 166 ms of which 3 ms to minimize.
[2024-05-23 00:23:43] [INFO ] Deduced a trap composed of 70 places in 166 ms of which 3 ms to minimize.
[2024-05-23 00:23:43] [INFO ] Deduced a trap composed of 74 places in 167 ms of which 3 ms to minimize.
[2024-05-23 00:23:43] [INFO ] Deduced a trap composed of 83 places in 186 ms of which 4 ms to minimize.
[2024-05-23 00:23:44] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 3 ms to minimize.
[2024-05-23 00:23:44] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:23:44] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 2 ms to minimize.
[2024-05-23 00:23:44] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 2 ms to minimize.
[2024-05-23 00:23:45] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 2 ms to minimize.
[2024-05-23 00:23:45] [INFO ] Deduced a trap composed of 66 places in 156 ms of which 3 ms to minimize.
[2024-05-23 00:23:46] [INFO ] Deduced a trap composed of 81 places in 171 ms of which 3 ms to minimize.
[2024-05-23 00:23:46] [INFO ] Deduced a trap composed of 82 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:23:46] [INFO ] Deduced a trap composed of 55 places in 141 ms of which 3 ms to minimize.
[2024-05-23 00:23:47] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:23:48] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 17/129 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-23 00:23:49] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 2 ms to minimize.
[2024-05-23 00:23:50] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 2 ms to minimize.
[2024-05-23 00:23:51] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 2 ms to minimize.
[2024-05-23 00:23:51] [INFO ] Deduced a trap composed of 98 places in 165 ms of which 2 ms to minimize.
[2024-05-23 00:23:51] [INFO ] Deduced a trap composed of 78 places in 165 ms of which 2 ms to minimize.
[2024-05-23 00:23:51] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 141/438 variables, and 135 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/141 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/292 constraints, Known Traps: 122/122 constraints]
After SMT, in 60853ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 60901ms
Starting structural reductions in LTL mode, iteration 1 : 141/161 places, 297/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62481 ms. Remains : 141/161 places, 297/365 transitions.
Support contains 38 out of 141 places after structural reductions.
[2024-05-23 00:24:11] [INFO ] Flatten gal took : 81 ms
[2024-05-23 00:24:11] [INFO ] Flatten gal took : 38 ms
[2024-05-23 00:24:11] [INFO ] Input system was already deterministic with 297 transitions.
RANDOM walk for 40000 steps (8 resets) in 2102 ms. (19 steps per ms) remains 10/30 properties
BEST_FIRST walk for 40002 steps (8 resets) in 539 ms. (74 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 330 ms. (120 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 314 ms. (126 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 297 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/4 properties
[2024-05-23 00:24:12] [INFO ] Invariant cache hit.
[2024-05-23 00:24:12] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/75 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/131 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/141 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 297/438 variables, 141/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/438 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 174 constraints, problems are : Problem set: 0 solved, 2 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/75 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/131 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/141 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 00:24:13] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 297/438 variables, 141/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/438 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 177 constraints, problems are : Problem set: 0 solved, 2 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 904ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 141 transition count 277
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 121 transition count 277
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 58 place count 103 transition count 163
Iterating global reduction 0 with 18 rules applied. Total rules applied 76 place count 103 transition count 163
Applied a total of 76 rules in 66 ms. Remains 103 /141 variables (removed 38) and now considering 163/297 (removed 134) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 103/141 places, 163/297 transitions.
RANDOM walk for 40000 steps (8 resets) in 323 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 1/2 properties
BEST_FIRST walk for 38195 steps (8 resets) in 156 ms. (243 steps per ms) remains 0/1 properties
FORMULA Anderson-PT-05-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Anderson-PT-05-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(X(F(p0))))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 121 transition count 165
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 121 transition count 165
Applied a total of 40 rules in 15 ms. Remains 121 /141 variables (removed 20) and now considering 165/297 (removed 132) transitions.
// Phase 1: matrix 165 rows 121 cols
[2024-05-23 00:24:14] [INFO ] Computed 13 invariants in 6 ms
[2024-05-23 00:24:14] [INFO ] Implicit Places using invariants in 188 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 190 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/141 places, 165/297 transitions.
Applied a total of 0 rules in 6 ms. Remains 120 /120 variables (removed 0) and now considering 165/165 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 211 ms. Remains : 120/141 places, 165/297 transitions.
Stuttering acceptance computed with spot in 372 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-00
Product exploration explored 100000 steps with 3 reset in 474 ms.
Stack based approach found an accepted trace after 61 steps with 0 reset with depth 62 and stack size 62 in 1 ms.
FORMULA Anderson-PT-05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-00 finished in 1141 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(G(p0)))'
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 141 transition count 278
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 122 transition count 278
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 103 transition count 147
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 103 transition count 147
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 78 place count 102 transition count 146
Applied a total of 78 rules in 22 ms. Remains 102 /141 variables (removed 39) and now considering 146/297 (removed 151) transitions.
// Phase 1: matrix 146 rows 102 cols
[2024-05-23 00:24:15] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 00:24:15] [INFO ] Implicit Places using invariants in 133 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 134 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/141 places, 146/297 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 101 transition count 121
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 76 transition count 121
Applied a total of 50 rules in 9 ms. Remains 76 /101 variables (removed 25) and now considering 121/146 (removed 25) transitions.
// Phase 1: matrix 121 rows 76 cols
[2024-05-23 00:24:15] [INFO ] Computed 12 invariants in 2 ms
[2024-05-23 00:24:15] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-23 00:24:15] [INFO ] Invariant cache hit.
[2024-05-23 00:24:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:24:15] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/141 places, 121/297 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 425 ms. Remains : 76/141 places, 121/297 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 273 ms.
Stack based approach found an accepted trace after 5666 steps with 0 reset with depth 5667 and stack size 2246 in 23 ms.
FORMULA Anderson-PT-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-01 finished in 774 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(p2)&&p1))) U (G(p2)||X(!p3))))'
Support contains 7 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 124 transition count 192
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 124 transition count 192
Applied a total of 34 rules in 8 ms. Remains 124 /141 variables (removed 17) and now considering 192/297 (removed 105) transitions.
// Phase 1: matrix 192 rows 124 cols
[2024-05-23 00:24:15] [INFO ] Computed 13 invariants in 4 ms
[2024-05-23 00:24:16] [INFO ] Implicit Places using invariants in 217 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 220 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/141 places, 192/297 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 233 ms. Remains : 123/141 places, 192/297 transitions.
Stuttering acceptance computed with spot in 587 ms :[(AND (NOT p2) p3), (AND p2 (NOT p0) p1 p3), (OR (AND (NOT p2) p3) (AND (NOT p1) p3)), (AND (NOT p2) p3), (AND (NOT p2) p3), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 337 ms.
Product exploration explored 100000 steps with 50000 reset in 307 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 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p1) (NOT p0) p3)))), (X (NOT (AND p2 p3))), (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p1) p3)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p0) p3))), (X (NOT (AND p2 p1 (NOT p0) p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p1 (NOT p0) p3)))), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p1) (NOT p0) p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p1) p3))))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) p3)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 25 factoid took 28 ms. Reduced automaton from 10 states, 31 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-05-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-05-LTLFireability-02 finished in 1553 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((G(F(p1))||p0))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 141 transition count 277
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 121 transition count 277
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 59 place count 102 transition count 154
Iterating global reduction 0 with 19 rules applied. Total rules applied 78 place count 102 transition count 154
Applied a total of 78 rules in 48 ms. Remains 102 /141 variables (removed 39) and now considering 154/297 (removed 143) transitions.
// Phase 1: matrix 154 rows 102 cols
[2024-05-23 00:24:17] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 00:24:17] [INFO ] Implicit Places using invariants in 141 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 144 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/141 places, 154/297 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 101 transition count 130
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 77 transition count 130
Applied a total of 48 rules in 8 ms. Remains 77 /101 variables (removed 24) and now considering 130/154 (removed 24) transitions.
// Phase 1: matrix 130 rows 77 cols
[2024-05-23 00:24:17] [INFO ] Computed 12 invariants in 2 ms
[2024-05-23 00:24:17] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-23 00:24:17] [INFO ] Invariant cache hit.
[2024-05-23 00:24:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:24:17] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/141 places, 130/297 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 481 ms. Remains : 77/141 places, 130/297 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 122 ms.
Product exploration explored 100000 steps with 0 reset in 165 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 239 ms. (166 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 1/1 properties
[2024-05-23 00:24:18] [INFO ] Invariant cache hit.
[2024-05-23 00:24:18] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/65 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/73 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/77 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/207 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/207 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 109 constraints, problems are : Problem set: 0 solved, 1 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 20/20 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/65 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/73 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 77/207 variables, and 12 constraints, problems are : Problem set: 1 solved, 0 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/77 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 212ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-05-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-05-LTLFireability-03 finished in 1439 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(G(p0))))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 122 transition count 174
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 122 transition count 174
Applied a total of 38 rules in 7 ms. Remains 122 /141 variables (removed 19) and now considering 174/297 (removed 123) transitions.
// Phase 1: matrix 174 rows 122 cols
[2024-05-23 00:24:18] [INFO ] Computed 13 invariants in 5 ms
[2024-05-23 00:24:19] [INFO ] Implicit Places using invariants in 189 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 190 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/141 places, 174/297 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 201 ms. Remains : 121/141 places, 174/297 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 153 ms.
Product exploration explored 100000 steps with 0 reset in 173 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 199 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 28234 steps, run visited all 1 properties in 151 ms. (steps per millisecond=186 )
Probabilistic random walk after 28234 steps, saw 14270 distinct states, run finished after 157 ms. (steps per millisecond=179 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 174/174 transitions.
Applied a total of 0 rules in 2 ms. Remains 121 /121 variables (removed 0) and now considering 174/174 (removed 0) transitions.
// Phase 1: matrix 174 rows 121 cols
[2024-05-23 00:24:20] [INFO ] Computed 12 invariants in 3 ms
[2024-05-23 00:24:20] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-23 00:24:20] [INFO ] Invariant cache hit.
[2024-05-23 00:24:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:24:21] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-23 00:24:21] [INFO ] Invariant cache hit.
[2024-05-23 00:24:21] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:24:22] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 2 ms to minimize.
[2024-05-23 00:24:22] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 3 ms to minimize.
[2024-05-23 00:24:23] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 2 ms to minimize.
[2024-05-23 00:24:23] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 3 ms to minimize.
[2024-05-23 00:24:23] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 3 ms to minimize.
[2024-05-23 00:24:23] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 3 ms to minimize.
[2024-05-23 00:24:23] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 3 ms to minimize.
[2024-05-23 00:24:23] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 3 ms to minimize.
[2024-05-23 00:24:23] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:24:24] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 2 ms to minimize.
[2024-05-23 00:24:24] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:24:24] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 3 ms to minimize.
[2024-05-23 00:24:24] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 2 ms to minimize.
[2024-05-23 00:24:24] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:24:25] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 3 ms to minimize.
[2024-05-23 00:24:25] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2024-05-23 00:24:25] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:24:26] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 3 ms to minimize.
[2024-05-23 00:24:26] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 2 ms to minimize.
[2024-05-23 00:24:26] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:24:26] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:24:26] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 2 ms to minimize.
[2024-05-23 00:24:26] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:24:26] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:24:26] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 3 ms to minimize.
[2024-05-23 00:24:26] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 3 ms to minimize.
[2024-05-23 00:24:26] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:24:27] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 2 ms to minimize.
[2024-05-23 00:24:27] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:24:27] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 3 ms to minimize.
[2024-05-23 00:24:27] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 14/43 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:24:29] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 3 ms to minimize.
[2024-05-23 00:24:29] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-05-23 00:24:29] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 2 ms to minimize.
[2024-05-23 00:24:30] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:24:30] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:24:30] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 5 ms to minimize.
[2024-05-23 00:24:30] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:24:31] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:24:33] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 3 ms to minimize.
[2024-05-23 00:24:33] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:24:36] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:24:36] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 2 ms to minimize.
[2024-05-23 00:24:36] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:24:37] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 3 ms to minimize.
[2024-05-23 00:24:37] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 3 ms to minimize.
[2024-05-23 00:24:37] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:24:38] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (OVERLAPS) 174/295 variables, 121/181 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 14 (OVERLAPS) 0/295 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 201 constraints, problems are : Problem set: 0 solved, 169 unsolved in 25515 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 121/121 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:24:48] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 3 ms to minimize.
[2024-05-23 00:24:48] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 3 ms to minimize.
[2024-05-23 00:24:48] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 3 ms to minimize.
[2024-05-23 00:24:49] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:24:49] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:24:49] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 3 ms to minimize.
[2024-05-23 00:24:49] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:24:49] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:24:49] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:24:50] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:24:51] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:24:51] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 2 ms to minimize.
[2024-05-23 00:24:51] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 2 ms to minimize.
[2024-05-23 00:24:52] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:24:53] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:24:56] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:24:57] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:24:57] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:24:58] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:24:58] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:24:58] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 3 ms to minimize.
[2024-05-23 00:24:58] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (OVERLAPS) 174/295 variables, 121/203 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 169/392 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/295 variables, and 392 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 121/121 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 70/70 constraints]
After SMT, in 55633ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 55636ms
Finished structural reductions in LTL mode , in 1 iterations and 56287 ms. Remains : 121/121 places, 174/174 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 28234 steps, run visited all 1 properties in 102 ms. (steps per millisecond=276 )
Probabilistic random walk after 28234 steps, saw 14270 distinct states, run finished after 103 ms. (steps per millisecond=274 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 146 ms.
Product exploration explored 100000 steps with 0 reset in 299 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 174/174 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 121 transition count 174
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 24 place count 121 transition count 174
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 44 place count 121 transition count 174
Deduced a syphon composed of 44 places in 0 ms
Applied a total of 44 rules in 23 ms. Remains 121 /121 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-23 00:25:19] [INFO ] Redundant transitions in 10 ms returned []
Running 169 sub problems to find dead transitions.
// Phase 1: matrix 174 rows 121 cols
[2024-05-23 00:25:19] [INFO ] Computed 12 invariants in 3 ms
[2024-05-23 00:25:19] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:25:20] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-23 00:25:20] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-23 00:25:20] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 3 ms to minimize.
[2024-05-23 00:25:20] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
[2024-05-23 00:25:20] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-23 00:25:20] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:25:21] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
[2024-05-23 00:25:23] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:25:23] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
[2024-05-23 00:25:23] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2024-05-23 00:25:24] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:25:24] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 2 ms to minimize.
[2024-05-23 00:25:24] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-05-23 00:25:24] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-05-23 00:25:24] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 3 ms to minimize.
[2024-05-23 00:25:24] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
[2024-05-23 00:25:24] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 2 ms to minimize.
[2024-05-23 00:25:25] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 18/30 constraints. Problems are: Problem set: 44 solved, 125 unsolved
[2024-05-23 00:25:25] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:25:25] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 2 ms to minimize.
[2024-05-23 00:25:26] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 3 ms to minimize.
[2024-05-23 00:25:26] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 4/34 constraints. Problems are: Problem set: 44 solved, 125 unsolved
[2024-05-23 00:25:27] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-05-23 00:25:27] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 2/36 constraints. Problems are: Problem set: 44 solved, 125 unsolved
[2024-05-23 00:25:28] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
[2024-05-23 00:25:28] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-23 00:25:28] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 3/39 constraints. Problems are: Problem set: 44 solved, 125 unsolved
[2024-05-23 00:25:29] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/40 constraints. Problems are: Problem set: 44 solved, 125 unsolved
[2024-05-23 00:25:30] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:25:31] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 3 ms to minimize.
[2024-05-23 00:25:31] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:25:31] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 3 ms to minimize.
[2024-05-23 00:25:31] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 2 ms to minimize.
[2024-05-23 00:25:31] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
[2024-05-23 00:25:31] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 7/47 constraints. Problems are: Problem set: 44 solved, 125 unsolved
[2024-05-23 00:25:32] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/48 constraints. Problems are: Problem set: 44 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/48 constraints. Problems are: Problem set: 44 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 174/295 variables, 121/169 constraints. Problems are: Problem set: 44 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 35/204 constraints. Problems are: Problem set: 44 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 0/204 constraints. Problems are: Problem set: 44 solved, 125 unsolved
At refinement iteration 13 (OVERLAPS) 0/295 variables, 0/204 constraints. Problems are: Problem set: 44 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 204 constraints, problems are : Problem set: 44 solved, 125 unsolved in 20100 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 121/121 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 44 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 36/36 constraints. Problems are: Problem set: 44 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/36 constraints. Problems are: Problem set: 44 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 44/121 variables, 7/43 constraints. Problems are: Problem set: 44 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 5/48 constraints. Problems are: Problem set: 44 solved, 125 unsolved
[2024-05-23 00:25:40] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:25:40] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 3 ms to minimize.
[2024-05-23 00:25:41] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 4 ms to minimize.
[2024-05-23 00:25:41] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 4/52 constraints. Problems are: Problem set: 44 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/52 constraints. Problems are: Problem set: 44 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 174/295 variables, 121/173 constraints. Problems are: Problem set: 44 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 35/208 constraints. Problems are: Problem set: 44 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 125/333 constraints. Problems are: Problem set: 44 solved, 125 unsolved
[2024-05-23 00:25:59] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:26:00] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-23 00:26:00] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-05-23 00:26:00] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:26:00] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-05-23 00:26:01] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 6/339 constraints. Problems are: Problem set: 44 solved, 125 unsolved
[2024-05-23 00:26:06] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-23 00:26:06] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-23 00:26:06] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:26:06] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 4/343 constraints. Problems are: Problem set: 44 solved, 125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/295 variables, and 343 constraints, problems are : Problem set: 44 solved, 125 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 121/121 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 125/169 constraints, Known Traps: 50/50 constraints]
After SMT, in 50217ms problems are : Problem set: 44 solved, 125 unsolved
Search for dead transitions found 44 dead transitions in 50222ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 121/121 places, 130/174 transitions.
Graph (complete) has 359 edges and 121 vertex of which 77 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Discarding 44 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 77 /121 variables (removed 44) and now considering 130/130 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/121 places, 130/174 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50277 ms. Remains : 77/121 places, 130/174 transitions.
Built C files in :
/tmp/ltsmin9992658502481761010
[2024-05-23 00:26:09] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9992658502481761010
Running compilation step : cd /tmp/ltsmin9992658502481761010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 981 ms.
Running link step : cd /tmp/ltsmin9992658502481761010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin9992658502481761010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17134846208908911553.hoa' '--buchi-type=spotba'
LTSmin run took 1362 ms.
FORMULA Anderson-PT-05-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-05-LTLFireability-05 finished in 112826 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)||G(F(p1)))))'
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 124 transition count 184
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 124 transition count 184
Applied a total of 34 rules in 4 ms. Remains 124 /141 variables (removed 17) and now considering 184/297 (removed 113) transitions.
// Phase 1: matrix 184 rows 124 cols
[2024-05-23 00:26:11] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 00:26:11] [INFO ] Implicit Places using invariants in 167 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 169 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/141 places, 184/297 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 177 ms. Remains : 123/141 places, 184/297 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-06
Product exploration explored 100000 steps with 5 reset in 146 ms.
Stack based approach found an accepted trace after 933 steps with 0 reset with depth 934 and stack size 432 in 4 ms.
FORMULA Anderson-PT-05-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-06 finished in 494 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 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 141 transition count 278
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 122 transition count 278
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 56 place count 104 transition count 156
Iterating global reduction 0 with 18 rules applied. Total rules applied 74 place count 104 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 103 transition count 155
Applied a total of 76 rules in 28 ms. Remains 103 /141 variables (removed 38) and now considering 155/297 (removed 142) transitions.
// Phase 1: matrix 155 rows 103 cols
[2024-05-23 00:26:12] [INFO ] Computed 13 invariants in 3 ms
[2024-05-23 00:26:12] [INFO ] Implicit Places using invariants in 218 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 221 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/141 places, 155/297 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 102 transition count 131
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 78 transition count 131
Applied a total of 48 rules in 12 ms. Remains 78 /102 variables (removed 24) and now considering 131/155 (removed 24) transitions.
// Phase 1: matrix 131 rows 78 cols
[2024-05-23 00:26:12] [INFO ] Computed 12 invariants in 2 ms
[2024-05-23 00:26:12] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-23 00:26:12] [INFO ] Invariant cache hit.
[2024-05-23 00:26:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:26:12] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/141 places, 131/297 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 714 ms. Remains : 78/141 places, 131/297 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-07
Product exploration explored 100000 steps with 27 reset in 211 ms.
Stack based approach found an accepted trace after 1482 steps with 0 reset with depth 1483 and stack size 663 in 4 ms.
FORMULA Anderson-PT-05-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-07 finished in 1028 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(G(!p0)) U p1))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 141 transition count 277
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 121 transition count 277
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 101 transition count 145
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 101 transition count 145
Applied a total of 80 rules in 34 ms. Remains 101 /141 variables (removed 40) and now considering 145/297 (removed 152) transitions.
// Phase 1: matrix 145 rows 101 cols
[2024-05-23 00:26:13] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 00:26:13] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-23 00:26:13] [INFO ] Invariant cache hit.
[2024-05-23 00:26:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:26:13] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2024-05-23 00:26:13] [INFO ] Redundant transitions in 4 ms returned []
Running 140 sub problems to find dead transitions.
[2024-05-23 00:26:13] [INFO ] Invariant cache hit.
[2024-05-23 00:26:13] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:26:16] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 2 ms to minimize.
[2024-05-23 00:26:16] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:26:16] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:26:16] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 2 ms to minimize.
[2024-05-23 00:26:16] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 3 ms to minimize.
[2024-05-23 00:26:17] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 3 ms to minimize.
[2024-05-23 00:26:17] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:26:17] [INFO ] Deduced a trap composed of 54 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:26:17] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:26:17] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 3 ms to minimize.
[2024-05-23 00:26:17] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:26:17] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 3 ms to minimize.
[2024-05-23 00:26:17] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 3 ms to minimize.
[2024-05-23 00:26:18] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 2 ms to minimize.
[2024-05-23 00:26:18] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:26:18] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 1 ms to minimize.
[2024-05-23 00:26:18] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:26:18] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2024-05-23 00:26:18] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 19/32 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:26:19] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:26:19] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:26:21] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:26:21] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 2 ms to minimize.
[2024-05-23 00:26:21] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-05-23 00:26:21] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:26:21] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 2 ms to minimize.
[2024-05-23 00:26:21] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 2 ms to minimize.
[2024-05-23 00:26:21] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:26:22] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:26:22] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:26:22] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:26:22] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:26:22] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:26:23] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:26:23] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:26:23] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:26:24] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-05-23 00:26:24] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:26:26] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:26:26] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
[2024-05-23 00:26:27] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:26:27] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:26:28] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/101 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:26:29] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:26:29] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 17 ms to minimize.
[2024-05-23 00:26:29] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/101 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/101 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 15 (OVERLAPS) 145/246 variables, 101/160 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/246 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 18 (OVERLAPS) 0/246 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 180 constraints, problems are : Problem set: 0 solved, 140 unsolved in 25749 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 101/101 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:26:41] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 2 ms to minimize.
[2024-05-23 00:26:42] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:26:42] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:26:42] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:26:43] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 2 ms to minimize.
[2024-05-23 00:26:43] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 2 ms to minimize.
[2024-05-23 00:26:43] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:26:43] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:26:43] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:26:43] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2024-05-23 00:26:43] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 2 ms to minimize.
[2024-05-23 00:26:43] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:26:44] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:26:44] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:26:44] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 11/74 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 145/246 variables, 101/175 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 140/335 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 335 constraints, problems are : Problem set: 0 solved, 140 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 101/101 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 61/61 constraints]
After SMT, in 55826ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 55828ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/141 places, 145/297 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56440 ms. Remains : 101/141 places, 145/297 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), p0]
Running random walk in product with property : Anderson-PT-05-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 129 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-08 finished in 56681 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(G(p0))&&F(p1))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 141 transition count 278
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 122 transition count 278
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 103 transition count 155
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 103 transition count 155
Applied a total of 76 rules in 15 ms. Remains 103 /141 variables (removed 38) and now considering 155/297 (removed 142) transitions.
// Phase 1: matrix 155 rows 103 cols
[2024-05-23 00:27:09] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 00:27:10] [INFO ] Implicit Places using invariants in 140 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/141 places, 155/297 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 102 transition count 141
Reduce places removed 14 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 19 rules applied. Total rules applied 33 place count 88 transition count 136
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 38 place count 83 transition count 136
Applied a total of 38 rules in 14 ms. Remains 83 /102 variables (removed 19) and now considering 136/155 (removed 19) transitions.
// Phase 1: matrix 136 rows 83 cols
[2024-05-23 00:27:10] [INFO ] Computed 12 invariants in 1 ms
[2024-05-23 00:27:10] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-23 00:27:10] [INFO ] Invariant cache hit.
[2024-05-23 00:27:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:27:10] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/141 places, 136/297 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 675 ms. Remains : 83/141 places, 136/297 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 207 ms.
Stack based approach found an accepted trace after 54 steps with 0 reset with depth 55 and stack size 55 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-09 finished in 1011 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))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 141 transition count 277
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 121 transition count 277
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 59 place count 102 transition count 154
Iterating global reduction 0 with 19 rules applied. Total rules applied 78 place count 102 transition count 154
Applied a total of 78 rules in 10 ms. Remains 102 /141 variables (removed 39) and now considering 154/297 (removed 143) transitions.
// Phase 1: matrix 154 rows 102 cols
[2024-05-23 00:27:10] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 00:27:11] [INFO ] Implicit Places using invariants in 198 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 202 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/141 places, 154/297 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 101 transition count 130
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 77 transition count 130
Applied a total of 48 rules in 9 ms. Remains 77 /101 variables (removed 24) and now considering 130/154 (removed 24) transitions.
// Phase 1: matrix 130 rows 77 cols
[2024-05-23 00:27:11] [INFO ] Computed 12 invariants in 1 ms
[2024-05-23 00:27:11] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-23 00:27:11] [INFO ] Invariant cache hit.
[2024-05-23 00:27:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:27:11] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/141 places, 130/297 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 575 ms. Remains : 77/141 places, 130/297 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-12
Product exploration explored 100000 steps with 11 reset in 309 ms.
Stack based approach found an accepted trace after 46 steps with 0 reset with depth 47 and stack size 47 in 1 ms.
FORMULA Anderson-PT-05-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-12 finished in 965 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((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 123 transition count 183
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 123 transition count 183
Applied a total of 36 rules in 6 ms. Remains 123 /141 variables (removed 18) and now considering 183/297 (removed 114) transitions.
// Phase 1: matrix 183 rows 123 cols
[2024-05-23 00:27:11] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 00:27:12] [INFO ] Implicit Places using invariants in 185 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 192 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/141 places, 183/297 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 201 ms. Remains : 122/141 places, 183/297 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-05-LTLFireability-13
Entered a terminal (fully accepting) state of product in 78517 steps with 2 reset in 164 ms.
FORMULA Anderson-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-05-LTLFireability-13 finished in 549 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)||(G(p2)&&p1))))'
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 123 transition count 183
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 123 transition count 183
Applied a total of 36 rules in 4 ms. Remains 123 /141 variables (removed 18) and now considering 183/297 (removed 114) transitions.
// Phase 1: matrix 183 rows 123 cols
[2024-05-23 00:27:12] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 00:27:12] [INFO ] Implicit Places using invariants in 257 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 258 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/141 places, 183/297 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 265 ms. Remains : 122/141 places, 183/297 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (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-05-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 319 ms.
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 15 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-05-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-05-LTLFireability-14 finished in 991 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(((p1 U p2)||p0)))))'
Support contains 6 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 297/297 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 124 transition count 176
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 124 transition count 176
Applied a total of 34 rules in 2 ms. Remains 124 /141 variables (removed 17) and now considering 176/297 (removed 121) transitions.
// Phase 1: matrix 176 rows 124 cols
[2024-05-23 00:27:13] [INFO ] Computed 13 invariants in 4 ms
[2024-05-23 00:27:13] [INFO ] Implicit Places using invariants in 173 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/141 places, 176/297 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 178 ms. Remains : 123/141 places, 176/297 transitions.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-05-LTLFireability-15
Product exploration explored 100000 steps with 444 reset in 189 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 0 ms.
FORMULA Anderson-PT-05-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-05-LTLFireability-15 finished in 654 ms.
All properties solved by simple procedures.
Total runtime 246888 ms.

BK_STOP 1716424034178

--------------------
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-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Anderson-PT-05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r004-smll-171620118300324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-05.tgz
mv Anderson-PT-05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;