About the Execution of 2023-gold for ResAllocation-PT-R100C002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 469.371 | 30143.00 | 48556.00 | 400.90 | FFFFFFFTFFFFFTFF | normal |
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.r329-tall-171662362500553.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 gold2023
Input is ResAllocation-PT-R100C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362500553
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 23:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 11 23:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 23:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 11 23:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 422K May 18 16:43 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 ResAllocation-PT-R100C002-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716866097831
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R100C002
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 03:14:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 03:14:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 03:14:59] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-28 03:14:59] [INFO ] Transformed 400 places.
[2024-05-28 03:14:59] [INFO ] Transformed 202 transitions.
[2024-05-28 03:14:59] [INFO ] Found NUPN structural information;
[2024-05-28 03:14:59] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ResAllocation-PT-R100C002-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 202/202 transitions.
Applied a total of 0 rules in 40 ms. Remains 400 /400 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 400 cols
[2024-05-28 03:14:59] [INFO ] Computed 200 invariants in 20 ms
[2024-05-28 03:15:00] [INFO ] Implicit Places using invariants in 724 ms returned []
[2024-05-28 03:15:00] [INFO ] Invariant cache hit.
[2024-05-28 03:15:00] [INFO ] Implicit Places using invariants and state equation in 599 ms returned [201, 203, 207, 209, 211, 213, 215, 217, 219, 221, 223, 225, 227, 229, 231, 233, 235, 237, 241, 243, 247, 249, 251, 253, 257, 259, 261, 263, 265, 267, 269, 271, 273, 275, 277, 283, 285, 287, 289, 293, 295, 297, 299, 301, 305, 307, 309, 313, 315, 317, 321, 323, 325, 331, 333, 335, 337, 339, 341, 343, 345, 347, 349, 351, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 381, 383, 385, 387, 389, 391, 393, 395, 397]
Discarding 86 places :
Implicit Place search using SMT with State Equation took 1359 ms to find 86 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 314/400 places, 202/202 transitions.
Applied a total of 0 rules in 15 ms. Remains 314 /314 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1416 ms. Remains : 314/400 places, 202/202 transitions.
Support contains 59 out of 314 places after structural reductions.
[2024-05-28 03:15:01] [INFO ] Flatten gal took : 47 ms
[2024-05-28 03:15:01] [INFO ] Flatten gal took : 19 ms
[2024-05-28 03:15:01] [INFO ] Input system was already deterministic with 202 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 25) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 202 rows 314 cols
[2024-05-28 03:15:02] [INFO ] Computed 114 invariants in 2 ms
[2024-05-28 03:15:02] [INFO ] [Real]Absence check using 114 positive place invariants in 18 ms returned sat
[2024-05-28 03:15:02] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-28 03:15:02] [INFO ] [Nat]Absence check using 114 positive place invariants in 13 ms returned sat
[2024-05-28 03:15:03] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-28 03:15:03] [INFO ] After 486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 172 ms.
[2024-05-28 03:15:03] [INFO ] After 810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 7 properties in 65 ms.
Support contains 5 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 312 transition count 200
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 312 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 7 place count 310 transition count 199
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 1 with 2 rules applied. Total rules applied 9 place count 309 transition count 198
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 309 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 307 transition count 197
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 305 transition count 196
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 305 transition count 195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 303 transition count 195
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 3 with 2 rules applied. Total rules applied 20 place count 302 transition count 194
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 302 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 23 place count 300 transition count 193
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 4 with 2 rules applied. Total rules applied 25 place count 299 transition count 192
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 299 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 28 place count 297 transition count 191
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 5 with 2 rules applied. Total rules applied 30 place count 296 transition count 190
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 31 place count 296 transition count 189
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 33 place count 294 transition count 189
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 6 with 2 rules applied. Total rules applied 35 place count 293 transition count 188
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 36 place count 293 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 38 place count 291 transition count 187
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 7 with 2 rules applied. Total rules applied 40 place count 290 transition count 186
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 41 place count 290 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 43 place count 288 transition count 185
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 8 with 2 rules applied. Total rules applied 45 place count 287 transition count 184
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 46 place count 287 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 48 place count 285 transition count 183
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 9 with 2 rules applied. Total rules applied 50 place count 284 transition count 182
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 51 place count 284 transition count 181
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 53 place count 282 transition count 181
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 55 place count 281 transition count 180
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 56 place count 281 transition count 179
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 58 place count 279 transition count 179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 60 place count 278 transition count 178
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 61 place count 278 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 63 place count 276 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 65 place count 275 transition count 176
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 66 place count 275 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 68 place count 273 transition count 175
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 70 place count 272 transition count 174
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 71 place count 272 transition count 173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 73 place count 270 transition count 173
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 75 place count 269 transition count 172
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 76 place count 269 transition count 171
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 78 place count 267 transition count 171
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 80 place count 266 transition count 170
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 81 place count 266 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 83 place count 264 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 85 place count 263 transition count 168
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 86 place count 263 transition count 167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 88 place count 261 transition count 167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 90 place count 260 transition count 166
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 91 place count 260 transition count 165
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 93 place count 258 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 95 place count 257 transition count 164
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 96 place count 257 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 98 place count 255 transition count 163
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 3 rules applied. Total rules applied 101 place count 253 transition count 162
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 102 place count 253 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 104 place count 251 transition count 161
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 106 place count 250 transition count 160
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 107 place count 250 transition count 159
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 109 place count 248 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 111 place count 247 transition count 158
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 112 place count 247 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 114 place count 245 transition count 157
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 22 with 3 rules applied. Total rules applied 117 place count 243 transition count 156
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 118 place count 243 transition count 155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 120 place count 241 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 122 place count 240 transition count 154
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 123 place count 240 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 125 place count 238 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 127 place count 237 transition count 152
Free-agglomeration rule applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 128 place count 237 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 130 place count 235 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 132 place count 234 transition count 150
Free-agglomeration rule applied 1 times.
Iterating global reduction 25 with 1 rules applied. Total rules applied 133 place count 234 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 135 place count 232 transition count 149
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 26 with 2 rules applied. Total rules applied 137 place count 231 transition count 148
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 138 place count 231 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 140 place count 229 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 27 with 3 rules applied. Total rules applied 143 place count 227 transition count 146
Free-agglomeration rule applied 1 times.
Iterating global reduction 27 with 1 rules applied. Total rules applied 144 place count 227 transition count 145
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 146 place count 225 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 148 place count 224 transition count 144
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 149 place count 224 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 151 place count 222 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 153 place count 221 transition count 142
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 154 place count 221 transition count 141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 156 place count 219 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 158 place count 218 transition count 140
Free-agglomeration rule applied 1 times.
Iterating global reduction 30 with 1 rules applied. Total rules applied 159 place count 218 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 161 place count 216 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 163 place count 215 transition count 138
Free-agglomeration rule applied 1 times.
Iterating global reduction 31 with 1 rules applied. Total rules applied 164 place count 215 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 166 place count 213 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 168 place count 212 transition count 136
Free-agglomeration rule applied 1 times.
Iterating global reduction 32 with 1 rules applied. Total rules applied 169 place count 212 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 171 place count 210 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 173 place count 209 transition count 134
Free-agglomeration rule applied 1 times.
Iterating global reduction 33 with 1 rules applied. Total rules applied 174 place count 209 transition count 133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 176 place count 207 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 178 place count 206 transition count 132
Free-agglomeration rule applied 1 times.
Iterating global reduction 34 with 1 rules applied. Total rules applied 179 place count 206 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 181 place count 204 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 183 place count 203 transition count 130
Free-agglomeration rule applied 1 times.
Iterating global reduction 35 with 1 rules applied. Total rules applied 184 place count 203 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 186 place count 201 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 36 with 2 rules applied. Total rules applied 188 place count 200 transition count 128
Free-agglomeration rule applied 1 times.
Iterating global reduction 36 with 1 rules applied. Total rules applied 189 place count 200 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 191 place count 198 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 37 with 2 rules applied. Total rules applied 193 place count 197 transition count 126
Free-agglomeration rule applied 1 times.
Iterating global reduction 37 with 1 rules applied. Total rules applied 194 place count 197 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 37 with 2 rules applied. Total rules applied 196 place count 195 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 38 with 2 rules applied. Total rules applied 198 place count 194 transition count 124
Free-agglomeration rule applied 1 times.
Iterating global reduction 38 with 1 rules applied. Total rules applied 199 place count 194 transition count 123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 38 with 2 rules applied. Total rules applied 201 place count 192 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 39 with 3 rules applied. Total rules applied 204 place count 190 transition count 122
Free-agglomeration rule applied 1 times.
Iterating global reduction 39 with 1 rules applied. Total rules applied 205 place count 190 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 39 with 2 rules applied. Total rules applied 207 place count 188 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 40 with 3 rules applied. Total rules applied 210 place count 186 transition count 120
Free-agglomeration rule applied 1 times.
Iterating global reduction 40 with 1 rules applied. Total rules applied 211 place count 186 transition count 119
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 40 with 2 rules applied. Total rules applied 213 place count 184 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 41 with 2 rules applied. Total rules applied 215 place count 183 transition count 118
Free-agglomeration rule applied 1 times.
Iterating global reduction 41 with 1 rules applied. Total rules applied 216 place count 183 transition count 117
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 41 with 2 rules applied. Total rules applied 218 place count 181 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 42 with 2 rules applied. Total rules applied 220 place count 180 transition count 116
Free-agglomeration rule applied 1 times.
Iterating global reduction 42 with 1 rules applied. Total rules applied 221 place count 180 transition count 115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 42 with 2 rules applied. Total rules applied 223 place count 178 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 43 with 2 rules applied. Total rules applied 225 place count 177 transition count 114
Free-agglomeration rule applied 1 times.
Iterating global reduction 43 with 1 rules applied. Total rules applied 226 place count 177 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 43 with 2 rules applied. Total rules applied 228 place count 175 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 44 with 2 rules applied. Total rules applied 230 place count 174 transition count 112
Free-agglomeration rule applied 1 times.
Iterating global reduction 44 with 1 rules applied. Total rules applied 231 place count 174 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 44 with 2 rules applied. Total rules applied 233 place count 172 transition count 111
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 45 with 1 rules applied. Total rules applied 234 place count 172 transition count 110
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 45 with 3 rules applied. Total rules applied 237 place count 169 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 46 with 2 rules applied. Total rules applied 239 place count 168 transition count 109
Free-agglomeration rule applied 1 times.
Iterating global reduction 46 with 1 rules applied. Total rules applied 240 place count 168 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 46 with 2 rules applied. Total rules applied 242 place count 166 transition count 108
Applied a total of 242 rules in 454 ms. Remains 166 /314 variables (removed 148) and now considering 108/202 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 454 ms. Remains : 166/314 places, 108/202 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1758942 steps, run timeout after 3001 ms. (steps per millisecond=586 ) properties seen :{}
Probabilistic random walk after 1758942 steps, saw 378437 distinct states, run finished after 3002 ms. (steps per millisecond=585 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 166 cols
[2024-05-28 03:15:07] [INFO ] Computed 60 invariants in 5 ms
[2024-05-28 03:15:07] [INFO ] [Real]Absence check using 60 positive place invariants in 7 ms returned sat
[2024-05-28 03:15:07] [INFO ] After 66ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 03:15:07] [INFO ] After 88ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-28 03:15:07] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 166 /166 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 166/166 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 166 /166 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-28 03:15:07] [INFO ] Invariant cache hit.
[2024-05-28 03:15:07] [INFO ] Implicit Places using invariants in 143 ms returned [114, 119, 124, 129, 131, 157]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 144 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/166 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 148 ms. Remains : 160/166 places, 108/108 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1662922 steps, run timeout after 3001 ms. (steps per millisecond=554 ) properties seen :{}
Probabilistic random walk after 1662922 steps, saw 358558 distinct states, run finished after 3004 ms. (steps per millisecond=553 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 160 cols
[2024-05-28 03:15:10] [INFO ] Computed 54 invariants in 3 ms
[2024-05-28 03:15:10] [INFO ] [Real]Absence check using 54 positive place invariants in 7 ms returned sat
[2024-05-28 03:15:10] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 03:15:10] [INFO ] After 86ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-28 03:15:10] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 03:15:10] [INFO ] [Nat]Absence check using 54 positive place invariants in 7 ms returned sat
[2024-05-28 03:15:10] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 03:15:10] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-28 03:15:10] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 160/160 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-28 03:15:10] [INFO ] Invariant cache hit.
[2024-05-28 03:15:10] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 03:15:10] [INFO ] Invariant cache hit.
[2024-05-28 03:15:11] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-05-28 03:15:11] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 03:15:11] [INFO ] Invariant cache hit.
[2024-05-28 03:15:11] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 354 ms. Remains : 160/160 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-28 03:15:11] [INFO ] Invariant cache hit.
[2024-05-28 03:15:11] [INFO ] [Real]Absence check using 54 positive place invariants in 6 ms returned sat
[2024-05-28 03:15:11] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 03:15:11] [INFO ] After 64ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-28 03:15:11] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 03:15:11] [INFO ] [Nat]Absence check using 54 positive place invariants in 6 ms returned sat
[2024-05-28 03:15:11] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 03:15:11] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-28 03:15:11] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ResAllocation-PT-R100C002-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 314 /314 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 314 cols
[2024-05-28 03:15:11] [INFO ] Computed 114 invariants in 2 ms
[2024-05-28 03:15:11] [INFO ] Implicit Places using invariants in 157 ms returned [203, 221, 225, 231, 244, 246, 252, 259, 264, 269, 274, 276, 302, 313]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 158 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/314 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 163 ms. Remains : 300/314 places, 202/202 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 231 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s114 0) (EQ s117 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 38 reset in 443 ms.
Entered a terminal (fully accepting) state of product in 41963 steps with 16 reset in 189 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-00 finished in 1075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 5 out of 314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 314/314 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 312 transition count 200
Applied a total of 4 rules in 16 ms. Remains 312 /314 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 312 cols
[2024-05-28 03:15:12] [INFO ] Computed 114 invariants in 2 ms
[2024-05-28 03:15:13] [INFO ] Implicit Places using invariants in 165 ms returned [201, 219, 223, 229, 242, 250, 257, 262, 267, 272, 274, 300, 311]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 167 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 299/314 places, 200/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 188 ms. Remains : 299/314 places, 200/202 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s102 1) (EQ s105 1)), p1:(OR (NEQ s81 1) (NEQ s239 1) (NEQ s240 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2559 steps with 0 reset in 10 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-02 finished in 405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 314/314 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 312 transition count 200
Applied a total of 4 rules in 8 ms. Remains 312 /314 variables (removed 2) and now considering 200/202 (removed 2) transitions.
[2024-05-28 03:15:13] [INFO ] Invariant cache hit.
[2024-05-28 03:15:13] [INFO ] Implicit Places using invariants in 154 ms returned [201, 219, 229, 242, 244, 250, 257, 262, 267, 272, 274, 311]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 156 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 300/314 places, 200/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 169 ms. Remains : 300/314 places, 200/202 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s179 1) (EQ s289 1) (EQ s290 1)), p1:(AND (EQ s45 1) (EQ s221 1) (EQ s222 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2618 steps with 1 reset in 20 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-03 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 314 /314 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 314 cols
[2024-05-28 03:15:13] [INFO ] Computed 114 invariants in 6 ms
[2024-05-28 03:15:13] [INFO ] Implicit Places using invariants in 169 ms returned [203, 221, 225, 244, 246, 252, 259, 264, 269, 274, 276, 302, 313]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 170 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/314 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 176 ms. Remains : 301/314 places, 202/202 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s55 0) (EQ s228 0) (EQ s229 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 38 reset in 385 ms.
Product exploration explored 100000 steps with 38 reset in 415 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9874 steps, run visited all 1 properties in 41 ms. (steps per millisecond=240 )
Probabilistic random walk after 9874 steps, saw 7390 distinct states, run finished after 42 ms. (steps per millisecond=235 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R100C002-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R100C002-LTLFireability-04 finished in 1402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((!p0&&F(!p1))))))'
Support contains 4 out of 314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 314/314 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 312 transition count 200
Applied a total of 4 rules in 13 ms. Remains 312 /314 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 312 cols
[2024-05-28 03:15:14] [INFO ] Computed 114 invariants in 4 ms
[2024-05-28 03:15:15] [INFO ] Implicit Places using invariants in 160 ms returned [201, 219, 223, 229, 242, 244, 250, 257, 262, 267, 272, 274, 300, 311]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 163 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 298/314 places, 200/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 181 ms. Remains : 298/314 places, 200/202 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR p0 p1), (OR p0 p1), true, p1]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s176 1) (EQ s179 1)), p1:(AND (EQ s42 1) (EQ s45 1) (EQ s176 1) (EQ s179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 38 reset in 425 ms.
Product exploration explored 100000 steps with 38 reset in 405 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p0))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 105 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR p0 p1), true, p1]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 619653 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 619653 steps, saw 196713 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 200 rows 298 cols
[2024-05-28 03:15:19] [INFO ] Computed 100 invariants in 2 ms
[2024-05-28 03:15:19] [INFO ] [Real]Absence check using 100 positive place invariants in 12 ms returned sat
[2024-05-28 03:15:19] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-28 03:15:19] [INFO ] [Nat]Absence check using 100 positive place invariants in 14 ms returned sat
[2024-05-28 03:15:19] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-28 03:15:20] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-28 03:15:20] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 260 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=52 )
Parikh walk visited 1 properties in 4 ms.
Support contains 4 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 200/200 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 298 transition count 198
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 294 transition count 198
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 292 transition count 196
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 292 transition count 194
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 16 place count 288 transition count 194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 286 transition count 192
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 286 transition count 190
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 282 transition count 190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 280 transition count 188
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 280 transition count 186
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 36 place count 276 transition count 186
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 40 place count 274 transition count 184
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 42 place count 274 transition count 182
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 46 place count 270 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 50 place count 268 transition count 180
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 52 place count 268 transition count 178
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 56 place count 264 transition count 178
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 60 place count 262 transition count 176
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 62 place count 262 transition count 174
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 66 place count 258 transition count 174
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 70 place count 256 transition count 172
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 72 place count 256 transition count 170
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 76 place count 252 transition count 170
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 80 place count 250 transition count 168
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 82 place count 250 transition count 166
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 86 place count 246 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 90 place count 244 transition count 164
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 92 place count 244 transition count 162
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 96 place count 240 transition count 162
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 98 place count 239 transition count 161
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 99 place count 239 transition count 160
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 101 place count 237 transition count 160
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 103 place count 236 transition count 159
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 104 place count 236 transition count 158
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 106 place count 234 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 108 place count 233 transition count 157
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 109 place count 233 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 111 place count 231 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 113 place count 230 transition count 155
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 114 place count 230 transition count 154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 116 place count 228 transition count 154
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 14 with 2 rules applied. Total rules applied 118 place count 227 transition count 153
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 119 place count 227 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 121 place count 225 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 123 place count 224 transition count 151
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 124 place count 224 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 126 place count 222 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 128 place count 221 transition count 149
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 129 place count 221 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 131 place count 219 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 133 place count 218 transition count 147
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 134 place count 218 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 136 place count 216 transition count 146
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 18 with 2 rules applied. Total rules applied 138 place count 215 transition count 145
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 139 place count 215 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 141 place count 213 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 143 place count 212 transition count 143
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 144 place count 212 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 146 place count 210 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 148 place count 209 transition count 141
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 149 place count 209 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 151 place count 207 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 153 place count 206 transition count 139
Applied a total of 153 rules in 113 ms. Remains 206 /298 variables (removed 92) and now considering 139/200 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 206/298 places, 139/200 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1277886 steps, run timeout after 3001 ms. (steps per millisecond=425 ) properties seen :{}
Probabilistic random walk after 1277886 steps, saw 283940 distinct states, run finished after 3001 ms. (steps per millisecond=425 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 139 rows 206 cols
[2024-05-28 03:15:23] [INFO ] Computed 69 invariants in 2 ms
[2024-05-28 03:15:23] [INFO ] [Real]Absence check using 69 positive place invariants in 8 ms returned sat
[2024-05-28 03:15:23] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 03:15:23] [INFO ] [Nat]Absence check using 69 positive place invariants in 8 ms returned sat
[2024-05-28 03:15:23] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 03:15:23] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-28 03:15:23] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 72 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=72 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p0))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 8 factoid took 132 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R100C002-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R100C002-LTLFireability-05 finished in 8710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((X(p1)||F(p2)))))'
Support contains 7 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 202/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 314 /314 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 314 cols
[2024-05-28 03:15:23] [INFO ] Computed 114 invariants in 2 ms
[2024-05-28 03:15:23] [INFO ] Implicit Places using invariants in 176 ms returned [203, 221, 225, 231, 244, 246, 252, 259, 264, 274, 276, 302, 313]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 178 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/314 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 301/314 places, 202/202 transitions.
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (EQ s119 1) (EQ s260 1) (EQ s261 1)) (AND (EQ s74 1) (EQ s77 1))), p2:(AND (EQ s74 1) (EQ s77 1) (EQ s78 1) (EQ s81 1)), p1:(AND (EQ s119 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2990 steps with 1 reset in 17 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-06 finished in 488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((!p1 U (p2||G(!p1)))))))'
Support contains 7 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 314 /314 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-28 03:15:24] [INFO ] Invariant cache hit.
[2024-05-28 03:15:24] [INFO ] Implicit Places using invariants in 172 ms returned [203, 221, 225, 231, 244, 246, 252, 259, 264, 269, 274, 302]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 173 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/314 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 178 ms. Remains : 302/314 places, 202/202 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s199 1) (EQ s301 1)), p2:(AND (NOT (AND (EQ s129 1) (EQ s265 1) (EQ s266 1))) (NOT (AND (EQ s18 1) (EQ s21 1)))), p1:(AND (EQ s18 1) (EQ s21 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 321 ms.
Product exploration explored 100000 steps with 50000 reset in 336 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 88 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R100C002-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R100C002-LTLFireability-07 finished in 1057 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 314 /314 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-28 03:15:25] [INFO ] Invariant cache hit.
[2024-05-28 03:15:25] [INFO ] Implicit Places using invariants in 180 ms returned [203, 221, 225, 231, 244, 246, 252, 259, 269, 274, 276, 302, 313]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 181 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/314 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 189 ms. Remains : 301/314 places, 202/202 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s111 1) (EQ s256 1) (EQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3787 steps with 2 reset in 20 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-08 finished in 291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X((X(G(p0))||!p1)) U p0))'
Support contains 2 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 314 /314 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-28 03:15:25] [INFO ] Invariant cache hit.
[2024-05-28 03:15:25] [INFO ] Implicit Places using invariants in 177 ms returned [203, 221, 225, 231, 244, 246, 252, 259, 264, 269, 274, 276, 302, 313]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 178 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/314 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 184 ms. Remains : 300/314 places, 202/202 transitions.
Stuttering acceptance computed with spot in 129 ms :[p0, (NOT p0), true, true]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s180 1) (EQ s183 1)), p1:(OR (AND (NOT (AND (EQ s180 1) (EQ s183 1))) (EQ s180 1) (EQ s183 1)) (AND (EQ s180 1) (EQ s183 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-09 finished in 335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p1)))))'
Support contains 8 out of 314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 314/314 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 312 transition count 200
Applied a total of 4 rules in 10 ms. Remains 312 /314 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 312 cols
[2024-05-28 03:15:25] [INFO ] Computed 114 invariants in 1 ms
[2024-05-28 03:15:26] [INFO ] Implicit Places using invariants in 205 ms returned [201, 219, 223, 229, 244, 257, 262, 267, 272, 274, 300, 311]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 206 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 300/314 places, 200/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 220 ms. Remains : 300/314 places, 200/202 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s79 0) (EQ s238 0) (EQ s239 0)), p1:(AND (EQ s192 1) (EQ s195 1) (EQ s91 1) (EQ s245 1) (EQ s246 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2566 steps with 0 reset in 12 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-10 finished in 365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
Support contains 7 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 314 /314 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 314 cols
[2024-05-28 03:15:26] [INFO ] Computed 114 invariants in 1 ms
[2024-05-28 03:15:26] [INFO ] Implicit Places using invariants in 174 ms returned [221, 225, 231, 244, 246, 252, 259, 264, 269, 274, 276, 302, 313]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 176 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/314 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 183 ms. Remains : 301/314 places, 202/202 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (EQ s176 1) (EQ s179 1)) (AND (EQ s84 1) (EQ s87 1))), p1:(AND (EQ s5 1) (EQ s203 1) (EQ s204 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2559 steps with 0 reset in 15 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-12 finished in 367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 314/314 places, 202/202 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 201
Applied a total of 2 rules in 8 ms. Remains 313 /314 variables (removed 1) and now considering 201/202 (removed 1) transitions.
// Phase 1: matrix 201 rows 313 cols
[2024-05-28 03:15:26] [INFO ] Computed 114 invariants in 12 ms
[2024-05-28 03:15:26] [INFO ] Implicit Places using invariants in 191 ms returned [202, 224, 230, 243, 245, 251, 258, 263, 268, 273, 275, 301, 312]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 194 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 300/314 places, 201/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 205 ms. Remains : 300/314 places, 201/202 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s199 1), p1:(AND (EQ s39 1) (EQ s219 1) (EQ s220 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2599 steps with 0 reset in 16 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-15 finished in 301 ms.
All properties solved by simple procedures.
Total runtime 27632 ms.
BK_STOP 1716866127974
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R100C002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is ResAllocation-PT-R100C002, 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 r329-tall-171662362500553"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R100C002.tgz
mv ResAllocation-PT-R100C002 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 '
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 ;