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.r496-tall-171640604300820.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 ltsminxred
Input is HealthRecord-PT-16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604300820
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 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 125K 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 HealthRecord-PT-16-LTLFireability-00
FORMULA_NAME HealthRecord-PT-16-LTLFireability-01
FORMULA_NAME HealthRecord-PT-16-LTLFireability-02
FORMULA_NAME HealthRecord-PT-16-LTLFireability-03
FORMULA_NAME HealthRecord-PT-16-LTLFireability-04
FORMULA_NAME HealthRecord-PT-16-LTLFireability-05
FORMULA_NAME HealthRecord-PT-16-LTLFireability-06
FORMULA_NAME HealthRecord-PT-16-LTLFireability-07
FORMULA_NAME HealthRecord-PT-16-LTLFireability-08
FORMULA_NAME HealthRecord-PT-16-LTLFireability-09
FORMULA_NAME HealthRecord-PT-16-LTLFireability-10
FORMULA_NAME HealthRecord-PT-16-LTLFireability-11
FORMULA_NAME HealthRecord-PT-16-LTLFireability-12
FORMULA_NAME HealthRecord-PT-16-LTLFireability-13
FORMULA_NAME HealthRecord-PT-16-LTLFireability-14
FORMULA_NAME HealthRecord-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717201759225

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:29:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:29:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:29:20] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-01 00:29:20] [INFO ] Transformed 453 places.
[2024-06-01 00:29:20] [INFO ] Transformed 594 transitions.
[2024-06-01 00:29:20] [INFO ] Found NUPN structural information;
[2024-06-01 00:29:20] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HealthRecord-PT-16-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 594/594 transitions.
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 77 place count 376 transition count 506
Iterating global reduction 0 with 77 rules applied. Total rules applied 154 place count 376 transition count 506
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 187 place count 343 transition count 464
Iterating global reduction 0 with 33 rules applied. Total rules applied 220 place count 343 transition count 464
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 224 place count 343 transition count 460
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 241 place count 326 transition count 428
Iterating global reduction 1 with 17 rules applied. Total rules applied 258 place count 326 transition count 428
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 266 place count 318 transition count 414
Iterating global reduction 1 with 8 rules applied. Total rules applied 274 place count 318 transition count 414
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 275 place count 317 transition count 413
Iterating global reduction 1 with 1 rules applied. Total rules applied 276 place count 317 transition count 413
Applied a total of 276 rules in 121 ms. Remains 317 /453 variables (removed 136) and now considering 413/594 (removed 181) transitions.
// Phase 1: matrix 413 rows 317 cols
[2024-06-01 00:29:20] [INFO ] Computed 14 invariants in 21 ms
[2024-06-01 00:29:21] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-06-01 00:29:21] [INFO ] Invariant cache hit.
[2024-06-01 00:29:21] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-06-01 00:29:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (OVERLAPS) 1/317 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 00:29:26] [INFO ] Deduced a trap composed of 61 places in 139 ms of which 24 ms to minimize.
[2024-06-01 00:29:26] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 3 ms to minimize.
[2024-06-01 00:29:26] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 3 ms to minimize.
[2024-06-01 00:29:26] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 3 ms to minimize.
[2024-06-01 00:29:27] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:29:27] [INFO ] Deduced a trap composed of 149 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:29:27] [INFO ] Deduced a trap composed of 159 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:29:27] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:29:28] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 2 ms to minimize.
[2024-06-01 00:29:29] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:29:29] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:29:29] [INFO ] Deduced a trap composed of 149 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:29:29] [INFO ] Deduced a trap composed of 146 places in 78 ms of which 2 ms to minimize.
[2024-06-01 00:29:30] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:29:30] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 00:29:32] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 3 ms to minimize.
[2024-06-01 00:29:32] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 3 ms to minimize.
[2024-06-01 00:29:33] [INFO ] Deduced a trap composed of 98 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:29:34] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 3 ms to minimize.
[2024-06-01 00:29:35] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:29:35] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 00:29:36] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-06-01 00:29:36] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 2 ms to minimize.
[2024-06-01 00:29:36] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-06-01 00:29:36] [INFO ] Deduced a trap composed of 147 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:29:37] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 3 ms to minimize.
[2024-06-01 00:29:37] [INFO ] Deduced a trap composed of 107 places in 107 ms of which 2 ms to minimize.
[2024-06-01 00:29:39] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 00:29:39] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-06-01 00:29:40] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-06-01 00:29:40] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 1 ms to minimize.
[2024-06-01 00:29:41] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:29:41] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:29:41] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:29:41] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 4 ms to minimize.
[2024-06-01 00:29:42] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:29:42] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 1 ms to minimize.
[2024-06-01 00:29:42] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:29:43] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 00:29:46] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/730 variables, and 54 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (OVERLAPS) 1/317 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 00:29:56] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 413/730 variables, 317/372 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/730 variables, 412/784 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 00:30:03] [INFO ] Deduced a trap composed of 128 places in 102 ms of which 2 ms to minimize.
[2024-06-01 00:30:03] [INFO ] Deduced a trap composed of 124 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/730 variables, 2/786 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 00:30:12] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:30:16] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:30:16] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/730 variables, 3/789 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 730/730 variables, and 789 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 46/46 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Starting structural reductions in LTL mode, iteration 1 : 317/453 places, 413/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60916 ms. Remains : 317/453 places, 413/594 transitions.
Support contains 45 out of 317 places after structural reductions.
[2024-06-01 00:30:21] [INFO ] Flatten gal took : 50 ms
[2024-06-01 00:30:21] [INFO ] Flatten gal took : 23 ms
[2024-06-01 00:30:21] [INFO ] Input system was already deterministic with 413 transitions.
Support contains 44 out of 317 places (down from 45) after GAL structural reductions.
RANDOM walk for 40000 steps (292 resets) in 2132 ms. (18 steps per ms) remains 16/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
[2024-06-01 00:30:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 106/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 193/317 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:30:23] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:30:23] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:30:23] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:30:23] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:30:23] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:30:23] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2024-06-01 00:30:23] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:30:23] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 413/730 variables, 317/339 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/730 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:30:24] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:30:24] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/730 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/730 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/730 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 730/730 variables, and 341 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1959 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 106/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:30:24] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 8 ms to minimize.
[2024-06-01 00:30:24] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:30:25] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:30:25] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:30:25] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 193/317 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 413/730 variables, 317/346 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/730 variables, 16/362 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/730 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:30:26] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:30:26] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/730 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/730 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 0/730 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 730/730 variables, and 364 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2274 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 17/17 constraints]
After SMT, in 4253ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 12 properties in 5520 ms.
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 413/413 transitions.
Graph (trivial) has 346 edges and 317 vertex of which 30 / 317 are part of one of the 15 SCC in 5 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (complete) has 584 edges and 302 vertex of which 294 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 294 transition count 251
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 149 rules applied. Total rules applied 283 place count 162 transition count 234
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 13 rules applied. Total rules applied 296 place count 153 transition count 230
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 300 place count 149 transition count 230
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 300 place count 149 transition count 225
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 310 place count 144 transition count 225
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 323 place count 131 transition count 201
Iterating global reduction 4 with 13 rules applied. Total rules applied 336 place count 131 transition count 201
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 342 place count 131 transition count 195
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 348 place count 125 transition count 195
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 358 place count 115 transition count 174
Iterating global reduction 6 with 10 rules applied. Total rules applied 368 place count 115 transition count 174
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 369 place count 115 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 370 place count 114 transition count 173
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 372 place count 112 transition count 170
Iterating global reduction 8 with 2 rules applied. Total rules applied 374 place count 112 transition count 170
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 376 place count 110 transition count 166
Iterating global reduction 8 with 2 rules applied. Total rules applied 378 place count 110 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 379 place count 110 transition count 165
Performed 41 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 9 with 82 rules applied. Total rules applied 461 place count 69 transition count 122
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 468 place count 69 transition count 115
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 470 place count 67 transition count 111
Iterating global reduction 10 with 2 rules applied. Total rules applied 472 place count 67 transition count 111
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 473 place count 66 transition count 107
Iterating global reduction 10 with 1 rules applied. Total rules applied 474 place count 66 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 475 place count 66 transition count 106
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 11 with 2 rules applied. Total rules applied 477 place count 65 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 478 place count 65 transition count 104
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 486 place count 61 transition count 127
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 488 place count 59 transition count 123
Iterating global reduction 12 with 2 rules applied. Total rules applied 490 place count 59 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 495 place count 59 transition count 118
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 496 place count 58 transition count 115
Iterating global reduction 12 with 1 rules applied. Total rules applied 497 place count 58 transition count 115
Free-agglomeration rule applied 20 times.
Iterating global reduction 12 with 20 rules applied. Total rules applied 517 place count 58 transition count 95
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 12 with 20 rules applied. Total rules applied 537 place count 38 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 13 with 9 rules applied. Total rules applied 546 place count 38 transition count 86
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 548 place count 38 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 550 place count 36 transition count 85
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 14 with 9 rules applied. Total rules applied 559 place count 36 transition count 85
Applied a total of 559 rules in 102 ms. Remains 36 /317 variables (removed 281) and now considering 85/413 (removed 328) transitions.
Running 81 sub problems to find dead transitions.
[2024-06-01 00:30:32] [INFO ] Flow matrix only has 73 transitions (discarded 12 similar events)
// Phase 1: matrix 73 rows 36 cols
[2024-06-01 00:30:32] [INFO ] Computed 6 invariants in 6 ms
[2024-06-01 00:30:32] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
At refinement iteration 3 (OVERLAPS) 73/109 variables, 36/42 constraints. Problems are: Problem set: 2 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 12/54 constraints. Problems are: Problem set: 2 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 0/109 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 54 constraints, problems are : Problem set: 2 solved, 79 unsolved in 954 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 36/36 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 2/36 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 73/109 variables, 36/42 constraints. Problems are: Problem set: 2 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 12/54 constraints. Problems are: Problem set: 2 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 79/133 constraints. Problems are: Problem set: 2 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/133 constraints. Problems are: Problem set: 2 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/109 variables, 0/133 constraints. Problems are: Problem set: 2 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 133 constraints, problems are : Problem set: 2 solved, 79 unsolved in 1163 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 36/36 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 79/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 2183ms problems are : Problem set: 2 solved, 79 unsolved
Search for dead transitions found 2 dead transitions in 2186ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 36/317 places, 83/413 transitions.
Graph (complete) has 121 edges and 36 vertex of which 35 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 35 transition count 83
Applied a total of 9 rules in 9 ms. Remains 35 /36 variables (removed 1) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2299 ms. Remains : 35/317 places, 83/413 transitions.
RANDOM walk for 40000 steps (43 resets) in 282 ms. (141 steps per ms) remains 1/4 properties
BEST_FIRST walk for 30118 steps (41 resets) in 86 ms. (346 steps per ms) remains 0/1 properties
Computed a total of 90 stabilizing places and 96 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' '!((((p0 U p1) U X(p1))||(G(p2) U G(p1))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 413/413 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 395
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 304 transition count 394
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 35 place count 296 transition count 378
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 296 transition count 378
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 291 transition count 370
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 291 transition count 370
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 287 transition count 363
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 287 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 287 transition count 362
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 285 transition count 360
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 285 transition count 360
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 284 transition count 359
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 284 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 284 transition count 358
Applied a total of 69 rules in 39 ms. Remains 284 /317 variables (removed 33) and now considering 358/413 (removed 55) transitions.
// Phase 1: matrix 358 rows 284 cols
[2024-06-01 00:30:35] [INFO ] Computed 14 invariants in 3 ms
[2024-06-01 00:30:35] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 00:30:35] [INFO ] Invariant cache hit.
[2024-06-01 00:30:35] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 357 sub problems to find dead transitions.
[2024-06-01 00:30:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/284 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-01 00:30:39] [INFO ] Deduced a trap composed of 135 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:30:39] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:30:39] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-06-01 00:30:39] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:30:39] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:30:39] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:30:41] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-01 00:30:43] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:30:44] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:30:44] [INFO ] Deduced a trap composed of 135 places in 85 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-01 00:30:46] [INFO ] Deduced a trap composed of 136 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-01 00:30:48] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:30:48] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 1 ms to minimize.
[2024-06-01 00:30:48] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 2 ms to minimize.
[2024-06-01 00:30:48] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-01 00:30:52] [INFO ] Deduced a trap composed of 116 places in 109 ms of which 2 ms to minimize.
[2024-06-01 00:30:53] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2024-06-01 00:30:53] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:30:53] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:30:54] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:30:54] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2024-06-01 00:30:54] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 9 (OVERLAPS) 358/642 variables, 284/320 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/642 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/642 variables, and 320 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 357 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/284 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (OVERLAPS) 358/642 variables, 284/320 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 357/677 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-01 00:31:15] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 2 ms to minimize.
[2024-06-01 00:31:15] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:31:15] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 3/680 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-01 00:31:18] [INFO ] Deduced a trap composed of 111 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/642 variables, 1/681 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/642 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-01 00:31:35] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/642 variables, and 682 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 27/27 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 357 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Starting structural reductions in LTL mode, iteration 1 : 284/317 places, 358/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60364 ms. Remains : 284/317 places, 358/413 transitions.
Stuttering acceptance computed with spot in 576 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND p1 (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-16-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLFireability-00 finished in 61022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))||(G(p2)&&F(G(p3)))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 413/413 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 394
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 304 transition count 393
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 297 transition count 378
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 297 transition count 378
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 293 transition count 372
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 293 transition count 372
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 290 transition count 367
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 290 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 290 transition count 366
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 289 transition count 365
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 289 transition count 365
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 288 transition count 364
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 288 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 288 transition count 363
Applied a total of 61 rules in 32 ms. Remains 288 /317 variables (removed 29) and now considering 363/413 (removed 50) transitions.
// Phase 1: matrix 363 rows 288 cols
[2024-06-01 00:31:36] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 00:31:36] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 00:31:36] [INFO ] Invariant cache hit.
[2024-06-01 00:31:36] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2024-06-01 00:31:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/288 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 00:31:40] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:31:40] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:31:40] [INFO ] Deduced a trap composed of 137 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:31:40] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 5 ms to minimize.
[2024-06-01 00:31:40] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:31:40] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:31:41] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:31:41] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
[2024-06-01 00:31:41] [INFO ] Deduced a trap composed of 136 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:31:41] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:31:41] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:31:42] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:31:42] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:31:42] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 2 ms to minimize.
[2024-06-01 00:31:42] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:31:43] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 363/651 variables, 288/318 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 00:31:49] [INFO ] Deduced a trap composed of 118 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:31:49] [INFO ] Deduced a trap composed of 113 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (OVERLAPS) 0/651 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 362 unsolved
No progress, stopping.
After SMT solving in domain Real declared 651/651 variables, and 320 constraints, problems are : Problem set: 0 solved, 362 unsolved in 24899 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/288 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 00:32:03] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 1 ms to minimize.
[2024-06-01 00:32:04] [INFO ] Deduced a trap composed of 121 places in 104 ms of which 1 ms to minimize.
[2024-06-01 00:32:05] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 00:32:06] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 2 ms to minimize.
[2024-06-01 00:32:07] [INFO ] Deduced a trap composed of 157 places in 99 ms of which 2 ms to minimize.
[2024-06-01 00:32:07] [INFO ] Deduced a trap composed of 137 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 00:32:09] [INFO ] Deduced a trap composed of 125 places in 106 ms of which 2 ms to minimize.
[2024-06-01 00:32:10] [INFO ] Deduced a trap composed of 130 places in 94 ms of which 1 ms to minimize.
[2024-06-01 00:32:10] [INFO ] Deduced a trap composed of 129 places in 100 ms of which 2 ms to minimize.
[2024-06-01 00:32:10] [INFO ] Deduced a trap composed of 126 places in 87 ms of which 4 ms to minimize.
[2024-06-01 00:32:10] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 00:32:12] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:32:12] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:32:13] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-06-01 00:32:13] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:32:13] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:32:13] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:32:13] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 9 (OVERLAPS) 363/651 variables, 288/338 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 362/700 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/651 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-01 00:32:29] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/651 variables, 1/701 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 651/651 variables, and 701 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 37/37 constraints]
After SMT, in 54970ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 54973ms
Starting structural reductions in LTL mode, iteration 1 : 288/317 places, 363/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55239 ms. Remains : 288/317 places, 363/413 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3), (OR (NOT p3) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-16-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLFireability-01 finished in 55553 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((G(p0)||(X(F(p1))&&G(p2))))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 413/413 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 305 transition count 396
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 305 transition count 396
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 305 transition count 395
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 299 transition count 383
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 299 transition count 383
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 295 transition count 376
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 295 transition count 376
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 292 transition count 370
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 292 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 292 transition count 369
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 290 transition count 367
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 290 transition count 367
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 289 transition count 366
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 289 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 289 transition count 365
Applied a total of 59 rules in 24 ms. Remains 289 /317 variables (removed 28) and now considering 365/413 (removed 48) transitions.
// Phase 1: matrix 365 rows 289 cols
[2024-06-01 00:32:32] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 00:32:32] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 00:32:32] [INFO ] Invariant cache hit.
[2024-06-01 00:32:32] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-06-01 00:32:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-01 00:32:35] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2024-06-01 00:32:36] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:32:36] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 2 ms to minimize.
[2024-06-01 00:32:36] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 2 ms to minimize.
[2024-06-01 00:32:36] [INFO ] Deduced a trap composed of 140 places in 96 ms of which 2 ms to minimize.
[2024-06-01 00:32:36] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 1 ms to minimize.
[2024-06-01 00:32:38] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2024-06-01 00:32:38] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-01 00:32:40] [INFO ] Deduced a trap composed of 147 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-01 00:32:42] [INFO ] Deduced a trap composed of 134 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:32:43] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 2 ms to minimize.
[2024-06-01 00:32:43] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:32:43] [INFO ] Deduced a trap composed of 145 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:32:43] [INFO ] Deduced a trap composed of 123 places in 78 ms of which 1 ms to minimize.
[2024-06-01 00:32:43] [INFO ] Deduced a trap composed of 140 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:32:44] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:32:44] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:32:44] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 2 ms to minimize.
[2024-06-01 00:32:44] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:32:45] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:32:45] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (OVERLAPS) 365/654 variables, 289/324 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-01 00:32:51] [INFO ] Deduced a trap composed of 134 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 654/654 variables, and 325 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/654 variables, 289/325 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/654 variables, 364/689 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-01 00:33:12] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:33:12] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-01 00:33:14] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 2 ms to minimize.
[2024-06-01 00:33:15] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2024-06-01 00:33:15] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 1 ms to minimize.
[2024-06-01 00:33:15] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:33:16] [INFO ] Deduced a trap composed of 112 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 5/696 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-01 00:33:22] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 1 ms to minimize.
[2024-06-01 00:33:22] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/654 variables, and 698 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 31/31 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 289/317 places, 365/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60482 ms. Remains : 289/317 places, 365/413 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0), (NOT p1), (AND (NOT p2) p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-02
Product exploration explored 100000 steps with 28518 reset in 263 ms.
Product exploration explored 100000 steps with 28507 reset in 146 ms.
Computed a total of 88 stabilizing places and 92 stable transitions
Computed a total of 88 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 136 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0), (NOT p1), (AND (NOT p2) p0)]
RANDOM walk for 40000 steps (349 resets) in 230 ms. (173 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (50 resets) in 153 ms. (259 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (57 resets) in 133 ms. (298 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (70 resets) in 133 ms. (298 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (58 resets) in 276 ms. (144 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (51 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (70 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (70 resets) in 221 ms. (180 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 1424297 steps, run timeout after 3001 ms. (steps per millisecond=474 ) properties seen :6 out of 7
Probabilistic random walk after 1424297 steps, saw 324618 distinct states, run finished after 3004 ms. (steps per millisecond=474 ) properties seen :6
[2024-06-01 00:33:37] [INFO ] Invariant cache hit.
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, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 100/654 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 7/8 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/289 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 42ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (G (OR (NOT p0) p2))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p0), (F (NOT p2)), (F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p2)))
Knowledge based reduction with 14 factoid took 237 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-16-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-16-LTLFireability-02 finished in 65260 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)||G((F(p1)&&F(G(p2)))))))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 413/413 transitions.
Graph (trivial) has 354 edges and 317 vertex of which 46 / 317 are part of one of the 17 SCC in 2 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 287 transition count 261
Reduce places removed 119 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 134 rules applied. Total rules applied 254 place count 168 transition count 246
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 264 place count 160 transition count 244
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 266 place count 158 transition count 244
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 266 place count 158 transition count 239
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 276 place count 153 transition count 239
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 296 place count 133 transition count 206
Iterating global reduction 4 with 20 rules applied. Total rules applied 316 place count 133 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 7 rules applied. Total rules applied 323 place count 133 transition count 199
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 329 place count 127 transition count 199
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 338 place count 118 transition count 182
Iterating global reduction 6 with 9 rules applied. Total rules applied 347 place count 118 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 349 place count 118 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 350 place count 117 transition count 180
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 353 place count 114 transition count 176
Iterating global reduction 8 with 3 rules applied. Total rules applied 356 place count 114 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 357 place count 114 transition count 175
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 358 place count 113 transition count 173
Iterating global reduction 9 with 1 rules applied. Total rules applied 359 place count 113 transition count 173
Performed 42 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 9 with 84 rules applied. Total rules applied 443 place count 71 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 444 place count 71 transition count 127
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 447 place count 68 transition count 119
Iterating global reduction 10 with 3 rules applied. Total rules applied 450 place count 68 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 451 place count 68 transition count 118
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 452 place count 67 transition count 114
Iterating global reduction 11 with 1 rules applied. Total rules applied 453 place count 67 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 454 place count 67 transition count 113
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 462 place count 63 transition count 143
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 464 place count 61 transition count 139
Iterating global reduction 12 with 2 rules applied. Total rules applied 466 place count 61 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 12 with 16 rules applied. Total rules applied 482 place count 61 transition count 123
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 483 place count 60 transition count 120
Iterating global reduction 12 with 1 rules applied. Total rules applied 484 place count 60 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 486 place count 59 transition count 126
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 487 place count 59 transition count 126
Applied a total of 487 rules in 62 ms. Remains 59 /317 variables (removed 258) and now considering 126/413 (removed 287) transitions.
[2024-06-01 00:33:37] [INFO ] Flow matrix only has 118 transitions (discarded 8 similar events)
// Phase 1: matrix 118 rows 59 cols
[2024-06-01 00:33:37] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 00:33:37] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 00:33:37] [INFO ] Flow matrix only has 118 transitions (discarded 8 similar events)
[2024-06-01 00:33:37] [INFO ] Invariant cache hit.
[2024-06-01 00:33:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 00:33:37] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-06-01 00:33:37] [INFO ] Redundant transitions in 3 ms returned []
Running 118 sub problems to find dead transitions.
[2024-06-01 00:33:37] [INFO ] Flow matrix only has 118 transitions (discarded 8 similar events)
[2024-06-01 00:33:37] [INFO ] Invariant cache hit.
[2024-06-01 00:33:37] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 00:33:37] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:33:37] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:33:38] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 117/176 variables, 59/69 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 1/177 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/177 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 81 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2817 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 59/59 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 00:33:40] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 117/176 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 118/199 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 1/177 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (OVERLAPS) 0/177 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 200 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4216 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 59/59 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 4/4 constraints]
After SMT, in 7090ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 7091ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/317 places, 126/413 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7264 ms. Remains : 59/317 places, 126/413 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLFireability-03 finished in 7416 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 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 413/413 transitions.
Graph (trivial) has 357 edges and 317 vertex of which 43 / 317 are part of one of the 17 SCC in 2 ms
Free SCC test removed 26 places
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 290 transition count 260
Reduce places removed 124 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 139 rules applied. Total rules applied 264 place count 166 transition count 245
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 272 place count 158 transition count 245
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 272 place count 158 transition count 240
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 282 place count 153 transition count 240
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 303 place count 132 transition count 205
Iterating global reduction 3 with 21 rules applied. Total rules applied 324 place count 132 transition count 205
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 330 place count 132 transition count 199
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 336 place count 126 transition count 199
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 345 place count 117 transition count 182
Iterating global reduction 5 with 9 rules applied. Total rules applied 354 place count 117 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 356 place count 117 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 357 place count 116 transition count 180
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 359 place count 114 transition count 177
Iterating global reduction 7 with 2 rules applied. Total rules applied 361 place count 114 transition count 177
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 362 place count 113 transition count 175
Iterating global reduction 7 with 1 rules applied. Total rules applied 363 place count 113 transition count 175
Performed 42 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 84 rules applied. Total rules applied 447 place count 71 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 448 place count 71 transition count 129
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 452 place count 67 transition count 119
Iterating global reduction 8 with 4 rules applied. Total rules applied 456 place count 67 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 457 place count 67 transition count 118
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 459 place count 65 transition count 112
Iterating global reduction 9 with 2 rules applied. Total rules applied 461 place count 65 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 462 place count 65 transition count 111
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 463 place count 64 transition count 110
Iterating global reduction 10 with 1 rules applied. Total rules applied 464 place count 64 transition count 110
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 472 place count 60 transition count 141
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 474 place count 58 transition count 137
Iterating global reduction 10 with 2 rules applied. Total rules applied 476 place count 58 transition count 137
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 477 place count 57 transition count 133
Iterating global reduction 10 with 1 rules applied. Total rules applied 478 place count 57 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 10 with 17 rules applied. Total rules applied 495 place count 57 transition count 116
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 496 place count 56 transition count 113
Iterating global reduction 10 with 1 rules applied. Total rules applied 497 place count 56 transition count 113
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 498 place count 55 transition count 111
Iterating global reduction 10 with 1 rules applied. Total rules applied 499 place count 55 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 500 place count 55 transition count 110
Applied a total of 500 rules in 37 ms. Remains 55 /317 variables (removed 262) and now considering 110/413 (removed 303) transitions.
[2024-06-01 00:33:44] [INFO ] Flow matrix only has 102 transitions (discarded 8 similar events)
// Phase 1: matrix 102 rows 55 cols
[2024-06-01 00:33:44] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 00:33:44] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 00:33:44] [INFO ] Flow matrix only has 102 transitions (discarded 8 similar events)
[2024-06-01 00:33:44] [INFO ] Invariant cache hit.
[2024-06-01 00:33:44] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 00:33:44] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-06-01 00:33:44] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
[2024-06-01 00:33:44] [INFO ] Flow matrix only has 102 transitions (discarded 8 similar events)
[2024-06-01 00:33:44] [INFO ] Invariant cache hit.
[2024-06-01 00:33:44] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 00:33:45] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:33:45] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 101/156 variables, 55/64 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 1/157 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/157 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 75 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2341 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 55/55 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-01 00:33:47] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 101/156 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 106/181 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 1/157 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (OVERLAPS) 0/157 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 182 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3001 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 55/55 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 3/3 constraints]
After SMT, in 5377ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 5378ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/317 places, 110/413 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5508 ms. Remains : 55/317 places, 110/413 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-16-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLFireability-06 finished in 5556 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 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 413/413 transitions.
Graph (trivial) has 360 edges and 317 vertex of which 46 / 317 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 287 transition count 260
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 135 rules applied. Total rules applied 256 place count 167 transition count 245
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 265 place count 159 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 266 place count 158 transition count 244
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 266 place count 158 transition count 239
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 276 place count 153 transition count 239
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 298 place count 131 transition count 202
Iterating global reduction 4 with 22 rules applied. Total rules applied 320 place count 131 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 7 rules applied. Total rules applied 327 place count 131 transition count 195
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 333 place count 125 transition count 195
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 343 place count 115 transition count 176
Iterating global reduction 6 with 10 rules applied. Total rules applied 353 place count 115 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 355 place count 115 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 356 place count 114 transition count 174
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 359 place count 111 transition count 170
Iterating global reduction 8 with 3 rules applied. Total rules applied 362 place count 111 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 363 place count 111 transition count 169
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 364 place count 110 transition count 167
Iterating global reduction 9 with 1 rules applied. Total rules applied 365 place count 110 transition count 167
Performed 42 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 9 with 84 rules applied. Total rules applied 449 place count 68 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 450 place count 68 transition count 121
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 454 place count 64 transition count 111
Iterating global reduction 10 with 4 rules applied. Total rules applied 458 place count 64 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 459 place count 64 transition count 110
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 461 place count 62 transition count 104
Iterating global reduction 11 with 2 rules applied. Total rules applied 463 place count 62 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 464 place count 62 transition count 103
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 465 place count 61 transition count 102
Iterating global reduction 12 with 1 rules applied. Total rules applied 466 place count 61 transition count 102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 474 place count 57 transition count 132
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 476 place count 55 transition count 128
Iterating global reduction 12 with 2 rules applied. Total rules applied 478 place count 55 transition count 128
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 479 place count 54 transition count 124
Iterating global reduction 12 with 1 rules applied. Total rules applied 480 place count 54 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 482 place count 53 transition count 141
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 503 place count 53 transition count 120
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 504 place count 52 transition count 114
Iterating global reduction 12 with 1 rules applied. Total rules applied 505 place count 52 transition count 114
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 506 place count 51 transition count 112
Iterating global reduction 12 with 1 rules applied. Total rules applied 507 place count 51 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 508 place count 51 transition count 111
Applied a total of 508 rules in 28 ms. Remains 51 /317 variables (removed 266) and now considering 111/413 (removed 302) transitions.
[2024-06-01 00:33:50] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
// Phase 1: matrix 103 rows 51 cols
[2024-06-01 00:33:50] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 00:33:50] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 00:33:50] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-06-01 00:33:50] [INFO ] Invariant cache hit.
[2024-06-01 00:33:50] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 00:33:50] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-06-01 00:33:50] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2024-06-01 00:33:50] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-06-01 00:33:50] [INFO ] Invariant cache hit.
[2024-06-01 00:33:50] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 00:33:50] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:33:50] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 00:33:50] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 102/153 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 1/154 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/154 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 76 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2298 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 00:33:53] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 102/153 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 107/183 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/154 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/154 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 184 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3436 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 4/4 constraints]
After SMT, in 5774ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5775ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/317 places, 111/413 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5895 ms. Remains : 51/317 places, 111/413 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-16-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLFireability-07 finished in 5948 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((X((p0&&G(p1)))||(p2 U (p3||G(p2))))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 413/413 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 306 transition count 397
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 306 transition count 397
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 299 transition count 383
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 299 transition count 383
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 295 transition count 377
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 295 transition count 377
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 292 transition count 372
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 292 transition count 372
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 290 transition count 370
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 290 transition count 370
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 289 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 289 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 289 transition count 368
Applied a total of 57 rules in 24 ms. Remains 289 /317 variables (removed 28) and now considering 368/413 (removed 45) transitions.
// Phase 1: matrix 368 rows 289 cols
[2024-06-01 00:33:56] [INFO ] Computed 14 invariants in 5 ms
[2024-06-01 00:33:56] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 00:33:56] [INFO ] Invariant cache hit.
[2024-06-01 00:33:56] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2024-06-01 00:33:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 00:33:59] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:34:00] [INFO ] Deduced a trap composed of 135 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:34:00] [INFO ] Deduced a trap composed of 139 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:34:00] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:34:00] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-06-01 00:34:00] [INFO ] Deduced a trap composed of 144 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:34:00] [INFO ] Deduced a trap composed of 136 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:34:00] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2024-06-01 00:34:02] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-06-01 00:34:02] [INFO ] Deduced a trap composed of 137 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:34:02] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 2 ms to minimize.
[2024-06-01 00:34:02] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:34:03] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 00:34:05] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:34:05] [INFO ] Deduced a trap composed of 139 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:34:06] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 1 ms to minimize.
[2024-06-01 00:34:06] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:34:07] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:34:07] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 00:34:08] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
[2024-06-01 00:34:08] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 368/657 variables, 289/324 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (OVERLAPS) 0/657 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 367 unsolved
No progress, stopping.
After SMT solving in domain Real declared 657/657 variables, and 324 constraints, problems are : Problem set: 0 solved, 367 unsolved in 27884 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 00:34:26] [INFO ] Deduced a trap composed of 142 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:34:27] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:34:27] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:34:28] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-06-01 00:34:28] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 00:34:29] [INFO ] Deduced a trap composed of 115 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 368/657 variables, 289/330 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 367/697 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 00:34:35] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:34:36] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:34:36] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 3/700 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/657 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-06-01 00:34:52] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/657 variables, 1/701 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/657 variables, and 701 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 31/31 constraints]
After SMT, in 57951ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 57955ms
Starting structural reductions in LTL mode, iteration 1 : 289/317 places, 368/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58207 ms. Remains : 289/317 places, 368/413 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p3) (NOT p2) p0 p1), false]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-08
Entered a terminal (fully accepting) state of product in 149 steps with 1 reset in 1 ms.
FORMULA HealthRecord-PT-16-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLFireability-08 finished in 58507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(p1) U X(p2)))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 413/413 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 305 transition count 396
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 305 transition count 396
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 305 transition count 395
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 33 place count 297 transition count 379
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 297 transition count 379
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 292 transition count 371
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 292 transition count 371
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 288 transition count 364
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 288 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 288 transition count 363
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 286 transition count 361
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 286 transition count 361
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 285 transition count 360
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 285 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 285 transition count 359
Applied a total of 67 rules in 27 ms. Remains 285 /317 variables (removed 32) and now considering 359/413 (removed 54) transitions.
// Phase 1: matrix 359 rows 285 cols
[2024-06-01 00:34:54] [INFO ] Computed 14 invariants in 4 ms
[2024-06-01 00:34:54] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 00:34:54] [INFO ] Invariant cache hit.
[2024-06-01 00:34:55] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 358 sub problems to find dead transitions.
[2024-06-01 00:34:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:34:58] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-06-01 00:34:58] [INFO ] Deduced a trap composed of 136 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:34:58] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:34:58] [INFO ] Deduced a trap composed of 158 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:34:58] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-06-01 00:34:59] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:34:59] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:34:59] [INFO ] Deduced a trap composed of 135 places in 78 ms of which 2 ms to minimize.
[2024-06-01 00:34:59] [INFO ] Deduced a trap composed of 140 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:34:59] [INFO ] Deduced a trap composed of 113 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:34:59] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:34:59] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
[2024-06-01 00:35:01] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:35:04] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:35:06] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:35:06] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:35:06] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:35:07] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2024-06-01 00:35:07] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:35:08] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:35:13] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 9 (OVERLAPS) 359/644 variables, 285/320 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/644 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 644/644 variables, and 320 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:35:26] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 1 ms to minimize.
[2024-06-01 00:35:28] [INFO ] Deduced a trap composed of 137 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:35:28] [INFO ] Deduced a trap composed of 142 places in 74 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:35:29] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:35:30] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:35:30] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 2 ms to minimize.
[2024-06-01 00:35:31] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:35:31] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:35:33] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 8 (OVERLAPS) 359/644 variables, 285/329 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/644 variables, 358/687 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/644 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:35:44] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/644 variables, 1/688 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 644/644 variables, and 688 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 31/31 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 285/317 places, 359/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60331 ms. Remains : 285/317 places, 359/413 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLFireability-09 finished in 60618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(!p1 U (G((!p1||X(G(p2))))||(X(p3)&&(!p1||X(G(p2))))))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 413/413 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 303 transition count 393
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 303 transition count 393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 303 transition count 392
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 37 place count 295 transition count 376
Iterating global reduction 1 with 8 rules applied. Total rules applied 45 place count 295 transition count 376
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 290 transition count 368
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 290 transition count 368
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 286 transition count 361
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 286 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 286 transition count 360
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 284 transition count 358
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 284 transition count 358
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 283 transition count 357
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 283 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 283 transition count 356
Applied a total of 71 rules in 24 ms. Remains 283 /317 variables (removed 34) and now considering 356/413 (removed 57) transitions.
// Phase 1: matrix 356 rows 283 cols
[2024-06-01 00:35:55] [INFO ] Computed 14 invariants in 4 ms
[2024-06-01 00:35:55] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 00:35:55] [INFO ] Invariant cache hit.
[2024-06-01 00:35:55] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2024-06-01 00:35:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-06-01 00:35:59] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 3 ms to minimize.
[2024-06-01 00:35:59] [INFO ] Deduced a trap composed of 134 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:35:59] [INFO ] Deduced a trap composed of 116 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:35:59] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 1 ms to minimize.
[2024-06-01 00:35:59] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:35:59] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:36:00] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:36:00] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:36:00] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:36:01] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:36:01] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:36:01] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-06-01 00:36:03] [INFO ] Deduced a trap composed of 135 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:36:04] [INFO ] Deduced a trap composed of 144 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:36:04] [INFO ] Deduced a trap composed of 136 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:36:04] [INFO ] Deduced a trap composed of 133 places in 65 ms of which 2 ms to minimize.
[2024-06-01 00:36:05] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-06-01 00:36:06] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:36:06] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:36:08] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 356/639 variables, 283/317 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 9 (OVERLAPS) 0/639 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Real declared 639/639 variables, and 317 constraints, problems are : Problem set: 0 solved, 355 unsolved in 25752 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-06-01 00:36:23] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:36:24] [INFO ] Deduced a trap composed of 157 places in 82 ms of which 1 ms to minimize.
[2024-06-01 00:36:24] [INFO ] Deduced a trap composed of 135 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-06-01 00:36:26] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 2 ms to minimize.
[2024-06-01 00:36:27] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 356/639 variables, 283/322 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 355/677 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 10 (OVERLAPS) 0/639 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Int declared 639/639 variables, and 677 constraints, problems are : Problem set: 0 solved, 355 unsolved in 22874 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 25/25 constraints]
After SMT, in 48672ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 48676ms
Starting structural reductions in LTL mode, iteration 1 : 283/317 places, 356/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48986 ms. Remains : 283/317 places, 356/413 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) p1 (NOT p3)), true]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Computed a total of 88 stabilizing places and 92 stable transitions
Computed a total of 88 stabilizing places and 92 stable transitions
Detected a total of 88/283 stabilizing places and 92/356 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 p2 p3), (X p2), (X p3), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 15 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-16-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-16-LTLFireability-10 finished in 49437 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((p0||(p1&&X(G((p1||G(p2))))))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 413/413 transitions.
Graph (trivial) has 355 edges and 317 vertex of which 44 / 317 are part of one of the 16 SCC in 2 ms
Free SCC test removed 28 places
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 288 transition count 262
Reduce places removed 119 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 134 rules applied. Total rules applied 254 place count 169 transition count 247
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 263 place count 161 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 264 place count 160 transition count 246
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 264 place count 160 transition count 242
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 272 place count 156 transition count 242
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 294 place count 134 transition count 205
Iterating global reduction 4 with 22 rules applied. Total rules applied 316 place count 134 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 7 rules applied. Total rules applied 323 place count 134 transition count 198
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 329 place count 128 transition count 198
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 338 place count 119 transition count 181
Iterating global reduction 6 with 9 rules applied. Total rules applied 347 place count 119 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 349 place count 119 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 350 place count 118 transition count 179
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 352 place count 116 transition count 176
Iterating global reduction 8 with 2 rules applied. Total rules applied 354 place count 116 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 355 place count 116 transition count 175
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 356 place count 115 transition count 173
Iterating global reduction 9 with 1 rules applied. Total rules applied 357 place count 115 transition count 173
Performed 42 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 9 with 84 rules applied. Total rules applied 441 place count 73 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 442 place count 73 transition count 128
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 446 place count 69 transition count 118
Iterating global reduction 10 with 4 rules applied. Total rules applied 450 place count 69 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 451 place count 69 transition count 117
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 453 place count 67 transition count 111
Iterating global reduction 11 with 2 rules applied. Total rules applied 455 place count 67 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 456 place count 67 transition count 110
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 457 place count 66 transition count 109
Iterating global reduction 12 with 1 rules applied. Total rules applied 458 place count 66 transition count 109
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 466 place count 62 transition count 139
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 468 place count 60 transition count 135
Iterating global reduction 12 with 2 rules applied. Total rules applied 470 place count 60 transition count 135
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 471 place count 59 transition count 131
Iterating global reduction 12 with 1 rules applied. Total rules applied 472 place count 59 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 12 with 16 rules applied. Total rules applied 488 place count 59 transition count 115
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 489 place count 58 transition count 112
Iterating global reduction 12 with 1 rules applied. Total rules applied 490 place count 58 transition count 112
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 491 place count 57 transition count 110
Iterating global reduction 12 with 1 rules applied. Total rules applied 492 place count 57 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 494 place count 56 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 495 place count 56 transition count 126
Applied a total of 495 rules in 37 ms. Remains 56 /317 variables (removed 261) and now considering 126/413 (removed 287) transitions.
[2024-06-01 00:36:44] [INFO ] Flow matrix only has 118 transitions (discarded 8 similar events)
// Phase 1: matrix 118 rows 56 cols
[2024-06-01 00:36:44] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 00:36:44] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 00:36:44] [INFO ] Flow matrix only has 118 transitions (discarded 8 similar events)
[2024-06-01 00:36:44] [INFO ] Invariant cache hit.
[2024-06-01 00:36:44] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 00:36:44] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-06-01 00:36:44] [INFO ] Redundant transitions in 2 ms returned []
Running 122 sub problems to find dead transitions.
[2024-06-01 00:36:44] [INFO ] Flow matrix only has 118 transitions (discarded 8 similar events)
[2024-06-01 00:36:44] [INFO ] Invariant cache hit.
[2024-06-01 00:36:44] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 00:36:45] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:36:45] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:36:45] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 117/173 variables, 56/66 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 1/174 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 77 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2785 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-06-01 00:36:48] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 117/173 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 122/199 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 1/174 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/174 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 200 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3957 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 4/4 constraints]
After SMT, in 6797ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 6798ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/317 places, 126/413 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6955 ms. Remains : 56/317 places, 126/413 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-11
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLFireability-11 finished in 7102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&F(p1))||X(G(p0))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 413/413 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 394
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 304 transition count 393
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 297 transition count 379
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 297 transition count 379
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 292 transition count 371
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 292 transition count 371
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 288 transition count 364
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 288 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 288 transition count 363
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 286 transition count 361
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 286 transition count 361
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 285 transition count 360
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 285 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 285 transition count 359
Applied a total of 67 rules in 29 ms. Remains 285 /317 variables (removed 32) and now considering 359/413 (removed 54) transitions.
// Phase 1: matrix 359 rows 285 cols
[2024-06-01 00:36:51] [INFO ] Computed 14 invariants in 4 ms
[2024-06-01 00:36:52] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 00:36:52] [INFO ] Invariant cache hit.
[2024-06-01 00:36:52] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 358 sub problems to find dead transitions.
[2024-06-01 00:36:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:36:55] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:36:55] [INFO ] Deduced a trap composed of 142 places in 92 ms of which 1 ms to minimize.
[2024-06-01 00:36:55] [INFO ] Deduced a trap composed of 136 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:36:56] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:36:56] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:36:56] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 1 ms to minimize.
[2024-06-01 00:36:58] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:37:00] [INFO ] Deduced a trap composed of 133 places in 92 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (OVERLAPS) 359/644 variables, 285/307 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 8 (OVERLAPS) 0/644 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 358 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 307 constraints, problems are : Problem set: 0 solved, 358 unsolved in 21099 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:37:15] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:37:15] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 1 ms to minimize.
[2024-06-01 00:37:15] [INFO ] Deduced a trap composed of 133 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:37:15] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:37:15] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:37:15] [INFO ] Deduced a trap composed of 116 places in 96 ms of which 2 ms to minimize.
[2024-06-01 00:37:16] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:37:17] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:37:18] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:37:18] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:37:21] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-06-01 00:37:21] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:37:21] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 1 ms to minimize.
[2024-06-01 00:37:22] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 1 ms to minimize.
[2024-06-01 00:37:22] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 1 ms to minimize.
[2024-06-01 00:37:22] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:37:23] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:37:26] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:37:28] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 11 (OVERLAPS) 359/644 variables, 285/326 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/644 variables, 358/684 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/644 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 00:37:39] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 1 ms to minimize.
[2024-06-01 00:37:40] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-06-01 00:37:43] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 644/644 variables, and 687 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 30/30 constraints]
After SMT, in 51167ms problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 51170ms
Starting structural reductions in LTL mode, iteration 1 : 285/317 places, 359/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51439 ms. Remains : 285/317 places, 359/413 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Computed a total of 88 stabilizing places and 92 stable transitions
Computed a total of 88 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-16-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-16-LTLFireability-12 finished in 51814 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 9 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 413/413 transitions.
Graph (trivial) has 307 edges and 317 vertex of which 46 / 317 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 287 transition count 258
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 137 rules applied. Total rules applied 260 place count 165 transition count 243
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 268 place count 157 transition count 243
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 268 place count 157 transition count 238
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 278 place count 152 transition count 238
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 300 place count 130 transition count 201
Iterating global reduction 3 with 22 rules applied. Total rules applied 322 place count 130 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 7 rules applied. Total rules applied 329 place count 130 transition count 194
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 335 place count 124 transition count 194
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 345 place count 114 transition count 175
Iterating global reduction 5 with 10 rules applied. Total rules applied 355 place count 114 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 357 place count 114 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 358 place count 113 transition count 173
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 360 place count 111 transition count 170
Iterating global reduction 7 with 2 rules applied. Total rules applied 362 place count 111 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 363 place count 111 transition count 169
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 364 place count 110 transition count 167
Iterating global reduction 8 with 1 rules applied. Total rules applied 365 place count 110 transition count 167
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 8 with 58 rules applied. Total rules applied 423 place count 81 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 426 place count 81 transition count 135
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 432 place count 75 transition count 122
Iterating global reduction 9 with 6 rules applied. Total rules applied 438 place count 75 transition count 122
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 443 place count 70 transition count 115
Iterating global reduction 9 with 5 rules applied. Total rules applied 448 place count 70 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 449 place count 70 transition count 114
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 451 place count 68 transition count 110
Iterating global reduction 10 with 2 rules applied. Total rules applied 453 place count 68 transition count 110
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 455 place count 66 transition count 105
Iterating global reduction 10 with 2 rules applied. Total rules applied 457 place count 66 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 458 place count 66 transition count 104
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 459 place count 65 transition count 102
Iterating global reduction 11 with 1 rules applied. Total rules applied 460 place count 65 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 464 place count 63 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 472 place count 63 transition count 97
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 473 place count 62 transition count 95
Iterating global reduction 11 with 1 rules applied. Total rules applied 474 place count 62 transition count 95
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 475 place count 61 transition count 92
Iterating global reduction 11 with 1 rules applied. Total rules applied 476 place count 61 transition count 92
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 477 place count 60 transition count 91
Iterating global reduction 11 with 1 rules applied. Total rules applied 478 place count 60 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 482 place count 58 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 483 place count 58 transition count 110
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 485 place count 58 transition count 110
Applied a total of 485 rules in 31 ms. Remains 58 /317 variables (removed 259) and now considering 110/413 (removed 303) transitions.
[2024-06-01 00:37:43] [INFO ] Flow matrix only has 102 transitions (discarded 8 similar events)
// Phase 1: matrix 102 rows 58 cols
[2024-06-01 00:37:43] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 00:37:43] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-01 00:37:43] [INFO ] Flow matrix only has 102 transitions (discarded 8 similar events)
[2024-06-01 00:37:43] [INFO ] Invariant cache hit.
[2024-06-01 00:37:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 00:37:43] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-06-01 00:37:43] [INFO ] Redundant transitions in 2 ms returned []
Running 94 sub problems to find dead transitions.
[2024-06-01 00:37:43] [INFO ] Flow matrix only has 102 transitions (discarded 8 similar events)
[2024-06-01 00:37:43] [INFO ] Invariant cache hit.
[2024-06-01 00:37:43] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 00:37:44] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 00:37:44] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:37:44] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-06-01 00:37:44] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 00:37:44] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 101/159 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 1/160 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 74 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2234 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 101/159 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 94/167 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/160 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 168 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2903 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 5/5 constraints]
After SMT, in 5172ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 5173ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/317 places, 110/413 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5398 ms. Remains : 58/317 places, 110/413 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-14
Stuttering criterion allowed to conclude after 223 steps with 17 reset in 2 ms.
FORMULA HealthRecord-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLFireability-14 finished in 5447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U p1)))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 413/413 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 304 transition count 394
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 304 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 304 transition count 393
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 297 transition count 380
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 297 transition count 380
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 292 transition count 372
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 292 transition count 372
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 288 transition count 365
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 288 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 288 transition count 364
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 287 transition count 363
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 287 transition count 363
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 286 transition count 362
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 286 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 286 transition count 361
Applied a total of 65 rules in 31 ms. Remains 286 /317 variables (removed 31) and now considering 361/413 (removed 52) transitions.
// Phase 1: matrix 361 rows 286 cols
[2024-06-01 00:37:49] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 00:37:49] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 00:37:49] [INFO ] Invariant cache hit.
[2024-06-01 00:37:49] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2024-06-01 00:37:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/286 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-06-01 00:37:52] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:37:52] [INFO ] Deduced a trap composed of 145 places in 153 ms of which 2 ms to minimize.
[2024-06-01 00:37:53] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:37:53] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-06-01 00:37:53] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:37:53] [INFO ] Deduced a trap composed of 159 places in 94 ms of which 1 ms to minimize.
[2024-06-01 00:37:53] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
[2024-06-01 00:37:53] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:37:54] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:37:54] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 1 ms to minimize.
[2024-06-01 00:37:54] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:37:54] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:37:55] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2024-06-01 00:37:55] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:37:55] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:37:56] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-06-01 00:37:58] [INFO ] Deduced a trap composed of 112 places in 96 ms of which 2 ms to minimize.
[2024-06-01 00:37:58] [INFO ] Deduced a trap composed of 118 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-06-01 00:38:00] [INFO ] Deduced a trap composed of 134 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 361/647 variables, 286/319 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-06-01 00:38:07] [INFO ] Deduced a trap composed of 136 places in 94 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/647 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/647 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 10 (OVERLAPS) 0/647 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 647/647 variables, and 320 constraints, problems are : Problem set: 0 solved, 360 unsolved in 29349 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/286 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-06-01 00:38:20] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 1 ms to minimize.
[2024-06-01 00:38:20] [INFO ] Deduced a trap composed of 114 places in 79 ms of which 1 ms to minimize.
[2024-06-01 00:38:21] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:38:21] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2024-06-01 00:38:21] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-06-01 00:38:23] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 361/647 variables, 286/326 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/647 variables, 360/686 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/647 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 10 (OVERLAPS) 0/647 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 647/647 variables, and 686 constraints, problems are : Problem set: 0 solved, 360 unsolved in 24287 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 26/26 constraints]
After SMT, in 53698ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 53701ms
Starting structural reductions in LTL mode, iteration 1 : 286/317 places, 361/413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54034 ms. Remains : 286/317 places, 361/413 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-15
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-16-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLFireability-15 finished in 54173 ms.
All properties solved by simple procedures.
Total runtime 562953 ms.
ITS solved all properties within timeout

BK_STOP 1717202323392

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="HealthRecord-PT-16"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is HealthRecord-PT-16, 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 r496-tall-171640604300820"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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