fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r292-tall-162124156600541
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for LeafsetExtension-PT-S32C4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16241.407 3600000.00 9527378.00 60547.70 FTFFT?FFFFTFFFFT normal

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-162124156600541.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-S32C4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156600541
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.8M
-rw-r--r-- 1 mcc users 36K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 134K 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 111K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.4K May 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 11 15:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 11 15:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 8.4M 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-S32C4-00
FORMULA_NAME LeafsetExtension-PT-S32C4-01
FORMULA_NAME LeafsetExtension-PT-S32C4-02
FORMULA_NAME LeafsetExtension-PT-S32C4-03
FORMULA_NAME LeafsetExtension-PT-S32C4-04
FORMULA_NAME LeafsetExtension-PT-S32C4-05
FORMULA_NAME LeafsetExtension-PT-S32C4-06
FORMULA_NAME LeafsetExtension-PT-S32C4-07
FORMULA_NAME LeafsetExtension-PT-S32C4-08
FORMULA_NAME LeafsetExtension-PT-S32C4-09
FORMULA_NAME LeafsetExtension-PT-S32C4-10
FORMULA_NAME LeafsetExtension-PT-S32C4-11
FORMULA_NAME LeafsetExtension-PT-S32C4-12
FORMULA_NAME LeafsetExtension-PT-S32C4-13
FORMULA_NAME LeafsetExtension-PT-S32C4-14
FORMULA_NAME LeafsetExtension-PT-S32C4-15

=== Now, execution of the tool begins

BK_START 1621311109653

Running Version 0
[2021-05-18 04:12:00] [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 04:12:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 04:12:00] [INFO ] Load time of PNML (sax parser for PT used): 410 ms
[2021-05-18 04:12:00] [INFO ] Transformed 5622 places.
[2021-05-18 04:12:00] [INFO ] Transformed 5449 transitions.
[2021-05-18 04:12:00] [INFO ] Parsed PT model containing 5622 places and 5449 transitions in 496 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Support contains 56 out of 5622 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Reduce places removed 1093 places and 0 transitions.
Iterating post reduction 0 with 1093 rules applied. Total rules applied 1093 place count 4529 transition count 5449
Discarding 1047 places :
Symmetric choice reduction at 1 with 1047 rule applications. Total rules 2140 place count 3482 transition count 4402
Iterating global reduction 1 with 1047 rules applied. Total rules applied 3187 place count 3482 transition count 4402
Discarding 974 places :
Symmetric choice reduction at 1 with 974 rule applications. Total rules 4161 place count 2508 transition count 3428
Iterating global reduction 1 with 974 rules applied. Total rules applied 5135 place count 2508 transition count 3428
Discarding 964 places :
Symmetric choice reduction at 1 with 964 rule applications. Total rules 6099 place count 1544 transition count 2464
Iterating global reduction 1 with 964 rules applied. Total rules applied 7063 place count 1544 transition count 2464
Discarding 45 places :
Implicit places reduction removed 45 places
Iterating post reduction 1 with 45 rules applied. Total rules applied 7108 place count 1499 transition count 2464
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 7151 place count 1456 transition count 2421
Iterating global reduction 2 with 43 rules applied. Total rules applied 7194 place count 1456 transition count 2421
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 7237 place count 1413 transition count 2378
Iterating global reduction 2 with 43 rules applied. Total rules applied 7280 place count 1413 transition count 2378
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 7323 place count 1370 transition count 2335
Iterating global reduction 2 with 43 rules applied. Total rules applied 7366 place count 1370 transition count 2335
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 7409 place count 1327 transition count 2292
Iterating global reduction 2 with 43 rules applied. Total rules applied 7452 place count 1327 transition count 2292
Discarding 651 places :
Symmetric choice reduction at 2 with 651 rule applications. Total rules 8103 place count 676 transition count 1641
Iterating global reduction 2 with 651 rules applied. Total rules applied 8754 place count 676 transition count 1641
Applied a total of 8754 rules in 3716 ms. Remains 676 /5622 variables (removed 4946) and now considering 1641/5449 (removed 3808) transitions.
[2021-05-18 04:12:04] [INFO ] Flow matrix only has 990 transitions (discarded 651 similar events)
// Phase 1: matrix 990 rows 676 cols
[2021-05-18 04:12:04] [INFO ] Computed 57 place invariants in 52 ms
[2021-05-18 04:12:05] [INFO ] Implicit Places using invariants in 800 ms returned [43, 48, 68, 102, 107, 111, 131, 158, 209, 215, 220, 224, 228, 232, 236, 256, 258, 288, 313, 335, 340, 344, 364, 369, 373, 400, 425, 430, 435, 511, 515, 559, 619, 647]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 830 ms to find 34 implicit places.
[2021-05-18 04:12:05] [INFO ] Flow matrix only has 990 transitions (discarded 651 similar events)
// Phase 1: matrix 990 rows 642 cols
[2021-05-18 04:12:05] [INFO ] Computed 23 place invariants in 15 ms
[2021-05-18 04:12:06] [INFO ] Dead Transitions using invariants and state equation in 802 ms returned []
Starting structural reductions, iteration 1 : 642/5622 places, 1641/5449 transitions.
Discarding 289 places :
Symmetric choice reduction at 0 with 289 rule applications. Total rules 289 place count 353 transition count 1352
Iterating global reduction 0 with 289 rules applied. Total rules applied 578 place count 353 transition count 1352
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 584 place count 347 transition count 1346
Iterating global reduction 0 with 6 rules applied. Total rules applied 590 place count 347 transition count 1346
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 596 place count 341 transition count 1340
Iterating global reduction 0 with 6 rules applied. Total rules applied 602 place count 341 transition count 1340
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 608 place count 335 transition count 1334
Iterating global reduction 0 with 6 rules applied. Total rules applied 614 place count 335 transition count 1334
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 638 place count 311 transition count 1310
Iterating global reduction 0 with 24 rules applied. Total rules applied 662 place count 311 transition count 1310
Applied a total of 662 rules in 67 ms. Remains 311 /642 variables (removed 331) and now considering 1310/1641 (removed 331) transitions.
[2021-05-18 04:12:06] [INFO ] Flow matrix only has 547 transitions (discarded 763 similar events)
// Phase 1: matrix 547 rows 311 cols
[2021-05-18 04:12:06] [INFO ] Computed 23 place invariants in 6 ms
[2021-05-18 04:12:06] [INFO ] Implicit Places using invariants in 183 ms returned []
[2021-05-18 04:12:06] [INFO ] Flow matrix only has 547 transitions (discarded 763 similar events)
// Phase 1: matrix 547 rows 311 cols
[2021-05-18 04:12:06] [INFO ] Computed 23 place invariants in 9 ms
[2021-05-18 04:12:07] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 311/5622 places, 1310/5449 transitions.
[2021-05-18 04:12:07] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-18 04:12:07] [INFO ] Flatten gal took : 125 ms
FORMULA LeafsetExtension-PT-S32C4-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C4-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S32C4-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 04:12:07] [INFO ] Flatten gal took : 88 ms
[2021-05-18 04:12:07] [INFO ] Input system was already deterministic with 1310 transitions.
Incomplete random walk after 100000 steps, including 2843 resets, run finished after 503 ms. (steps per millisecond=198 ) properties (out of 25) seen :23
Running SMT prover for 2 properties.
[2021-05-18 04:12:08] [INFO ] Flow matrix only has 547 transitions (discarded 763 similar events)
// Phase 1: matrix 547 rows 311 cols
[2021-05-18 04:12:08] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-18 04:12:08] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 12 ms returned sat
[2021-05-18 04:12:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 04:12:08] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2021-05-18 04:12:08] [INFO ] Computed and/alt/rep : 479/652/460 causal constraints (skipped 54 transitions) in 54 ms.
[2021-05-18 04:12:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 04:12:09] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 19 ms returned sat
[2021-05-18 04:12:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 04:12:09] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2021-05-18 04:12:09] [INFO ] Computed and/alt/rep : 479/652/460 causal constraints (skipped 54 transitions) in 52 ms.
[2021-05-18 04:12:09] [INFO ] Added : 24 causal constraints over 5 iterations in 268 ms. Result :sat
[2021-05-18 04:12:09] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 7 ms returned sat
[2021-05-18 04:12:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 04:12:09] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2021-05-18 04:12:09] [INFO ] Computed and/alt/rep : 479/652/460 causal constraints (skipped 54 transitions) in 42 ms.
[2021-05-18 04:12:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 04:12:09] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 9 ms returned sat
[2021-05-18 04:12:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 04:12:09] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-18 04:12:10] [INFO ] Computed and/alt/rep : 479/652/460 causal constraints (skipped 54 transitions) in 35 ms.
[2021-05-18 04:12:10] [INFO ] Added : 23 causal constraints over 5 iterations in 176 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 311/311 places, 1310/1310 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 311 transition count 1276
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 277 transition count 1276
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 68 place count 277 transition count 1260
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 100 place count 261 transition count 1260
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 122 place count 239 transition count 1238
Iterating global reduction 2 with 22 rules applied. Total rules applied 144 place count 239 transition count 1238
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 151 place count 232 transition count 1231
Iterating global reduction 2 with 7 rules applied. Total rules applied 158 place count 232 transition count 1231
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 164 place count 226 transition count 1231
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 164 place count 226 transition count 1225
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 176 place count 220 transition count 1225
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 182 place count 214 transition count 1219
Iterating global reduction 3 with 6 rules applied. Total rules applied 188 place count 214 transition count 1219
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 194 place count 208 transition count 1213
Iterating global reduction 3 with 6 rules applied. Total rules applied 200 place count 208 transition count 1213
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 218 place count 190 transition count 1195
Iterating global reduction 3 with 18 rules applied. Total rules applied 236 place count 190 transition count 1195
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 300 place count 158 transition count 1163
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 311 place count 147 transition count 1152
Iterating global reduction 3 with 11 rules applied. Total rules applied 322 place count 147 transition count 1152
Applied a total of 322 rules in 212 ms. Remains 147 /311 variables (removed 164) and now considering 1152/1310 (removed 158) transitions.
[2021-05-18 04:12:16] [INFO ] Flow matrix only has 281 transitions (discarded 871 similar events)
// Phase 1: matrix 281 rows 147 cols
[2021-05-18 04:12:16] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-18 04:12:16] [INFO ] Implicit Places using invariants in 175 ms returned [15, 19, 28, 36, 55, 62, 77, 90, 95, 97, 104, 113, 118, 123, 128]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 180 ms to find 15 implicit places.
[2021-05-18 04:12:16] [INFO ] Redundant transitions in 74 ms returned []
[2021-05-18 04:12:16] [INFO ] Flow matrix only has 281 transitions (discarded 871 similar events)
// Phase 1: matrix 281 rows 132 cols
[2021-05-18 04:12:16] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-18 04:12:16] [INFO ] Dead Transitions using invariants and state equation in 355 ms returned []
Starting structural reductions, iteration 1 : 132/311 places, 1152/1310 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 99 transition count 1119
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 99 transition count 1119
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 92 transition count 1112
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 92 transition count 1112
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 85 transition count 1105
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 85 transition count 1105
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 106 place count 79 transition count 1099
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 77 transition count 1097
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 77 transition count 1097
Applied a total of 110 rules in 42 ms. Remains 77 /132 variables (removed 55) and now considering 1097/1152 (removed 55) transitions.
[2021-05-18 04:12:16] [INFO ] Flow matrix only has 77 transitions (discarded 1020 similar events)
// Phase 1: matrix 77 rows 77 cols
[2021-05-18 04:12:16] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-18 04:12:17] [INFO ] Implicit Places using invariants in 180 ms returned []
[2021-05-18 04:12:17] [INFO ] Flow matrix only has 77 transitions (discarded 1020 similar events)
// Phase 1: matrix 77 rows 77 cols
[2021-05-18 04:12:17] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 04:12:17] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 77/311 places, 1097/1310 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LT s63 1), p1:(LT s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7348 reset in 382 ms.
Product exploration explored 100000 steps with 7358 reset in 335 ms.
Graph (complete) has 1271 edges and 77 vertex of which 75 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 7355 reset in 300 ms.
Product exploration explored 100000 steps with 7337 reset in 308 ms.
[2021-05-18 04:12:19] [INFO ] Flatten gal took : 38 ms
[2021-05-18 04:12:19] [INFO ] Flatten gal took : 36 ms
[2021-05-18 04:12:19] [INFO ] Time to serialize gal into /tmp/LTL12551295614071222104.gal : 32 ms
[2021-05-18 04:12:19] [INFO ] Time to serialize properties into /tmp/LTL14390126090321136960.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/LTL12551295614071222104.gal, -t, CGAL, -LTL, /tmp/LTL14390126090321136960.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/LTL12551295614071222104.gal -t CGAL -LTL /tmp/LTL14390126090321136960.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("(Node28ManageTheBreakDownOfNode20<1)"))&&(F(G("(Node15ManageTheBreakDownOfNode14<1)"))))))
Formula 0 simplified : !G(F"(Node28ManageTheBreakDownOfNode20<1)" & FG"(Node15ManageTheBreakDownOfNode14<1)")
Detected timeout of ITS tools.
[2021-05-18 04:12:34] [INFO ] Flatten gal took : 44 ms
[2021-05-18 04:12:34] [INFO ] Applying decomposition
[2021-05-18 04:12:34] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13200951719868505116.txt, -o, /tmp/graph13200951719868505116.bin, -w, /tmp/graph13200951719868505116.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13200951719868505116.bin, -l, -1, -v, -w, /tmp/graph13200951719868505116.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 04:12:34] [INFO ] Decomposing Gal with order
[2021-05-18 04:12:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 04:12:34] [INFO ] Removed a total of 1145 redundant transitions.
[2021-05-18 04:12:34] [INFO ] Flatten gal took : 263 ms
[2021-05-18 04:12:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 154 labels/synchronizations in 19 ms.
[2021-05-18 04:12:34] [INFO ] Time to serialize gal into /tmp/LTL4388283788354917092.gal : 17 ms
[2021-05-18 04:12:34] [INFO ] Time to serialize properties into /tmp/LTL13173853539879796102.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/LTL4388283788354917092.gal, -t, CGAL, -LTL, /tmp/LTL13173853539879796102.ltl, -c, -stutter-deadlock], 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/LTL4388283788354917092.gal -t CGAL -LTL /tmp/LTL13173853539879796102.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F("(u4.Node28ManageTheBreakDownOfNode20<1)"))&&(F(G("(u3.Node15ManageTheBreakDownOfNode14<1)"))))))
Formula 0 simplified : !G(F"(u4.Node28ManageTheBreakDownOfNode20<1)" & FG"(u3.Node15ManageTheBreakDownOfNode14<1)")
Reverse transition relation is NOT exact ! Due to transitions t571, t972, t1093, t994_t3, t556_t2_t3, t572_t2_t3, t1069_t2_t3, t1083_t2_t3, t215_t25, t221_t25, t578_t25, t584_t25, t1095_t1085_t1086, t98_t2_t3_t554, t1084_t1085_t1086_t554, u1.t154, u1.t317, u1.t361, u1.t150.t3, u1.t162.t3, u1.t163.t3, u1.t164.t3, u1.t167.t3, u1.t168.t3, u1.t169.t3, u1.t170.t3, u1.t171.t3, u1.t172.t3, u1.t173.t3, u1.t231.t3, u1.t303.t3, u1.t307.t3, u1.t312.t3, u1.t313.t3, u1.t314.t3, u1.t315.t3, u1.t316.t3, u1.t321.t3, u1.t322.t3, u1.t323.t3, u1.t324.t3, u1.t325.t3, u1.t344.t3, u1.t348.t3, u1.t353.t3, u1.t354.t3, u1.t355.t3, u1.t356.t3, u1.t359.t3, u1.t360.t3, u1.t365.t3, u1.t366.t3, u1.t367.t3, u1.t1.t2.t3, u1.t10.t2.t3, u1.t11.t2.t3, u1.t12.t2.t3, u1.t13.t2.t3, u1.t16.t2.t3, u1.t17.t2.t3, u1.t18.t2.t3, u1.t19.t2.t3, u1.t20.t2.t3, u1.t21.t2.t3, u1.t22.t2.t3, u1.t48.t2.t3, u1.t51.t2.t3, u1.t52.t2.t3, u1.t53.t2.t3, u1.t54.t2.t3, u1.t56.t2.t3, u1.t57.t2.t3, u1.t58.t2.t3, u1.t59.t2.t3, u1.t60.t2.t3, u1.t61.t2.t3, u1.t62.t2.t3, u1.t83.t2.t3, u1.t84.t2.t3, u1.t86.t2.t3, u1.t87.t2.t3, u1.t88.t2.t3, u1.t89.t2.t3, u1.t91.t2.t3, u1.t92.t2.t3, u1.t93.t2.t3, u1.t94.t2.t3, u1.t95.t2.t3, u1.t96.t2.t3, u1.t97.t2.t3, u1.t116.t2.t3, u1.t117.t2.t3, u1.t120.t2.t3, u1.t121.t2.t3, u1.t122.t2.t3, u1.t123.t2.t3, u1.t125.t2.t3, u1.t126.t2.t3, u1.t127.t2.t3, u1.t128.t2.t3, u1.t129.t2.t3, u1.t130.t2.t3, u1.t131.t2.t3, u1.t193.t2.t3, u1.t194.t2.t3, u1.t198.t2.t3, u1.t199.t2.t3, u1.t200.t2.t3, u1.t202.t2.t3, u1.t203.t2.t3, u1.t204.t2.t3, u1.t205.t2.t3, u1.t206.t2.t3, u1.t207.t2.t3, u1.t208.t2.t3, u1.t227.t2.t3, u1.t228.t2.t3, u1.t234.t2.t3, u1.t235.t2.t3, u1.t237.t2.t3, u1.t238.t2.t3, u1.t239.t2.t3, u1.t240.t2.t3, u1.t241.t2.t3, u1.t242.t2.t3, u1.t243.t2.t3, u1.t262.t2.t3, u1.t263.t2.t3, u1.t266.t2.t3, u1.t267.t2.t3, u1.t268.t2.t3, u1.t270.t2.t3, u1.t271.t2.t3, u1.t272.t2.t3, u1.t273.t2.t3, u1.t274.t2.t3, u1.t275.t2.t3, u1.t276.t2.t3, u1.t387.t2.t3, u1.t388.t2.t3, u1.t391.t2.t3, u1.t392.t2.t3, u1.t393.t2.t3, u1.t394.t2.t3, u1.t397.t2.t3, u1.t398.t2.t3, u1.t399.t2.t3, u1.t400.t2.t3, u1.t401.t2.t3, u1.t402.t2.t3, u1.t421.t2.t3, u1.t422.t2.t3, u1.t426.t2.t3, u1.t427.t2.t3, u1.t428.t2.t3, u1.t429.t2.t3, u1.t431.t2.t3, u1.t432.t2.t3, u1.t433.t2.t3, u1.t434.t2.t3, u1.t435.t2.t3, u1.t436.t2.t3, u1.t455.t2.t3, u1.t456.t2.t3, u1.t459.t2.t3, u1.t460.t2.t3, u1.t461.t2.t3, u1.t462.t2.t3, u1.t464.t2.t3, u1.t465.t2.t3, u1.t466.t2.t3, u1.t467.t2.t3, u1.t468.t2.t3, u1.t469.t2.t3, u1.t488.t2.t3, u1.t489.t2.t3, u1.t492.t2.t3, u1.t493.t2.t3, u1.t494.t2.t3, u1.t495.t2.t3, u1.t497.t2.t3, u1.t498.t2.t3, u1.t499.t2.t3, u1.t500.t2.t3, u1.t501.t2.t3, u1.t502.t2.t3, u1.t521.t2.t3, u1.t522.t2.t3, u1.t525.t2.t3, u1.t526.t2.t3, u1.t527.t2.t3, u1.t528.t2.t3, u1.t530.t2.t3, u1.t531.t2.t3, u1.t532.t2.t3, u1.t533.t2.t3, u1.t534.t2.t3, u1.t535.t2.t3, u1.t6.t7.t3, u1.t8.t7.t3, u1.t14.t7.t3, u1.t49.t7.t3, u1.t50.t7.t3, u1.t55.t7.t3, u1.t85.t7.t3, u1.t90.t7.t3, u1.t118.t7.t3, u1.t124.t7.t3, u1.t158.t7.t3, u1.t160.t7.t3, u1.t165.t7.t3, u1.t195.t7.t3, u1.t196.t7.t3, u1.t201.t7.t3, u1.t229.t7.t3, u1.t230.t7.t3, u1.t236.t7.t3, u1.t264.t7.t3, u1.t265.t7.t3, u1.t269.t7.t3, u1.t308.t7.t3, u1.t310.t7.t3, u1.t349.t7.t3, u1.t351.t7.t3, u1.t357.t7.t3, u1.t389.t7.t3, u1.t390.t7.t3, u1.t395.t7.t3, u1.t423.t7.t3, u1.t425.t7.t3, u1.t430.t7.t3, u1.t457.t7.t3, u1.t458.t7.t3, u1.t463.t7.t3, u1.t490.t7.t3, u1.t491.t7.t3, u1.t496.t7.t3, u1.t523.t7.t3, u1.t524.t7.t3, u1.t529.t7.t3, i1.t634_t607_t608, i1.t629_t607_t608, i1.t663_t25, i1.u0.t671, i1.u0.t733, i1.u0.t1176, i1.u0.t664.t25, i1.u0.t665.t25, i1.u0.t666.t25, i1.u0.t667.t25, i1.u0.t668.t25, i1.u0.t669.t25, i1.u0.t670.t25, i1.u0.t675.t25, i1.u0.t676.t25, i1.u0.t679.t25, i1.u0.t680.t25, i1.u0.t699.t25, i1.u0.t700.t25, i1.u0.t701.t25, i1.u0.t702.t25, i1.u0.t703.t25, i1.u0.t704.t25, i1.u0.t705.t25, i1.u0.t706.t25, i1.u0.t708.t25, i1.u0.t709.t25, i1.u0.t712.t25, i1.u0.t713.t25, i1.u0.t732.t25, i1.u0.t736.t25, i1.u0.t737.t25, i1.u0.t738.t25, i1.u0.t739.t25, i1.u0.t740.t25, i1.u0.t741.t25, i1.u0.t743.t25, i1.u0.t744.t25, i1.u0.t747.t25, i1.u0.t748.t25, i1.u0.t767.t25, i1.u0.t768.t25, i1.u0.t769.t25, i1.u0.t770.t25, i1.u0.t771.t25, i1.u0.t772.t25, i1.u0.t773.t25, i1.u0.t774.t25, i1.u0.t776.t25, i1.u0.t777.t25, i1.u0.t780.t25, i1.u0.t781.t25, i1.u0.t800.t25, i1.u0.t801.t25, i1.u0.t802.t25, i1.u0.t803.t25, i1.u0.t804.t25, i1.u0.t805.t25, i1.u0.t806.t25, i1.u0.t807.t25, i1.u0.t809.t25, i1.u0.t810.t25, i1.u0.t813.t25, i1.u0.t814.t25, i1.u0.t843.t25, i1.u0.t844.t25, i1.u0.t845.t25, i1.u0.t846.t25, i1.u0.t847.t25, i1.u0.t848.t25, i1.u0.t849.t25, i1.u0.t850.t25, i1.u0.t852.t25, i1.u0.t853.t25, i1.u0.t856.t25, i1.u0.t857.t25, i1.u0.t879.t25, i1.u0.t883.t25, i1.u0.t884.t25, i1.u0.t885.t25, i1.u0.t886.t25, i1.u0.t887.t25, i1.u0.t888.t25, i1.u0.t889.t25, i1.u0.t892.t25, i1.u0.t893.t25, i1.u0.t898.t25, i1.u0.t899.t25, i1.u0.t918.t25, i1.u0.t919.t25, i1.u0.t920.t25, i1.u0.t921.t25, i1.u0.t922.t25, i1.u0.t923.t25, i1.u0.t924.t25, i1.u0.t925.t25, i1.u0.t927.t25, i1.u0.t928.t25, i1.u0.t931.t25, i1.u0.t932.t25, i1.u0.t952.t25, i1.u0.t953.t25, i1.u0.t954.t25, i1.u0.t955.t25, i1.u0.t956.t25, i1.u0.t957.t25, i1.u0.t958.t25, i1.u0.t959.t25, i1.u0.t961.t25, i1.u0.t962.t25, i1.u0.t965.t25, i1.u0.t966.t25, i1.u0.t1174.t25, i1.u0.t1175.t25, i1.u0.t1180.t25, i1.u0.t1181.t25, i1.u0.t1182.t25, i1.u0.t1183.t25, i1.u0.t1184.t25, i1.u0.t1185.t25, i1.u0.t1188.t25, i1.u0.t1189.t25, i1.u0.t1192.t25, i1.u0.t1193.t25, i1.u0.t1212.t25, i1.u0.t1213.t25, i1.u0.t1214.t25, i1.u0.t1215.t25, i1.u0.t1216.t25, i1.u0.t1217.t25, i1.u0.t1218.t25, i1.u0.t1219.t25, i1.u0.t1220.t25, i1.u0.t1223.t25, i1.u0.t1224.t25, i1.u0.t1229.t25, i1.u0.t1258.t25, i1.u0.t1259.t25, i1.u0.t1260.t25, i1.u0.t1261.t25, i1.u0.t1262.t25, i1.u0.t1263.t25, i1.u0.t1264.t25, i1.u0.t1265.t25, i1.u0.t1266.t25, i1.u0.t1269.t25, i1.u0.t1270.t25, i1.u0.t1273.t25, i1.u0.t1001.t997, i1.u0.t1007.t997, i1.u0.t999.t996.t997, i1.u0.t1000.t996.t997, i1.u0.t1004.t996.t997, i1.u0.t1005.t996.t997, i1.u0.t1006.t996.t997, i1.u0.t1010.t996.t997, i1.u0.t1011.t996.t997, i1.u0.t1012.t996.t997, i1.u0.t1013.t996.t997, i1.u0.t1020.t996.t997, i1.u0.t1021.t996.t997, i1.u0.t1043.t1040.t1041, i1.u0.t1044.t1040.t1041, i1.u0.t1045.t1040.t1041, i1.u0.t1046.t1040.t1041, i1.u0.t1047.t1040.t1041, i1.u0.t1048.t1040.t1041, i1.u0.t1049.t1040.t1041, i1.u0.t1050.t1040.t1041, i1.u0.t1051.t1040.t1041, i1.u0.t1054.t1040.t1041, i1.u0.t1059.t1040.t1041, i1.u0.t1060.t1061.t1062, i1.u0.t1132.t1129.t1130, i1.u0.t1133.t1129.t1130, i1.u0.t1134.t1129.t1130, i1.u0.t1135.t1129.t1130, i1.u0.t1136.t1129.t1130, i1.u0.t1137.t1129.t1130, i1.u0.t1138.t1129.t1130, i1.u0.t1144.t1129.t1130, i1.u0.t1147.t1129.t1130, i1.u0.t1148.t1129.t1130, i1.u0.t1151.t1129.t1130, i1.u0.t1152.t1129.t1130, i1.u0.t1139.t1140.t1141, i1.u0.t674.t38, i1.u0.t677.t38, i1.u0.t678.t38, i1.u0.t707.t38, i1.u0.t710.t38, i1.u0.t711.t38, i1.u0.t742.t38, i1.u0.t745.t38, i1.u0.t746.t38, i1.u0.t775.t38, i1.u0.t778.t38, i1.u0.t779.t38, i1.u0.t808.t38, i1.u0.t811.t38, i1.u0.t812.t38, i1.u0.t851.t38, i1.u0.t854.t38, i1.u0.t855.t38, i1.u0.t890.t38, i1.u0.t894.t38, i1.u0.t896.t38, i1.u0.t926.t38, i1.u0.t929.t38, i1.u0.t930.t38, i1.u0.t960.t38, i1.u0.t963.t38, i1.u0.t964.t38, i1.u0.t1186.t38, i1.u0.t1190.t38, i1.u0.t1221.t38, i1.u0.t1225.t38, i1.u0.t1227.t38, i1.u0.t1267.t38, i1.u0.t1271.t38, i1.u0.t1272.t38, i1.u0.t1014.t291.t280, i1.u0.t1016.t291.t280, i1.u0.t1052.t291.t280, i1.u0.t1055.t291.t280, i1.u0.t1057.t291.t280, i1.u0.t1145.t291.t280, i1.u0.t1149.t291.t280, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/13/468/481
Computing Next relation with stutter on 160640 deadlock states
47 unique states visited
0 strongly connected components in search stack
53 transitions explored
19 items max in DFS search stack
1340 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,13.4465,445140,1,0,369684,948728,3328,906353,3158,4.17955e+06,351165
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S32C4-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property LeafsetExtension-PT-S32C4-01 finished in 39635 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 311 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 311/311 places, 1310/1310 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 311 transition count 1276
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 277 transition count 1276
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 68 place count 277 transition count 1259
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 102 place count 260 transition count 1259
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 125 place count 237 transition count 1236
Iterating global reduction 2 with 23 rules applied. Total rules applied 148 place count 237 transition count 1236
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 154 place count 231 transition count 1230
Iterating global reduction 2 with 6 rules applied. Total rules applied 160 place count 231 transition count 1230
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 165 place count 226 transition count 1230
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 165 place count 226 transition count 1225
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 175 place count 221 transition count 1225
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 180 place count 216 transition count 1220
Iterating global reduction 3 with 5 rules applied. Total rules applied 185 place count 216 transition count 1220
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 190 place count 211 transition count 1215
Iterating global reduction 3 with 5 rules applied. Total rules applied 195 place count 211 transition count 1215
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 213 place count 193 transition count 1197
Iterating global reduction 3 with 18 rules applied. Total rules applied 231 place count 193 transition count 1197
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 297 place count 160 transition count 1164
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 303 place count 154 transition count 1158
Iterating global reduction 3 with 6 rules applied. Total rules applied 309 place count 154 transition count 1158
Applied a total of 309 rules in 73 ms. Remains 154 /311 variables (removed 157) and now considering 1158/1310 (removed 152) transitions.
[2021-05-18 04:12:49] [INFO ] Flow matrix only has 302 transitions (discarded 856 similar events)
// Phase 1: matrix 302 rows 154 cols
[2021-05-18 04:12:49] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-18 04:12:50] [INFO ] Implicit Places using invariants in 193 ms returned [15, 19, 28, 36, 53, 77, 96, 103, 105, 112, 119, 124, 129, 134]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 194 ms to find 14 implicit places.
[2021-05-18 04:12:50] [INFO ] Redundant transitions in 51 ms returned []
[2021-05-18 04:12:50] [INFO ] Flow matrix only has 302 transitions (discarded 856 similar events)
// Phase 1: matrix 302 rows 140 cols
[2021-05-18 04:12:50] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-18 04:12:50] [INFO ] Dead Transitions using invariants and state equation in 482 ms returned []
Starting structural reductions, iteration 1 : 140/311 places, 1158/1310 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 106 transition count 1124
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 106 transition count 1124
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 100 transition count 1118
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 100 transition count 1118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 94 transition count 1112
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 94 transition count 1112
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 108 place count 86 transition count 1104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 84 transition count 1102
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 84 transition count 1102
Applied a total of 112 rules in 34 ms. Remains 84 /140 variables (removed 56) and now considering 1102/1158 (removed 56) transitions.
[2021-05-18 04:12:50] [INFO ] Flow matrix only has 112 transitions (discarded 990 similar events)
// Phase 1: matrix 112 rows 84 cols
[2021-05-18 04:12:50] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 04:12:50] [INFO ] Implicit Places using invariants in 108 ms returned []
[2021-05-18 04:12:50] [INFO ] Flow matrix only has 112 transitions (discarded 990 similar events)
// Phase 1: matrix 112 rows 84 cols
[2021-05-18 04:12:50] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-18 04:12:50] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 84/311 places, 1102/1310 transitions.
Stuttering acceptance computed with spot in 9563 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-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:(AND (GEQ s40 1) (GEQ s62 1) (GEQ s64 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]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C4-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C4-03 finished in 10692 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(X(F((p1&&X((p1 U (G(p1)||p2))))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 311/311 places, 1310/1310 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 282 transition count 1281
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 282 transition count 1281
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 82 place count 258 transition count 1257
Iterating global reduction 0 with 24 rules applied. Total rules applied 106 place count 258 transition count 1257
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 112 place count 252 transition count 1257
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 132 place count 232 transition count 1237
Iterating global reduction 1 with 20 rules applied. Total rules applied 152 place count 232 transition count 1237
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 159 place count 225 transition count 1237
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 179 place count 205 transition count 1217
Iterating global reduction 2 with 20 rules applied. Total rules applied 199 place count 205 transition count 1217
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 212 place count 192 transition count 1204
Iterating global reduction 2 with 13 rules applied. Total rules applied 225 place count 192 transition count 1204
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 238 place count 179 transition count 1191
Iterating global reduction 2 with 13 rules applied. Total rules applied 251 place count 179 transition count 1191
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 280 place count 150 transition count 1162
Iterating global reduction 2 with 29 rules applied. Total rules applied 309 place count 150 transition count 1162
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 336 place count 123 transition count 1135
Iterating global reduction 2 with 27 rules applied. Total rules applied 363 place count 123 transition count 1135
Applied a total of 363 rules in 29 ms. Remains 123 /311 variables (removed 188) and now considering 1135/1310 (removed 175) transitions.
[2021-05-18 04:13:00] [INFO ] Flow matrix only has 153 transitions (discarded 982 similar events)
// Phase 1: matrix 153 rows 123 cols
[2021-05-18 04:13:00] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-18 04:13:00] [INFO ] Implicit Places using invariants in 99 ms returned [23, 27, 39, 78, 96, 104, 108]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 108 ms to find 7 implicit places.
[2021-05-18 04:13:00] [INFO ] Flow matrix only has 153 transitions (discarded 982 similar events)
// Phase 1: matrix 153 rows 116 cols
[2021-05-18 04:13:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 04:13:01] [INFO ] Dead Transitions using invariants and state equation in 322 ms returned []
Starting structural reductions, iteration 1 : 116/311 places, 1135/1310 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 99 transition count 1118
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 99 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 98 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 98 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 97 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 97 transition count 1116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 96 transition count 1115
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 96 transition count 1115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 95 transition count 1114
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 95 transition count 1114
Applied a total of 42 rules in 23 ms. Remains 95 /116 variables (removed 21) and now considering 1114/1135 (removed 21) transitions.
[2021-05-18 04:13:01] [INFO ] Flow matrix only has 111 transitions (discarded 1003 similar events)
// Phase 1: matrix 111 rows 95 cols
[2021-05-18 04:13:01] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 04:13:01] [INFO ] Implicit Places using invariants in 85 ms returned []
[2021-05-18 04:13:01] [INFO ] Flow matrix only has 111 transitions (discarded 1003 similar events)
// Phase 1: matrix 111 rows 95 cols
[2021-05-18 04:13:01] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 04:13:01] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 95/311 places, 1114/1310 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S32C4-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s65 1) (OR (LT s71 1) (LT s73 1))), p1:(LT s65 1), p2:(OR (LT s1 1) (LT s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3172 reset in 226 ms.
Product exploration explored 100000 steps with 3171 reset in 274 ms.
Graph (complete) has 1338 edges and 95 vertex of which 82 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3153 reset in 217 ms.
Product exploration explored 100000 steps with 3155 reset in 254 ms.
[2021-05-18 04:13:02] [INFO ] Flatten gal took : 38 ms
[2021-05-18 04:13:02] [INFO ] Flatten gal took : 35 ms
[2021-05-18 04:13:02] [INFO ] Time to serialize gal into /tmp/LTL9561671418959550724.gal : 5 ms
[2021-05-18 04:13:02] [INFO ] Time to serialize properties into /tmp/LTL3150161457654460858.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/LTL9561671418959550724.gal, -t, CGAL, -LTL, /tmp/LTL3150161457654460858.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/LTL9561671418959550724.gal -t CGAL -LTL /tmp/LTL3150161457654460858.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((X(X(F(("(Node26ManageTheBreakDownOfNode1<1)")&&(X(("(Node26ManageTheBreakDownOfNode1<1)")U(("((Node0IsActive<1)||(Node7DontAnswerToAnyNode<1))")||(G("(Node26ManageTheBreakDownOfNode1<1)")))))))))||("((Node26ManageTheBreakDownOfNode1<1)&&((Node26HasAskedItsLeafSetToRxToReplaceNode30<1)||(LeafSetOfRxIsSentToNode26<1)))"))))
Formula 0 simplified : !G("((Node26ManageTheBreakDownOfNode1<1)&&((Node26HasAskedItsLeafSetToRxToReplaceNode30<1)||(LeafSetOfRxIsSentToNode26<1)))" | XXF("(Node26ManageTheBreakDownOfNode1<1)" & X("(Node26ManageTheBreakDownOfNode1<1)" U ("((Node0IsActive<1)||(Node7DontAnswerToAnyNode<1))" | G"(Node26ManageTheBreakDownOfNode1<1)"))))
Detected timeout of ITS tools.
[2021-05-18 04:13:17] [INFO ] Flatten gal took : 34 ms
[2021-05-18 04:13:17] [INFO ] Applying decomposition
[2021-05-18 04:13:17] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14976347663266403145.txt, -o, /tmp/graph14976347663266403145.bin, -w, /tmp/graph14976347663266403145.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14976347663266403145.bin, -l, -1, -v, -w, /tmp/graph14976347663266403145.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 04:13:18] [INFO ] Decomposing Gal with order
[2021-05-18 04:13:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 04:13:18] [INFO ] Removed a total of 1069 redundant transitions.
[2021-05-18 04:13:18] [INFO ] Flatten gal took : 108 ms
[2021-05-18 04:13:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 7 ms.
[2021-05-18 04:13:18] [INFO ] Time to serialize gal into /tmp/LTL841654373747456759.gal : 3 ms
[2021-05-18 04:13:18] [INFO ] Time to serialize properties into /tmp/LTL18174855504550593883.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/LTL841654373747456759.gal, -t, CGAL, -LTL, /tmp/LTL18174855504550593883.ltl, -c, -stutter-deadlock], 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/LTL841654373747456759.gal -t CGAL -LTL /tmp/LTL18174855504550593883.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((X(X(F(("(i1.i0.u6.Node26ManageTheBreakDownOfNode1<1)")&&(X(("(i1.i0.u6.Node26ManageTheBreakDownOfNode1<1)")U(("((u5.Node0IsActive<1)||(u5.Node7DontAnswerToAnyNode<1))")||(G("(i1.i0.u6.Node26ManageTheBreakDownOfNode1<1)")))))))))||("((i1.i0.u6.Node26ManageTheBreakDownOfNode1<1)&&((i1.i1.u9.Node26HasAskedItsLeafSetToRxToReplaceNode30<1)||(i1.i1.u10.LeafSetOfRxIsSentToNode26<1)))"))))
Formula 0 simplified : !G("((i1.i0.u6.Node26ManageTheBreakDownOfNode1<1)&&((i1.i1.u9.Node26HasAskedItsLeafSetToRxToReplaceNode30<1)||(i1.i1.u10.LeafSetOfRxIsSentToNode26<1)))" | XXF("(i1.i0.u6.Node26ManageTheBreakDownOfNode1<1)" & X("(i1.i0.u6.Node26ManageTheBreakDownOfNode1<1)" U ("((u5.Node0IsActive<1)||(u5.Node7DontAnswerToAnyNode<1))" | G"(i1.i0.u6.Node26ManageTheBreakDownOfNode1<1)"))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11953724956113576894
[2021-05-18 04:13:33] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11953724956113576894
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11953724956113576894]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11953724956113576894] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11953724956113576894] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property LeafsetExtension-PT-S32C4-05 finished in 33721 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 311/311 places, 1310/1310 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 283 transition count 1282
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 283 transition count 1282
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 81 place count 258 transition count 1257
Iterating global reduction 0 with 25 rules applied. Total rules applied 106 place count 258 transition count 1257
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 114 place count 250 transition count 1257
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 136 place count 228 transition count 1235
Iterating global reduction 1 with 22 rules applied. Total rules applied 158 place count 228 transition count 1235
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 165 place count 221 transition count 1235
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 187 place count 199 transition count 1213
Iterating global reduction 2 with 22 rules applied. Total rules applied 209 place count 199 transition count 1213
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 224 place count 184 transition count 1198
Iterating global reduction 2 with 15 rules applied. Total rules applied 239 place count 184 transition count 1198
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 254 place count 169 transition count 1183
Iterating global reduction 2 with 15 rules applied. Total rules applied 269 place count 169 transition count 1183
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 305 place count 133 transition count 1147
Iterating global reduction 2 with 36 rules applied. Total rules applied 341 place count 133 transition count 1147
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 368 place count 106 transition count 1120
Iterating global reduction 2 with 27 rules applied. Total rules applied 395 place count 106 transition count 1120
Applied a total of 395 rules in 32 ms. Remains 106 /311 variables (removed 205) and now considering 1120/1310 (removed 190) transitions.
[2021-05-18 04:13:34] [INFO ] Flow matrix only has 109 transitions (discarded 1011 similar events)
// Phase 1: matrix 109 rows 106 cols
[2021-05-18 04:13:34] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-18 04:13:34] [INFO ] Implicit Places using invariants in 128 ms returned [27, 39, 79, 89]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 138 ms to find 4 implicit places.
[2021-05-18 04:13:34] [INFO ] Flow matrix only has 109 transitions (discarded 1011 similar events)
// Phase 1: matrix 109 rows 102 cols
[2021-05-18 04:13:34] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-18 04:13:34] [INFO ] Dead Transitions using invariants and state equation in 389 ms returned []
Starting structural reductions, iteration 1 : 102/311 places, 1120/1310 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 1112
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 1112
Applied a total of 16 rules in 10 ms. Remains 94 /102 variables (removed 8) and now considering 1112/1120 (removed 8) transitions.
[2021-05-18 04:13:34] [INFO ] Flow matrix only has 97 transitions (discarded 1015 similar events)
// Phase 1: matrix 97 rows 94 cols
[2021-05-18 04:13:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 04:13:34] [INFO ] Implicit Places using invariants in 118 ms returned []
[2021-05-18 04:13:34] [INFO ] Flow matrix only has 97 transitions (discarded 1015 similar events)
// Phase 1: matrix 97 rows 94 cols
[2021-05-18 04:13:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 04:13:35] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 94/311 places, 1112/1310 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-06 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s34 1) (LT s81 1) (GEQ s75 1) (LT s19 1) (LT s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17412 steps with 537 reset in 39 ms.
FORMULA LeafsetExtension-PT-S32C4-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C4-06 finished in 1077 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 311 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 311/311 places, 1310/1310 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 282 transition count 1281
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 282 transition count 1281
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 82 place count 258 transition count 1257
Iterating global reduction 0 with 24 rules applied. Total rules applied 106 place count 258 transition count 1257
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 113 place count 251 transition count 1257
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 134 place count 230 transition count 1236
Iterating global reduction 1 with 21 rules applied. Total rules applied 155 place count 230 transition count 1236
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 162 place count 223 transition count 1236
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 183 place count 202 transition count 1215
Iterating global reduction 2 with 21 rules applied. Total rules applied 204 place count 202 transition count 1215
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 218 place count 188 transition count 1201
Iterating global reduction 2 with 14 rules applied. Total rules applied 232 place count 188 transition count 1201
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 246 place count 174 transition count 1187
Iterating global reduction 2 with 14 rules applied. Total rules applied 260 place count 174 transition count 1187
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 292 place count 142 transition count 1155
Iterating global reduction 2 with 32 rules applied. Total rules applied 324 place count 142 transition count 1155
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 351 place count 115 transition count 1128
Iterating global reduction 2 with 27 rules applied. Total rules applied 378 place count 115 transition count 1128
Applied a total of 378 rules in 33 ms. Remains 115 /311 variables (removed 196) and now considering 1128/1310 (removed 182) transitions.
[2021-05-18 04:13:35] [INFO ] Flow matrix only has 131 transitions (discarded 997 similar events)
// Phase 1: matrix 131 rows 115 cols
[2021-05-18 04:13:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-18 04:13:35] [INFO ] Implicit Places using invariants in 92 ms returned [23, 27, 51, 89, 97, 101]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 110 ms to find 6 implicit places.
[2021-05-18 04:13:35] [INFO ] Flow matrix only has 131 transitions (discarded 997 similar events)
// Phase 1: matrix 131 rows 109 cols
[2021-05-18 04:13:35] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 04:13:35] [INFO ] Dead Transitions using invariants and state equation in 338 ms returned []
Starting structural reductions, iteration 1 : 109/311 places, 1128/1310 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 95 transition count 1114
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 95 transition count 1114
Applied a total of 28 rules in 10 ms. Remains 95 /109 variables (removed 14) and now considering 1114/1128 (removed 14) transitions.
[2021-05-18 04:13:35] [INFO ] Flow matrix only has 111 transitions (discarded 1003 similar events)
// Phase 1: matrix 111 rows 95 cols
[2021-05-18 04:13:35] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-18 04:13:35] [INFO ] Implicit Places using invariants in 115 ms returned []
[2021-05-18 04:13:35] [INFO ] Flow matrix only has 111 transitions (discarded 1003 similar events)
// Phase 1: matrix 111 rows 95 cols
[2021-05-18 04:13:35] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 04:13:36] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 95/311 places, 1114/1310 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s33 1) (GEQ s35 1)), p0:(LT s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 821 steps with 209 reset in 3 ms.
FORMULA LeafsetExtension-PT-S32C4-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C4-07 finished in 909 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 311/311 places, 1310/1310 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 281 transition count 1280
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 281 transition count 1280
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 85 place count 256 transition count 1255
Iterating global reduction 0 with 25 rules applied. Total rules applied 110 place count 256 transition count 1255
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 118 place count 248 transition count 1255
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 139 place count 227 transition count 1234
Iterating global reduction 1 with 21 rules applied. Total rules applied 160 place count 227 transition count 1234
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 166 place count 221 transition count 1234
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 186 place count 201 transition count 1214
Iterating global reduction 2 with 20 rules applied. Total rules applied 206 place count 201 transition count 1214
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 220 place count 187 transition count 1200
Iterating global reduction 2 with 14 rules applied. Total rules applied 234 place count 187 transition count 1200
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 248 place count 173 transition count 1186
Iterating global reduction 2 with 14 rules applied. Total rules applied 262 place count 173 transition count 1186
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 297 place count 138 transition count 1151
Iterating global reduction 2 with 35 rules applied. Total rules applied 332 place count 138 transition count 1151
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 355 place count 115 transition count 1128
Iterating global reduction 2 with 23 rules applied. Total rules applied 378 place count 115 transition count 1128
Applied a total of 378 rules in 33 ms. Remains 115 /311 variables (removed 196) and now considering 1128/1310 (removed 182) transitions.
[2021-05-18 04:13:36] [INFO ] Flow matrix only has 130 transitions (discarded 998 similar events)
// Phase 1: matrix 130 rows 115 cols
[2021-05-18 04:13:36] [INFO ] Computed 9 place invariants in 6 ms
[2021-05-18 04:13:36] [INFO ] Implicit Places using invariants in 100 ms returned [23, 27, 39, 89, 97, 101]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 118 ms to find 6 implicit places.
[2021-05-18 04:13:36] [INFO ] Flow matrix only has 130 transitions (discarded 998 similar events)
// Phase 1: matrix 130 rows 109 cols
[2021-05-18 04:13:36] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 04:13:36] [INFO ] Dead Transitions using invariants and state equation in 323 ms returned []
Starting structural reductions, iteration 1 : 109/311 places, 1128/1310 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 94 transition count 1113
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 94 transition count 1113
Applied a total of 30 rules in 6 ms. Remains 94 /109 variables (removed 15) and now considering 1113/1128 (removed 15) transitions.
[2021-05-18 04:13:36] [INFO ] Flow matrix only has 109 transitions (discarded 1004 similar events)
// Phase 1: matrix 109 rows 94 cols
[2021-05-18 04:13:36] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 04:13:36] [INFO ] Implicit Places using invariants in 94 ms returned []
[2021-05-18 04:13:36] [INFO ] Flow matrix only has 109 transitions (discarded 1004 similar events)
// Phase 1: matrix 109 rows 94 cols
[2021-05-18 04:13:36] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 04:13:36] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 94/311 places, 1113/1310 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C4-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C4-08 finished in 815 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0) U p1) U ((p2 U p3) U p4)))], workingDir=/home/mcc/execution]
Support contains 9 out of 311 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 311/311 places, 1310/1310 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 311 transition count 1277
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 278 transition count 1277
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 66 place count 278 transition count 1261
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 98 place count 262 transition count 1261
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 117 place count 243 transition count 1242
Iterating global reduction 2 with 19 rules applied. Total rules applied 136 place count 243 transition count 1242
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 141 place count 238 transition count 1237
Iterating global reduction 2 with 5 rules applied. Total rules applied 146 place count 238 transition count 1237
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 150 place count 234 transition count 1237
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 150 place count 234 transition count 1233
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 158 place count 230 transition count 1233
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 162 place count 226 transition count 1229
Iterating global reduction 3 with 4 rules applied. Total rules applied 166 place count 226 transition count 1229
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 170 place count 222 transition count 1225
Iterating global reduction 3 with 4 rules applied. Total rules applied 174 place count 222 transition count 1225
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 183 place count 213 transition count 1216
Iterating global reduction 3 with 9 rules applied. Total rules applied 192 place count 213 transition count 1216
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 264 place count 177 transition count 1180
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 276 place count 165 transition count 1168
Iterating global reduction 3 with 12 rules applied. Total rules applied 288 place count 165 transition count 1168
Applied a total of 288 rules in 76 ms. Remains 165 /311 variables (removed 146) and now considering 1168/1310 (removed 142) transitions.
[2021-05-18 04:13:37] [INFO ] Flow matrix only has 331 transitions (discarded 837 similar events)
// Phase 1: matrix 331 rows 165 cols
[2021-05-18 04:13:37] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-18 04:13:37] [INFO ] Implicit Places using invariants in 267 ms returned [15, 19, 37, 45, 70, 77, 94, 107, 114, 121, 128, 138, 143]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 268 ms to find 13 implicit places.
[2021-05-18 04:13:37] [INFO ] Redundant transitions in 24 ms returned []
[2021-05-18 04:13:37] [INFO ] Flow matrix only has 331 transitions (discarded 837 similar events)
// Phase 1: matrix 331 rows 152 cols
[2021-05-18 04:13:37] [INFO ] Computed 6 place invariants in 10 ms
[2021-05-18 04:13:37] [INFO ] Dead Transitions using invariants and state equation in 365 ms returned []
Starting structural reductions, iteration 1 : 152/311 places, 1168/1310 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 129 transition count 1145
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 129 transition count 1145
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 122 transition count 1138
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 122 transition count 1138
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 74 place count 108 transition count 1124
Iterating global reduction 0 with 14 rules applied. Total rules applied 88 place count 108 transition count 1124
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 104 place count 100 transition count 1116
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 106 place count 98 transition count 1114
Iterating global reduction 0 with 2 rules applied. Total rules applied 108 place count 98 transition count 1114
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 111 place count 95 transition count 1111
Iterating global reduction 0 with 3 rules applied. Total rules applied 114 place count 95 transition count 1111
Applied a total of 114 rules in 83 ms. Remains 95 /152 variables (removed 57) and now considering 1111/1168 (removed 57) transitions.
[2021-05-18 04:13:37] [INFO ] Flow matrix only has 126 transitions (discarded 985 similar events)
// Phase 1: matrix 126 rows 95 cols
[2021-05-18 04:13:37] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-18 04:13:38] [INFO ] Implicit Places using invariants in 359 ms returned []
[2021-05-18 04:13:38] [INFO ] Flow matrix only has 126 transitions (discarded 985 similar events)
// Phase 1: matrix 126 rows 95 cols
[2021-05-18 04:13:38] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-18 04:13:38] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 95/311 places, 1111/1310 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, (G p4 | G!p4)&(G p3 | G!p3)&(G p2 | G!p2)&(G p1 | G!p1)&(G p0 | G!p0)], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 11994 ms :[false, (NOT p0), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p0) p1 (NOT p4)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : LeafsetExtension-PT-S32C4-09 automaton TGBA [mat=[[{ cond=(NOT p4), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p4) (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p4) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p4) (NOT p3) p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p4) p3 (NOT p1) (NOT p0)) (AND (NOT p4) p2 (NOT p1) (NOT p0))), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p4) (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p4) p3 p1 (NOT p0)) (AND (NOT p4) p2 p1 (NOT p0))), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p4) (NOT p3) p2 p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p4:(AND (GEQ s72 1) (GEQ s87 1)), p3:(AND (GEQ s16 1) (GEQ s19 1)), p2:(GEQ s56 1), p1:(OR (AND (GEQ s32 1) (GEQ s34 1)) (AND (GEQ s17 1) (GEQ s80 1))), p0:(AND (GEQ s32 1) (GEQ s34 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C4-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C4-09 finished in 13351 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 311 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 311/311 places, 1310/1310 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 311 transition count 1274
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 275 transition count 1274
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 72 place count 275 transition count 1257
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 106 place count 258 transition count 1257
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 130 place count 234 transition count 1233
Iterating global reduction 2 with 24 rules applied. Total rules applied 154 place count 234 transition count 1233
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 161 place count 227 transition count 1226
Iterating global reduction 2 with 7 rules applied. Total rules applied 168 place count 227 transition count 1226
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 174 place count 221 transition count 1226
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 174 place count 221 transition count 1220
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 186 place count 215 transition count 1220
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 192 place count 209 transition count 1214
Iterating global reduction 3 with 6 rules applied. Total rules applied 198 place count 209 transition count 1214
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 204 place count 203 transition count 1208
Iterating global reduction 3 with 6 rules applied. Total rules applied 210 place count 203 transition count 1208
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 232 place count 181 transition count 1186
Iterating global reduction 3 with 22 rules applied. Total rules applied 254 place count 181 transition count 1186
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 316 place count 150 transition count 1155
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 323 place count 143 transition count 1148
Iterating global reduction 3 with 7 rules applied. Total rules applied 330 place count 143 transition count 1148
Applied a total of 330 rules in 54 ms. Remains 143 /311 variables (removed 168) and now considering 1148/1310 (removed 162) transitions.
[2021-05-18 04:13:50] [INFO ] Flow matrix only has 276 transitions (discarded 872 similar events)
// Phase 1: matrix 276 rows 143 cols
[2021-05-18 04:13:50] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-18 04:13:50] [INFO ] Implicit Places using invariants in 114 ms returned [15, 19, 28, 36, 53, 60, 75, 88, 93, 95, 102, 109, 114, 119, 124]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 116 ms to find 15 implicit places.
[2021-05-18 04:13:50] [INFO ] Redundant transitions in 12 ms returned []
[2021-05-18 04:13:50] [INFO ] Flow matrix only has 276 transitions (discarded 872 similar events)
// Phase 1: matrix 276 rows 128 cols
[2021-05-18 04:13:50] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-18 04:13:50] [INFO ] Dead Transitions using invariants and state equation in 361 ms returned []
Starting structural reductions, iteration 1 : 128/311 places, 1148/1310 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 95 transition count 1115
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 95 transition count 1115
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 88 transition count 1108
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 88 transition count 1108
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 81 transition count 1101
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 81 transition count 1101
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 106 place count 75 transition count 1095
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 73 transition count 1093
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 73 transition count 1093
Applied a total of 110 rules in 25 ms. Remains 73 /128 variables (removed 55) and now considering 1093/1148 (removed 55) transitions.
[2021-05-18 04:13:51] [INFO ] Flow matrix only has 71 transitions (discarded 1022 similar events)
// Phase 1: matrix 71 rows 73 cols
[2021-05-18 04:13:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-18 04:13:51] [INFO ] Implicit Places using invariants in 71 ms returned []
[2021-05-18 04:13:51] [INFO ] Flow matrix only has 71 transitions (discarded 1022 similar events)
// Phase 1: matrix 71 rows 73 cols
[2021-05-18 04:13:51] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 04:13:51] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 73/311 places, 1093/1310 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s16 1) (LT s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7408 reset in 316 ms.
Product exploration explored 100000 steps with 7421 reset in 317 ms.
Graph (complete) has 1263 edges and 73 vertex of which 71 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7426 reset in 298 ms.
Product exploration explored 100000 steps with 7412 reset in 287 ms.
[2021-05-18 04:13:52] [INFO ] Flatten gal took : 22 ms
[2021-05-18 04:13:52] [INFO ] Flatten gal took : 21 ms
[2021-05-18 04:13:52] [INFO ] Time to serialize gal into /tmp/LTL5549775019126580644.gal : 4 ms
[2021-05-18 04:13:52] [INFO ] Time to serialize properties into /tmp/LTL2865137353526609217.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/LTL5549775019126580644.gal, -t, CGAL, -LTL, /tmp/LTL2865137353526609217.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/LTL5549775019126580644.gal -t CGAL -LTL /tmp/LTL2865137353526609217.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((Node6DontAnswerToAnyNode<1)||(Node21IsActive<1))"))))
Formula 0 simplified : !FG"((Node6DontAnswerToAnyNode<1)||(Node21IsActive<1))"
Detected timeout of ITS tools.
[2021-05-18 04:14:07] [INFO ] Flatten gal took : 21 ms
[2021-05-18 04:14:07] [INFO ] Applying decomposition
[2021-05-18 04:14:07] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2147274888569927248.txt, -o, /tmp/graph2147274888569927248.bin, -w, /tmp/graph2147274888569927248.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2147274888569927248.bin, -l, -1, -v, -w, /tmp/graph2147274888569927248.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 04:14:07] [INFO ] Decomposing Gal with order
[2021-05-18 04:14:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 04:14:07] [INFO ] Removed a total of 1085 redundant transitions.
[2021-05-18 04:14:07] [INFO ] Flatten gal took : 90 ms
[2021-05-18 04:14:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 6 ms.
[2021-05-18 04:14:07] [INFO ] Time to serialize gal into /tmp/LTL14487431664832474813.gal : 3 ms
[2021-05-18 04:14:07] [INFO ] Time to serialize properties into /tmp/LTL224499029399090328.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/LTL14487431664832474813.gal, -t, CGAL, -LTL, /tmp/LTL224499029399090328.ltl, -c, -stutter-deadlock], 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/LTL14487431664832474813.gal -t CGAL -LTL /tmp/LTL224499029399090328.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("((u1.Node6DontAnswerToAnyNode<1)||(u0.Node21IsActive<1))"))))
Formula 0 simplified : !FG"((u1.Node6DontAnswerToAnyNode<1)||(u0.Node21IsActive<1))"
Reverse transition relation is NOT exact ! Due to transitions t603_t2, t1208_t2, t224_t25, t663_t25, t634_t607_t608, t326_t2_t554, u0.t671, u0.t733, u0.t1176, u0.t664.t25, u0.t665.t25, u0.t666.t25, u0.t667.t25, u0.t668.t25, u0.t669.t25, u0.t670.t25, u0.t675.t25, u0.t676.t25, u0.t679.t25, u0.t680.t25, u0.t699.t25, u0.t700.t25, u0.t701.t25, u0.t702.t25, u0.t703.t25, u0.t704.t25, u0.t705.t25, u0.t706.t25, u0.t708.t25, u0.t709.t25, u0.t712.t25, u0.t713.t25, u0.t732.t25, u0.t736.t25, u0.t737.t25, u0.t738.t25, u0.t739.t25, u0.t740.t25, u0.t741.t25, u0.t743.t25, u0.t744.t25, u0.t747.t25, u0.t748.t25, u0.t767.t25, u0.t768.t25, u0.t769.t25, u0.t770.t25, u0.t771.t25, u0.t772.t25, u0.t773.t25, u0.t774.t25, u0.t776.t25, u0.t777.t25, u0.t780.t25, u0.t781.t25, u0.t800.t25, u0.t801.t25, u0.t802.t25, u0.t803.t25, u0.t804.t25, u0.t805.t25, u0.t806.t25, u0.t807.t25, u0.t809.t25, u0.t810.t25, u0.t813.t25, u0.t814.t25, u0.t843.t25, u0.t844.t25, u0.t845.t25, u0.t846.t25, u0.t847.t25, u0.t848.t25, u0.t849.t25, u0.t850.t25, u0.t852.t25, u0.t853.t25, u0.t856.t25, u0.t857.t25, u0.t879.t25, u0.t883.t25, u0.t884.t25, u0.t885.t25, u0.t886.t25, u0.t887.t25, u0.t888.t25, u0.t889.t25, u0.t892.t25, u0.t893.t25, u0.t898.t25, u0.t899.t25, u0.t918.t25, u0.t919.t25, u0.t920.t25, u0.t921.t25, u0.t922.t25, u0.t923.t25, u0.t924.t25, u0.t925.t25, u0.t927.t25, u0.t928.t25, u0.t931.t25, u0.t932.t25, u0.t952.t25, u0.t953.t25, u0.t954.t25, u0.t955.t25, u0.t956.t25, u0.t957.t25, u0.t958.t25, u0.t959.t25, u0.t961.t25, u0.t962.t25, u0.t965.t25, u0.t966.t25, u0.t1174.t25, u0.t1175.t25, u0.t1180.t25, u0.t1181.t25, u0.t1182.t25, u0.t1183.t25, u0.t1184.t25, u0.t1185.t25, u0.t1188.t25, u0.t1189.t25, u0.t1192.t25, u0.t1193.t25, u0.t1212.t25, u0.t1213.t25, u0.t1214.t25, u0.t1215.t25, u0.t1216.t25, u0.t1217.t25, u0.t1218.t25, u0.t1219.t25, u0.t1220.t25, u0.t1223.t25, u0.t1224.t25, u0.t1229.t25, u0.t1258.t25, u0.t1259.t25, u0.t1260.t25, u0.t1261.t25, u0.t1262.t25, u0.t1263.t25, u0.t1264.t25, u0.t1265.t25, u0.t1266.t25, u0.t1269.t25, u0.t1270.t25, u0.t1273.t25, u0.t1001.t997, u0.t1007.t997, u0.t999.t996.t997, u0.t1000.t996.t997, u0.t1004.t996.t997, u0.t1005.t996.t997, u0.t1006.t996.t997, u0.t1010.t996.t997, u0.t1011.t996.t997, u0.t1012.t996.t997, u0.t1013.t996.t997, u0.t1020.t996.t997, u0.t1021.t996.t997, u0.t1043.t1040.t1041, u0.t1044.t1040.t1041, u0.t1045.t1040.t1041, u0.t1046.t1040.t1041, u0.t1047.t1040.t1041, u0.t1048.t1040.t1041, u0.t1049.t1040.t1041, u0.t1050.t1040.t1041, u0.t1051.t1040.t1041, u0.t1054.t1040.t1041, u0.t1059.t1040.t1041, u0.t1060.t1061.t1062, u0.t1091.t1086, u0.t1088.t1085.t1086, u0.t1089.t1085.t1086, u0.t1090.t1085.t1086, u0.t1094.t1085.t1086, u0.t1095.t1085.t1086, u0.t1096.t1085.t1086, u0.t1097.t1085.t1086, u0.t1098.t1085.t1086, u0.t1101.t1085.t1086, u0.t1109.t1085.t1086, u0.t1110.t1085.t1086, u0.t1132.t1129.t1130, u0.t1133.t1129.t1130, u0.t1134.t1129.t1130, u0.t1135.t1129.t1130, u0.t1136.t1129.t1130, u0.t1137.t1129.t1130, u0.t1138.t1129.t1130, u0.t1144.t1129.t1130, u0.t1147.t1129.t1130, u0.t1148.t1129.t1130, u0.t1151.t1129.t1130, u0.t1152.t1129.t1130, u0.t1139.t1140.t1141, u0.t674.t38, u0.t677.t38, u0.t678.t38, u0.t707.t38, u0.t710.t38, u0.t711.t38, u0.t742.t38, u0.t745.t38, u0.t746.t38, u0.t775.t38, u0.t778.t38, u0.t779.t38, u0.t808.t38, u0.t811.t38, u0.t812.t38, u0.t851.t38, u0.t854.t38, u0.t855.t38, u0.t890.t38, u0.t894.t38, u0.t896.t38, u0.t926.t38, u0.t929.t38, u0.t930.t38, u0.t960.t38, u0.t963.t38, u0.t964.t38, u0.t1186.t38, u0.t1190.t38, u0.t1221.t38, u0.t1225.t38, u0.t1227.t38, u0.t1267.t38, u0.t1271.t38, u0.t1272.t38, u0.t1014.t291.t280, u0.t1016.t291.t280, u0.t1052.t291.t280, u0.t1055.t291.t280, u0.t1057.t291.t280, u0.t1099.t291.t280, u0.t1102.t291.t280, u0.t1104.t291.t280, u0.t1145.t291.t280, u0.t1149.t291.t280, u1.t154, u1.t231, u1.t317, u1.t361, u1.t569, u1.t1.t2, u1.t10.t2, u1.t11.t2, u1.t12.t2, u1.t13.t2, u1.t16.t2, u1.t17.t2, u1.t18.t2, u1.t19.t2, u1.t20.t2, u1.t21.t2, u1.t22.t2, u1.t48.t2, u1.t51.t2, u1.t52.t2, u1.t53.t2, u1.t54.t2, u1.t56.t2, u1.t57.t2, u1.t58.t2, u1.t59.t2, u1.t60.t2, u1.t61.t2, u1.t62.t2, u1.t83.t2, u1.t84.t2, u1.t86.t2, u1.t87.t2, u1.t88.t2, u1.t89.t2, u1.t91.t2, u1.t92.t2, u1.t93.t2, u1.t94.t2, u1.t95.t2, u1.t96.t2, u1.t97.t2, u1.t116.t2, u1.t117.t2, u1.t120.t2, u1.t121.t2, u1.t122.t2, u1.t123.t2, u1.t125.t2, u1.t126.t2, u1.t127.t2, u1.t128.t2, u1.t129.t2, u1.t130.t2, u1.t131.t2, u1.t150.t2, u1.t162.t2, u1.t163.t2, u1.t164.t2, u1.t167.t2, u1.t168.t2, u1.t169.t2, u1.t170.t2, u1.t171.t2, u1.t172.t2, u1.t173.t2, u1.t193.t2, u1.t194.t2, u1.t198.t2, u1.t199.t2, u1.t200.t2, u1.t202.t2, u1.t203.t2, u1.t204.t2, u1.t205.t2, u1.t206.t2, u1.t207.t2, u1.t208.t2, u1.t227.t2, u1.t228.t2, u1.t234.t2, u1.t235.t2, u1.t237.t2, u1.t238.t2, u1.t239.t2, u1.t240.t2, u1.t241.t2, u1.t242.t2, u1.t243.t2, u1.t262.t2, u1.t263.t2, u1.t266.t2, u1.t267.t2, u1.t268.t2, u1.t270.t2, u1.t271.t2, u1.t272.t2, u1.t273.t2, u1.t274.t2, u1.t275.t2, u1.t276.t2, u1.t303.t2, u1.t307.t2, u1.t312.t2, u1.t313.t2, u1.t314.t2, u1.t315.t2, u1.t316.t2, u1.t321.t2, u1.t322.t2, u1.t323.t2, u1.t324.t2, u1.t325.t2, u1.t344.t2, u1.t348.t2, u1.t353.t2, u1.t354.t2, u1.t355.t2, u1.t356.t2, u1.t359.t2, u1.t360.t2, u1.t365.t2, u1.t366.t2, u1.t367.t2, u1.t387.t2, u1.t388.t2, u1.t391.t2, u1.t392.t2, u1.t393.t2, u1.t394.t2, u1.t397.t2, u1.t398.t2, u1.t399.t2, u1.t400.t2, u1.t401.t2, u1.t402.t2, u1.t421.t2, u1.t422.t2, u1.t426.t2, u1.t427.t2, u1.t428.t2, u1.t429.t2, u1.t431.t2, u1.t432.t2, u1.t433.t2, u1.t434.t2, u1.t435.t2, u1.t436.t2, u1.t455.t2, u1.t456.t2, u1.t459.t2, u1.t460.t2, u1.t461.t2, u1.t462.t2, u1.t464.t2, u1.t465.t2, u1.t466.t2, u1.t467.t2, u1.t468.t2, u1.t469.t2, u1.t488.t2, u1.t489.t2, u1.t492.t2, u1.t493.t2, u1.t494.t2, u1.t495.t2, u1.t497.t2, u1.t498.t2, u1.t499.t2, u1.t500.t2, u1.t501.t2, u1.t502.t2, u1.t521.t2, u1.t522.t2, u1.t525.t2, u1.t526.t2, u1.t527.t2, u1.t528.t2, u1.t530.t2, u1.t531.t2, u1.t532.t2, u1.t533.t2, u1.t534.t2, u1.t535.t2, u1.t555.t2, u1.t556.t2, u1.t559.t2, u1.t560.t2, u1.t561.t2, u1.t562.t2, u1.t564.t2, u1.t565.t2, u1.t566.t2, u1.t567.t2, u1.t568.t2, u1.t6.t7, u1.t8.t7, u1.t14.t7, u1.t49.t7, u1.t50.t7, u1.t55.t7, u1.t85.t7, u1.t90.t7, u1.t118.t7, u1.t124.t7, u1.t158.t7, u1.t160.t7, u1.t165.t7, u1.t195.t7, u1.t196.t7, u1.t201.t7, u1.t229.t7, u1.t230.t7, u1.t236.t7, u1.t264.t7, u1.t265.t7, u1.t269.t7, u1.t308.t7, u1.t310.t7, u1.t349.t7, u1.t351.t7, u1.t357.t7, u1.t389.t7, u1.t390.t7, u1.t395.t7, u1.t423.t7, u1.t425.t7, u1.t430.t7, u1.t457.t7, u1.t458.t7, u1.t463.t7, u1.t490.t7, u1.t491.t7, u1.t496.t7, u1.t523.t7, u1.t524.t7, u1.t529.t7, u1.t557.t7, u1.t558.t7, u1.t563.t7, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/7/486/493
Computing Next relation with stutter on 160640 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
532 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,5.36426,176452,1,0,82838,498119,2128,97479,2714,1.94684e+06,64037
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S32C4-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property LeafsetExtension-PT-S32C4-10 finished in 23899 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X((G(p1) U (G(p1)&&p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 311/311 places, 1310/1310 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 280 transition count 1279
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 280 transition count 1279
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 88 place count 254 transition count 1253
Iterating global reduction 0 with 26 rules applied. Total rules applied 114 place count 254 transition count 1253
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 122 place count 246 transition count 1253
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 144 place count 224 transition count 1231
Iterating global reduction 1 with 22 rules applied. Total rules applied 166 place count 224 transition count 1231
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 173 place count 217 transition count 1231
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 195 place count 195 transition count 1209
Iterating global reduction 2 with 22 rules applied. Total rules applied 217 place count 195 transition count 1209
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 232 place count 180 transition count 1194
Iterating global reduction 2 with 15 rules applied. Total rules applied 247 place count 180 transition count 1194
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 262 place count 165 transition count 1179
Iterating global reduction 2 with 15 rules applied. Total rules applied 277 place count 165 transition count 1179
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 313 place count 129 transition count 1143
Iterating global reduction 2 with 36 rules applied. Total rules applied 349 place count 129 transition count 1143
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 376 place count 102 transition count 1116
Iterating global reduction 2 with 27 rules applied. Total rules applied 403 place count 102 transition count 1116
Applied a total of 403 rules in 30 ms. Remains 102 /311 variables (removed 209) and now considering 1116/1310 (removed 194) transitions.
[2021-05-18 04:14:14] [INFO ] Flow matrix only has 102 transitions (discarded 1014 similar events)
// Phase 1: matrix 102 rows 102 cols
[2021-05-18 04:14:14] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-18 04:14:14] [INFO ] Implicit Places using invariants in 85 ms returned [23, 27, 39, 77, 85, 89]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 87 ms to find 6 implicit places.
[2021-05-18 04:14:14] [INFO ] Flow matrix only has 102 transitions (discarded 1014 similar events)
// Phase 1: matrix 102 rows 96 cols
[2021-05-18 04:14:14] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-18 04:14:14] [INFO ] Dead Transitions using invariants and state equation in 310 ms returned []
Starting structural reductions, iteration 1 : 96/311 places, 1116/1310 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 84 transition count 1104
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 84 transition count 1104
Applied a total of 24 rules in 6 ms. Remains 84 /96 variables (removed 12) and now considering 1104/1116 (removed 12) transitions.
[2021-05-18 04:14:14] [INFO ] Flow matrix only has 84 transitions (discarded 1020 similar events)
// Phase 1: matrix 84 rows 84 cols
[2021-05-18 04:14:14] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-18 04:14:14] [INFO ] Implicit Places using invariants in 70 ms returned []
[2021-05-18 04:14:14] [INFO ] Flow matrix only has 84 transitions (discarded 1020 similar events)
// Phase 1: matrix 84 rows 84 cols
[2021-05-18 04:14:14] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 04:14:14] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 84/311 places, 1104/1310 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut11814316691346525327.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 10995 ms :[false, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S32C4-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s28 1) (GEQ s33 1)), p2:(AND (GEQ s28 1) (GEQ s33 1)), p1:(AND (GEQ s29 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C4-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C4-11 finished in 11626 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 311/311 places, 1310/1310 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 311 transition count 1275
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 276 transition count 1275
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 70 place count 276 transition count 1259
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 102 place count 260 transition count 1259
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 125 place count 237 transition count 1236
Iterating global reduction 2 with 23 rules applied. Total rules applied 148 place count 237 transition count 1236
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 155 place count 230 transition count 1229
Iterating global reduction 2 with 7 rules applied. Total rules applied 162 place count 230 transition count 1229
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 168 place count 224 transition count 1229
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 168 place count 224 transition count 1223
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 180 place count 218 transition count 1223
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 186 place count 212 transition count 1217
Iterating global reduction 3 with 6 rules applied. Total rules applied 192 place count 212 transition count 1217
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 198 place count 206 transition count 1211
Iterating global reduction 3 with 6 rules applied. Total rules applied 204 place count 206 transition count 1211
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 221 place count 189 transition count 1194
Iterating global reduction 3 with 17 rules applied. Total rules applied 238 place count 189 transition count 1194
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 302 place count 157 transition count 1162
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 314 place count 145 transition count 1150
Iterating global reduction 3 with 12 rules applied. Total rules applied 326 place count 145 transition count 1150
Applied a total of 326 rules in 59 ms. Remains 145 /311 variables (removed 166) and now considering 1150/1310 (removed 160) transitions.
[2021-05-18 04:14:26] [INFO ] Flow matrix only has 279 transitions (discarded 871 similar events)
// Phase 1: matrix 279 rows 145 cols
[2021-05-18 04:14:26] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-18 04:14:26] [INFO ] Implicit Places using invariants in 118 ms returned [15, 19, 28, 36, 53, 60, 77, 90, 95, 97, 104, 111, 116, 121, 126]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 121 ms to find 15 implicit places.
[2021-05-18 04:14:26] [INFO ] Redundant transitions in 12 ms returned []
[2021-05-18 04:14:26] [INFO ] Flow matrix only has 279 transitions (discarded 871 similar events)
// Phase 1: matrix 279 rows 130 cols
[2021-05-18 04:14:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-18 04:14:26] [INFO ] Dead Transitions using invariants and state equation in 327 ms returned []
Starting structural reductions, iteration 1 : 130/311 places, 1150/1310 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 97 transition count 1117
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 97 transition count 1117
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 90 transition count 1110
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 90 transition count 1110
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 83 transition count 1103
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 83 transition count 1103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 106 place count 77 transition count 1097
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 75 transition count 1095
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 75 transition count 1095
Applied a total of 110 rules in 27 ms. Remains 75 /130 variables (removed 55) and now considering 1095/1150 (removed 55) transitions.
[2021-05-18 04:14:26] [INFO ] Flow matrix only has 74 transitions (discarded 1021 similar events)
// Phase 1: matrix 74 rows 75 cols
[2021-05-18 04:14:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-18 04:14:26] [INFO ] Implicit Places using invariants in 76 ms returned []
[2021-05-18 04:14:26] [INFO ] Flow matrix only has 74 transitions (discarded 1021 similar events)
// Phase 1: matrix 74 rows 75 cols
[2021-05-18 04:14:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-18 04:14:26] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 75/311 places, 1095/1310 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S32C4-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C4-12 finished in 774 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((p0 U p1)||G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 311/311 places, 1310/1310 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 282 transition count 1281
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 282 transition count 1281
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 82 place count 258 transition count 1257
Iterating global reduction 0 with 24 rules applied. Total rules applied 106 place count 258 transition count 1257
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 113 place count 251 transition count 1257
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 133 place count 231 transition count 1237
Iterating global reduction 1 with 20 rules applied. Total rules applied 153 place count 231 transition count 1237
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 159 place count 225 transition count 1237
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 178 place count 206 transition count 1218
Iterating global reduction 2 with 19 rules applied. Total rules applied 197 place count 206 transition count 1218
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 210 place count 193 transition count 1205
Iterating global reduction 2 with 13 rules applied. Total rules applied 223 place count 193 transition count 1205
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 236 place count 180 transition count 1192
Iterating global reduction 2 with 13 rules applied. Total rules applied 249 place count 180 transition count 1192
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 281 place count 148 transition count 1160
Iterating global reduction 2 with 32 rules applied. Total rules applied 313 place count 148 transition count 1160
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 336 place count 125 transition count 1137
Iterating global reduction 2 with 23 rules applied. Total rules applied 359 place count 125 transition count 1137
Applied a total of 359 rules in 29 ms. Remains 125 /311 variables (removed 186) and now considering 1137/1310 (removed 173) transitions.
[2021-05-18 04:14:26] [INFO ] Flow matrix only has 155 transitions (discarded 982 similar events)
// Phase 1: matrix 155 rows 125 cols
[2021-05-18 04:14:26] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-18 04:14:26] [INFO ] Implicit Places using invariants in 110 ms returned [23, 27, 39, 90, 98, 106, 110]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 112 ms to find 7 implicit places.
[2021-05-18 04:14:26] [INFO ] Flow matrix only has 155 transitions (discarded 982 similar events)
// Phase 1: matrix 155 rows 118 cols
[2021-05-18 04:14:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 04:14:27] [INFO ] Dead Transitions using invariants and state equation in 338 ms returned []
Starting structural reductions, iteration 1 : 118/311 places, 1137/1310 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 100 transition count 1119
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 100 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 99 transition count 1118
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 99 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 98 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 98 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 97 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 97 transition count 1116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 96 transition count 1115
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 96 transition count 1115
Applied a total of 44 rules in 27 ms. Remains 96 /118 variables (removed 22) and now considering 1115/1137 (removed 22) transitions.
[2021-05-18 04:14:27] [INFO ] Flow matrix only has 112 transitions (discarded 1003 similar events)
// Phase 1: matrix 112 rows 96 cols
[2021-05-18 04:14:27] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 04:14:27] [INFO ] Implicit Places using invariants in 78 ms returned []
[2021-05-18 04:14:27] [INFO ] Flow matrix only has 112 transitions (discarded 1003 similar events)
// Phase 1: matrix 112 rows 96 cols
[2021-05-18 04:14:27] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 04:14:27] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 96/311 places, 1115/1310 transitions.
Stuttering acceptance computed with spot in 74 ms :[false, true, false, p1]
Running random walk in product with property : LeafsetExtension-PT-S32C4-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s74 1), p0:(GEQ s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 696 steps with 20 reset in 2 ms.
FORMULA LeafsetExtension-PT-S32C4-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C4-13 finished in 809 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 311/311 places, 1310/1310 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 282 transition count 1281
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 282 transition count 1281
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 82 place count 258 transition count 1257
Iterating global reduction 0 with 24 rules applied. Total rules applied 106 place count 258 transition count 1257
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 114 place count 250 transition count 1257
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 134 place count 230 transition count 1237
Iterating global reduction 1 with 20 rules applied. Total rules applied 154 place count 230 transition count 1237
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 159 place count 225 transition count 1237
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 177 place count 207 transition count 1219
Iterating global reduction 2 with 18 rules applied. Total rules applied 195 place count 207 transition count 1219
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 208 place count 194 transition count 1206
Iterating global reduction 2 with 13 rules applied. Total rules applied 221 place count 194 transition count 1206
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 234 place count 181 transition count 1193
Iterating global reduction 2 with 13 rules applied. Total rules applied 247 place count 181 transition count 1193
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 281 place count 147 transition count 1159
Iterating global reduction 2 with 34 rules applied. Total rules applied 315 place count 147 transition count 1159
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 335 place count 127 transition count 1139
Iterating global reduction 2 with 20 rules applied. Total rules applied 355 place count 127 transition count 1139
Applied a total of 355 rules in 31 ms. Remains 127 /311 variables (removed 184) and now considering 1139/1310 (removed 171) transitions.
[2021-05-18 04:14:27] [INFO ] Flow matrix only has 157 transitions (discarded 982 similar events)
// Phase 1: matrix 157 rows 127 cols
[2021-05-18 04:14:27] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-18 04:14:27] [INFO ] Implicit Places using invariants in 93 ms returned [23, 27, 39, 89, 108, 112]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 95 ms to find 6 implicit places.
[2021-05-18 04:14:27] [INFO ] Flow matrix only has 157 transitions (discarded 982 similar events)
// Phase 1: matrix 157 rows 121 cols
[2021-05-18 04:14:27] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 04:14:27] [INFO ] Dead Transitions using invariants and state equation in 318 ms returned []
Starting structural reductions, iteration 1 : 121/311 places, 1139/1310 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 104 transition count 1122
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 104 transition count 1122
Applied a total of 34 rules in 5 ms. Remains 104 /121 variables (removed 17) and now considering 1122/1139 (removed 17) transitions.
[2021-05-18 04:14:27] [INFO ] Flow matrix only has 134 transitions (discarded 988 similar events)
// Phase 1: matrix 134 rows 104 cols
[2021-05-18 04:14:27] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 04:14:28] [INFO ] Implicit Places using invariants in 78 ms returned []
[2021-05-18 04:14:28] [INFO ] Flow matrix only has 134 transitions (discarded 988 similar events)
// Phase 1: matrix 134 rows 104 cols
[2021-05-18 04:14:28] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-18 04:14:28] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 104/311 places, 1122/1310 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s40 1) (GEQ s66 1) (GEQ s85 1)), p1:(GEQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S32C4-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S32C4-14 finished in 779 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 311/311 places, 1310/1310 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 311 transition count 1275
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 276 transition count 1275
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 70 place count 276 transition count 1258
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 104 place count 259 transition count 1258
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 128 place count 235 transition count 1234
Iterating global reduction 2 with 24 rules applied. Total rules applied 152 place count 235 transition count 1234
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 159 place count 228 transition count 1227
Iterating global reduction 2 with 7 rules applied. Total rules applied 166 place count 228 transition count 1227
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 172 place count 222 transition count 1227
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 172 place count 222 transition count 1221
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 184 place count 216 transition count 1221
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 190 place count 210 transition count 1215
Iterating global reduction 3 with 6 rules applied. Total rules applied 196 place count 210 transition count 1215
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 202 place count 204 transition count 1209
Iterating global reduction 3 with 6 rules applied. Total rules applied 208 place count 204 transition count 1209
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 230 place count 182 transition count 1187
Iterating global reduction 3 with 22 rules applied. Total rules applied 252 place count 182 transition count 1187
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 314 place count 151 transition count 1156
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 320 place count 145 transition count 1150
Iterating global reduction 3 with 6 rules applied. Total rules applied 326 place count 145 transition count 1150
Applied a total of 326 rules in 53 ms. Remains 145 /311 variables (removed 166) and now considering 1150/1310 (removed 160) transitions.
[2021-05-18 04:14:28] [INFO ] Flow matrix only has 278 transitions (discarded 872 similar events)
// Phase 1: matrix 278 rows 145 cols
[2021-05-18 04:14:28] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-18 04:14:28] [INFO ] Implicit Places using invariants in 125 ms returned [15, 19, 28, 36, 53, 60, 75, 88, 93, 104, 111, 116, 121, 126]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 127 ms to find 14 implicit places.
[2021-05-18 04:14:28] [INFO ] Redundant transitions in 12 ms returned []
[2021-05-18 04:14:28] [INFO ] Flow matrix only has 278 transitions (discarded 872 similar events)
// Phase 1: matrix 278 rows 131 cols
[2021-05-18 04:14:28] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-18 04:14:28] [INFO ] Dead Transitions using invariants and state equation in 347 ms returned []
Starting structural reductions, iteration 1 : 131/311 places, 1150/1310 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 99 transition count 1118
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 99 transition count 1118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 93 transition count 1112
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 93 transition count 1112
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 82 place count 87 transition count 1106
Iterating global reduction 0 with 6 rules applied. Total rules applied 88 place count 87 transition count 1106
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 102 place count 80 transition count 1099
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 104 place count 78 transition count 1097
Iterating global reduction 0 with 2 rules applied. Total rules applied 106 place count 78 transition count 1097
Applied a total of 106 rules in 25 ms. Remains 78 /131 variables (removed 53) and now considering 1097/1150 (removed 53) transitions.
[2021-05-18 04:14:28] [INFO ] Flow matrix only has 91 transitions (discarded 1006 similar events)
// Phase 1: matrix 91 rows 78 cols
[2021-05-18 04:14:28] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-18 04:14:28] [INFO ] Implicit Places using invariants in 84 ms returned []
[2021-05-18 04:14:28] [INFO ] Flow matrix only has 91 transitions (discarded 1006 similar events)
// Phase 1: matrix 91 rows 78 cols
[2021-05-18 04:14:28] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-18 04:14:29] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 78/311 places, 1097/1310 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S32C4-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:(LT s60 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 6997 reset in 273 ms.
Product exploration explored 100000 steps with 6987 reset in 290 ms.
Graph (complete) has 1305 edges and 78 vertex of which 72 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7003 reset in 270 ms.
Product exploration explored 100000 steps with 6986 reset in 291 ms.
[2021-05-18 04:14:30] [INFO ] Flatten gal took : 25 ms
[2021-05-18 04:14:30] [INFO ] Flatten gal took : 25 ms
[2021-05-18 04:14:30] [INFO ] Time to serialize gal into /tmp/LTL15299739500539156114.gal : 4 ms
[2021-05-18 04:14:30] [INFO ] Time to serialize properties into /tmp/LTL10988041738498532689.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/LTL15299739500539156114.gal, -t, CGAL, -LTL, /tmp/LTL10988041738498532689.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/LTL15299739500539156114.gal -t CGAL -LTL /tmp/LTL10988041738498532689.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(Node27HasTheLeafSetOfRxToReplaceNode32<1)"))))
Formula 0 simplified : !GF"(Node27HasTheLeafSetOfRxToReplaceNode32<1)"
Detected timeout of ITS tools.
[2021-05-18 04:14:45] [INFO ] Flatten gal took : 26 ms
[2021-05-18 04:14:45] [INFO ] Applying decomposition
[2021-05-18 04:14:45] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1210187878394491070.txt, -o, /tmp/graph1210187878394491070.bin, -w, /tmp/graph1210187878394491070.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1210187878394491070.bin, -l, -1, -v, -w, /tmp/graph1210187878394491070.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 04:14:45] [INFO ] Decomposing Gal with order
[2021-05-18 04:14:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 04:14:45] [INFO ] Removed a total of 1099 redundant transitions.
[2021-05-18 04:14:45] [INFO ] Flatten gal took : 94 ms
[2021-05-18 04:14:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 9 ms.
[2021-05-18 04:14:45] [INFO ] Time to serialize gal into /tmp/LTL8866923057555895611.gal : 2 ms
[2021-05-18 04:14:45] [INFO ] Time to serialize properties into /tmp/LTL4187943794760076014.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/LTL8866923057555895611.gal, -t, CGAL, -LTL, /tmp/LTL4187943794760076014.ltl, -c, -stutter-deadlock], 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/LTL8866923057555895611.gal -t CGAL -LTL /tmp/LTL4187943794760076014.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("(i4.u5.Node27HasTheLeafSetOfRxToReplaceNode32<1)"))))
Formula 0 simplified : !GF"(i4.u5.Node27HasTheLeafSetOfRxToReplaceNode32<1)"
Reverse transition relation is NOT exact ! Due to transitions t603_t2, t1036_t2, t1208_t2, t224_t25, t663_t25, t634_t607_t608, t1044_t1040_t1041, t326_t2_t554, t1039_t1040_t1041_t554, u0.t671, u0.t733, u0.t1176, u0.t664.t25, u0.t665.t25, u0.t666.t25, u0.t667.t25, u0.t668.t25, u0.t669.t25, u0.t670.t25, u0.t675.t25, u0.t676.t25, u0.t679.t25, u0.t680.t25, u0.t699.t25, u0.t700.t25, u0.t701.t25, u0.t702.t25, u0.t703.t25, u0.t704.t25, u0.t705.t25, u0.t706.t25, u0.t708.t25, u0.t709.t25, u0.t712.t25, u0.t713.t25, u0.t732.t25, u0.t736.t25, u0.t737.t25, u0.t738.t25, u0.t739.t25, u0.t740.t25, u0.t741.t25, u0.t743.t25, u0.t744.t25, u0.t747.t25, u0.t748.t25, u0.t767.t25, u0.t768.t25, u0.t769.t25, u0.t770.t25, u0.t771.t25, u0.t772.t25, u0.t773.t25, u0.t774.t25, u0.t776.t25, u0.t777.t25, u0.t780.t25, u0.t781.t25, u0.t800.t25, u0.t801.t25, u0.t802.t25, u0.t803.t25, u0.t804.t25, u0.t805.t25, u0.t806.t25, u0.t807.t25, u0.t809.t25, u0.t810.t25, u0.t813.t25, u0.t814.t25, u0.t843.t25, u0.t844.t25, u0.t845.t25, u0.t846.t25, u0.t847.t25, u0.t848.t25, u0.t849.t25, u0.t850.t25, u0.t852.t25, u0.t853.t25, u0.t856.t25, u0.t857.t25, u0.t879.t25, u0.t883.t25, u0.t884.t25, u0.t885.t25, u0.t886.t25, u0.t887.t25, u0.t888.t25, u0.t889.t25, u0.t892.t25, u0.t893.t25, u0.t898.t25, u0.t899.t25, u0.t918.t25, u0.t919.t25, u0.t920.t25, u0.t921.t25, u0.t922.t25, u0.t923.t25, u0.t924.t25, u0.t925.t25, u0.t927.t25, u0.t928.t25, u0.t931.t25, u0.t932.t25, u0.t952.t25, u0.t953.t25, u0.t954.t25, u0.t955.t25, u0.t956.t25, u0.t957.t25, u0.t958.t25, u0.t959.t25, u0.t961.t25, u0.t962.t25, u0.t965.t25, u0.t966.t25, u0.t1174.t25, u0.t1175.t25, u0.t1180.t25, u0.t1181.t25, u0.t1182.t25, u0.t1183.t25, u0.t1184.t25, u0.t1185.t25, u0.t1188.t25, u0.t1189.t25, u0.t1192.t25, u0.t1193.t25, u0.t1212.t25, u0.t1213.t25, u0.t1214.t25, u0.t1215.t25, u0.t1216.t25, u0.t1217.t25, u0.t1218.t25, u0.t1219.t25, u0.t1220.t25, u0.t1223.t25, u0.t1224.t25, u0.t1229.t25, u0.t1258.t25, u0.t1259.t25, u0.t1260.t25, u0.t1261.t25, u0.t1262.t25, u0.t1263.t25, u0.t1264.t25, u0.t1265.t25, u0.t1266.t25, u0.t1269.t25, u0.t1270.t25, u0.t1273.t25, u0.t1001.t997, u0.t1007.t997, u0.t999.t996.t997, u0.t1000.t996.t997, u0.t1004.t996.t997, u0.t1005.t996.t997, u0.t1006.t996.t997, u0.t1010.t996.t997, u0.t1011.t996.t997, u0.t1012.t996.t997, u0.t1013.t996.t997, u0.t1020.t996.t997, u0.t1021.t996.t997, u0.t1091.t1086, u0.t1088.t1085.t1086, u0.t1089.t1085.t1086, u0.t1090.t1085.t1086, u0.t1094.t1085.t1086, u0.t1095.t1085.t1086, u0.t1096.t1085.t1086, u0.t1097.t1085.t1086, u0.t1098.t1085.t1086, u0.t1101.t1085.t1086, u0.t1109.t1085.t1086, u0.t1110.t1085.t1086, u0.t1132.t1129.t1130, u0.t1133.t1129.t1130, u0.t1134.t1129.t1130, u0.t1135.t1129.t1130, u0.t1136.t1129.t1130, u0.t1137.t1129.t1130, u0.t1138.t1129.t1130, u0.t1144.t1129.t1130, u0.t1147.t1129.t1130, u0.t1148.t1129.t1130, u0.t1151.t1129.t1130, u0.t1152.t1129.t1130, u0.t1139.t1140.t1141, u0.t674.t38, u0.t677.t38, u0.t678.t38, u0.t707.t38, u0.t710.t38, u0.t711.t38, u0.t742.t38, u0.t745.t38, u0.t746.t38, u0.t775.t38, u0.t778.t38, u0.t779.t38, u0.t808.t38, u0.t811.t38, u0.t812.t38, u0.t851.t38, u0.t854.t38, u0.t855.t38, u0.t890.t38, u0.t894.t38, u0.t896.t38, u0.t926.t38, u0.t929.t38, u0.t930.t38, u0.t960.t38, u0.t963.t38, u0.t964.t38, u0.t1186.t38, u0.t1190.t38, u0.t1221.t38, u0.t1225.t38, u0.t1227.t38, u0.t1267.t38, u0.t1271.t38, u0.t1272.t38, u0.t1014.t291.t280, u0.t1016.t291.t280, u0.t1099.t291.t280, u0.t1102.t291.t280, u0.t1104.t291.t280, u0.t1145.t291.t280, u0.t1149.t291.t280, u1.t154, u1.t231, u1.t317, u1.t361, u1.t569, u1.t1.t2, u1.t10.t2, u1.t11.t2, u1.t12.t2, u1.t13.t2, u1.t16.t2, u1.t17.t2, u1.t18.t2, u1.t19.t2, u1.t20.t2, u1.t21.t2, u1.t22.t2, u1.t48.t2, u1.t51.t2, u1.t52.t2, u1.t53.t2, u1.t54.t2, u1.t56.t2, u1.t57.t2, u1.t58.t2, u1.t59.t2, u1.t60.t2, u1.t61.t2, u1.t62.t2, u1.t83.t2, u1.t84.t2, u1.t86.t2, u1.t87.t2, u1.t88.t2, u1.t89.t2, u1.t91.t2, u1.t92.t2, u1.t93.t2, u1.t94.t2, u1.t95.t2, u1.t96.t2, u1.t97.t2, u1.t116.t2, u1.t117.t2, u1.t120.t2, u1.t121.t2, u1.t122.t2, u1.t123.t2, u1.t125.t2, u1.t126.t2, u1.t127.t2, u1.t128.t2, u1.t129.t2, u1.t130.t2, u1.t131.t2, u1.t150.t2, u1.t162.t2, u1.t163.t2, u1.t164.t2, u1.t167.t2, u1.t168.t2, u1.t169.t2, u1.t170.t2, u1.t171.t2, u1.t172.t2, u1.t173.t2, u1.t193.t2, u1.t194.t2, u1.t198.t2, u1.t199.t2, u1.t200.t2, u1.t202.t2, u1.t203.t2, u1.t204.t2, u1.t205.t2, u1.t206.t2, u1.t207.t2, u1.t208.t2, u1.t227.t2, u1.t228.t2, u1.t234.t2, u1.t235.t2, u1.t237.t2, u1.t238.t2, u1.t239.t2, u1.t240.t2, u1.t241.t2, u1.t242.t2, u1.t243.t2, u1.t262.t2, u1.t263.t2, u1.t266.t2, u1.t267.t2, u1.t268.t2, u1.t270.t2, u1.t271.t2, u1.t272.t2, u1.t273.t2, u1.t274.t2, u1.t275.t2, u1.t276.t2, u1.t303.t2, u1.t307.t2, u1.t312.t2, u1.t313.t2, u1.t314.t2, u1.t315.t2, u1.t316.t2, u1.t321.t2, u1.t322.t2, u1.t323.t2, u1.t324.t2, u1.t325.t2, u1.t344.t2, u1.t348.t2, u1.t353.t2, u1.t354.t2, u1.t355.t2, u1.t356.t2, u1.t359.t2, u1.t360.t2, u1.t365.t2, u1.t366.t2, u1.t367.t2, u1.t387.t2, u1.t388.t2, u1.t391.t2, u1.t392.t2, u1.t393.t2, u1.t394.t2, u1.t397.t2, u1.t398.t2, u1.t399.t2, u1.t400.t2, u1.t401.t2, u1.t402.t2, u1.t421.t2, u1.t422.t2, u1.t426.t2, u1.t427.t2, u1.t428.t2, u1.t429.t2, u1.t431.t2, u1.t432.t2, u1.t433.t2, u1.t434.t2, u1.t435.t2, u1.t436.t2, u1.t455.t2, u1.t456.t2, u1.t459.t2, u1.t460.t2, u1.t461.t2, u1.t462.t2, u1.t464.t2, u1.t465.t2, u1.t466.t2, u1.t467.t2, u1.t468.t2, u1.t469.t2, u1.t488.t2, u1.t489.t2, u1.t492.t2, u1.t493.t2, u1.t494.t2, u1.t495.t2, u1.t497.t2, u1.t498.t2, u1.t499.t2, u1.t500.t2, u1.t501.t2, u1.t502.t2, u1.t521.t2, u1.t522.t2, u1.t525.t2, u1.t526.t2, u1.t527.t2, u1.t528.t2, u1.t530.t2, u1.t531.t2, u1.t532.t2, u1.t533.t2, u1.t534.t2, u1.t535.t2, u1.t555.t2, u1.t556.t2, u1.t559.t2, u1.t560.t2, u1.t561.t2, u1.t562.t2, u1.t564.t2, u1.t565.t2, u1.t566.t2, u1.t567.t2, u1.t568.t2, u1.t6.t7, u1.t8.t7, u1.t14.t7, u1.t49.t7, u1.t50.t7, u1.t55.t7, u1.t85.t7, u1.t90.t7, u1.t118.t7, u1.t124.t7, u1.t158.t7, u1.t160.t7, u1.t165.t7, u1.t195.t7, u1.t196.t7, u1.t201.t7, u1.t229.t7, u1.t230.t7, u1.t236.t7, u1.t264.t7, u1.t265.t7, u1.t269.t7, u1.t308.t7, u1.t310.t7, u1.t349.t7, u1.t351.t7, u1.t357.t7, u1.t389.t7, u1.t390.t7, u1.t395.t7, u1.t423.t7, u1.t425.t7, u1.t430.t7, u1.t457.t7, u1.t458.t7, u1.t463.t7, u1.t490.t7, u1.t491.t7, u1.t496.t7, u1.t523.t7, u1.t524.t7, u1.t529.t7, u1.t557.t7, u1.t558.t7, u1.t563.t7, i4.t1303_t1042_t28, i4.u5.t1064, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/11/476/487
Computing Next relation with stutter on 258844 deadlock states
33 unique states visited
0 strongly connected components in search stack
37 transitions explored
19 items max in DFS search stack
737 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,7.43058,271992,1,0,338286,726237,2745,344194,4029,1.7685e+06,400479
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S32C4-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property LeafsetExtension-PT-S32C4-15 finished in 26420 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9662981275886055291
[2021-05-18 04:14:54] [INFO ] Applying decomposition
[2021-05-18 04:14:54] [INFO ] Computing symmetric may disable matrix : 1310 transitions.
[2021-05-18 04:14:54] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 04:14:54] [INFO ] Computing symmetric may enable matrix : 1310 transitions.
[2021-05-18 04:14:54] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 04:14:54] [INFO ] Flatten gal took : 32 ms
[2021-05-18 04:14:54] [INFO ] Computing Do-Not-Accords matrix : 1310 transitions.
[2021-05-18 04:14:55] [INFO ] Computation of Completed DNA matrix. took 53 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 04:14:55] [INFO ] Built C files in 307ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9662981275886055291
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9662981275886055291]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6489643659513814530.txt, -o, /tmp/graph6489643659513814530.bin, -w, /tmp/graph6489643659513814530.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6489643659513814530.bin, -l, -1, -v, -w, /tmp/graph6489643659513814530.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 04:14:59] [INFO ] Decomposing Gal with order
[2021-05-18 04:14:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 04:14:59] [INFO ] Removed a total of 1639 redundant transitions.
[2021-05-18 04:14:59] [INFO ] Flatten gal took : 68 ms
[2021-05-18 04:14:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 17 ms.
[2021-05-18 04:14:59] [INFO ] Time to serialize gal into /tmp/LTLFireability7501416219992896496.gal : 17 ms
[2021-05-18 04:14:59] [INFO ] Time to serialize properties into /tmp/LTLFireability9387640977087744317.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/LTLFireability7501416219992896496.gal, -t, CGAL, -LTL, /tmp/LTLFireability9387640977087744317.ltl, -c, -stutter-deadlock], 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/LTLFireability7501416219992896496.gal -t CGAL -LTL /tmp/LTLFireability9387640977087744317.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((!("(((i11.i0.u52.Node26HasAskedItsLeafSetToRxToReplaceNode30>=1)&&(i7.i0.u78.LeafSetOfRxIsSentToNode26>=1))||(i12.i0.u48.Node26ManageTheBreakDownOfNode1>=1))"))||(X(X(F(("(i12.i0.u48.Node26ManageTheBreakDownOfNode1<1)")&&(X(("(i12.i0.u48.Node26ManageTheBreakDownOfNode1<1)")U((!("((u0.Node0IsActive>=1)&&(u0.Node7DontAnswerToAnyNode>=1))"))||(G("(i12.i0.u48.Node26ManageTheBreakDownOfNode1<1)"))))))))))))
Formula 0 simplified : !G(!"(((i11.i0.u52.Node26HasAskedItsLeafSetToRxToReplaceNode30>=1)&&(i7.i0.u78.LeafSetOfRxIsSentToNode26>=1))||(i12.i0.u48.Node26ManageTheBreakDownOfNode1>=1))" | XXF("(i12.i0.u48.Node26ManageTheBreakDownOfNode1<1)" & X("(i12.i0.u48.Node26ManageTheBreakDownOfNode1<1)" U (!"((u0.Node0IsActive>=1)&&(u0.Node7DontAnswerToAnyNode>=1))" | G"(i12.i0.u48.Node26ManageTheBreakDownOfNode1<1)"))))
Compilation finished in 9616 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9662981275886055291]
Link finished in 77 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](((LTLAPp0==true)||X(X(<>(((LTLAPp1==true)&&X(((LTLAPp1==true) U ([]((LTLAPp1==true))||(LTLAPp2==true)))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9662981275886055291]
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](((LTLAPp0==true)||X(X(<>(((LTLAPp1==true)&&X(((LTLAPp1==true) U ([]((LTLAPp1==true))||(LTLAPp2==true)))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9662981275886055291]
Retrying LTSmin with larger timeout 2208 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](((LTLAPp0==true)||X(X(<>(((LTLAPp1==true)&&X(((LTLAPp1==true) U ([]((LTLAPp1==true))||(LTLAPp2==true)))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9662981275886055291]
Detected timeout of ITS tools.
[2021-05-18 04:35:58] [INFO ] Flatten gal took : 141 ms
[2021-05-18 04:35:58] [INFO ] Time to serialize gal into /tmp/LTLFireability2894695617806844651.gal : 5 ms
[2021-05-18 04:35:58] [INFO ] Time to serialize properties into /tmp/LTLFireability9558268853082468030.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/LTLFireability2894695617806844651.gal, -t, CGAL, -LTL, /tmp/LTLFireability9558268853082468030.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/LTLFireability2894695617806844651.gal -t CGAL -LTL /tmp/LTLFireability9558268853082468030.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((!("(((Node26HasAskedItsLeafSetToRxToReplaceNode30>=1)&&(LeafSetOfRxIsSentToNode26>=1))||(Node26ManageTheBreakDownOfNode1>=1))"))||(X(X(F(("(Node26ManageTheBreakDownOfNode1<1)")&&(X(("(Node26ManageTheBreakDownOfNode1<1)")U((!("((Node0IsActive>=1)&&(Node7DontAnswerToAnyNode>=1))"))||(G("(Node26ManageTheBreakDownOfNode1<1)"))))))))))))
Formula 0 simplified : !G(!"(((Node26HasAskedItsLeafSetToRxToReplaceNode30>=1)&&(LeafSetOfRxIsSentToNode26>=1))||(Node26ManageTheBreakDownOfNode1>=1))" | XXF("(Node26ManageTheBreakDownOfNode1<1)" & X("(Node26ManageTheBreakDownOfNode1<1)" U (!"((Node0IsActive>=1)&&(Node7DontAnswerToAnyNode>=1))" | G"(Node26ManageTheBreakDownOfNode1<1)"))))
WARNING : LTSmin timed out (>2208 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](((LTLAPp0==true)||X(X(<>(((LTLAPp1==true)&&X(((LTLAPp1==true) U ([]((LTLAPp1==true))||(LTLAPp2==true)))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9662981275886055291]
Detected timeout of ITS tools.
[2021-05-18 04:56:56] [INFO ] Flatten gal took : 35 ms
[2021-05-18 04:56:56] [INFO ] Input system was already deterministic with 1310 transitions.
[2021-05-18 04:56:56] [INFO ] Transformed 311 places.
[2021-05-18 04:56:56] [INFO ] Transformed 1310 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-18 04:56:56] [INFO ] Time to serialize gal into /tmp/LTLFireability40973268422980041.gal : 4 ms
[2021-05-18 04:56:56] [INFO ] Time to serialize properties into /tmp/LTLFireability18103036082716738746.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/LTLFireability40973268422980041.gal, -t, CGAL, -LTL, /tmp/LTLFireability18103036082716738746.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLFireability40973268422980041.gal -t CGAL -LTL /tmp/LTLFireability18103036082716738746.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((!("(((Node26HasAskedItsLeafSetToRxToReplaceNode30>=1)&&(LeafSetOfRxIsSentToNode26>=1))||(Node26ManageTheBreakDownOfNode1>=1))"))||(X(X(F(("(Node26ManageTheBreakDownOfNode1<1)")&&(X(("(Node26ManageTheBreakDownOfNode1<1)")U((!("((Node0IsActive>=1)&&(Node7DontAnswerToAnyNode>=1))"))||(G("(Node26ManageTheBreakDownOfNode1<1)"))))))))))))
Formula 0 simplified : !G(!"(((Node26HasAskedItsLeafSetToRxToReplaceNode30>=1)&&(LeafSetOfRxIsSentToNode26>=1))||(Node26ManageTheBreakDownOfNode1>=1))" | XXF("(Node26ManageTheBreakDownOfNode1<1)" & X("(Node26ManageTheBreakDownOfNode1<1)" U (!"((Node0IsActive>=1)&&(Node7DontAnswerToAnyNode>=1))" | G"(Node26ManageTheBreakDownOfNode1<1)"))))

BK_TIME_CONFINEMENT_REACHED

--------------------
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-S32C4"
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-S32C4, 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-162124156600541"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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