Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821000500.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is LeafsetExtension-PT-S32C2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821000500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 6.9K Apr 29 12:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Apr 29 12:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 29 12:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 12:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K May 9 08:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 9 08:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 9 08:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.4M May 10 09:34 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 LeafsetExtension-PT-S32C2-LTLFireability-00
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-01
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-02
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-03
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-04
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-05
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-06
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-07
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-08
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-09
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-10
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-11
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-12
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-13
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-14
FORMULA_NAME LeafsetExtension-PT-S32C2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652796885387

Running Version 202205111006
[2022-05-17 14:14:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 14:14:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 14:14:47] [INFO ] Load time of PNML (sax parser for PT used): 505 ms
[2022-05-17 14:14:47] [INFO ] Transformed 5622 places.
[2022-05-17 14:14:47] [INFO ] Transformed 5449 transitions.
[2022-05-17 14:14:47] [INFO ] Parsed PT model containing 5622 places and 5449 transitions in 640 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 5622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Reduce places removed 1093 places and 0 transitions.
Iterating post reduction 0 with 1093 rules applied. Total rules applied 1093 place count 4529 transition count 5449
Discarding 1047 places :
Symmetric choice reduction at 1 with 1047 rule applications. Total rules 2140 place count 3482 transition count 4402
Iterating global reduction 1 with 1047 rules applied. Total rules applied 3187 place count 3482 transition count 4402
Discarding 972 places :
Symmetric choice reduction at 1 with 972 rule applications. Total rules 4159 place count 2510 transition count 3430
Iterating global reduction 1 with 972 rules applied. Total rules applied 5131 place count 2510 transition count 3430
Discarding 964 places :
Symmetric choice reduction at 1 with 964 rule applications. Total rules 6095 place count 1546 transition count 2466
Iterating global reduction 1 with 964 rules applied. Total rules applied 7059 place count 1546 transition count 2466
Discarding 46 places :
Implicit places reduction removed 46 places
Iterating post reduction 1 with 46 rules applied. Total rules applied 7105 place count 1500 transition count 2466
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 7149 place count 1456 transition count 2422
Iterating global reduction 2 with 44 rules applied. Total rules applied 7193 place count 1456 transition count 2422
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 7237 place count 1412 transition count 2378
Iterating global reduction 2 with 44 rules applied. Total rules applied 7281 place count 1412 transition count 2378
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 7325 place count 1368 transition count 2334
Iterating global reduction 2 with 44 rules applied. Total rules applied 7369 place count 1368 transition count 2334
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 7413 place count 1324 transition count 2290
Iterating global reduction 2 with 44 rules applied. Total rules applied 7457 place count 1324 transition count 2290
Discarding 669 places :
Symmetric choice reduction at 2 with 669 rule applications. Total rules 8126 place count 655 transition count 1621
Iterating global reduction 2 with 669 rules applied. Total rules applied 8795 place count 655 transition count 1621
Applied a total of 8795 rules in 1620 ms. Remains 655 /5622 variables (removed 4967) and now considering 1621/5449 (removed 3828) transitions.
[2022-05-17 14:14:49] [INFO ] Flow matrix only has 954 transitions (discarded 667 similar events)
// Phase 1: matrix 954 rows 655 cols
[2022-05-17 14:14:49] [INFO ] Computed 56 place invariants in 32 ms
[2022-05-17 14:14:49] [INFO ] Implicit Places using invariants in 592 ms returned [43, 91, 97, 148, 155, 179, 223, 253, 257, 277, 284, 309, 336, 365, 369, 377, 379, 409, 413, 417, 441, 463, 468, 474, 478, 482, 486, 490, 516, 543, 548, 579, 627]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 914 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 622/5622 places, 1621/5449 transitions.
Discarding 279 places :
Symmetric choice reduction at 0 with 279 rule applications. Total rules 279 place count 343 transition count 1342
Iterating global reduction 0 with 279 rules applied. Total rules applied 558 place count 343 transition count 1342
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 562 place count 339 transition count 1338
Iterating global reduction 0 with 4 rules applied. Total rules applied 566 place count 339 transition count 1338
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 570 place count 335 transition count 1334
Iterating global reduction 0 with 4 rules applied. Total rules applied 574 place count 335 transition count 1334
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 578 place count 331 transition count 1330
Iterating global reduction 0 with 4 rules applied. Total rules applied 582 place count 331 transition count 1330
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 595 place count 318 transition count 1317
Iterating global reduction 0 with 13 rules applied. Total rules applied 608 place count 318 transition count 1317
Applied a total of 608 rules in 58 ms. Remains 318 /622 variables (removed 304) and now considering 1317/1621 (removed 304) transitions.
[2022-05-17 14:14:50] [INFO ] Flow matrix only has 566 transitions (discarded 751 similar events)
// Phase 1: matrix 566 rows 318 cols
[2022-05-17 14:14:50] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-17 14:14:50] [INFO ] Implicit Places using invariants in 153 ms returned []
[2022-05-17 14:14:50] [INFO ] Flow matrix only has 566 transitions (discarded 751 similar events)
// Phase 1: matrix 566 rows 318 cols
[2022-05-17 14:14:50] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 14:14:50] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 318/5622 places, 1317/5449 transitions.
Finished structural reductions, in 2 iterations. Remains : 318/5622 places, 1317/5449 transitions.
Support contains 54 out of 318 places after structural reductions.
[2022-05-17 14:14:50] [INFO ] Flatten gal took : 121 ms
[2022-05-17 14:14:51] [INFO ] Flatten gal took : 69 ms
[2022-05-17 14:14:51] [INFO ] Input system was already deterministic with 1317 transitions.
Support contains 52 out of 318 places (down from 54) after GAL structural reductions.
Finished random walk after 9346 steps, including 504 resets, run visited all 33 properties in 398 ms. (steps per millisecond=23 )
Computed a total of 318 stabilizing places and 1317 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 318 transition count 1317
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(X(p0))||G(p1)))&&(F(p2) U p3)))'
Support contains 7 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 1317/1317 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 291 transition count 1290
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 291 transition count 1290
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 77 place count 268 transition count 1267
Iterating global reduction 0 with 23 rules applied. Total rules applied 100 place count 268 transition count 1267
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 106 place count 262 transition count 1267
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 126 place count 242 transition count 1247
Iterating global reduction 1 with 20 rules applied. Total rules applied 146 place count 242 transition count 1247
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 153 place count 235 transition count 1247
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 173 place count 215 transition count 1227
Iterating global reduction 2 with 20 rules applied. Total rules applied 193 place count 215 transition count 1227
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 206 place count 202 transition count 1214
Iterating global reduction 2 with 13 rules applied. Total rules applied 219 place count 202 transition count 1214
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 232 place count 189 transition count 1201
Iterating global reduction 2 with 13 rules applied. Total rules applied 245 place count 189 transition count 1201
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 276 place count 158 transition count 1170
Iterating global reduction 2 with 31 rules applied. Total rules applied 307 place count 158 transition count 1170
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 330 place count 135 transition count 1147
Iterating global reduction 2 with 23 rules applied. Total rules applied 353 place count 135 transition count 1147
Applied a total of 353 rules in 47 ms. Remains 135 /318 variables (removed 183) and now considering 1147/1317 (removed 170) transitions.
[2022-05-17 14:14:52] [INFO ] Flow matrix only has 180 transitions (discarded 967 similar events)
// Phase 1: matrix 180 rows 135 cols
[2022-05-17 14:14:52] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 14:14:52] [INFO ] Implicit Places using invariants in 126 ms returned [36, 60, 66, 119]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 139 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/318 places, 1147/1317 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 118 transition count 1134
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 118 transition count 1134
Applied a total of 26 rules in 10 ms. Remains 118 /131 variables (removed 13) and now considering 1134/1147 (removed 13) transitions.
[2022-05-17 14:14:52] [INFO ] Flow matrix only has 164 transitions (discarded 970 similar events)
// Phase 1: matrix 164 rows 118 cols
[2022-05-17 14:14:52] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 14:14:52] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-05-17 14:14:52] [INFO ] Flow matrix only has 164 transitions (discarded 970 similar events)
// Phase 1: matrix 164 rows 118 cols
[2022-05-17 14:14:52] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 14:14:52] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 118/318 places, 1134/1317 transitions.
Finished structural reductions, in 2 iterations. Remains : 118/318 places, 1134/1317 transitions.
Stuttering acceptance computed with spot in 421 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(GEQ s21 1), p2:(AND (GEQ s90 1) (GEQ s96 1)), p1:(OR (LT s70 1) (LT s72 1)), p0:(OR (LT s35 1) (LT s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 3 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-00 finished in 965 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(X(p0))&&F(p1)) U p2))'
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 1317/1317 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 290 transition count 1289
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 290 transition count 1289
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 80 place count 266 transition count 1265
Iterating global reduction 0 with 24 rules applied. Total rules applied 104 place count 266 transition count 1265
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 112 place count 258 transition count 1265
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 137 place count 233 transition count 1240
Iterating global reduction 1 with 25 rules applied. Total rules applied 162 place count 233 transition count 1240
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 170 place count 225 transition count 1240
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 194 place count 201 transition count 1216
Iterating global reduction 2 with 24 rules applied. Total rules applied 218 place count 201 transition count 1216
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 234 place count 185 transition count 1200
Iterating global reduction 2 with 16 rules applied. Total rules applied 250 place count 185 transition count 1200
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 266 place count 169 transition count 1184
Iterating global reduction 2 with 16 rules applied. Total rules applied 282 place count 169 transition count 1184
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 322 place count 129 transition count 1144
Iterating global reduction 2 with 40 rules applied. Total rules applied 362 place count 129 transition count 1144
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 387 place count 104 transition count 1119
Iterating global reduction 2 with 25 rules applied. Total rules applied 412 place count 104 transition count 1119
Applied a total of 412 rules in 36 ms. Remains 104 /318 variables (removed 214) and now considering 1119/1317 (removed 198) transitions.
[2022-05-17 14:14:52] [INFO ] Flow matrix only has 106 transitions (discarded 1013 similar events)
// Phase 1: matrix 106 rows 104 cols
[2022-05-17 14:14:52] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 14:14:53] [INFO ] Implicit Places using invariants in 104 ms returned [28, 36, 54, 60]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 106 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/318 places, 1119/1317 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 92 transition count 1111
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 92 transition count 1111
Applied a total of 16 rules in 7 ms. Remains 92 /100 variables (removed 8) and now considering 1111/1119 (removed 8) transitions.
[2022-05-17 14:14:53] [INFO ] Flow matrix only has 95 transitions (discarded 1016 similar events)
// Phase 1: matrix 95 rows 92 cols
[2022-05-17 14:14:53] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:14:53] [INFO ] Implicit Places using invariants in 85 ms returned []
[2022-05-17 14:14:53] [INFO ] Flow matrix only has 95 transitions (discarded 1016 similar events)
// Phase 1: matrix 95 rows 92 cols
[2022-05-17 14:14:53] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-17 14:14:53] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/318 places, 1111/1317 transitions.
Finished structural reductions, in 2 iterations. Remains : 92/318 places, 1111/1317 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (NOT p1), (NOT p0), true]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s22 1), p1:(GEQ s26 1), p0:(AND (GEQ s61 1) (GEQ s79 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 18 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-02 finished in 538 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(F(X((p0 U X(p1)))))&&X(F(!p0))))))'
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 1317/1317 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 289 transition count 1288
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 289 transition count 1288
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 82 place count 265 transition count 1264
Iterating global reduction 0 with 24 rules applied. Total rules applied 106 place count 265 transition count 1264
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 113 place count 258 transition count 1264
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 136 place count 235 transition count 1241
Iterating global reduction 1 with 23 rules applied. Total rules applied 159 place count 235 transition count 1241
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 166 place count 228 transition count 1241
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 187 place count 207 transition count 1220
Iterating global reduction 2 with 21 rules applied. Total rules applied 208 place count 207 transition count 1220
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 222 place count 193 transition count 1206
Iterating global reduction 2 with 14 rules applied. Total rules applied 236 place count 193 transition count 1206
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 250 place count 179 transition count 1192
Iterating global reduction 2 with 14 rules applied. Total rules applied 264 place count 179 transition count 1192
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 301 place count 142 transition count 1155
Iterating global reduction 2 with 37 rules applied. Total rules applied 338 place count 142 transition count 1155
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 357 place count 123 transition count 1136
Iterating global reduction 2 with 19 rules applied. Total rules applied 376 place count 123 transition count 1136
Applied a total of 376 rules in 33 ms. Remains 123 /318 variables (removed 195) and now considering 1136/1317 (removed 181) transitions.
[2022-05-17 14:14:53] [INFO ] Flow matrix only has 152 transitions (discarded 984 similar events)
// Phase 1: matrix 152 rows 123 cols
[2022-05-17 14:14:53] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-17 14:14:53] [INFO ] Implicit Places using invariants in 112 ms returned [39, 45, 63, 69, 99, 103]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 113 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/318 places, 1136/1317 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 100 transition count 1119
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 100 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 99 transition count 1118
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 99 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 98 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 98 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 97 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 97 transition count 1116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 96 transition count 1115
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 96 transition count 1115
Applied a total of 42 rules in 17 ms. Remains 96 /117 variables (removed 21) and now considering 1115/1136 (removed 21) transitions.
[2022-05-17 14:14:53] [INFO ] Flow matrix only has 112 transitions (discarded 1003 similar events)
// Phase 1: matrix 112 rows 96 cols
[2022-05-17 14:14:53] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:14:53] [INFO ] Implicit Places using invariants in 95 ms returned []
[2022-05-17 14:14:53] [INFO ] Flow matrix only has 112 transitions (discarded 1003 similar events)
// Phase 1: matrix 112 rows 96 cols
[2022-05-17 14:14:53] [INFO ] Computed 3 place invariants in 9 ms
[2022-05-17 14:14:53] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 96/318 places, 1115/1317 transitions.
Finished structural reductions, in 2 iterations. Remains : 96/318 places, 1115/1317 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LT s84 1), p1:(LT s21 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, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 51 steps with 2 reset in 3 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-04 finished in 746 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(!(p1 U X(p2)))||p0))))'
Support contains 6 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 1317/1317 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 289 transition count 1288
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 289 transition count 1288
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 82 place count 265 transition count 1264
Iterating global reduction 0 with 24 rules applied. Total rules applied 106 place count 265 transition count 1264
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 113 place count 258 transition count 1264
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 135 place count 236 transition count 1242
Iterating global reduction 1 with 22 rules applied. Total rules applied 157 place count 236 transition count 1242
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 164 place count 229 transition count 1242
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 186 place count 207 transition count 1220
Iterating global reduction 2 with 22 rules applied. Total rules applied 208 place count 207 transition count 1220
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 222 place count 193 transition count 1206
Iterating global reduction 2 with 14 rules applied. Total rules applied 236 place count 193 transition count 1206
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 250 place count 179 transition count 1192
Iterating global reduction 2 with 14 rules applied. Total rules applied 264 place count 179 transition count 1192
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 299 place count 144 transition count 1157
Iterating global reduction 2 with 35 rules applied. Total rules applied 334 place count 144 transition count 1157
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 357 place count 121 transition count 1134
Iterating global reduction 2 with 23 rules applied. Total rules applied 380 place count 121 transition count 1134
Applied a total of 380 rules in 40 ms. Remains 121 /318 variables (removed 197) and now considering 1134/1317 (removed 183) transitions.
[2022-05-17 14:14:54] [INFO ] Flow matrix only has 150 transitions (discarded 984 similar events)
// Phase 1: matrix 150 rows 121 cols
[2022-05-17 14:14:54] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-17 14:14:54] [INFO ] Implicit Places using invariants in 116 ms returned [35, 41, 59, 65, 95]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 118 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/318 places, 1134/1317 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 102 transition count 1120
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 102 transition count 1120
Applied a total of 28 rules in 7 ms. Remains 102 /116 variables (removed 14) and now considering 1120/1134 (removed 14) transitions.
[2022-05-17 14:14:54] [INFO ] Flow matrix only has 132 transitions (discarded 988 similar events)
// Phase 1: matrix 132 rows 102 cols
[2022-05-17 14:14:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:14:54] [INFO ] Implicit Places using invariants in 94 ms returned []
[2022-05-17 14:14:54] [INFO ] Flow matrix only has 132 transitions (discarded 988 similar events)
// Phase 1: matrix 132 rows 102 cols
[2022-05-17 14:14:54] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 14:14:54] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/318 places, 1120/1317 transitions.
Finished structural reductions, in 2 iterations. Remains : 102/318 places, 1120/1317 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s34 1) (LT s41 1)), p1:(AND (GEQ s34 1) (GEQ s41 1)), p2:(OR (AND (GEQ s89 1) (GEQ s91 1)) (AND (GEQ s34 1) (GEQ s41 1)) (AND (GEQ s23 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 48074 reset in 354 ms.
Product exploration explored 100000 steps with 48103 reset in 331 ms.
Computed a total of 102 stabilizing places and 1120 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 102 transition count 1120
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 327 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-05 finished in 1756 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X((!(p0 U p1)&&!p1))||p2)))))'
Support contains 5 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 1317/1317 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 289 transition count 1288
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 289 transition count 1288
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 82 place count 265 transition count 1264
Iterating global reduction 0 with 24 rules applied. Total rules applied 106 place count 265 transition count 1264
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 113 place count 258 transition count 1264
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 135 place count 236 transition count 1242
Iterating global reduction 1 with 22 rules applied. Total rules applied 157 place count 236 transition count 1242
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 164 place count 229 transition count 1242
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 185 place count 208 transition count 1221
Iterating global reduction 2 with 21 rules applied. Total rules applied 206 place count 208 transition count 1221
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 220 place count 194 transition count 1207
Iterating global reduction 2 with 14 rules applied. Total rules applied 234 place count 194 transition count 1207
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 248 place count 180 transition count 1193
Iterating global reduction 2 with 14 rules applied. Total rules applied 262 place count 180 transition count 1193
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 296 place count 146 transition count 1159
Iterating global reduction 2 with 34 rules applied. Total rules applied 330 place count 146 transition count 1159
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 352 place count 124 transition count 1137
Iterating global reduction 2 with 22 rules applied. Total rules applied 374 place count 124 transition count 1137
Applied a total of 374 rules in 46 ms. Remains 124 /318 variables (removed 194) and now considering 1137/1317 (removed 180) transitions.
[2022-05-17 14:14:55] [INFO ] Flow matrix only has 153 transitions (discarded 984 similar events)
// Phase 1: matrix 153 rows 124 cols
[2022-05-17 14:14:55] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-17 14:14:56] [INFO ] Implicit Places using invariants in 110 ms returned [38, 44, 62, 68, 98]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 111 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/318 places, 1137/1317 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 103 transition count 1121
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 103 transition count 1121
Applied a total of 32 rules in 7 ms. Remains 103 /119 variables (removed 16) and now considering 1121/1137 (removed 16) transitions.
[2022-05-17 14:14:56] [INFO ] Flow matrix only has 133 transitions (discarded 988 similar events)
// Phase 1: matrix 133 rows 103 cols
[2022-05-17 14:14:56] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 14:14:56] [INFO ] Implicit Places using invariants in 99 ms returned []
[2022-05-17 14:14:56] [INFO ] Flow matrix only has 133 transitions (discarded 988 similar events)
// Phase 1: matrix 133 rows 103 cols
[2022-05-17 14:14:56] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:14:56] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/318 places, 1121/1317 transitions.
Finished structural reductions, in 2 iterations. Remains : 103/318 places, 1121/1317 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (AND p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p2:(GEQ s90 1), p1:(AND (GEQ s35 1) (GEQ s78 1)), p0:(AND (GEQ s19 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1124 steps with 224 reset in 10 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-06 finished in 653 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X(F(G((G(p0) U p1))))))))'
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 1317/1317 transitions.
Graph (complete) has 2122 edges and 318 vertex of which 317 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 317 transition count 1283
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 284 transition count 1283
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 67 place count 284 transition count 1266
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 101 place count 267 transition count 1266
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 120 place count 248 transition count 1247
Iterating global reduction 2 with 19 rules applied. Total rules applied 139 place count 248 transition count 1247
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 147 place count 240 transition count 1239
Iterating global reduction 2 with 8 rules applied. Total rules applied 155 place count 240 transition count 1239
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 161 place count 234 transition count 1239
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 161 place count 234 transition count 1233
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 173 place count 228 transition count 1233
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 179 place count 222 transition count 1227
Iterating global reduction 3 with 6 rules applied. Total rules applied 185 place count 222 transition count 1227
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 191 place count 216 transition count 1221
Iterating global reduction 3 with 6 rules applied. Total rules applied 197 place count 216 transition count 1221
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 217 place count 196 transition count 1201
Iterating global reduction 3 with 20 rules applied. Total rules applied 237 place count 196 transition count 1201
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 307 place count 161 transition count 1166
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 321 place count 147 transition count 1152
Iterating global reduction 3 with 14 rules applied. Total rules applied 335 place count 147 transition count 1152
Applied a total of 335 rules in 142 ms. Remains 147 /318 variables (removed 171) and now considering 1152/1317 (removed 165) transitions.
[2022-05-17 14:14:56] [INFO ] Flow matrix only has 294 transitions (discarded 858 similar events)
// Phase 1: matrix 294 rows 147 cols
[2022-05-17 14:14:56] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 14:14:56] [INFO ] Implicit Places using invariants in 131 ms returned [11, 18, 23, 30, 35, 41, 43, 58, 66, 74, 80, 117, 129]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 134 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/318 places, 1152/1317 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 108 transition count 1126
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 108 transition count 1126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 102 transition count 1120
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 102 transition count 1120
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 96 transition count 1114
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 96 transition count 1114
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 92 place count 88 transition count 1106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 86 transition count 1104
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 86 transition count 1104
Applied a total of 96 rules in 41 ms. Remains 86 /134 variables (removed 48) and now considering 1104/1152 (removed 48) transitions.
[2022-05-17 14:14:56] [INFO ] Flow matrix only has 115 transitions (discarded 989 similar events)
// Phase 1: matrix 115 rows 86 cols
[2022-05-17 14:14:56] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:14:57] [INFO ] Implicit Places using invariants in 91 ms returned []
[2022-05-17 14:14:57] [INFO ] Flow matrix only has 115 transitions (discarded 989 similar events)
// Phase 1: matrix 115 rows 86 cols
[2022-05-17 14:14:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 14:14:57] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/318 places, 1104/1317 transitions.
Finished structural reductions, in 2 iterations. Remains : 86/318 places, 1104/1317 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s15 1) (LT s41 1)), p0:(AND (GEQ s74 1) (GEQ s76 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 10373 reset in 379 ms.
Product exploration explored 100000 steps with 10368 reset in 403 ms.
Computed a total of 86 stabilizing places and 1104 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 1104
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (OR p1 p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (OR p1 p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 13 factoid took 277 ms. Reduced automaton from 3 states, 11 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-07 finished in 1868 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F(G(F(p0))) U (X(p1) U (G(p2)||p3))))'
Support contains 6 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 1317/1317 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 290 transition count 1289
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 290 transition count 1289
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 80 place count 266 transition count 1265
Iterating global reduction 0 with 24 rules applied. Total rules applied 104 place count 266 transition count 1265
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 111 place count 259 transition count 1265
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 134 place count 236 transition count 1242
Iterating global reduction 1 with 23 rules applied. Total rules applied 157 place count 236 transition count 1242
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 164 place count 229 transition count 1242
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 185 place count 208 transition count 1221
Iterating global reduction 2 with 21 rules applied. Total rules applied 206 place count 208 transition count 1221
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 220 place count 194 transition count 1207
Iterating global reduction 2 with 14 rules applied. Total rules applied 234 place count 194 transition count 1207
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 248 place count 180 transition count 1193
Iterating global reduction 2 with 14 rules applied. Total rules applied 262 place count 180 transition count 1193
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 299 place count 143 transition count 1156
Iterating global reduction 2 with 37 rules applied. Total rules applied 336 place count 143 transition count 1156
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 358 place count 121 transition count 1134
Iterating global reduction 2 with 22 rules applied. Total rules applied 380 place count 121 transition count 1134
Applied a total of 380 rules in 42 ms. Remains 121 /318 variables (removed 197) and now considering 1134/1317 (removed 183) transitions.
[2022-05-17 14:14:58] [INFO ] Flow matrix only has 151 transitions (discarded 983 similar events)
// Phase 1: matrix 151 rows 121 cols
[2022-05-17 14:14:58] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-17 14:14:58] [INFO ] Implicit Places using invariants in 106 ms returned [37, 43, 61, 97, 101]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 108 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/318 places, 1134/1317 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 105 transition count 1123
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 105 transition count 1123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 104 transition count 1122
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 104 transition count 1122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 103 transition count 1121
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 103 transition count 1121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 102 transition count 1120
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 102 transition count 1120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 100 transition count 1118
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 100 transition count 1118
Applied a total of 32 rules in 14 ms. Remains 100 /116 variables (removed 16) and now considering 1118/1134 (removed 16) transitions.
[2022-05-17 14:14:58] [INFO ] Flow matrix only has 116 transitions (discarded 1002 similar events)
// Phase 1: matrix 116 rows 100 cols
[2022-05-17 14:14:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 14:14:58] [INFO ] Implicit Places using invariants in 97 ms returned []
[2022-05-17 14:14:58] [INFO ] Flow matrix only has 116 transitions (discarded 1002 similar events)
// Phase 1: matrix 116 rows 100 cols
[2022-05-17 14:14:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 14:14:58] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/318 places, 1118/1317 transitions.
Finished structural reductions, in 2 iterations. Remains : 100/318 places, 1118/1317 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR p2 p3), true, p2, (OR (AND p0 p3) (AND p0 p2)), (OR (AND p1 p2) (AND p1 p3)), p0, (AND p2 p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}, { cond=p3, acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND p3 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(AND (GEQ s17 1) (GEQ s86 1)), p2:(AND (GEQ s30 1) (GEQ s56 1)), p0:(GEQ s25 1), p1:(GEQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9875 reset in 292 ms.
Product exploration explored 100000 steps with 9911 reset in 246 ms.
Computed a total of 100 stabilizing places and 1118 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 100 transition count 1118
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND p3 p1))), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p3) p2 p1))), (X (X (NOT (AND p0 (NOT p3) p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p3) p2 p1)))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p3)), (X p3), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))
Knowledge based reduction with 17 factoid took 875 ms. Reduced automaton from 7 states, 16 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-08 finished in 2214 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 1317/1317 transitions.
Graph (complete) has 2122 edges and 318 vertex of which 317 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 317 transition count 1281
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 282 transition count 1281
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 71 place count 282 transition count 1264
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 105 place count 265 transition count 1264
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 126 place count 244 transition count 1243
Iterating global reduction 2 with 21 rules applied. Total rules applied 147 place count 244 transition count 1243
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 156 place count 235 transition count 1234
Iterating global reduction 2 with 9 rules applied. Total rules applied 165 place count 235 transition count 1234
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 2 with 7 rules applied. Total rules applied 172 place count 228 transition count 1234
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 172 place count 228 transition count 1227
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 186 place count 221 transition count 1227
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 193 place count 214 transition count 1220
Iterating global reduction 3 with 7 rules applied. Total rules applied 200 place count 214 transition count 1220
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 207 place count 207 transition count 1213
Iterating global reduction 3 with 7 rules applied. Total rules applied 214 place count 207 transition count 1213
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 236 place count 185 transition count 1191
Iterating global reduction 3 with 22 rules applied. Total rules applied 258 place count 185 transition count 1191
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 324 place count 152 transition count 1158
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 338 place count 138 transition count 1144
Iterating global reduction 3 with 14 rules applied. Total rules applied 352 place count 138 transition count 1144
Applied a total of 352 rules in 76 ms. Remains 138 /318 variables (removed 180) and now considering 1144/1317 (removed 173) transitions.
[2022-05-17 14:15:00] [INFO ] Flow matrix only has 270 transitions (discarded 874 similar events)
// Phase 1: matrix 270 rows 138 cols
[2022-05-17 14:15:00] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-17 14:15:00] [INFO ] Implicit Places using invariants in 148 ms returned [11, 18, 23, 30, 33, 39, 41, 66, 74, 80, 82, 115, 121]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 150 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/318 places, 1144/1317 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 99 transition count 1118
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 99 transition count 1118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 93 transition count 1112
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 93 transition count 1112
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 87 transition count 1106
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 87 transition count 1106
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 90 place count 80 transition count 1099
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 78 transition count 1097
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 78 transition count 1097
Applied a total of 94 rules in 33 ms. Remains 78 /125 variables (removed 47) and now considering 1097/1144 (removed 47) transitions.
[2022-05-17 14:15:00] [INFO ] Flow matrix only has 91 transitions (discarded 1006 similar events)
// Phase 1: matrix 91 rows 78 cols
[2022-05-17 14:15:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:15:01] [INFO ] Implicit Places using invariants in 93 ms returned []
[2022-05-17 14:15:01] [INFO ] Flow matrix only has 91 transitions (discarded 1006 similar events)
// Phase 1: matrix 91 rows 78 cols
[2022-05-17 14:15:01] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:15:01] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/318 places, 1097/1317 transitions.
Finished structural reductions, in 2 iterations. Remains : 78/318 places, 1097/1317 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(AND (GEQ s24 1) (GEQ s49 1)), p0:(LT s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 498 steps with 57 reset in 5 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-09 finished in 613 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)&&X(p1)))))'
Support contains 6 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 1317/1317 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 290 transition count 1289
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 290 transition count 1289
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 81 place count 265 transition count 1264
Iterating global reduction 0 with 25 rules applied. Total rules applied 106 place count 265 transition count 1264
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 113 place count 258 transition count 1264
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 136 place count 235 transition count 1241
Iterating global reduction 1 with 23 rules applied. Total rules applied 159 place count 235 transition count 1241
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 167 place count 227 transition count 1241
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 190 place count 204 transition count 1218
Iterating global reduction 2 with 23 rules applied. Total rules applied 213 place count 204 transition count 1218
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 228 place count 189 transition count 1203
Iterating global reduction 2 with 15 rules applied. Total rules applied 243 place count 189 transition count 1203
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 258 place count 174 transition count 1188
Iterating global reduction 2 with 15 rules applied. Total rules applied 273 place count 174 transition count 1188
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 310 place count 137 transition count 1151
Iterating global reduction 2 with 37 rules applied. Total rules applied 347 place count 137 transition count 1151
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 372 place count 112 transition count 1126
Iterating global reduction 2 with 25 rules applied. Total rules applied 397 place count 112 transition count 1126
Applied a total of 397 rules in 50 ms. Remains 112 /318 variables (removed 206) and now considering 1126/1317 (removed 191) transitions.
[2022-05-17 14:15:01] [INFO ] Flow matrix only has 128 transitions (discarded 998 similar events)
// Phase 1: matrix 128 rows 112 cols
[2022-05-17 14:15:01] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 14:15:01] [INFO ] Implicit Places using invariants in 107 ms returned [33, 58, 98]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 108 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/318 places, 1126/1317 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 101 transition count 1118
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 101 transition count 1118
Applied a total of 16 rules in 12 ms. Remains 101 /109 variables (removed 8) and now considering 1118/1126 (removed 8) transitions.
[2022-05-17 14:15:01] [INFO ] Flow matrix only has 118 transitions (discarded 1000 similar events)
// Phase 1: matrix 118 rows 101 cols
[2022-05-17 14:15:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:15:01] [INFO ] Implicit Places using invariants in 103 ms returned []
[2022-05-17 14:15:01] [INFO ] Flow matrix only has 118 transitions (discarded 1000 similar events)
// Phase 1: matrix 118 rows 101 cols
[2022-05-17 14:15:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:15:01] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 101/318 places, 1118/1317 transitions.
Finished structural reductions, in 2 iterations. Remains : 101/318 places, 1118/1317 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (OR (AND (GEQ s35 1) (GEQ s47 1)) (AND (GEQ s81 1) (GEQ s83 1))) (GEQ s81 1) (GEQ s83 1)) (AND (GEQ s5 1) (GEQ s24 1))), p1:(OR (LT s5 1) (LT ...], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-10 finished in 563 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 1317/1317 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 288 transition count 1287
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 288 transition count 1287
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 85 place count 263 transition count 1262
Iterating global reduction 0 with 25 rules applied. Total rules applied 110 place count 263 transition count 1262
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 117 place count 256 transition count 1262
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 140 place count 233 transition count 1239
Iterating global reduction 1 with 23 rules applied. Total rules applied 163 place count 233 transition count 1239
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 171 place count 225 transition count 1239
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 194 place count 202 transition count 1216
Iterating global reduction 2 with 23 rules applied. Total rules applied 217 place count 202 transition count 1216
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 232 place count 187 transition count 1201
Iterating global reduction 2 with 15 rules applied. Total rules applied 247 place count 187 transition count 1201
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 262 place count 172 transition count 1186
Iterating global reduction 2 with 15 rules applied. Total rules applied 277 place count 172 transition count 1186
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 314 place count 135 transition count 1149
Iterating global reduction 2 with 37 rules applied. Total rules applied 351 place count 135 transition count 1149
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 376 place count 110 transition count 1124
Iterating global reduction 2 with 25 rules applied. Total rules applied 401 place count 110 transition count 1124
Applied a total of 401 rules in 40 ms. Remains 110 /318 variables (removed 208) and now considering 1124/1317 (removed 193) transitions.
[2022-05-17 14:15:01] [INFO ] Flow matrix only has 124 transitions (discarded 1000 similar events)
// Phase 1: matrix 124 rows 110 cols
[2022-05-17 14:15:01] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 14:15:02] [INFO ] Implicit Places using invariants in 110 ms returned [26, 32, 50, 56, 96]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 111 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/318 places, 1124/1317 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 1112
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 1112
Applied a total of 24 rules in 8 ms. Remains 93 /105 variables (removed 12) and now considering 1112/1124 (removed 12) transitions.
[2022-05-17 14:15:02] [INFO ] Flow matrix only has 108 transitions (discarded 1004 similar events)
// Phase 1: matrix 108 rows 93 cols
[2022-05-17 14:15:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 14:15:02] [INFO ] Implicit Places using invariants in 90 ms returned []
[2022-05-17 14:15:02] [INFO ] Flow matrix only has 108 transitions (discarded 1004 similar events)
// Phase 1: matrix 108 rows 93 cols
[2022-05-17 14:15:02] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 14:15:02] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/318 places, 1112/1317 transitions.
Finished structural reductions, in 2 iterations. Remains : 93/318 places, 1112/1317 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s73 1) (LT s75 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]]
Product exploration explored 100000 steps with 50000 reset in 243 ms.
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Computed a total of 93 stabilizing places and 1112 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 93 transition count 1112
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 441 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-11 finished in 1514 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 1 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 1317/1317 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 288 transition count 1287
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 288 transition count 1287
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 85 place count 263 transition count 1262
Iterating global reduction 0 with 25 rules applied. Total rules applied 110 place count 263 transition count 1262
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 118 place count 255 transition count 1262
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 143 place count 230 transition count 1237
Iterating global reduction 1 with 25 rules applied. Total rules applied 168 place count 230 transition count 1237
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 176 place count 222 transition count 1237
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 200 place count 198 transition count 1213
Iterating global reduction 2 with 24 rules applied. Total rules applied 224 place count 198 transition count 1213
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 240 place count 182 transition count 1197
Iterating global reduction 2 with 16 rules applied. Total rules applied 256 place count 182 transition count 1197
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 272 place count 166 transition count 1181
Iterating global reduction 2 with 16 rules applied. Total rules applied 288 place count 166 transition count 1181
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 328 place count 126 transition count 1141
Iterating global reduction 2 with 40 rules applied. Total rules applied 368 place count 126 transition count 1141
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 393 place count 101 transition count 1116
Iterating global reduction 2 with 25 rules applied. Total rules applied 418 place count 101 transition count 1116
Applied a total of 418 rules in 37 ms. Remains 101 /318 variables (removed 217) and now considering 1116/1317 (removed 201) transitions.
[2022-05-17 14:15:03] [INFO ] Flow matrix only has 101 transitions (discarded 1015 similar events)
// Phase 1: matrix 101 rows 101 cols
[2022-05-17 14:15:03] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-17 14:15:03] [INFO ] Implicit Places using invariants in 110 ms returned [26, 32, 52, 58, 88]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 111 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 96/318 places, 1116/1317 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 86 transition count 1106
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 86 transition count 1106
Applied a total of 20 rules in 11 ms. Remains 86 /96 variables (removed 10) and now considering 1106/1116 (removed 10) transitions.
[2022-05-17 14:15:03] [INFO ] Flow matrix only has 87 transitions (discarded 1019 similar events)
// Phase 1: matrix 87 rows 86 cols
[2022-05-17 14:15:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 14:15:03] [INFO ] Implicit Places using invariants in 97 ms returned []
[2022-05-17 14:15:03] [INFO ] Flow matrix only has 87 transitions (discarded 1019 similar events)
// Phase 1: matrix 87 rows 86 cols
[2022-05-17 14:15:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 14:15:03] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 86/318 places, 1106/1317 transitions.
Finished structural reductions, in 2 iterations. Remains : 86/318 places, 1106/1317 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LT s29 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 264 ms.
Product exploration explored 100000 steps with 33333 reset in 272 ms.
Computed a total of 86 stabilizing places and 1106 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 1106
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-12 finished in 1212 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((((F(p0)||p1)&&F(G(p1)))||p2))||F(p3)))'
Support contains 5 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 1317/1317 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 291 transition count 1290
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 291 transition count 1290
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 76 place count 269 transition count 1268
Iterating global reduction 0 with 22 rules applied. Total rules applied 98 place count 269 transition count 1268
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 105 place count 262 transition count 1268
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 127 place count 240 transition count 1246
Iterating global reduction 1 with 22 rules applied. Total rules applied 149 place count 240 transition count 1246
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 155 place count 234 transition count 1246
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 174 place count 215 transition count 1227
Iterating global reduction 2 with 19 rules applied. Total rules applied 193 place count 215 transition count 1227
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 206 place count 202 transition count 1214
Iterating global reduction 2 with 13 rules applied. Total rules applied 219 place count 202 transition count 1214
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 232 place count 189 transition count 1201
Iterating global reduction 2 with 13 rules applied. Total rules applied 245 place count 189 transition count 1201
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 278 place count 156 transition count 1168
Iterating global reduction 2 with 33 rules applied. Total rules applied 311 place count 156 transition count 1168
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 332 place count 135 transition count 1147
Iterating global reduction 2 with 21 rules applied. Total rules applied 353 place count 135 transition count 1147
Applied a total of 353 rules in 35 ms. Remains 135 /318 variables (removed 183) and now considering 1147/1317 (removed 170) transitions.
[2022-05-17 14:15:04] [INFO ] Flow matrix only has 180 transitions (discarded 967 similar events)
// Phase 1: matrix 180 rows 135 cols
[2022-05-17 14:15:04] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-17 14:15:04] [INFO ] Implicit Places using invariants in 120 ms returned [26, 42, 81, 87, 119]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 121 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 130/318 places, 1147/1317 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 115 transition count 1132
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 115 transition count 1132
Applied a total of 30 rules in 6 ms. Remains 115 /130 variables (removed 15) and now considering 1132/1147 (removed 15) transitions.
[2022-05-17 14:15:04] [INFO ] Flow matrix only has 161 transitions (discarded 971 similar events)
// Phase 1: matrix 161 rows 115 cols
[2022-05-17 14:15:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 14:15:04] [INFO ] Implicit Places using invariants in 107 ms returned []
[2022-05-17 14:15:04] [INFO ] Flow matrix only has 161 transitions (discarded 971 similar events)
// Phase 1: matrix 161 rows 115 cols
[2022-05-17 14:15:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 14:15:05] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/318 places, 1132/1317 transitions.
Finished structural reductions, in 2 iterations. Remains : 115/318 places, 1132/1317 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(GEQ s56 1), p2:(LT s28 1), p1:(GEQ s79 1), p0:(AND (GEQ s40 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 248 ms.
Product exploration explored 100000 steps with 50000 reset in 255 ms.
Computed a total of 115 stabilizing places and 1132 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 115 transition count 1132
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p3) p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (AND (NOT p3) (NOT p0)))), (F (G (NOT p3))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p3) (NOT p2))))
Knowledge based reduction with 10 factoid took 119 ms. Reduced automaton from 4 states, 6 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-13 finished in 1410 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(p0)&&(X(X(F(p0)))||(G(X(p1))&&p0))))))'
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 1317/1317 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 288 transition count 1287
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 288 transition count 1287
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 85 place count 263 transition count 1262
Iterating global reduction 0 with 25 rules applied. Total rules applied 110 place count 263 transition count 1262
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 118 place count 255 transition count 1262
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 143 place count 230 transition count 1237
Iterating global reduction 1 with 25 rules applied. Total rules applied 168 place count 230 transition count 1237
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 175 place count 223 transition count 1237
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 198 place count 200 transition count 1214
Iterating global reduction 2 with 23 rules applied. Total rules applied 221 place count 200 transition count 1214
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 236 place count 185 transition count 1199
Iterating global reduction 2 with 15 rules applied. Total rules applied 251 place count 185 transition count 1199
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 266 place count 170 transition count 1184
Iterating global reduction 2 with 15 rules applied. Total rules applied 281 place count 170 transition count 1184
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 320 place count 131 transition count 1145
Iterating global reduction 2 with 39 rules applied. Total rules applied 359 place count 131 transition count 1145
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 379 place count 111 transition count 1125
Iterating global reduction 2 with 20 rules applied. Total rules applied 399 place count 111 transition count 1125
Applied a total of 399 rules in 36 ms. Remains 111 /318 variables (removed 207) and now considering 1125/1317 (removed 192) transitions.
[2022-05-17 14:15:06] [INFO ] Flow matrix only has 125 transitions (discarded 1000 similar events)
// Phase 1: matrix 125 rows 111 cols
[2022-05-17 14:15:06] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-17 14:15:06] [INFO ] Implicit Places using invariants in 120 ms returned [26, 32, 45, 61, 67, 97]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 121 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/318 places, 1125/1317 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 90 transition count 1110
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 90 transition count 1110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 89 transition count 1109
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 89 transition count 1109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 88 transition count 1108
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 88 transition count 1108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 87 transition count 1107
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 87 transition count 1107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 86 transition count 1106
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 86 transition count 1106
Applied a total of 38 rules in 16 ms. Remains 86 /105 variables (removed 19) and now considering 1106/1125 (removed 19) transitions.
[2022-05-17 14:15:06] [INFO ] Flow matrix only has 87 transitions (discarded 1019 similar events)
// Phase 1: matrix 87 rows 86 cols
[2022-05-17 14:15:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 14:15:06] [INFO ] Implicit Places using invariants in 92 ms returned []
[2022-05-17 14:15:06] [INFO ] Flow matrix only has 87 transitions (discarded 1019 similar events)
// Phase 1: matrix 87 rows 86 cols
[2022-05-17 14:15:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 14:15:06] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 86/318 places, 1106/1317 transitions.
Finished structural reductions, in 2 iterations. Remains : 86/318 places, 1106/1317 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(GEQ s35 1), p1:(AND (GEQ s20 1) (GEQ s75 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][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C2-LTLFireability-15 finished in 660 ms.
All properties solved by simple procedures.
Total runtime 20088 ms.

BK_STOP 1652796907074

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S32C2, 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 r132-tall-165271821000500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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