Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 31K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 34K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 121K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 5.4K May 11 18:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 11 18:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 11 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 6 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 647K May 12 08:13 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-S08C2-00
FORMULA_NAME LeafsetExtension-PT-S08C2-01
FORMULA_NAME LeafsetExtension-PT-S08C2-02
FORMULA_NAME LeafsetExtension-PT-S08C2-03
FORMULA_NAME LeafsetExtension-PT-S08C2-04
FORMULA_NAME LeafsetExtension-PT-S08C2-05
FORMULA_NAME LeafsetExtension-PT-S08C2-06
FORMULA_NAME LeafsetExtension-PT-S08C2-07
FORMULA_NAME LeafsetExtension-PT-S08C2-08
FORMULA_NAME LeafsetExtension-PT-S08C2-09
FORMULA_NAME LeafsetExtension-PT-S08C2-10
FORMULA_NAME LeafsetExtension-PT-S08C2-11
FORMULA_NAME LeafsetExtension-PT-S08C2-12
FORMULA_NAME LeafsetExtension-PT-S08C2-13
FORMULA_NAME LeafsetExtension-PT-S08C2-14
FORMULA_NAME LeafsetExtension-PT-S08C2-15

=== Now, execution of the tool begins

BK_START 1621299621837

Running Version 0
[2021-05-18 01:00:24] [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]
[2021-05-18 01:00:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 01:00:24] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2021-05-18 01:00:24] [INFO ] Transformed 462 places.
[2021-05-18 01:00:24] [INFO ] Transformed 409 transitions.
[2021-05-18 01:00:24] [INFO ] Parsed PT model containing 462 places and 409 transitions in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-18 01:00:24] [INFO ] Initial state test concluded for 4 properties.
FORMULA LeafsetExtension-PT-S08C2-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C2-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 462 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 462/462 places, 409/409 transitions.
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 377 transition count 409
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 153 place count 309 transition count 341
Iterating global reduction 1 with 68 rules applied. Total rules applied 221 place count 309 transition count 341
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 269 place count 261 transition count 293
Iterating global reduction 1 with 48 rules applied. Total rules applied 317 place count 261 transition count 293
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 360 place count 218 transition count 250
Iterating global reduction 1 with 43 rules applied. Total rules applied 403 place count 218 transition count 250
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 413 place count 208 transition count 250
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 421 place count 200 transition count 242
Iterating global reduction 2 with 8 rules applied. Total rules applied 429 place count 200 transition count 242
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 437 place count 192 transition count 234
Iterating global reduction 2 with 8 rules applied. Total rules applied 445 place count 192 transition count 234
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 453 place count 184 transition count 226
Iterating global reduction 2 with 8 rules applied. Total rules applied 461 place count 184 transition count 226
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 469 place count 176 transition count 218
Iterating global reduction 2 with 8 rules applied. Total rules applied 477 place count 176 transition count 218
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 499 place count 154 transition count 196
Iterating global reduction 2 with 22 rules applied. Total rules applied 521 place count 154 transition count 196
Applied a total of 521 rules in 99 ms. Remains 154 /462 variables (removed 308) and now considering 196/409 (removed 213) transitions.
[2021-05-18 01:00:24] [INFO ] Flow matrix only has 175 transitions (discarded 21 similar events)
// Phase 1: matrix 175 rows 154 cols
[2021-05-18 01:00:24] [INFO ] Computed 20 place invariants in 21 ms
[2021-05-18 01:00:24] [INFO ] Implicit Places using invariants in 168 ms returned [4, 21, 32, 38, 66, 117, 121, 128, 138]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 194 ms to find 9 implicit places.
[2021-05-18 01:00:24] [INFO ] Flow matrix only has 175 transitions (discarded 21 similar events)
// Phase 1: matrix 175 rows 145 cols
[2021-05-18 01:00:24] [INFO ] Computed 11 place invariants in 6 ms
[2021-05-18 01:00:24] [INFO ] Dead Transitions using invariants and state equation in 141 ms returned []
Starting structural reductions, iteration 1 : 145/462 places, 196/409 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 138 transition count 189
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 138 transition count 189
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 136 transition count 187
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 136 transition count 187
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 135 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 135 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 134 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 134 transition count 185
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 131 transition count 182
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 131 transition count 182
Applied a total of 28 rules in 13 ms. Remains 131 /145 variables (removed 14) and now considering 182/196 (removed 14) transitions.
[2021-05-18 01:00:24] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 131 cols
[2021-05-18 01:00:24] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-18 01:00:24] [INFO ] Implicit Places using invariants in 45 ms returned []
[2021-05-18 01:00:24] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 131 cols
[2021-05-18 01:00:24] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-18 01:00:24] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 131/462 places, 182/409 transitions.
[2021-05-18 01:00:25] [INFO ] Flatten gal took : 42 ms
[2021-05-18 01:00:25] [INFO ] Flatten gal took : 19 ms
[2021-05-18 01:00:25] [INFO ] Input system was already deterministic with 182 transitions.
Incomplete random walk after 100000 steps, including 5303 resets, run finished after 348 ms. (steps per millisecond=287 ) properties (out of 31) seen :30
Running SMT prover for 1 properties.
[2021-05-18 01:00:25] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 131 cols
[2021-05-18 01:00:25] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-18 01:00:25] [INFO ] [Real]Absence check using 0 positive and 11 generalized place invariants in 4 ms returned sat
[2021-05-18 01:00:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 01:00:25] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-18 01:00:25] [INFO ] Computed and/alt/rep : 173/269/149 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-18 01:00:25] [INFO ] Added : 6 causal constraints over 2 iterations in 50 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&X((G(p1)||X(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 182/182 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 115 transition count 166
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 115 transition count 166
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 106 transition count 157
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 106 transition count 157
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 104 transition count 157
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 65 place count 91 transition count 144
Iterating global reduction 1 with 13 rules applied. Total rules applied 78 place count 91 transition count 144
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 90 transition count 144
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 89 place count 80 transition count 134
Iterating global reduction 2 with 10 rules applied. Total rules applied 99 place count 80 transition count 134
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 102 place count 77 transition count 131
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 77 transition count 131
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 74 transition count 128
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 74 transition count 128
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 118 place count 67 transition count 121
Iterating global reduction 2 with 7 rules applied. Total rules applied 125 place count 67 transition count 121
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 128 place count 64 transition count 118
Iterating global reduction 2 with 3 rules applied. Total rules applied 131 place count 64 transition count 118
Applied a total of 131 rules in 13 ms. Remains 64 /131 variables (removed 67) and now considering 118/182 (removed 64) transitions.
[2021-05-18 01:00:25] [INFO ] Flow matrix only has 67 transitions (discarded 51 similar events)
// Phase 1: matrix 67 rows 64 cols
[2021-05-18 01:00:25] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-18 01:00:25] [INFO ] Implicit Places using invariants in 47 ms returned [23, 42, 46, 50]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 48 ms to find 4 implicit places.
[2021-05-18 01:00:25] [INFO ] Flow matrix only has 67 transitions (discarded 51 similar events)
// Phase 1: matrix 67 rows 60 cols
[2021-05-18 01:00:25] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 01:00:25] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 60/131 places, 118/182 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 50 transition count 108
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 50 transition count 108
Applied a total of 20 rules in 1 ms. Remains 50 /60 variables (removed 10) and now considering 108/118 (removed 10) transitions.
[2021-05-18 01:00:25] [INFO ] Flow matrix only has 54 transitions (discarded 54 similar events)
// Phase 1: matrix 54 rows 50 cols
[2021-05-18 01:00:25] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-18 01:00:25] [INFO ] Implicit Places using invariants in 35 ms returned []
[2021-05-18 01:00:25] [INFO ] Flow matrix only has 54 transitions (discarded 54 similar events)
// Phase 1: matrix 54 rows 50 cols
[2021-05-18 01:00:25] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-18 01:00:25] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 50/131 places, 108/182 transitions.
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s33 1)), p1:(GEQ s26 1), p2:(AND (GEQ s17 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S08C2-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-00 finished in 572 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||F((F(G(p2))&&p1))||X(F((p0&&X(F(p3)))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 182/182 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 114 transition count 165
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 114 transition count 165
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 104 transition count 155
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 104 transition count 155
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 102 transition count 155
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 69 place count 89 transition count 142
Iterating global reduction 1 with 13 rules applied. Total rules applied 82 place count 89 transition count 142
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 84 place count 87 transition count 142
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 95 place count 76 transition count 131
Iterating global reduction 2 with 11 rules applied. Total rules applied 106 place count 76 transition count 131
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 110 place count 72 transition count 127
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 72 transition count 127
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 118 place count 68 transition count 123
Iterating global reduction 2 with 4 rules applied. Total rules applied 122 place count 68 transition count 123
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 129 place count 61 transition count 116
Iterating global reduction 2 with 7 rules applied. Total rules applied 136 place count 61 transition count 116
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 142 place count 55 transition count 110
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 55 transition count 110
Applied a total of 148 rules in 13 ms. Remains 55 /131 variables (removed 76) and now considering 110/182 (removed 72) transitions.
[2021-05-18 01:00:26] [INFO ] Flow matrix only has 56 transitions (discarded 54 similar events)
// Phase 1: matrix 56 rows 55 cols
[2021-05-18 01:00:26] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-18 01:00:26] [INFO ] Implicit Places using invariants in 32 ms returned [24, 28, 36]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 32 ms to find 3 implicit places.
[2021-05-18 01:00:26] [INFO ] Flow matrix only has 56 transitions (discarded 54 similar events)
// Phase 1: matrix 56 rows 52 cols
[2021-05-18 01:00:26] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 01:00:26] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 52/131 places, 110/182 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 46 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 46 transition count 104
Applied a total of 12 rules in 2 ms. Remains 46 /52 variables (removed 6) and now considering 104/110 (removed 6) transitions.
[2021-05-18 01:00:26] [INFO ] Flow matrix only has 47 transitions (discarded 57 similar events)
// Phase 1: matrix 47 rows 46 cols
[2021-05-18 01:00:26] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-18 01:00:26] [INFO ] Implicit Places using invariants in 26 ms returned []
[2021-05-18 01:00:26] [INFO ] Flow matrix only has 47 transitions (discarded 57 similar events)
// Phase 1: matrix 47 rows 46 cols
[2021-05-18 01:00:26] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-18 01:00:26] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 46/131 places, 104/182 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s19 1), p1:(AND (GEQ s25 1) (GEQ s27 1)), p2:(AND (GEQ s25 1) (GEQ s27 1)), p3:(AND (GEQ s32 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-01 finished in 369 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&(X(X((p1||X(p2))))||G(p3))))], workingDir=/home/mcc/execution]
Support contains 7 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 182/182 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 114 transition count 165
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 114 transition count 165
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 104 transition count 155
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 104 transition count 155
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 102 transition count 155
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 70 place count 88 transition count 141
Iterating global reduction 1 with 14 rules applied. Total rules applied 84 place count 88 transition count 141
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 86 place count 86 transition count 141
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 97 place count 75 transition count 130
Iterating global reduction 2 with 11 rules applied. Total rules applied 108 place count 75 transition count 130
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 111 place count 72 transition count 127
Iterating global reduction 2 with 3 rules applied. Total rules applied 114 place count 72 transition count 127
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 117 place count 69 transition count 124
Iterating global reduction 2 with 3 rules applied. Total rules applied 120 place count 69 transition count 124
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 125 place count 64 transition count 119
Iterating global reduction 2 with 5 rules applied. Total rules applied 130 place count 64 transition count 119
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 136 place count 58 transition count 113
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 58 transition count 113
Applied a total of 142 rules in 9 ms. Remains 58 /131 variables (removed 73) and now considering 113/182 (removed 69) transitions.
[2021-05-18 01:00:26] [INFO ] Flow matrix only has 62 transitions (discarded 51 similar events)
// Phase 1: matrix 62 rows 58 cols
[2021-05-18 01:00:26] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-18 01:00:26] [INFO ] Implicit Places using invariants in 29 ms returned [23, 27, 31, 44]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 30 ms to find 4 implicit places.
[2021-05-18 01:00:26] [INFO ] Flow matrix only has 62 transitions (discarded 51 similar events)
// Phase 1: matrix 62 rows 54 cols
[2021-05-18 01:00:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 01:00:26] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 54/131 places, 113/182 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 44 transition count 103
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 44 transition count 103
Applied a total of 20 rules in 1 ms. Remains 44 /54 variables (removed 10) and now considering 103/113 (removed 10) transitions.
[2021-05-18 01:00:26] [INFO ] Flow matrix only has 49 transitions (discarded 54 similar events)
// Phase 1: matrix 49 rows 44 cols
[2021-05-18 01:00:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 01:00:26] [INFO ] Implicit Places using invariants in 21 ms returned []
[2021-05-18 01:00:26] [INFO ] Flow matrix only has 49 transitions (discarded 54 similar events)
// Phase 1: matrix 49 rows 44 cols
[2021-05-18 01:00:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 01:00:26] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 44/131 places, 103/182 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=p3, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 4}, { cond=p3, acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p3 (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p3), acceptance={} source=9 dest: 6}, { cond=p3, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(AND (GEQ s23 1) (GEQ s33 1)), p3:(LT s39 1), p1:(AND (GEQ s5 1) (GEQ s28 1)), p2:(AND (GEQ s20 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C2-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-02 finished in 401 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 182/182 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 131 transition count 171
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 120 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 119 transition count 170
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 24 place count 119 transition count 160
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 44 place count 109 transition count 160
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 57 place count 96 transition count 147
Iterating global reduction 3 with 13 rules applied. Total rules applied 70 place count 96 transition count 147
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 77 place count 89 transition count 140
Iterating global reduction 3 with 7 rules applied. Total rules applied 84 place count 89 transition count 140
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 88 transition count 140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 85 place count 88 transition count 139
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 87 transition count 139
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 93 place count 81 transition count 133
Iterating global reduction 4 with 6 rules applied. Total rules applied 99 place count 81 transition count 133
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 100 place count 80 transition count 132
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 80 transition count 132
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 104 place count 77 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 107 place count 77 transition count 129
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 137 place count 62 transition count 114
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 140 place count 59 transition count 111
Iterating global reduction 4 with 3 rules applied. Total rules applied 143 place count 59 transition count 111
Applied a total of 143 rules in 35 ms. Remains 59 /131 variables (removed 72) and now considering 111/182 (removed 71) transitions.
[2021-05-18 01:00:27] [INFO ] Flow matrix only has 65 transitions (discarded 46 similar events)
// Phase 1: matrix 65 rows 59 cols
[2021-05-18 01:00:27] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-18 01:00:27] [INFO ] Implicit Places using invariants in 43 ms returned [14, 18, 22, 26, 29, 34, 39]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 43 ms to find 7 implicit places.
[2021-05-18 01:00:27] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-18 01:00:27] [INFO ] Flow matrix only has 65 transitions (discarded 46 similar events)
// Phase 1: matrix 65 rows 52 cols
[2021-05-18 01:00:27] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 01:00:27] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 52/131 places, 111/182 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 41 transition count 100
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 41 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 40 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 40 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 39 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 39 transition count 98
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 36 place count 34 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 33 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 33 transition count 92
Applied a total of 38 rules in 16 ms. Remains 33 /52 variables (removed 19) and now considering 92/111 (removed 19) transitions.
[2021-05-18 01:00:27] [INFO ] Flow matrix only has 35 transitions (discarded 57 similar events)
// Phase 1: matrix 35 rows 33 cols
[2021-05-18 01:00:27] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 01:00:27] [INFO ] Implicit Places using invariants in 25 ms returned []
[2021-05-18 01:00:27] [INFO ] Flow matrix only has 35 transitions (discarded 57 similar events)
// Phase 1: matrix 35 rows 33 cols
[2021-05-18 01:00:27] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 01:00:27] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 33/131 places, 92/182 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s15 1) (AND (GEQ s22 1) (GEQ s24 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10948 reset in 249 ms.
Product exploration explored 100000 steps with 10920 reset in 170 ms.
Graph (complete) has 157 edges and 33 vertex of which 27 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10971 reset in 150 ms.
Product exploration explored 100000 steps with 10964 reset in 201 ms.
[2021-05-18 01:00:28] [INFO ] Flatten gal took : 5 ms
[2021-05-18 01:00:28] [INFO ] Flatten gal took : 5 ms
[2021-05-18 01:00:28] [INFO ] Time to serialize gal into /tmp/LTL12260147960988228677.gal : 7 ms
[2021-05-18 01:00:28] [INFO ] Time to serialize properties into /tmp/LTL13406526382415143244.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12260147960988228677.gal, -t, CGAL, -LTL, /tmp/LTL13406526382415143244.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12260147960988228677.gal -t CGAL -LTL /tmp/LTL13406526382415143244.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((Node5ManageTheBreakDownOfNode6<1)||((Node7HasAskedItsLeafSetToLxToReplaceNode1>=1)&&(LeafSetOfLxIsSentToNode7>=1)))"))))
Formula 0 simplified : !GF"((Node5ManageTheBreakDownOfNode6<1)||((Node7HasAskedItsLeafSetToLxToReplaceNode1>=1)&&(LeafSetOfLxIsSentToNode7>=1)))"
Reverse transition relation is NOT exact ! Due to transitions t1, t93, t107, t147, t160, t129.t5, t133.t5, t20.t21, t22.t21, t36.t21, t37.t21, t86.t21, t87.t21, t123.t21, t124.t21, t145.t21, t24.t25, t39.t25, t40.t25, t55.t25, t56.t25, t77.t25, t78.t25, t89.t25, t115.t25, t116.t25, t150.t25, t50.t51.t21, t52.t51.t21, t69.t70.t67, t71.t72.t73, t110.t103, t108.t109.t103, t126.t127.t128, t6.t7, t9.t7, t27.t7, t29.t7, t41.t7, t57.t7, t59.t7, t79.t7, t81.t7, t97.t7, t99.t7, t117.t7, t118.t7, t151.t7, t152.t7, t11.t54.t7, t31.t54.t7, t43.t54.t7, t13.t14, t18.t14, t33.t14, t35.t14, t44.t14, t47.t14, t83.t14, t85.t14, t121.t14, t142.t14, t143.t14, t156.t14, t158.t14, t119.t54.t14, t141.t54.t14, t153.t54.t14, t60.t61.t62, t65.t61.t62, t101.t61.t62, t134.t135.t136, t139.t135.t136, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/19/73/92
Computing Next relation with stutter on 77 deadlock states
22 unique states visited
0 strongly connected components in search stack
25 transitions explored
14 items max in DFS search stack
18 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.205281,23720,1,0,312,38666,214,149,1441,35234,384
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S08C2-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property LeafsetExtension-PT-S08C2-03 finished in 1505 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((G(p0)||(p0&&F(p1)))) U (X(G((G(p0)||(p0&&F(p1)))))||(p2&&X((G(p0)||(p0&&F(p1)))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 182/182 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 116 transition count 167
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 116 transition count 167
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 108 transition count 159
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 108 transition count 159
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 107 transition count 159
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 99 transition count 151
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 99 transition count 151
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 97 transition count 151
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 76 place count 86 transition count 140
Iterating global reduction 2 with 11 rules applied. Total rules applied 87 place count 86 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 90 place count 83 transition count 137
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 83 transition count 137
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 96 place count 80 transition count 134
Iterating global reduction 2 with 3 rules applied. Total rules applied 99 place count 80 transition count 134
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 104 place count 75 transition count 129
Iterating global reduction 2 with 5 rules applied. Total rules applied 109 place count 75 transition count 129
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 115 place count 69 transition count 123
Iterating global reduction 2 with 6 rules applied. Total rules applied 121 place count 69 transition count 123
Applied a total of 121 rules in 8 ms. Remains 69 /131 variables (removed 62) and now considering 123/182 (removed 59) transitions.
[2021-05-18 01:00:28] [INFO ] Flow matrix only has 75 transitions (discarded 48 similar events)
// Phase 1: matrix 75 rows 69 cols
[2021-05-18 01:00:28] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-18 01:00:28] [INFO ] Implicit Places using invariants in 34 ms returned [26, 31, 44, 49]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 35 ms to find 4 implicit places.
[2021-05-18 01:00:28] [INFO ] Flow matrix only has 75 transitions (discarded 48 similar events)
// Phase 1: matrix 75 rows 65 cols
[2021-05-18 01:00:28] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 01:00:28] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Starting structural reductions, iteration 1 : 65/131 places, 123/182 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 52 transition count 110
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 52 transition count 110
Applied a total of 26 rules in 2 ms. Remains 52 /65 variables (removed 13) and now considering 110/123 (removed 13) transitions.
[2021-05-18 01:00:28] [INFO ] Flow matrix only has 59 transitions (discarded 51 similar events)
// Phase 1: matrix 59 rows 52 cols
[2021-05-18 01:00:28] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-18 01:00:28] [INFO ] Implicit Places using invariants in 24 ms returned []
[2021-05-18 01:00:28] [INFO ] Flow matrix only has 59 transitions (discarded 51 similar events)
// Phase 1: matrix 59 rows 52 cols
[2021-05-18 01:00:28] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-18 01:00:28] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 52/131 places, 110/182 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 5}, { cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=(AND p2 p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(OR (LT s31 1) (LT s33 1)), p0:(OR (LT s42 1) (LT s47 1)), p2:(OR (LT s18 1) (LT s20 1) (LT s31 1) (LT s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 163 ms.
Product exploration explored 100000 steps with 33333 reset in 168 ms.
Graph (complete) has 194 edges and 52 vertex of which 39 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Knowledge obtained : [p1, p0, p2]
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 147 ms.
Product exploration explored 100000 steps with 33333 reset in 154 ms.
Applying partial POR strategy [true, true, false, false, true, true, false]
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Support contains 6 out of 52 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 52/52 places, 110/110 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 52 transition count 110
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 5 place count 52 transition count 110
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 52 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 50 transition count 108
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 50 transition count 108
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 50 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 48 transition count 106
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 48 transition count 106
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 23 rules in 8 ms. Remains 48 /52 variables (removed 4) and now considering 106/110 (removed 4) transitions.
[2021-05-18 01:00:30] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-18 01:00:30] [INFO ] Flow matrix only has 54 transitions (discarded 52 similar events)
// Phase 1: matrix 54 rows 48 cols
[2021-05-18 01:00:30] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-18 01:00:30] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 48/52 places, 106/110 transitions.
Product exploration explored 100000 steps with 33333 reset in 441 ms.
Product exploration explored 100000 steps with 33333 reset in 357 ms.
[2021-05-18 01:00:31] [INFO ] Flatten gal took : 6 ms
[2021-05-18 01:00:31] [INFO ] Flatten gal took : 5 ms
[2021-05-18 01:00:31] [INFO ] Time to serialize gal into /tmp/LTL13058955062190662351.gal : 2 ms
[2021-05-18 01:00:31] [INFO ] Time to serialize properties into /tmp/LTL3782435284964876131.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13058955062190662351.gal, -t, CGAL, -LTL, /tmp/LTL3782435284964876131.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13058955062190662351.gal -t CGAL -LTL /tmp/LTL3782435284964876131.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X((G("((RequestOfNode8IsSentToRx<1)||(RxIsActiveAndNotInTheLeafSet<1))"))||((F("((Node5HasAskedItsLeafSetToRxToReplaceNode8<1)||(LeafSetOfRxIsSentToNode5<1))"))&&("((RequestOfNode8IsSentToRx<1)||(RxIsActiveAndNotInTheLeafSet<1))"))))U((X(G((G("((RequestOfNode8IsSentToRx<1)||(RxIsActiveAndNotInTheLeafSet<1))"))||(("((RequestOfNode8IsSentToRx<1)||(RxIsActiveAndNotInTheLeafSet<1))")&&(F("((Node5HasAskedItsLeafSetToRxToReplaceNode8<1)||(LeafSetOfRxIsSentToNode5<1))"))))))||((X((G("((RequestOfNode8IsSentToRx<1)||(RxIsActiveAndNotInTheLeafSet<1))"))||(("((RequestOfNode8IsSentToRx<1)||(RxIsActiveAndNotInTheLeafSet<1))")&&(F("((Node5HasAskedItsLeafSetToRxToReplaceNode8<1)||(LeafSetOfRxIsSentToNode5<1))")))))&&("((((NoNodeManageTheBreakDownOfNode2<1)||(Node3WantsToManageTheBreakDownOfNode2<1))||(Node5HasAskedItsLeafSetToRxToReplaceNode8<1))||(LeafSetOfRxIsSentToNode5<1))"))))))
Formula 0 simplified : !X(X(G"((RequestOfNode8IsSentToRx<1)||(RxIsActiveAndNotInTheLeafSet<1))" | ("((RequestOfNode8IsSentToRx<1)||(RxIsActiveAndNotInTheLeafSet<1))" & F"((Node5HasAskedItsLeafSetToRxToReplaceNode8<1)||(LeafSetOfRxIsSentToNode5<1))")) U (XG(G"((RequestOfNode8IsSentToRx<1)||(RxIsActiveAndNotInTheLeafSet<1))" | ("((RequestOfNode8IsSentToRx<1)||(RxIsActiveAndNotInTheLeafSet<1))" & F"((Node5HasAskedItsLeafSetToRxToReplaceNode8<1)||(LeafSetOfRxIsSentToNode5<1))")) | ("((((NoNodeManageTheBreakDownOfNode2<1)||(Node3WantsToManageTheBreakDownOfNode2<1))||(Node5HasAskedItsLeafSetToRxToReplaceNode8<1))||(LeafSetOfRxIsSentToNode5<1))" & X(G"((RequestOfNode8IsSentToRx<1)||(RxIsActiveAndNotInTheLeafSet<1))" | ("((RequestOfNode8IsSentToRx<1)||(RxIsActiveAndNotInTheLeafSet<1))" & F"((Node5HasAskedItsLeafSetToRxToReplaceNode8<1)||(LeafSetOfRxIsSentToNode5<1))")))))
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t7, t9, t11, t13, t18, t20, t22, t24, t29, t31, t33, t35, t36, t37, t39, t40, t41, t43, t44, t47, t50, t52, t54, t55, t56, t58, t59, t60, t65, t69, t71, t77, t78, t80, t81, t83, t85, t86, t87, t89, t93, t99, t101, t104, t105, t108, t113, t115, t116, t118, t119, t121, t123, t124, t126, t130, t139, t141, t142, t143, t145, t147, t150, t152, t153, t156, t158, t160, t181, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/39/71/110
Computing Next relation with stutter on 87 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
16 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.179514,25180,1,0,295,37753,249,116,1949,30343,240
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S08C2-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property LeafsetExtension-PT-S08C2-04 finished in 2715 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G((F(p1)||p0))) U p2))], workingDir=/home/mcc/execution]
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 182/182 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 131 transition count 168
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 117 transition count 168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 28 place count 117 transition count 158
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 48 place count 107 transition count 158
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 62 place count 93 transition count 144
Iterating global reduction 2 with 14 rules applied. Total rules applied 76 place count 93 transition count 144
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 84 place count 85 transition count 136
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 85 transition count 136
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 84 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 93 place count 84 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 83 transition count 135
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 101 place count 77 transition count 129
Iterating global reduction 3 with 6 rules applied. Total rules applied 107 place count 77 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 76 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 76 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 73 transition count 125
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 73 transition count 125
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 145 place count 58 transition count 110
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 55 transition count 107
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 55 transition count 107
Applied a total of 151 rules in 34 ms. Remains 55 /131 variables (removed 76) and now considering 107/182 (removed 75) transitions.
[2021-05-18 01:00:31] [INFO ] Flow matrix only has 61 transitions (discarded 46 similar events)
// Phase 1: matrix 61 rows 55 cols
[2021-05-18 01:00:31] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-18 01:00:31] [INFO ] Implicit Places using invariants in 48 ms returned [14, 18, 22, 26, 29, 33, 38, 40]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 49 ms to find 8 implicit places.
[2021-05-18 01:00:31] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-18 01:00:31] [INFO ] Flow matrix only has 61 transitions (discarded 46 similar events)
// Phase 1: matrix 61 rows 47 cols
[2021-05-18 01:00:31] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-18 01:00:31] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 47/131 places, 107/182 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 35 transition count 95
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 35 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 34 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 34 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 33 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 33 transition count 93
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 40 place count 27 transition count 87
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 25 transition count 85
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 25 transition count 85
Applied a total of 44 rules in 7 ms. Remains 25 /47 variables (removed 22) and now considering 85/107 (removed 22) transitions.
[2021-05-18 01:00:31] [INFO ] Flow matrix only has 23 transitions (discarded 62 similar events)
// Phase 1: matrix 23 rows 25 cols
[2021-05-18 01:00:31] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 01:00:31] [INFO ] Implicit Places using invariants in 17 ms returned []
[2021-05-18 01:00:31] [INFO ] Flow matrix only has 23 transitions (discarded 62 similar events)
// Phase 1: matrix 23 rows 25 cols
[2021-05-18 01:00:31] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 01:00:31] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 25/131 places, 85/182 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-05 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s5 1) (GEQ s20 1)), p0:(OR (LT s5 1) (LT s20 1)), p1:(OR (LT s14 1) (LT s15 1) (LT s14 1) (LT s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 342 steps with 43 reset in 1 ms.
FORMULA LeafsetExtension-PT-S08C2-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-05 finished in 285 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)||(p1&&F(G(p2)))||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 182/182 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 115 transition count 166
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 115 transition count 166
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 107 transition count 158
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 107 transition count 158
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 105 transition count 158
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 92 transition count 145
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 92 transition count 145
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 78 place count 90 transition count 145
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 86 place count 82 transition count 137
Iterating global reduction 2 with 8 rules applied. Total rules applied 94 place count 82 transition count 137
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 78 transition count 133
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 78 transition count 133
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 74 transition count 129
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 74 transition count 129
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 118 place count 66 transition count 121
Iterating global reduction 2 with 8 rules applied. Total rules applied 126 place count 66 transition count 121
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 132 place count 60 transition count 115
Iterating global reduction 2 with 6 rules applied. Total rules applied 138 place count 60 transition count 115
Applied a total of 138 rules in 13 ms. Remains 60 /131 variables (removed 71) and now considering 115/182 (removed 67) transitions.
[2021-05-18 01:00:31] [INFO ] Flow matrix only has 64 transitions (discarded 51 similar events)
// Phase 1: matrix 64 rows 60 cols
[2021-05-18 01:00:31] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-18 01:00:31] [INFO ] Implicit Places using invariants in 35 ms returned [28, 32, 36, 40, 44]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 36 ms to find 5 implicit places.
[2021-05-18 01:00:31] [INFO ] Flow matrix only has 64 transitions (discarded 51 similar events)
// Phase 1: matrix 64 rows 55 cols
[2021-05-18 01:00:31] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-18 01:00:31] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 55/131 places, 115/182 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 42 transition count 102
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 42 transition count 102
Applied a total of 26 rules in 1 ms. Remains 42 /55 variables (removed 13) and now considering 102/115 (removed 13) transitions.
[2021-05-18 01:00:31] [INFO ] Flow matrix only has 47 transitions (discarded 55 similar events)
// Phase 1: matrix 47 rows 42 cols
[2021-05-18 01:00:31] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 01:00:31] [INFO ] Implicit Places using invariants in 21 ms returned []
[2021-05-18 01:00:31] [INFO ] Flow matrix only has 47 transitions (discarded 55 similar events)
// Phase 1: matrix 47 rows 42 cols
[2021-05-18 01:00:31] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-18 01:00:31] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 42/131 places, 102/182 transitions.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=p1, acceptance={} source=6 dest: 6}, { cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 7}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(LT s32 1), p1:(OR (LT s17 1) (LT s28 1)), p2:(LT s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 720 steps with 39 reset in 3 ms.
FORMULA LeafsetExtension-PT-S08C2-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-07 finished in 384 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 182/182 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 131 transition count 169
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 118 transition count 169
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 26 place count 118 transition count 161
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 110 transition count 161
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 54 place count 98 transition count 149
Iterating global reduction 2 with 12 rules applied. Total rules applied 66 place count 98 transition count 149
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 71 place count 93 transition count 144
Iterating global reduction 2 with 5 rules applied. Total rules applied 76 place count 93 transition count 144
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 92 transition count 144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 77 place count 92 transition count 143
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 91 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 83 place count 87 transition count 139
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 87 transition count 139
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 86 transition count 138
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 86 transition count 138
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 83 transition count 135
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 83 transition count 135
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 129 place count 66 transition count 118
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 134 place count 61 transition count 113
Iterating global reduction 3 with 5 rules applied. Total rules applied 139 place count 61 transition count 113
Applied a total of 139 rules in 38 ms. Remains 61 /131 variables (removed 70) and now considering 113/182 (removed 69) transitions.
[2021-05-18 01:00:32] [INFO ] Flow matrix only has 72 transitions (discarded 41 similar events)
// Phase 1: matrix 72 rows 61 cols
[2021-05-18 01:00:32] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-18 01:00:32] [INFO ] Implicit Places using invariants in 46 ms returned [17, 21, 25, 29, 32, 36, 41, 43]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 48 ms to find 8 implicit places.
[2021-05-18 01:00:32] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-18 01:00:32] [INFO ] Flow matrix only has 72 transitions (discarded 41 similar events)
// Phase 1: matrix 72 rows 53 cols
[2021-05-18 01:00:32] [INFO ] Computed 2 place invariants in 9 ms
[2021-05-18 01:00:32] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 53/131 places, 113/182 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 40 transition count 100
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 40 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 39 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 39 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 38 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 38 transition count 98
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 44 place count 31 transition count 91
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 29 transition count 89
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 29 transition count 89
Applied a total of 48 rules in 6 ms. Remains 29 /53 variables (removed 24) and now considering 89/113 (removed 24) transitions.
[2021-05-18 01:00:32] [INFO ] Flow matrix only has 32 transitions (discarded 57 similar events)
// Phase 1: matrix 32 rows 29 cols
[2021-05-18 01:00:32] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-18 01:00:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-18 01:00:32] [INFO ] Flow matrix only has 32 transitions (discarded 57 similar events)
// Phase 1: matrix 32 rows 29 cols
[2021-05-18 01:00:32] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 01:00:32] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 29/131 places, 89/182 transitions.
Stuttering acceptance computed with spot in 28 ms :[true, (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s26 1) (GEQ s22 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][true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-08 finished in 235 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 182/182 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 114 transition count 165
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 114 transition count 165
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 105 transition count 156
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 105 transition count 156
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 103 transition count 156
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 67 place count 90 transition count 143
Iterating global reduction 1 with 13 rules applied. Total rules applied 80 place count 90 transition count 143
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 82 place count 88 transition count 143
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 91 place count 79 transition count 134
Iterating global reduction 2 with 9 rules applied. Total rules applied 100 place count 79 transition count 134
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 75 transition count 130
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 75 transition count 130
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 112 place count 71 transition count 126
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 71 transition count 126
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 124 place count 63 transition count 118
Iterating global reduction 2 with 8 rules applied. Total rules applied 132 place count 63 transition count 118
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 138 place count 57 transition count 112
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 57 transition count 112
Applied a total of 144 rules in 7 ms. Remains 57 /131 variables (removed 74) and now considering 112/182 (removed 70) transitions.
[2021-05-18 01:00:32] [INFO ] Flow matrix only has 61 transitions (discarded 51 similar events)
// Phase 1: matrix 61 rows 57 cols
[2021-05-18 01:00:32] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-18 01:00:32] [INFO ] Implicit Places using invariants in 40 ms returned [27, 31, 36, 44]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 40 ms to find 4 implicit places.
[2021-05-18 01:00:32] [INFO ] Flow matrix only has 61 transitions (discarded 51 similar events)
// Phase 1: matrix 61 rows 53 cols
[2021-05-18 01:00:32] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 01:00:32] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 53/131 places, 112/182 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 44 transition count 103
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 44 transition count 103
Applied a total of 18 rules in 1 ms. Remains 44 /53 variables (removed 9) and now considering 103/112 (removed 9) transitions.
[2021-05-18 01:00:32] [INFO ] Flow matrix only has 49 transitions (discarded 54 similar events)
// Phase 1: matrix 49 rows 44 cols
[2021-05-18 01:00:32] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 01:00:32] [INFO ] Implicit Places using invariants in 25 ms returned []
[2021-05-18 01:00:32] [INFO ] Flow matrix only has 49 transitions (discarded 54 similar events)
// Phase 1: matrix 49 rows 44 cols
[2021-05-18 01:00:32] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 01:00:32] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 44/131 places, 103/182 transitions.
Stuttering acceptance computed with spot in 56 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s25 1) (GEQ s29 1)), p1:(AND (GEQ s20 1) (GEQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-09 finished in 222 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 182/182 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 131 transition count 168
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 117 transition count 168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 28 place count 117 transition count 158
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 48 place count 107 transition count 158
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 62 place count 93 transition count 144
Iterating global reduction 2 with 14 rules applied. Total rules applied 76 place count 93 transition count 144
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 84 place count 85 transition count 136
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 85 transition count 136
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 84 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 93 place count 84 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 83 transition count 135
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 101 place count 77 transition count 129
Iterating global reduction 3 with 6 rules applied. Total rules applied 107 place count 77 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 76 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 76 transition count 128
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 112 place count 73 transition count 125
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 73 transition count 125
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 145 place count 58 transition count 110
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 55 transition count 107
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 55 transition count 107
Applied a total of 151 rules in 24 ms. Remains 55 /131 variables (removed 76) and now considering 107/182 (removed 75) transitions.
[2021-05-18 01:00:32] [INFO ] Flow matrix only has 61 transitions (discarded 46 similar events)
// Phase 1: matrix 61 rows 55 cols
[2021-05-18 01:00:32] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-18 01:00:32] [INFO ] Implicit Places using invariants in 41 ms returned [14, 18, 22, 26, 29, 33, 38, 40]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 42 ms to find 8 implicit places.
[2021-05-18 01:00:32] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-18 01:00:32] [INFO ] Flow matrix only has 61 transitions (discarded 46 similar events)
// Phase 1: matrix 61 rows 47 cols
[2021-05-18 01:00:32] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 01:00:32] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 47/131 places, 107/182 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 35 transition count 95
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 35 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 34 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 34 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 33 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 33 transition count 93
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 40 place count 27 transition count 87
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 25 transition count 85
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 25 transition count 85
Applied a total of 44 rules in 4 ms. Remains 25 /47 variables (removed 22) and now considering 85/107 (removed 22) transitions.
[2021-05-18 01:00:32] [INFO ] Flow matrix only has 23 transitions (discarded 62 similar events)
// Phase 1: matrix 23 rows 25 cols
[2021-05-18 01:00:32] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 01:00:32] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-18 01:00:32] [INFO ] Flow matrix only has 23 transitions (discarded 62 similar events)
// Phase 1: matrix 23 rows 25 cols
[2021-05-18 01:00:32] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 01:00:32] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 25/131 places, 85/182 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S08C2-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S08C2-10 finished in 201 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 182/182 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 113 transition count 164
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 113 transition count 164
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 103 transition count 154
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 103 transition count 154
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 101 transition count 154
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 72 place count 87 transition count 140
Iterating global reduction 1 with 14 rules applied. Total rules applied 86 place count 87 transition count 140
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 88 place count 85 transition count 140
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 100 place count 73 transition count 128
Iterating global reduction 2 with 12 rules applied. Total rules applied 112 place count 73 transition count 128
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 116 place count 69 transition count 124
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 69 transition count 124
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 124 place count 65 transition count 120
Iterating global reduction 2 with 4 rules applied. Total rules applied 128 place count 65 transition count 120
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 136 place count 57 transition count 112
Iterating global reduction 2 with 8 rules applied. Total rules applied 144 place count 57 transition count 112
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 150 place count 51 transition count 106
Iterating global reduction 2 with 6 rules applied. Total rules applied 156 place count 51 transition count 106
Applied a total of 156 rules in 6 ms. Remains 51 /131 variables (removed 80) and now considering 106/182 (removed 76) transitions.
[2021-05-18 01:00:32] [INFO ] Flow matrix only has 50 transitions (discarded 56 similar events)
// Phase 1: matrix 50 rows 51 cols
[2021-05-18 01:00:32] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-18 01:00:32] [INFO ] Implicit Places using invariants in 35 ms returned [22, 26, 30, 34, 38]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 36 ms to find 5 implicit places.
[2021-05-18 01:00:32] [INFO ] Flow matrix only has 50 transitions (discarded 56 similar events)
// Phase 1: matrix 50 rows 46 cols
[2021-05-18 01:00:32] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 01:00:32] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 46/131 places, 106/182 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 36 transition count 96
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 36 transition count 96
Applied a total of 20 rules in 0 ms. Remains 36 /46 variables (removed 10) and now considering 96/106 (removed 10) transitions.
[2021-05-18 01:00:32] [INFO ] Flow matrix only has 36 transitions (discarded 60 similar events)
// Phase 1: matrix 36 rows 36 cols
[2021-05-18 01:00:32] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 01:00:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-18 01:00:32] [INFO ] Flow matrix only has 36 transitions (discarded 60 similar events)
// Phase 1: matrix 36 rows 36 cols
[2021-05-18 01:00:32] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 01:00:32] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 36/131 places, 96/182 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s18 1) (LT s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 43748 reset in 122 ms.
Product exploration explored 100000 steps with 43561 reset in 129 ms.
Graph (complete) has 152 edges and 36 vertex of which 27 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 43579 reset in 122 ms.
Product exploration explored 100000 steps with 43706 reset in 132 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 36 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 36/36 places, 96/96 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 36 transition count 96
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 36 transition count 96
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 36 transition count 96
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 32 transition count 92
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 32 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 32 transition count 92
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 19 rules in 4 ms. Remains 32 /36 variables (removed 4) and now considering 92/96 (removed 4) transitions.
[2021-05-18 01:00:33] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-18 01:00:33] [INFO ] Flow matrix only has 30 transitions (discarded 62 similar events)
// Phase 1: matrix 30 rows 32 cols
[2021-05-18 01:00:33] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 01:00:33] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 32/36 places, 92/96 transitions.
Product exploration explored 100000 steps with 43913 reset in 345 ms.
Product exploration explored 100000 steps with 43923 reset in 327 ms.
[2021-05-18 01:00:34] [INFO ] Flatten gal took : 5 ms
[2021-05-18 01:00:34] [INFO ] Flatten gal took : 5 ms
[2021-05-18 01:00:34] [INFO ] Time to serialize gal into /tmp/LTL17764516970546307931.gal : 2 ms
[2021-05-18 01:00:34] [INFO ] Time to serialize properties into /tmp/LTL12045697114390113634.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17764516970546307931.gal, -t, CGAL, -LTL, /tmp/LTL12045697114390113634.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17764516970546307931.gal -t CGAL -LTL /tmp/LTL12045697114390113634.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((Node3DontAnswerToAnyNode<1)||(Node5IsActive<1))"))))
Formula 0 simplified : !XF"((Node3DontAnswerToAnyNode<1)||(Node5IsActive<1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t9, t11, t13, t18, t20, t22, t24, t27, t29, t31, t33, t35, t36, t37, t39, t40, t41, t43, t44, t47, t50, t52, t54, t55, t56, t57, t59, t60, t65, t69, t71, t77, t78, t79, t81, t83, t85, t86, t87, t89, t93, t97, t99, t101, t105, t108, t110, t115, t116, t117, t118, t119, t121, t123, t124, t126, t130, t134, t139, t141, t142, t143, t145, t147, t150, t151, t152, t153, t156, t158, t160, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/23/73/96
Computing Next relation with stutter on 64 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
18 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.202917,23044,1,0,325,32881,218,134,1427,33016,312
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S08C2-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property LeafsetExtension-PT-S08C2-11 finished in 1854 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 182/182 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 114 transition count 165
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 114 transition count 165
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 105 transition count 156
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 105 transition count 156
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 103 transition count 156
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 67 place count 90 transition count 143
Iterating global reduction 1 with 13 rules applied. Total rules applied 80 place count 90 transition count 143
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 89 transition count 143
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 92 place count 78 transition count 132
Iterating global reduction 2 with 11 rules applied. Total rules applied 103 place count 78 transition count 132
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 106 place count 75 transition count 129
Iterating global reduction 2 with 3 rules applied. Total rules applied 109 place count 75 transition count 129
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 112 place count 72 transition count 126
Iterating global reduction 2 with 3 rules applied. Total rules applied 115 place count 72 transition count 126
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 122 place count 65 transition count 119
Iterating global reduction 2 with 7 rules applied. Total rules applied 129 place count 65 transition count 119
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 132 place count 62 transition count 116
Iterating global reduction 2 with 3 rules applied. Total rules applied 135 place count 62 transition count 116
Applied a total of 135 rules in 15 ms. Remains 62 /131 variables (removed 69) and now considering 116/182 (removed 66) transitions.
[2021-05-18 01:00:34] [INFO ] Flow matrix only has 64 transitions (discarded 52 similar events)
// Phase 1: matrix 64 rows 62 cols
[2021-05-18 01:00:34] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-18 01:00:34] [INFO ] Implicit Places using invariants in 48 ms returned [22, 26, 30, 34, 38]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 49 ms to find 5 implicit places.
[2021-05-18 01:00:34] [INFO ] Flow matrix only has 64 transitions (discarded 52 similar events)
// Phase 1: matrix 64 rows 57 cols
[2021-05-18 01:00:34] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 01:00:34] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 57/131 places, 116/182 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 46 transition count 105
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 46 transition count 105
Applied a total of 22 rules in 1 ms. Remains 46 /57 variables (removed 11) and now considering 105/116 (removed 11) transitions.
[2021-05-18 01:00:34] [INFO ] Flow matrix only has 49 transitions (discarded 56 similar events)
// Phase 1: matrix 49 rows 46 cols
[2021-05-18 01:00:34] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-18 01:00:34] [INFO ] Implicit Places using invariants in 32 ms returned []
[2021-05-18 01:00:34] [INFO ] Flow matrix only has 49 transitions (discarded 56 similar events)
// Phase 1: matrix 49 rows 46 cols
[2021-05-18 01:00:34] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 01:00:34] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 46/131 places, 105/182 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LT s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 132 ms.
Product exploration explored 100000 steps with 25000 reset in 145 ms.
Graph (complete) has 172 edges and 46 vertex of which 32 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 137 ms.
Product exploration explored 100000 steps with 25000 reset in 149 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 46 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 46/46 places, 105/105 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 46 transition count 105
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 7 place count 46 transition count 106
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 46 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 43 transition count 103
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 43 transition count 103
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 43 transition count 103
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 39 transition count 99
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 39 transition count 99
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 30 rules in 4 ms. Remains 39 /46 variables (removed 7) and now considering 99/105 (removed 6) transitions.
[2021-05-18 01:00:35] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-18 01:00:35] [INFO ] Flow matrix only has 41 transitions (discarded 58 similar events)
// Phase 1: matrix 41 rows 39 cols
[2021-05-18 01:00:35] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 01:00:35] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/46 places, 99/105 transitions.
Product exploration explored 100000 steps with 25000 reset in 325 ms.
Product exploration explored 100000 steps with 25000 reset in 339 ms.
[2021-05-18 01:00:36] [INFO ] Flatten gal took : 5 ms
[2021-05-18 01:00:36] [INFO ] Flatten gal took : 5 ms
[2021-05-18 01:00:36] [INFO ] Time to serialize gal into /tmp/LTL7829150590775394511.gal : 1 ms
[2021-05-18 01:00:36] [INFO ] Time to serialize properties into /tmp/LTL16982774969361295471.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7829150590775394511.gal, -t, CGAL, -LTL, /tmp/LTL16982774969361295471.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7829150590775394511.gal -t CGAL -LTL /tmp/LTL16982774969361295471.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(Node7HasTheLeafSetOfLxToReplaceNode2<1)"))))))
Formula 0 simplified : !XXXF"(Node7HasTheLeafSetOfLxToReplaceNode2<1)"
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t9, t11, t13, t18, t20, t22, t24, t27, t29, t31, t33, t35, t36, t37, t39, t40, t41, t43, t44, t47, t50, t52, t54, t55, t56, t57, t59, t60, t65, t69, t71, t77, t78, t79, t81, t83, t85, t86, t87, t89, t93, t97, t99, t101, t105, t108, t110, t115, t116, t117, t118, t119, t121, t123, t124, t126, t129, t130, t138, t139, t141, t142, t143, t145, t147, t150, t151, t152, t153, t156, t158, t160, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/31/74/105
Computing Next relation with stutter on 77 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
33 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.355496,27264,1,0,291,55550,236,112,1736,51926,229
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S08C2-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property LeafsetExtension-PT-S08C2-12 finished in 2247 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((G(p0)||X((p1&&X(p2))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 182/182 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 116 transition count 167
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 116 transition count 167
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 108 transition count 159
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 108 transition count 159
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 107 transition count 159
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 58 place count 96 transition count 148
Iterating global reduction 1 with 11 rules applied. Total rules applied 69 place count 96 transition count 148
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 95 transition count 148
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 79 place count 86 transition count 139
Iterating global reduction 2 with 9 rules applied. Total rules applied 88 place count 86 transition count 139
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 84 transition count 137
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 84 transition count 137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 82 transition count 135
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 82 transition count 135
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 100 place count 78 transition count 131
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 78 transition count 131
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 75 transition count 128
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 75 transition count 128
Applied a total of 110 rules in 5 ms. Remains 75 /131 variables (removed 56) and now considering 128/182 (removed 54) transitions.
[2021-05-18 01:00:36] [INFO ] Flow matrix only has 81 transitions (discarded 47 similar events)
// Phase 1: matrix 81 rows 75 cols
[2021-05-18 01:00:36] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-18 01:00:36] [INFO ] Implicit Places using invariants in 35 ms returned [24, 38, 42, 56, 60]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 36 ms to find 5 implicit places.
[2021-05-18 01:00:36] [INFO ] Flow matrix only has 81 transitions (discarded 47 similar events)
// Phase 1: matrix 81 rows 70 cols
[2021-05-18 01:00:36] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 01:00:36] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 70/131 places, 128/182 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 57 transition count 115
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 57 transition count 115
Applied a total of 26 rules in 0 ms. Remains 57 /70 variables (removed 13) and now considering 115/128 (removed 13) transitions.
[2021-05-18 01:00:36] [INFO ] Flow matrix only has 64 transitions (discarded 51 similar events)
// Phase 1: matrix 64 rows 57 cols
[2021-05-18 01:00:36] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-18 01:00:36] [INFO ] Implicit Places using invariants in 25 ms returned []
[2021-05-18 01:00:36] [INFO ] Flow matrix only has 64 transitions (discarded 51 similar events)
// Phase 1: matrix 64 rows 57 cols
[2021-05-18 01:00:36] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 01:00:36] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 57/131 places, 115/182 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : LeafsetExtension-PT-S08C2-13 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 4}], [{ cond=(NOT p0), acceptance={} source=7 dest: 3}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=true, acceptance={} source=8 dest: 5}], [{ cond=true, acceptance={} source=9 dest: 8}]], initial=9, aps=[p2:(LT s23 1), p0:(OR (LT s38 1) (LT s40 1)), p1:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16228 reset in 147 ms.
Product exploration explored 100000 steps with 16127 reset in 159 ms.
Graph (complete) has 194 edges and 57 vertex of which 39 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Knowledge obtained : [p2, p0, p1]
Stuttering acceptance computed with spot in 230 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 16192 reset in 155 ms.
Product exploration explored 100000 steps with 16203 reset in 151 ms.
Applying partial POR strategy [true, false, true, true, false, false, false, true, false, false]
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 4 out of 57 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 57/57 places, 115/115 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 57 transition count 115
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 7 place count 57 transition count 116
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 57 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 56 transition count 115
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 56 transition count 115
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 21 place count 56 transition count 115
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 49 transition count 108
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 49 transition count 108
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 35 rules in 4 ms. Remains 49 /57 variables (removed 8) and now considering 108/115 (removed 7) transitions.
[2021-05-18 01:00:38] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-18 01:00:38] [INFO ] Flow matrix only has 55 transitions (discarded 53 similar events)
// Phase 1: matrix 55 rows 49 cols
[2021-05-18 01:00:38] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-18 01:00:38] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 49/57 places, 108/115 transitions.
Product exploration explored 100000 steps with 16468 reset in 278 ms.
Product exploration explored 100000 steps with 16458 reset in 319 ms.
[2021-05-18 01:00:39] [INFO ] Flatten gal took : 6 ms
[2021-05-18 01:00:39] [INFO ] Flatten gal took : 6 ms
[2021-05-18 01:00:39] [INFO ] Time to serialize gal into /tmp/LTL5380811581561585791.gal : 1 ms
[2021-05-18 01:00:39] [INFO ] Time to serialize properties into /tmp/LTL7455950289492080667.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5380811581561585791.gal, -t, CGAL, -LTL, /tmp/LTL7455950289492080667.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5380811581561585791.gal -t CGAL -LTL /tmp/LTL7455950289492080667.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("((Node5HasAskedItsLeafSetToLxToReplaceNode1<1)||(LeafSetOfLxIsSentToNode5<1))"))||(X(("(Node0ManageTheBreakDownOfNode1<1)")&&(X("(Node3HasTheLeafSetOfRxToReplaceNode5<1)")))))))))
Formula 0 simplified : !XXX(G"((Node5HasAskedItsLeafSetToLxToReplaceNode1<1)||(LeafSetOfLxIsSentToNode5<1))" | X("(Node0ManageTheBreakDownOfNode1<1)" & X"(Node3HasTheLeafSetOfRxToReplaceNode5<1)"))
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t9, t11, t13, t18, t20, t22, t24, t27, t29, t31, t33, t35, t36, t37, t39, t40, t41, t43, t44, t47, t50, t52, t54, t55, t56, t57, t59, t64, t65, t68, t69, t71, t77, t78, t79, t81, t83, t85, t86, t87, t89, t92, t96, t97, t99, t101, t105, t108, t110, t115, t116, t117, t118, t119, t121, t123, t124, t126, t130, t134, t139, t141, t142, t143, t145, t147, t150, t151, t152, t153, t156, t158, t160, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/40/75/115
Computing Next relation with stutter on 90 deadlock states
21 unique states visited
0 strongly connected components in search stack
21 transitions explored
20 items max in DFS search stack
40 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.420764,32364,1,0,362,71558,275,199,2051,86557,455
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S08C2-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property LeafsetExtension-PT-S08C2-13 finished in 2777 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 182/182 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 131 transition count 169
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 118 transition count 169
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 26 place count 118 transition count 160
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 44 place count 109 transition count 160
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 57 place count 96 transition count 147
Iterating global reduction 2 with 13 rules applied. Total rules applied 70 place count 96 transition count 147
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 88 transition count 139
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 88 transition count 139
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 87 transition count 139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 87 place count 87 transition count 138
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 86 transition count 138
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 83 transition count 135
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 83 transition count 135
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 82 transition count 134
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 82 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 81 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 81 transition count 133
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 131 place count 65 transition count 117
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 139 place count 57 transition count 109
Iterating global reduction 3 with 8 rules applied. Total rules applied 147 place count 57 transition count 109
Applied a total of 147 rules in 12 ms. Remains 57 /131 variables (removed 74) and now considering 109/182 (removed 73) transitions.
[2021-05-18 01:00:39] [INFO ] Flow matrix only has 64 transitions (discarded 45 similar events)
// Phase 1: matrix 64 rows 57 cols
[2021-05-18 01:00:39] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-18 01:00:39] [INFO ] Implicit Places using invariants in 37 ms returned [14, 18, 22, 26, 29, 33, 38, 40]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 38 ms to find 8 implicit places.
[2021-05-18 01:00:39] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-18 01:00:39] [INFO ] Flow matrix only has 64 transitions (discarded 45 similar events)
// Phase 1: matrix 64 rows 49 cols
[2021-05-18 01:00:39] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 01:00:39] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 49/131 places, 109/182 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 37 transition count 97
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 37 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 36 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 36 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 35 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 35 transition count 95
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 40 place count 29 transition count 89
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 27 transition count 87
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 27 transition count 87
Applied a total of 44 rules in 5 ms. Remains 27 /49 variables (removed 22) and now considering 87/109 (removed 22) transitions.
[2021-05-18 01:00:39] [INFO ] Flow matrix only has 26 transitions (discarded 61 similar events)
// Phase 1: matrix 26 rows 27 cols
[2021-05-18 01:00:39] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 01:00:39] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-18 01:00:39] [INFO ] Flow matrix only has 26 transitions (discarded 61 similar events)
// Phase 1: matrix 26 rows 27 cols
[2021-05-18 01:00:39] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-18 01:00:39] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 27/131 places, 87/182 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S08C2-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s15 1) (LT s22 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12547 reset in 116 ms.
Product exploration explored 100000 steps with 12537 reset in 120 ms.
Graph (complete) has 139 edges and 27 vertex of which 25 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12560 reset in 113 ms.
Product exploration explored 100000 steps with 12535 reset in 114 ms.
[2021-05-18 01:00:40] [INFO ] Flatten gal took : 3 ms
[2021-05-18 01:00:40] [INFO ] Flatten gal took : 3 ms
[2021-05-18 01:00:40] [INFO ] Time to serialize gal into /tmp/LTL13294309514950278737.gal : 1 ms
[2021-05-18 01:00:40] [INFO ] Time to serialize properties into /tmp/LTL12243159807294171363.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13294309514950278737.gal, -t, CGAL, -LTL, /tmp/LTL12243159807294171363.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13294309514950278737.gal -t CGAL -LTL /tmp/LTL12243159807294171363.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(((Node6IsActive<1)||(Node8DontAnswerToAnyNode<1))||(Node8ManageTheBreakDownOfNode0>=1))"))))
Formula 0 simplified : !GF"(((Node6IsActive<1)||(Node8DontAnswerToAnyNode<1))||(Node8ManageTheBreakDownOfNode0>=1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t93, t149, t160, t20.t21, t22.t21, t36.t21, t37.t21, t86.t21, t87.t21, t123.t21, t124.t21, t145.t21, t89.t26, t24.t25.t26, t39.t25.t26, t40.t25.t26, t55.t25.t26, t56.t25.t26, t77.t25.t26, t78.t25.t26, t115.t25.t26, t116.t25.t26, t150.t25.t26, t50.t51.t21, t52.t51.t21, t69.t70.t67, t71.t72.t73, t110.t103, t108.t109.t103, t130.t128, t126.t127.t128, t6.t7, t9.t7, t27.t7, t29.t7, t41.t7, t57.t7, t59.t7, t79.t7, t81.t7, t97.t7, t99.t7, t117.t7, t118.t7, t151.t7, t152.t7, t11.t54.t7, t31.t54.t7, t43.t54.t7, t13.t14, t18.t14, t33.t14, t35.t14, t44.t14, t47.t14, t83.t14, t85.t14, t121.t14, t142.t14, t143.t14, t156.t14, t158.t14, t119.t54.t14, t141.t54.t14, t153.t54.t14, t60.t61.t62, t65.t61.t62, t101.t61.t62, t105.t61.t62, t134.t135.t136, t139.t135.t136, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/15/72/87
Computing Next relation with stutter on 64 deadlock states
18 unique states visited
0 strongly connected components in search stack
19 transitions explored
11 items max in DFS search stack
10 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.108976,19980,1,0,293,19108,204,133,1213,17689,343
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S08C2-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property LeafsetExtension-PT-S08C2-15 finished in 905 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621299641400

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-S08C2"
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-S08C2, 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 r292-tall-162124156500477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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