Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 10K Apr 29 12:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 12:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 29 12:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 12:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 9 08:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 9 08:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14M May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-00
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-01
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-02
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-03
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-04
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-05
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-06
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-07
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-08
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-09
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-10
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-11
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-12
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-13
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-14
FORMULA_NAME LeafsetExtension-PT-S64C2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652802759650

Running Version 202205111006
[2022-05-17 15:52:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 15:52:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 15:52:41] [INFO ] Load time of PNML (sax parser for PT used): 982 ms
[2022-05-17 15:52:42] [INFO ] Transformed 21462 places.
[2022-05-17 15:52:42] [INFO ] Transformed 21129 transitions.
[2022-05-17 15:52:42] [INFO ] Parsed PT model containing 21462 places and 21129 transitions in 1191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 21462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Reduce places removed 4229 places and 0 transitions.
Iterating post reduction 0 with 4229 rules applied. Total rules applied 4229 place count 17233 transition count 21129
Applied a total of 4229 rules in 299 ms. Remains 17233 /21462 variables (removed 4229) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:52:45] [INFO ] Computed 198 place invariants in 1973 ms
[2022-05-17 15:52:46] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:52:46] [INFO ] Implicit Places using invariants in 3812 ms returned []
Implicit Place search using SMT only with invariants took 3860 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:52:48] [INFO ] Computed 198 place invariants in 1702 ms
[2022-05-17 15:52:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:52:50] [INFO ] Dead Transitions using invariants and state equation in 3322 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17233/21462 places, 21129/21129 transitions.
Finished structural reductions, in 1 iterations. Remains : 17233/21462 places, 21129/21129 transitions.
Support contains 56 out of 17233 places after structural reductions.
[2022-05-17 15:52:51] [INFO ] Flatten gal took : 839 ms
[2022-05-17 15:52:52] [INFO ] Flatten gal took : 607 ms
[2022-05-17 15:52:53] [INFO ] Input system was already deterministic with 21129 transitions.
Support contains 49 out of 17233 places (down from 56) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 549 resets, run finished after 839 ms. (steps per millisecond=11 ) properties (out of 27) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 14) seen :1
Running SMT prover for 13 properties.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:52:55] [INFO ] Computed 198 place invariants in 1567 ms
[2022-05-17 15:53:01] [INFO ] [Real]Absence check using 0 positive and 198 generalized place invariants in 376 ms returned sat
[2022-05-17 15:53:21] [INFO ] After 16760ms SMT Verify possible using state equation in real domain returned unsat :0 sat :12
[2022-05-17 15:53:21] [INFO ] After 16807ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-17 15:53:21] [INFO ] After 25083ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :12
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 22 out of 17233 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 38156 edges and 17233 vertex of which 1047 are kept as prefixes of interest. Removing 16186 places using SCC suffix rule.35 ms
Discarding 16186 places :
Also discarding 11953 output transitions
Drop transitions removed 11953 transitions
Drop transitions removed 4113 transitions
Reduce isomorphic transitions removed 4113 transitions.
Drop transitions removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 4427 rules applied. Total rules applied 4428 place count 1047 transition count 4749
Reduce places removed 316 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 321 rules applied. Total rules applied 4749 place count 731 transition count 4744
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 4754 place count 726 transition count 4744
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 4754 place count 726 transition count 4734
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 4774 place count 716 transition count 4734
Discarding 150 places :
Symmetric choice reduction at 3 with 150 rule applications. Total rules 4924 place count 566 transition count 4584
Iterating global reduction 3 with 150 rules applied. Total rules applied 5074 place count 566 transition count 4584
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 5079 place count 566 transition count 4579
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 5084 place count 561 transition count 4579
Partial Free-agglomeration rule applied 154 times.
Drop transitions removed 154 transitions
Iterating global reduction 4 with 154 rules applied. Total rules applied 5238 place count 561 transition count 4579
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 4 with 4 rules applied. Total rules applied 5242 place count 557 transition count 4579
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 5246 place count 557 transition count 4575
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 5250 place count 553 transition count 4575
Applied a total of 5250 rules in 708 ms. Remains 553 /17233 variables (removed 16680) and now considering 4575/21129 (removed 16554) transitions.
Finished structural reductions, in 1 iterations. Remains : 553/17233 places, 4575/21129 transitions.
Incomplete random walk after 10000 steps, including 1297 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-17 15:53:22] [INFO ] Flow matrix only has 804 transitions (discarded 3771 similar events)
// Phase 1: matrix 804 rows 553 cols
[2022-05-17 15:53:22] [INFO ] Computed 7 place invariants in 5 ms
[2022-05-17 15:53:22] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-17 15:53:22] [INFO ] After 272ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2022-05-17 15:53:22] [INFO ] After 468ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 93 ms.
[2022-05-17 15:53:22] [INFO ] After 792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 8 out of 553 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 553/553 places, 4575/4575 transitions.
Graph (complete) has 1888 edges and 553 vertex of which 306 are kept as prefixes of interest. Removing 247 places using SCC suffix rule.2 ms
Discarding 247 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Drop transitions removed 288 transitions
Reduce isomorphic transitions removed 288 transitions.
Discarding 28 places :
Implicit places reduction removed 28 places
Iterating post reduction 0 with 316 rules applied. Total rules applied 317 place count 278 transition count 4269
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 61 rules applied. Total rules applied 378 place count 277 transition count 4209
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 406 place count 249 transition count 4209
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 410 place count 249 transition count 4205
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 414 place count 245 transition count 4205
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 4 with 28 rules applied. Total rules applied 442 place count 245 transition count 4177
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 470 place count 217 transition count 4177
Applied a total of 470 rules in 230 ms. Remains 217 /553 variables (removed 336) and now considering 4177/4575 (removed 398) transitions.
Finished structural reductions, in 1 iterations. Remains : 217/553 places, 4177/4575 transitions.
Incomplete random walk after 10000 steps, including 1660 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 48677 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 48677 steps, saw 16402 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :2
Running SMT prover for 1 properties.
[2022-05-17 15:53:26] [INFO ] Flow matrix only has 276 transitions (discarded 3901 similar events)
// Phase 1: matrix 276 rows 217 cols
[2022-05-17 15:53:26] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-17 15:53:26] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-17 15:53:26] [INFO ] After 65ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 15:53:26] [INFO ] After 102ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-17 15:53:26] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 217 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 217/217 places, 4177/4177 transitions.
Graph (complete) has 554 edges and 217 vertex of which 171 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.2 ms
Discarding 46 places :
Also discarding 99 output transitions
Drop transitions removed 99 transitions
Drop transitions removed 1937 transitions
Ensure Unique test removed 884 transitions
Reduce isomorphic transitions removed 2821 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2822 rules applied. Total rules applied 2823 place count 170 transition count 1257
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2825 place count 169 transition count 1256
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2826 place count 169 transition count 1255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2827 place count 168 transition count 1255
Applied a total of 2827 rules in 38 ms. Remains 168 /217 variables (removed 49) and now considering 1255/4177 (removed 2922) transitions.
Finished structural reductions, in 1 iterations. Remains : 168/217 places, 1255/4177 transitions.
Incomplete random walk after 10000 steps, including 1471 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 57341 steps, run visited all 1 properties in 1189 ms. (steps per millisecond=48 )
Probabilistic random walk after 57341 steps, saw 19812 distinct states, run finished after 1190 ms. (steps per millisecond=48 ) properties seen :1
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 17233 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17233 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 62 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:53:30] [INFO ] Computed 198 place invariants in 1591 ms
[2022-05-17 15:53:31] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:53:31] [INFO ] Implicit Places using invariants in 3209 ms returned []
Implicit Place search using SMT only with invariants took 3211 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:53:33] [INFO ] Computed 198 place invariants in 1610 ms
[2022-05-17 15:53:34] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:53:34] [INFO ] Dead Transitions using invariants and state equation in 3113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (LT s911 1) (LT s8416 1)) (OR (LT s2830 1) (LT s2891 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4650 steps with 256 reset in 127 ms.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-00 finished in 6849 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 17233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.69 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8319 transitions
Trivial Post-agglo rules discarded 8319 transitions
Performed 8319 trivial Post agglomeration. Transition count delta: 8319
Iterating post reduction 0 with 8319 rules applied. Total rules applied 8320 place count 17231 transition count 12808
Reduce places removed 8319 places and 0 transitions.
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16639 place count 8912 transition count 12808
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 16639 place count 8912 transition count 12678
Deduced a syphon composed of 130 places in 4 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 16899 place count 8782 transition count 12678
Discarding 4029 places :
Symmetric choice reduction at 2 with 4029 rule applications. Total rules 20928 place count 4753 transition count 8649
Iterating global reduction 2 with 4029 rules applied. Total rules applied 24957 place count 4753 transition count 8649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24957 place count 4753 transition count 8648
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24959 place count 4752 transition count 8648
Applied a total of 24959 rules in 2428 ms. Remains 4752 /17233 variables (removed 12481) and now considering 8648/21129 (removed 12481) transitions.
// Phase 1: matrix 8648 rows 4752 cols
[2022-05-17 15:53:37] [INFO ] Computed 198 place invariants in 84 ms
[2022-05-17 15:53:38] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:53:40] [INFO ] Implicit Places using invariants in 3365 ms returned [391, 2130, 2451, 3835, 4334]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3383 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4747/17233 places, 8648/21129 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 4683 transition count 8584
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 4683 transition count 8584
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 4682 transition count 8583
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 4682 transition count 8583
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 159 place count 4653 transition count 8554
Iterating global reduction 0 with 29 rules applied. Total rules applied 188 place count 4653 transition count 8554
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 0 with 256 rules applied. Total rules applied 444 place count 4525 transition count 8426
Applied a total of 444 rules in 2679 ms. Remains 4525 /4747 variables (removed 222) and now considering 8426/8648 (removed 222) transitions.
[2022-05-17 15:53:43] [INFO ] Flow matrix only has 8396 transitions (discarded 30 similar events)
// Phase 1: matrix 8396 rows 4525 cols
[2022-05-17 15:53:43] [INFO ] Computed 193 place invariants in 82 ms
[2022-05-17 15:53:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:53:47] [INFO ] Implicit Places using invariants in 3788 ms returned [883, 1495, 1498, 1971, 2453]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3794 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4520/17233 places, 8426/21129 transitions.
Discarding 128 places :
Symmetric choice reduction at 0 with 128 rule applications. Total rules 128 place count 4392 transition count 8298
Iterating global reduction 0 with 128 rules applied. Total rules applied 256 place count 4392 transition count 8298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 257 place count 4391 transition count 8297
Iterating global reduction 0 with 1 rules applied. Total rules applied 258 place count 4391 transition count 8297
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 286 place count 4363 transition count 8269
Iterating global reduction 0 with 28 rules applied. Total rules applied 314 place count 4363 transition count 8269
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 0 with 132 rules applied. Total rules applied 446 place count 4297 transition count 8203
Applied a total of 446 rules in 2379 ms. Remains 4297 /4520 variables (removed 223) and now considering 8203/8426 (removed 223) transitions.
[2022-05-17 15:53:49] [INFO ] Flow matrix only has 8143 transitions (discarded 60 similar events)
// Phase 1: matrix 8143 rows 4297 cols
[2022-05-17 15:53:49] [INFO ] Computed 188 place invariants in 82 ms
[2022-05-17 15:53:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:53:52] [INFO ] Implicit Places using invariants in 3015 ms returned [457, 782, 1071, 1266, 1951]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3021 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4292/17233 places, 8203/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 4288 transition count 8199
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 4288 transition count 8199
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 4284 transition count 8195
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 4284 transition count 8195
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 114 place count 4186 transition count 8097
Iterating global reduction 0 with 98 rules applied. Total rules applied 212 place count 4186 transition count 8097
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 214 place count 4185 transition count 8096
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 215 place count 4184 transition count 8095
Iterating global reduction 0 with 1 rules applied. Total rules applied 216 place count 4184 transition count 8095
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 244 place count 4156 transition count 8067
Iterating global reduction 0 with 28 rules applied. Total rules applied 272 place count 4156 transition count 8067
Applied a total of 272 rules in 3382 ms. Remains 4156 /4292 variables (removed 136) and now considering 8067/8203 (removed 136) transitions.
[2022-05-17 15:53:56] [INFO ] Flow matrix only has 7866 transitions (discarded 201 similar events)
// Phase 1: matrix 7866 rows 4156 cols
[2022-05-17 15:53:56] [INFO ] Computed 183 place invariants in 75 ms
[2022-05-17 15:53:59] [INFO ] Implicit Places using invariants in 2774 ms returned [1178, 2341, 3638, 3802, 3997]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2779 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 4151/17233 places, 8067/21129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 4148 transition count 8064
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 4148 transition count 8064
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 4145 transition count 8061
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 4145 transition count 8061
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 65 place count 4092 transition count 8008
Iterating global reduction 0 with 53 rules applied. Total rules applied 118 place count 4092 transition count 8008
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 0 with 118 rules applied. Total rules applied 236 place count 4033 transition count 7949
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 237 place count 4032 transition count 7948
Iterating global reduction 0 with 1 rules applied. Total rules applied 238 place count 4032 transition count 7948
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 274 place count 3996 transition count 7912
Iterating global reduction 0 with 36 rules applied. Total rules applied 310 place count 3996 transition count 7912
Applied a total of 310 rules in 2908 ms. Remains 3996 /4151 variables (removed 155) and now considering 7912/8067 (removed 155) transitions.
[2022-05-17 15:54:01] [INFO ] Flow matrix only has 7610 transitions (discarded 302 similar events)
// Phase 1: matrix 7610 rows 3996 cols
[2022-05-17 15:54:02] [INFO ] Computed 178 place invariants in 70 ms
[2022-05-17 15:54:04] [INFO ] Implicit Places using invariants in 2706 ms returned [734, 2373, 2504, 3144, 3269]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2712 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 3991/17233 places, 7912/21129 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 3930 transition count 7851
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 3930 transition count 7851
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 3928 transition count 7849
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 3928 transition count 7849
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 182 place count 3872 transition count 7793
Iterating global reduction 0 with 56 rules applied. Total rules applied 238 place count 3872 transition count 7793
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 0 with 118 rules applied. Total rules applied 356 place count 3813 transition count 7734
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 357 place count 3812 transition count 7733
Iterating global reduction 0 with 1 rules applied. Total rules applied 358 place count 3812 transition count 7733
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 386 place count 3784 transition count 7705
Iterating global reduction 0 with 28 rules applied. Total rules applied 414 place count 3784 transition count 7705
Applied a total of 414 rules in 2639 ms. Remains 3784 /3991 variables (removed 207) and now considering 7705/7912 (removed 207) transitions.
[2022-05-17 15:54:07] [INFO ] Flow matrix only has 7305 transitions (discarded 400 similar events)
// Phase 1: matrix 7305 rows 3784 cols
[2022-05-17 15:54:07] [INFO ] Computed 173 place invariants in 80 ms
[2022-05-17 15:54:09] [INFO ] Implicit Places using invariants in 2531 ms returned [1324, 1539, 2397, 2491, 3329]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2537 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 6 : 3779/17233 places, 7705/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3775 transition count 7701
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3775 transition count 7701
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 3771 transition count 7697
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 3771 transition count 7697
Discarding 104 places :
Symmetric choice reduction at 0 with 104 rule applications. Total rules 120 place count 3667 transition count 7593
Iterating global reduction 0 with 104 rules applied. Total rules applied 224 place count 3667 transition count 7593
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 226 place count 3666 transition count 7592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 227 place count 3665 transition count 7591
Iterating global reduction 0 with 1 rules applied. Total rules applied 228 place count 3665 transition count 7591
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 262 place count 3631 transition count 7557
Iterating global reduction 0 with 34 rules applied. Total rules applied 296 place count 3631 transition count 7557
Applied a total of 296 rules in 2472 ms. Remains 3631 /3779 variables (removed 148) and now considering 7557/7705 (removed 148) transitions.
[2022-05-17 15:54:12] [INFO ] Flow matrix only has 6997 transitions (discarded 560 similar events)
// Phase 1: matrix 6997 rows 3631 cols
[2022-05-17 15:54:12] [INFO ] Computed 168 place invariants in 57 ms
[2022-05-17 15:54:16] [INFO ] Implicit Places using invariants in 3995 ms returned [3, 32, 62, 65, 94, 124, 127, 156, 186, 189, 218, 248, 251, 280, 310, 313, 371, 374, 403, 433, 464, 494, 497, 526, 556, 559, 588, 618, 621, 650, 680, 683, 713, 721, 752, 781, 811, 814, 843, 873, 876, 905, 935, 938, 968, 971, 1000, 1030, 1033, 1062, 1092, 1101, 1104, 1133, 1163, 1166, 1196, 1230, 1259, 1262, 1291, 1321, 1326, 1355, 1358, 1387, 1417, 1420, 1449, 1479, 1482, 1512, 1515, 1545, 1577, 1607, 1643, 1672, 1675, 1704, 1734, 1736, 1738, 1767, 1797, 1800, 1829, 1859, 1862, 1894, 1897, 1926, 1956, 1959, 1991, 1994, 2023, 2053, 2056, 2085, 2115, 2120, 2149, 2152, 2181, 2214, 2243, 2273, 2276, 2305, 2335, 2344, 2347, 2376, 2406, 2409, 2438, 2441, 2470, 2500, 2503, 2532, 2562, 2565, 2594, 2624, 2627, 2656, 2686, 2689, 2718, 2748, 2751, 2780, 2810, 2813, 2842, 2872, 2875, 2907, 2936, 2969, 2998, 3028, 3031, 3060, 3090, 3093, 3122, 3152, 3155, 3184, 3217, 3246, 3280, 3313, 3357, 3360, 3389, 3419, 3422, 3451, 3481, 3484, 3517]
Discarding 165 places :
Implicit Place search using SMT only with invariants took 4003 ms to find 165 implicit places.
Starting structural reductions in SI_LTL mode, iteration 7 : 3466/17233 places, 7557/21129 transitions.
Discarding 3103 places :
Symmetric choice reduction at 0 with 3103 rule applications. Total rules 3103 place count 363 transition count 4454
Iterating global reduction 0 with 3103 rules applied. Total rules applied 6206 place count 363 transition count 4454
Discarding 107 places :
Symmetric choice reduction at 0 with 107 rule applications. Total rules 6313 place count 256 transition count 4347
Iterating global reduction 0 with 107 rules applied. Total rules applied 6420 place count 256 transition count 4347
Discarding 107 places :
Symmetric choice reduction at 0 with 107 rule applications. Total rules 6527 place count 149 transition count 4240
Iterating global reduction 0 with 107 rules applied. Total rules applied 6634 place count 149 transition count 4240
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 6646 place count 143 transition count 4234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6647 place count 142 transition count 4233
Iterating global reduction 0 with 1 rules applied. Total rules applied 6648 place count 142 transition count 4233
Applied a total of 6648 rules in 192 ms. Remains 142 /3466 variables (removed 3324) and now considering 4233/7557 (removed 3324) transitions.
[2022-05-17 15:54:16] [INFO ] Flow matrix only has 171 transitions (discarded 4062 similar events)
// Phase 1: matrix 171 rows 142 cols
[2022-05-17 15:54:16] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 15:54:16] [INFO ] Implicit Places using invariants in 259 ms returned []
[2022-05-17 15:54:16] [INFO ] Flow matrix only has 171 transitions (discarded 4062 similar events)
// Phase 1: matrix 171 rows 142 cols
[2022-05-17 15:54:16] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 15:54:17] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 8 : 142/17233 places, 4233/21129 transitions.
Finished structural reductions, in 8 iterations. Remains : 142/17233 places, 4233/21129 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s126 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 6 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-01 finished in 42079 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(F((F(p2)&&p1)))&&p0)))'
Support contains 5 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 64 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:54:18] [INFO ] Computed 198 place invariants in 1600 ms
[2022-05-17 15:54:20] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:54:20] [INFO ] Implicit Places using invariants in 3106 ms returned []
Implicit Place search using SMT only with invariants took 3107 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:54:21] [INFO ] Computed 198 place invariants in 1538 ms
[2022-05-17 15:54:23] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:54:23] [INFO ] Dead Transitions using invariants and state equation in 3031 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(OR (LT s2752 1) (LT s8416 1)), p1:(AND (OR (LT s7100 1) (LT s16045 1)) (GEQ s2470 1)), p0:(AND (GEQ s2752 1) (GEQ s8416 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-02 finished in 6482 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0 U (G(p0)||(p0&&F(G(!p1)))))))))'
Support contains 3 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 61 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:54:25] [INFO ] Computed 198 place invariants in 1655 ms
[2022-05-17 15:54:26] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:54:27] [INFO ] Implicit Places using invariants in 3187 ms returned []
Implicit Place search using SMT only with invariants took 3188 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:54:28] [INFO ] Computed 198 place invariants in 1615 ms
[2022-05-17 15:54:30] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:54:30] [INFO ] Dead Transitions using invariants and state equation in 3168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(LT s2378 1), p1:(AND (GEQ s5787 1) (GEQ s6311 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5498 reset in 1655 ms.
Product exploration explored 100000 steps with 5499 reset in 1697 ms.
Computed a total of 17233 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17233 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-05 finished in 29689 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||G(p2)))'
Support contains 7 out of 17233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.22 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8286 transitions
Trivial Post-agglo rules discarded 8286 transitions
Performed 8286 trivial Post agglomeration. Transition count delta: 8286
Iterating post reduction 0 with 8286 rules applied. Total rules applied 8287 place count 17231 transition count 12841
Reduce places removed 8286 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 8318 rules applied. Total rules applied 16605 place count 8945 transition count 12809
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 16637 place count 8913 transition count 12809
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16637 place count 8913 transition count 12680
Deduced a syphon composed of 129 places in 3 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16895 place count 8784 transition count 12680
Discarding 4028 places :
Symmetric choice reduction at 3 with 4028 rule applications. Total rules 20923 place count 4756 transition count 8652
Iterating global reduction 3 with 4028 rules applied. Total rules applied 24951 place count 4756 transition count 8652
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24951 place count 4756 transition count 8651
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24953 place count 4755 transition count 8651
Applied a total of 24953 rules in 2129 ms. Remains 4755 /17233 variables (removed 12478) and now considering 8651/21129 (removed 12478) transitions.
// Phase 1: matrix 8651 rows 4755 cols
[2022-05-17 15:54:55] [INFO ] Computed 198 place invariants in 82 ms
[2022-05-17 15:54:56] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:54:59] [INFO ] Implicit Places using invariants in 3515 ms returned [571, 1139, 1780, 3414]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3520 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4751/17233 places, 8651/21129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4749 transition count 8649
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4749 transition count 8649
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 4747 transition count 8647
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4747 transition count 8647
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 55 place count 4700 transition count 8600
Iterating global reduction 0 with 47 rules applied. Total rules applied 102 place count 4700 transition count 8600
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 0 with 128 rules applied. Total rules applied 230 place count 4636 transition count 8536
Applied a total of 230 rules in 2836 ms. Remains 4636 /4751 variables (removed 115) and now considering 8536/8651 (removed 115) transitions.
[2022-05-17 15:55:01] [INFO ] Flow matrix only has 8489 transitions (discarded 47 similar events)
// Phase 1: matrix 8489 rows 4636 cols
[2022-05-17 15:55:02] [INFO ] Computed 194 place invariants in 88 ms
[2022-05-17 15:55:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:55:05] [INFO ] Implicit Places using invariants in 3155 ms returned [595, 769, 1236, 2261, 4087]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3160 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4631/17233 places, 8536/21129 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 4599 transition count 8504
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 4599 transition count 8504
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 4597 transition count 8502
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 4597 transition count 8502
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 124 place count 4541 transition count 8446
Iterating global reduction 0 with 56 rules applied. Total rules applied 180 place count 4541 transition count 8446
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 1 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 0 with 188 rules applied. Total rules applied 368 place count 4447 transition count 8352
Applied a total of 368 rules in 2618 ms. Remains 4447 /4631 variables (removed 184) and now considering 8352/8536 (removed 184) transitions.
[2022-05-17 15:55:07] [INFO ] Flow matrix only has 8247 transitions (discarded 105 similar events)
// Phase 1: matrix 8247 rows 4447 cols
[2022-05-17 15:55:07] [INFO ] Computed 189 place invariants in 81 ms
[2022-05-17 15:55:08] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:55:10] [INFO ] Implicit Places using invariants in 3293 ms returned [2641, 2882, 3800, 4250]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3299 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4443/17233 places, 8352/21129 transitions.
Discarding 127 places :
Symmetric choice reduction at 0 with 127 rule applications. Total rules 127 place count 4316 transition count 8225
Iterating global reduction 0 with 127 rules applied. Total rules applied 254 place count 4316 transition count 8225
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 0 with 132 rules applied. Total rules applied 386 place count 4250 transition count 8159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 387 place count 4249 transition count 8158
Iterating global reduction 0 with 1 rules applied. Total rules applied 388 place count 4249 transition count 8158
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 406 place count 4231 transition count 8140
Iterating global reduction 0 with 18 rules applied. Total rules applied 424 place count 4231 transition count 8140
Applied a total of 424 rules in 2350 ms. Remains 4231 /4443 variables (removed 212) and now considering 8140/8352 (removed 212) transitions.
[2022-05-17 15:55:13] [INFO ] Flow matrix only has 8013 transitions (discarded 127 similar events)
// Phase 1: matrix 8013 rows 4231 cols
[2022-05-17 15:55:13] [INFO ] Computed 185 place invariants in 78 ms
[2022-05-17 15:55:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:55:16] [INFO ] Implicit Places using invariants in 2842 ms returned [843, 1181, 1870, 2199, 3973]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2848 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 4226/17233 places, 8140/21129 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 4163 transition count 8077
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 4163 transition count 8077
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 128 place count 4161 transition count 8075
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 4161 transition count 8075
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 189 place count 4102 transition count 8016
Iterating global reduction 0 with 59 rules applied. Total rules applied 248 place count 4102 transition count 8016
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 1 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 0 with 244 rules applied. Total rules applied 492 place count 3980 transition count 7894
Applied a total of 492 rules in 2117 ms. Remains 3980 /4226 variables (removed 246) and now considering 7894/8140 (removed 246) transitions.
[2022-05-17 15:55:18] [INFO ] Flow matrix only has 7701 transitions (discarded 193 similar events)
// Phase 1: matrix 7701 rows 3980 cols
[2022-05-17 15:55:18] [INFO ] Computed 180 place invariants in 70 ms
[2022-05-17 15:55:20] [INFO ] Implicit Places using invariants in 2552 ms returned [621, 960, 2801, 2925, 3606]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2557 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 3975/17233 places, 7894/21129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 3972 transition count 7891
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 3972 transition count 7891
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 3969 transition count 7888
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 3969 transition count 7888
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 80 place count 3901 transition count 7820
Iterating global reduction 0 with 68 rules applied. Total rules applied 148 place count 3901 transition count 7820
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 2 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 0 with 124 rules applied. Total rules applied 272 place count 3839 transition count 7758
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 273 place count 3838 transition count 7757
Iterating global reduction 0 with 1 rules applied. Total rules applied 274 place count 3838 transition count 7757
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 309 place count 3803 transition count 7722
Iterating global reduction 0 with 35 rules applied. Total rules applied 344 place count 3803 transition count 7722
Applied a total of 344 rules in 2654 ms. Remains 3803 /3975 variables (removed 172) and now considering 7722/7894 (removed 172) transitions.
[2022-05-17 15:55:23] [INFO ] Flow matrix only has 7406 transitions (discarded 316 similar events)
// Phase 1: matrix 7406 rows 3803 cols
[2022-05-17 15:55:23] [INFO ] Computed 175 place invariants in 70 ms
[2022-05-17 15:55:25] [INFO ] Implicit Places using invariants in 2384 ms returned [430, 550, 794, 1730, 2101]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2390 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 6 : 3798/17233 places, 7722/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3794 transition count 7718
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3794 transition count 7718
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 3790 transition count 7714
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 3790 transition count 7714
Discarding 104 places :
Symmetric choice reduction at 0 with 104 rule applications. Total rules 120 place count 3686 transition count 7610
Iterating global reduction 0 with 104 rules applied. Total rules applied 224 place count 3686 transition count 7610
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 226 place count 3685 transition count 7609
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 227 place count 3684 transition count 7608
Iterating global reduction 0 with 1 rules applied. Total rules applied 228 place count 3684 transition count 7608
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 258 place count 3654 transition count 7578
Iterating global reduction 0 with 30 rules applied. Total rules applied 288 place count 3654 transition count 7578
Applied a total of 288 rules in 2345 ms. Remains 3654 /3798 variables (removed 144) and now considering 7578/7722 (removed 144) transitions.
[2022-05-17 15:55:28] [INFO ] Flow matrix only has 7103 transitions (discarded 475 similar events)
// Phase 1: matrix 7103 rows 3654 cols
[2022-05-17 15:55:28] [INFO ] Computed 170 place invariants in 64 ms
[2022-05-17 15:55:31] [INFO ] Implicit Places using invariants in 3633 ms returned [3, 32, 61, 64, 93, 122, 125, 154, 183, 186, 215, 244, 247, 276, 305, 308, 337, 366, 369, 398, 427, 458, 487, 518, 522, 550, 554, 584, 613, 642, 645, 675, 706, 736, 739, 768, 797, 800, 830, 837, 865, 868, 897, 926, 931, 959, 963, 991, 994, 1054, 1057, 1086, 1115, 1118, 1147, 1176, 1179, 1208, 1237, 1240, 1269, 1298, 1307, 1335, 1338, 1367, 1396, 1399, 1428, 1457, 1460, 1489, 1518, 1521, 1551, 1582, 1611, 1640, 1648, 1676, 1678, 1680, 1710, 1741, 1770, 1799, 1802, 1831, 1860, 1863, 1891, 1894, 1923, 1952, 1955, 1990, 1993, 2022, 2051, 2054, 2083, 2115, 2144, 2173, 2176, 2205, 2234, 2237, 2298, 2301, 2337, 2340, 2369, 2398, 2401, 2430, 2459, 2462, 2491, 2520, 2523, 2560, 2589, 2618, 2621, 2653, 2656, 2685, 2714, 2717, 2746, 2775, 2778, 2807, 2836, 2839, 2868, 2897, 2900, 2929, 2958, 2961, 2990, 3019, 3022, 3051, 3083, 3112, 3141, 3144, 3173, 3202, 3204, 3232, 3235, 3264, 3296, 3325, 3354, 3357, 3386, 3418, 3447, 3479, 3508, 3537]
Discarding 166 places :
Implicit Place search using SMT only with invariants took 3640 ms to find 166 implicit places.
Starting structural reductions in SI_LTL mode, iteration 7 : 3488/17233 places, 7578/21129 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3488 transition count 7577
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3487 transition count 7577
Discarding 3113 places :
Symmetric choice reduction at 0 with 3113 rule applications. Total rules 3115 place count 374 transition count 4464
Iterating global reduction 0 with 3113 rules applied. Total rules applied 6228 place count 374 transition count 4464
Discarding 109 places :
Symmetric choice reduction at 0 with 109 rule applications. Total rules 6337 place count 265 transition count 4355
Iterating global reduction 0 with 109 rules applied. Total rules applied 6446 place count 265 transition count 4355
Discarding 109 places :
Symmetric choice reduction at 0 with 109 rule applications. Total rules 6555 place count 156 transition count 4246
Iterating global reduction 0 with 109 rules applied. Total rules applied 6664 place count 156 transition count 4246
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 6678 place count 149 transition count 4239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6679 place count 148 transition count 4238
Iterating global reduction 0 with 1 rules applied. Total rules applied 6680 place count 148 transition count 4238
Applied a total of 6680 rules in 199 ms. Remains 148 /3488 variables (removed 3340) and now considering 4238/7578 (removed 3340) transitions.
[2022-05-17 15:55:32] [INFO ] Flow matrix only has 208 transitions (discarded 4030 similar events)
// Phase 1: matrix 208 rows 148 cols
[2022-05-17 15:55:32] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 15:55:32] [INFO ] Implicit Places using invariants in 255 ms returned []
[2022-05-17 15:55:32] [INFO ] Flow matrix only has 208 transitions (discarded 4030 similar events)
// Phase 1: matrix 208 rows 148 cols
[2022-05-17 15:55:32] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 15:55:32] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 8 : 148/17233 places, 4238/21129 transitions.
Finished structural reductions, in 8 iterations. Remains : 148/17233 places, 4238/21129 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(AND (GEQ s103 1) (GEQ s136 1)), p0:(AND (GEQ s94 1) (GEQ s96 1) (GEQ s46 1)), p2:(OR (LT s120 1) (LT s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 74 steps with 8 reset in 2 ms.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-06 finished in 39487 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(G(p0))||X(p1)))'
Support contains 2 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 92 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:55:34] [INFO ] Computed 198 place invariants in 1546 ms
[2022-05-17 15:55:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:55:35] [INFO ] Implicit Places using invariants in 2928 ms returned []
Implicit Place search using SMT only with invariants took 2929 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:55:37] [INFO ] Computed 198 place invariants in 1595 ms
[2022-05-17 15:55:38] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:55:38] [INFO ] Dead Transitions using invariants and state equation in 3006 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GEQ s2496 1), p0:(LT s2707 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13581 steps with 746 reset in 325 ms.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-07 finished in 6570 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X(((p0 U F(G(p1)))&&G(p0)))))))'
Support contains 3 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 72 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:55:41] [INFO ] Computed 198 place invariants in 1559 ms
[2022-05-17 15:55:42] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:55:42] [INFO ] Implicit Places using invariants in 3115 ms returned []
Implicit Place search using SMT only with invariants took 3116 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:55:44] [INFO ] Computed 198 place invariants in 1583 ms
[2022-05-17 15:55:45] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:55:45] [INFO ] Dead Transitions using invariants and state equation in 3134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s5524 1) (GEQ s9994 1)), p1:(GEQ s9249 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-08 finished in 6623 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F(X(!((p0 U G(F(!p1))) U p0)))))))'
Support contains 4 out of 17233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.23 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8287 transitions
Trivial Post-agglo rules discarded 8287 transitions
Performed 8287 trivial Post agglomeration. Transition count delta: 8287
Iterating post reduction 0 with 8287 rules applied. Total rules applied 8288 place count 17231 transition count 12840
Reduce places removed 8287 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16607 place count 8944 transition count 12808
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 16639 place count 8912 transition count 12808
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16639 place count 8912 transition count 12679
Deduced a syphon composed of 129 places in 4 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16897 place count 8783 transition count 12679
Discarding 4029 places :
Symmetric choice reduction at 3 with 4029 rule applications. Total rules 20926 place count 4754 transition count 8650
Iterating global reduction 3 with 4029 rules applied. Total rules applied 24955 place count 4754 transition count 8650
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24955 place count 4754 transition count 8649
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24957 place count 4753 transition count 8649
Applied a total of 24957 rules in 2232 ms. Remains 4753 /17233 variables (removed 12480) and now considering 8649/21129 (removed 12480) transitions.
// Phase 1: matrix 8649 rows 4753 cols
[2022-05-17 15:55:48] [INFO ] Computed 198 place invariants in 87 ms
[2022-05-17 15:55:48] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:55:52] [INFO ] Implicit Places using invariants in 3762 ms returned [355, 1210, 3270, 3409, 4264]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3773 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4748/17233 places, 8649/21129 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 4684 transition count 8585
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 4684 transition count 8585
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 4683 transition count 8584
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 4683 transition count 8584
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 147 place count 4666 transition count 8567
Iterating global reduction 0 with 17 rules applied. Total rules applied 164 place count 4666 transition count 8567
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 2 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 0 with 258 rules applied. Total rules applied 422 place count 4537 transition count 8438
Applied a total of 422 rules in 2859 ms. Remains 4537 /4748 variables (removed 211) and now considering 8438/8649 (removed 211) transitions.
[2022-05-17 15:55:54] [INFO ] Flow matrix only has 8421 transitions (discarded 17 similar events)
// Phase 1: matrix 8421 rows 4537 cols
[2022-05-17 15:55:55] [INFO ] Computed 193 place invariants in 83 ms
[2022-05-17 15:55:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:55:58] [INFO ] Implicit Places using invariants in 3211 ms returned [71, 919, 1971, 2891, 4405]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3218 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4532/17233 places, 8438/21129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4530 transition count 8436
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4530 transition count 8436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 4529 transition count 8435
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 4529 transition count 8435
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 26 place count 4509 transition count 8415
Iterating global reduction 0 with 20 rules applied. Total rules applied 46 place count 4509 transition count 8415
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 2 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 0 with 254 rules applied. Total rules applied 300 place count 4382 transition count 8288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 301 place count 4381 transition count 8287
Iterating global reduction 0 with 1 rules applied. Total rules applied 302 place count 4381 transition count 8287
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 317 place count 4366 transition count 8272
Iterating global reduction 0 with 15 rules applied. Total rules applied 332 place count 4366 transition count 8272
Applied a total of 332 rules in 3640 ms. Remains 4366 /4532 variables (removed 166) and now considering 8272/8438 (removed 166) transitions.
[2022-05-17 15:56:01] [INFO ] Flow matrix only has 8215 transitions (discarded 57 similar events)
// Phase 1: matrix 8215 rows 4366 cols
[2022-05-17 15:56:01] [INFO ] Computed 188 place invariants in 79 ms
[2022-05-17 15:56:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:56:05] [INFO ] Implicit Places using invariants in 3276 ms returned [1269, 1301, 2688, 3114, 3541]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3282 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4361/17233 places, 8272/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 4357 transition count 8268
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 4357 transition count 8268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 4355 transition count 8266
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 4355 transition count 8266
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 59 place count 4308 transition count 8219
Iterating global reduction 0 with 47 rules applied. Total rules applied 106 place count 4308 transition count 8219
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 2 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 0 with 248 rules applied. Total rules applied 354 place count 4184 transition count 8095
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 355 place count 4183 transition count 8094
Iterating global reduction 0 with 1 rules applied. Total rules applied 356 place count 4183 transition count 8094
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 385 place count 4154 transition count 8065
Iterating global reduction 0 with 29 rules applied. Total rules applied 414 place count 4154 transition count 8065
Applied a total of 414 rules in 3273 ms. Remains 4154 /4361 variables (removed 207) and now considering 8065/8272 (removed 207) transitions.
[2022-05-17 15:56:08] [INFO ] Flow matrix only has 7921 transitions (discarded 144 similar events)
// Phase 1: matrix 7921 rows 4154 cols
[2022-05-17 15:56:08] [INFO ] Computed 183 place invariants in 77 ms
[2022-05-17 15:56:08] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:56:11] [INFO ] Implicit Places using invariants in 2909 ms returned [1427, 2580, 3086, 3966]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2918 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 4150/17233 places, 8065/21129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 4147 transition count 8062
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 4147 transition count 8062
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 4144 transition count 8059
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 4144 transition count 8059
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 91 place count 4065 transition count 7980
Iterating global reduction 0 with 79 rules applied. Total rules applied 170 place count 4065 transition count 7980
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 172 place count 4064 transition count 7979
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 173 place count 4063 transition count 7978
Iterating global reduction 0 with 1 rules applied. Total rules applied 174 place count 4063 transition count 7978
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 211 place count 4026 transition count 7941
Iterating global reduction 0 with 37 rules applied. Total rules applied 248 place count 4026 transition count 7941
Applied a total of 248 rules in 2954 ms. Remains 4026 /4150 variables (removed 124) and now considering 7941/8065 (removed 124) transitions.
[2022-05-17 15:56:14] [INFO ] Flow matrix only has 7669 transitions (discarded 272 similar events)
// Phase 1: matrix 7669 rows 4026 cols
[2022-05-17 15:56:14] [INFO ] Computed 179 place invariants in 72 ms
[2022-05-17 15:56:16] [INFO ] Implicit Places using invariants in 2694 ms returned [800, 1299, 1623, 1974, 3550]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2702 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 4021/17233 places, 7941/21129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 4018 transition count 7938
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 4018 transition count 7938
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 4016 transition count 7936
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 4016 transition count 7936
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 66 place count 3960 transition count 7880
Iterating global reduction 0 with 56 rules applied. Total rules applied 122 place count 3960 transition count 7880
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 2 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 0 with 234 rules applied. Total rules applied 356 place count 3843 transition count 7763
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 357 place count 3842 transition count 7762
Iterating global reduction 0 with 1 rules applied. Total rules applied 358 place count 3842 transition count 7762
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 386 place count 3814 transition count 7734
Iterating global reduction 0 with 28 rules applied. Total rules applied 414 place count 3814 transition count 7734
Applied a total of 414 rules in 2725 ms. Remains 3814 /4021 variables (removed 207) and now considering 7734/7941 (removed 207) transitions.
[2022-05-17 15:56:19] [INFO ] Flow matrix only has 7365 transitions (discarded 369 similar events)
// Phase 1: matrix 7365 rows 3814 cols
[2022-05-17 15:56:19] [INFO ] Computed 174 place invariants in 69 ms
[2022-05-17 15:56:23] [INFO ] Implicit Places using invariants in 4169 ms returned [3, 32, 62, 93, 123, 126, 155, 185, 188, 217, 247, 250, 280, 312, 341, 371, 374, 403, 433, 436, 465, 495, 498, 527, 557, 560, 589, 619, 622, 651, 681, 684, 713, 743, 746, 804, 807, 837, 840, 869, 899, 902, 931, 961, 964, 993, 1023, 1041, 1070, 1073, 1102, 1132, 1135, 1168, 1197, 1227, 1233, 1262, 1265, 1294, 1324, 1329, 1358, 1361, 1390, 1420, 1423, 1452, 1482, 1485, 1515, 1518, 1547, 1577, 1580, 1610, 1642, 1671, 1701, 1704, 1733, 1763, 1766, 1796, 1827, 1829, 1858, 1888, 1891, 1920, 1950, 1953, 1982, 2012, 2015, 2044, 2074, 2077, 2106, 2136, 2139, 2168, 2198, 2201, 2230, 2260, 2263, 2292, 2322, 2325, 2354, 2394, 2423, 2426, 2465, 2468, 2497, 2527, 2530, 2559, 2589, 2592, 2621, 2651, 2654, 2683, 2686, 2715, 2748, 2777, 2780, 2809, 2839, 2842, 2871, 2874, 2903, 2933, 2936, 2965, 2995, 2998, 3027, 3057, 3060, 3101, 3104, 3133, 3163, 3166, 3195, 3225, 3228, 3257, 3287, 3321, 3355, 3384, 3417, 3446, 3476, 3479, 3508, 3538, 3541, 3570, 3600, 3603, 3632, 3662, 3665]
Discarding 171 places :
Implicit Place search using SMT only with invariants took 4178 ms to find 171 implicit places.
Starting structural reductions in SI_LTL mode, iteration 6 : 3643/17233 places, 7734/21129 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3643 transition count 7733
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3642 transition count 7733
Discarding 3267 places :
Symmetric choice reduction at 0 with 3267 rule applications. Total rules 3269 place count 375 transition count 4466
Iterating global reduction 0 with 3267 rules applied. Total rules applied 6536 place count 375 transition count 4466
Discarding 113 places :
Symmetric choice reduction at 0 with 113 rule applications. Total rules 6649 place count 262 transition count 4353
Iterating global reduction 0 with 113 rules applied. Total rules applied 6762 place count 262 transition count 4353
Discarding 113 places :
Symmetric choice reduction at 0 with 113 rule applications. Total rules 6875 place count 149 transition count 4240
Iterating global reduction 0 with 113 rules applied. Total rules applied 6988 place count 149 transition count 4240
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 6998 place count 144 transition count 4235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6999 place count 143 transition count 4234
Iterating global reduction 0 with 1 rules applied. Total rules applied 7000 place count 143 transition count 4234
Applied a total of 7000 rules in 213 ms. Remains 143 /3643 variables (removed 3500) and now considering 4234/7734 (removed 3500) transitions.
[2022-05-17 15:56:24] [INFO ] Flow matrix only has 172 transitions (discarded 4062 similar events)
// Phase 1: matrix 172 rows 143 cols
[2022-05-17 15:56:24] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-17 15:56:24] [INFO ] Implicit Places using invariants in 264 ms returned []
[2022-05-17 15:56:24] [INFO ] Flow matrix only has 172 transitions (discarded 4062 similar events)
// Phase 1: matrix 172 rows 143 cols
[2022-05-17 15:56:24] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-17 15:56:24] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 7 : 143/17233 places, 4234/21129 transitions.
Finished structural reductions, in 7 iterations. Remains : 143/17233 places, 4234/21129 transitions.
Stuttering acceptance computed with spot in 127 ms :[p0, p0, (AND p0 (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s46 1)), p1:(AND (GEQ s122 1) (GEQ s124 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 10925 reset in 485 ms.
Product exploration explored 100000 steps with 10939 reset in 539 ms.
Computed a total of 143 stabilizing places and 4234 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 143 transition count 4234
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 7 factoid took 453 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-09 finished in 40668 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 17233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8319 transitions
Trivial Post-agglo rules discarded 8319 transitions
Performed 8319 trivial Post agglomeration. Transition count delta: 8319
Iterating post reduction 0 with 8319 rules applied. Total rules applied 8320 place count 17231 transition count 12808
Reduce places removed 8319 places and 0 transitions.
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16639 place count 8912 transition count 12808
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 16639 place count 8912 transition count 12678
Deduced a syphon composed of 130 places in 4 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 16899 place count 8782 transition count 12678
Discarding 4029 places :
Symmetric choice reduction at 2 with 4029 rule applications. Total rules 20928 place count 4753 transition count 8649
Iterating global reduction 2 with 4029 rules applied. Total rules applied 24957 place count 4753 transition count 8649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24957 place count 4753 transition count 8648
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24959 place count 4752 transition count 8648
Applied a total of 24959 rules in 1968 ms. Remains 4752 /17233 variables (removed 12481) and now considering 8648/21129 (removed 12481) transitions.
// Phase 1: matrix 8648 rows 4752 cols
[2022-05-17 15:56:28] [INFO ] Computed 198 place invariants in 86 ms
[2022-05-17 15:56:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:56:32] [INFO ] Implicit Places using invariants in 3535 ms returned [391, 1917, 3127, 3343, 3660]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3541 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4747/17233 places, 8648/21129 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4746 transition count 8647
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4746 transition count 8647
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4745 transition count 8646
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4745 transition count 8646
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 18 place count 4731 transition count 8632
Iterating global reduction 0 with 14 rules applied. Total rules applied 32 place count 4731 transition count 8632
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 0 with 256 rules applied. Total rules applied 288 place count 4603 transition count 8504
Applied a total of 288 rules in 2812 ms. Remains 4603 /4747 variables (removed 144) and now considering 8504/8648 (removed 144) transitions.
[2022-05-17 15:56:35] [INFO ] Flow matrix only has 8490 transitions (discarded 14 similar events)
// Phase 1: matrix 8490 rows 4603 cols
[2022-05-17 15:56:35] [INFO ] Computed 193 place invariants in 86 ms
[2022-05-17 15:56:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:56:38] [INFO ] Implicit Places using invariants in 3473 ms returned [2555, 2659, 2972, 3110, 4336]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3480 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4598/17233 places, 8504/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 4594 transition count 8500
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 4594 transition count 8500
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 4591 transition count 8497
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 4591 transition count 8497
Discarding 93 places :
Symmetric choice reduction at 0 with 93 rule applications. Total rules 107 place count 4498 transition count 8404
Iterating global reduction 0 with 93 rules applied. Total rules applied 200 place count 4498 transition count 8404
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 0 with 128 rules applied. Total rules applied 328 place count 4434 transition count 8340
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 329 place count 4433 transition count 8339
Iterating global reduction 0 with 1 rules applied. Total rules applied 330 place count 4433 transition count 8339
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 360 place count 4403 transition count 8309
Iterating global reduction 0 with 30 rules applied. Total rules applied 390 place count 4403 transition count 8309
Applied a total of 390 rules in 3597 ms. Remains 4403 /4598 variables (removed 195) and now considering 8309/8504 (removed 195) transitions.
[2022-05-17 15:56:42] [INFO ] Flow matrix only has 8166 transitions (discarded 143 similar events)
// Phase 1: matrix 8166 rows 4403 cols
[2022-05-17 15:56:42] [INFO ] Computed 188 place invariants in 78 ms
[2022-05-17 15:56:42] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:56:45] [INFO ] Implicit Places using invariants in 3114 ms returned [1087, 1495, 2698, 3560]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3119 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4399/17233 places, 8309/21129 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 4338 transition count 8248
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 4338 transition count 8248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 4337 transition count 8247
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 4337 transition count 8247
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 154 place count 4307 transition count 8217
Iterating global reduction 0 with 30 rules applied. Total rules applied 184 place count 4307 transition count 8217
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 1 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 0 with 246 rules applied. Total rules applied 430 place count 4184 transition count 8094
Applied a total of 430 rules in 2323 ms. Remains 4184 /4399 variables (removed 215) and now considering 8094/8309 (removed 215) transitions.
[2022-05-17 15:56:47] [INFO ] Flow matrix only has 7919 transitions (discarded 175 similar events)
// Phase 1: matrix 7919 rows 4184 cols
[2022-05-17 15:56:47] [INFO ] Computed 184 place invariants in 77 ms
[2022-05-17 15:56:50] [INFO ] Implicit Places using invariants in 2794 ms returned [844, 1494, 2342, 2475, 2837]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2798 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 4179/17233 places, 8094/21129 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 4118 transition count 8033
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 4118 transition count 8033
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 4117 transition count 8032
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 4117 transition count 8032
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 152 place count 4089 transition count 8004
Iterating global reduction 0 with 28 rules applied. Total rules applied 180 place count 4089 transition count 8004
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 1 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 0 with 246 rules applied. Total rules applied 426 place count 3966 transition count 7881
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 427 place count 3965 transition count 7880
Iterating global reduction 0 with 1 rules applied. Total rules applied 428 place count 3965 transition count 7880
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 456 place count 3937 transition count 7852
Iterating global reduction 0 with 28 rules applied. Total rules applied 484 place count 3937 transition count 7852
Applied a total of 484 rules in 2847 ms. Remains 3937 /4179 variables (removed 242) and now considering 7852/8094 (removed 242) transitions.
[2022-05-17 15:56:53] [INFO ] Flow matrix only has 7612 transitions (discarded 240 similar events)
// Phase 1: matrix 7612 rows 3937 cols
[2022-05-17 15:56:53] [INFO ] Computed 179 place invariants in 70 ms
[2022-05-17 15:56:55] [INFO ] Implicit Places using invariants in 2485 ms returned [310, 464, 1180, 1989, 3720]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2495 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 3932/17233 places, 7852/21129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 3929 transition count 7849
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 3929 transition count 7849
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 3926 transition count 7846
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 3926 transition count 7846
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 57 place count 3881 transition count 7801
Iterating global reduction 0 with 45 rules applied. Total rules applied 102 place count 3881 transition count 7801
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 0 with 116 rules applied. Total rules applied 218 place count 3823 transition count 7743
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 219 place count 3822 transition count 7742
Iterating global reduction 0 with 1 rules applied. Total rules applied 220 place count 3822 transition count 7742
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 264 place count 3778 transition count 7698
Iterating global reduction 0 with 44 rules applied. Total rules applied 308 place count 3778 transition count 7698
Applied a total of 308 rules in 2530 ms. Remains 3778 /3932 variables (removed 154) and now considering 7698/7852 (removed 154) transitions.
[2022-05-17 15:56:58] [INFO ] Flow matrix only has 7351 transitions (discarded 347 similar events)
// Phase 1: matrix 7351 rows 3778 cols
[2022-05-17 15:56:58] [INFO ] Computed 174 place invariants in 60 ms
[2022-05-17 15:57:00] [INFO ] Implicit Places using invariants in 2481 ms returned [429, 487, 2152, 3399]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2487 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 6 : 3774/17233 places, 7698/21129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 3771 transition count 7695
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 3771 transition count 7695
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 3769 transition count 7693
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 3769 transition count 7693
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 52 place count 3727 transition count 7651
Iterating global reduction 0 with 42 rules applied. Total rules applied 94 place count 3727 transition count 7651
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 214 place count 3667 transition count 7591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 215 place count 3666 transition count 7590
Iterating global reduction 0 with 1 rules applied. Total rules applied 216 place count 3666 transition count 7590
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 243 place count 3639 transition count 7563
Iterating global reduction 0 with 27 rules applied. Total rules applied 270 place count 3639 transition count 7563
Applied a total of 270 rules in 2314 ms. Remains 3639 /3774 variables (removed 135) and now considering 7563/7698 (removed 135) transitions.
[2022-05-17 15:57:03] [INFO ] Flow matrix only has 7129 transitions (discarded 434 similar events)
// Phase 1: matrix 7129 rows 3639 cols
[2022-05-17 15:57:03] [INFO ] Computed 170 place invariants in 65 ms
[2022-05-17 15:57:06] [INFO ] Implicit Places using invariants in 3729 ms returned [3, 30, 60, 63, 90, 120, 123, 150, 180, 183, 210, 240, 243, 271, 303, 359, 362, 389, 419, 449, 452, 480, 483, 510, 540, 543, 570, 600, 603, 630, 660, 663, 691, 723, 750, 780, 783, 810, 840, 843, 871, 903, 930, 960, 963, 990, 1020, 1023, 1050, 1080, 1093, 1122, 1125, 1152, 1182, 1185, 1213, 1245, 1273, 1305, 1332, 1362, 1365, 1392, 1422, 1425, 1452, 1482, 1485, 1513, 1545, 1572, 1602, 1605, 1632, 1662, 1665, 1692, 1722, 1725, 1752, 1782, 1785, 1844, 1846, 1858, 1887, 1890, 1917, 1947, 1950, 1977, 2007, 2010, 2037, 2070, 2102, 2129, 2159, 2166, 2169, 2196, 2226, 2229, 2258, 2261, 2288, 2318, 2321, 2348, 2378, 2381, 2413, 2446, 2449, 2478, 2481, 2508, 2538, 2541, 2570, 2573, 2600, 2630, 2633, 2660, 2690, 2693, 2720, 2750, 2753, 2788, 2791, 2818, 2848, 2851, 2878, 2911, 2938, 2968, 2971, 2998, 3028, 3031, 3058, 3088, 3091, 3118, 3148, 3151, 3178, 3208, 3211, 3238, 3271, 3298, 3328, 3331, 3358, 3388, 3391, 3418, 3448, 3461, 3464, 3491, 3521]
Discarding 167 places :
Implicit Place search using SMT only with invariants took 3735 ms to find 167 implicit places.
Starting structural reductions in SI_LTL mode, iteration 7 : 3472/17233 places, 7563/21129 transitions.
Discarding 3101 places :
Symmetric choice reduction at 0 with 3101 rule applications. Total rules 3101 place count 371 transition count 4462
Iterating global reduction 0 with 3101 rules applied. Total rules applied 6202 place count 371 transition count 4462
Discarding 111 places :
Symmetric choice reduction at 0 with 111 rule applications. Total rules 6313 place count 260 transition count 4351
Iterating global reduction 0 with 111 rules applied. Total rules applied 6424 place count 260 transition count 4351
Discarding 111 places :
Symmetric choice reduction at 0 with 111 rule applications. Total rules 6535 place count 149 transition count 4240
Iterating global reduction 0 with 111 rules applied. Total rules applied 6646 place count 149 transition count 4240
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 6658 place count 143 transition count 4234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6659 place count 142 transition count 4233
Iterating global reduction 0 with 1 rules applied. Total rules applied 6660 place count 142 transition count 4233
Applied a total of 6660 rules in 170 ms. Remains 142 /3472 variables (removed 3330) and now considering 4233/7563 (removed 3330) transitions.
[2022-05-17 15:57:07] [INFO ] Flow matrix only has 171 transitions (discarded 4062 similar events)
// Phase 1: matrix 171 rows 142 cols
[2022-05-17 15:57:07] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-17 15:57:07] [INFO ] Implicit Places using invariants in 260 ms returned []
[2022-05-17 15:57:07] [INFO ] Flow matrix only has 171 transitions (discarded 4062 similar events)
// Phase 1: matrix 171 rows 142 cols
[2022-05-17 15:57:07] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-17 15:57:07] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 8 : 142/17233 places, 4233/21129 transitions.
Finished structural reductions, in 8 iterations. Remains : 142/17233 places, 4233/21129 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s68 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 11488 reset in 463 ms.
Product exploration explored 100000 steps with 11508 reset in 507 ms.
Computed a total of 142 stabilizing places and 4233 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 142 transition count 4233
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-10 finished in 42375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)&&p1)))))'
Support contains 3 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 62 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:57:10] [INFO ] Computed 198 place invariants in 1568 ms
[2022-05-17 15:57:12] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:57:12] [INFO ] Implicit Places using invariants in 3098 ms returned []
Implicit Place search using SMT only with invariants took 3099 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:57:13] [INFO ] Computed 198 place invariants in 1538 ms
[2022-05-17 15:57:15] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:57:15] [INFO ] Dead Transitions using invariants and state equation in 3011 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 471 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(OR (LT s4380 1) (LT s4469 1)), p0:(GEQ s8346 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-12 finished in 6696 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 82 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:57:17] [INFO ] Computed 198 place invariants in 1544 ms
[2022-05-17 15:57:18] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:57:18] [INFO ] Implicit Places using invariants in 2945 ms returned []
Implicit Place search using SMT only with invariants took 2946 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:57:20] [INFO ] Computed 198 place invariants in 1614 ms
[2022-05-17 15:57:21] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:57:21] [INFO ] Dead Transitions using invariants and state equation in 3096 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 310 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1374 1) (LT s6363 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5488 reset in 1553 ms.
Product exploration explored 100000 steps with 5500 reset in 1618 ms.
Computed a total of 17233 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17233 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 548 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 8001 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8001 steps, saw 4373 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:57:48] [INFO ] Computed 198 place invariants in 1584 ms
[2022-05-17 15:57:50] [INFO ] [Real]Absence check using 0 positive and 198 generalized place invariants in 345 ms returned sat
[2022-05-17 15:58:13] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 17233 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 38156 edges and 17233 vertex of which 13 are kept as prefixes of interest. Removing 17220 places using SCC suffix rule.7 ms
Discarding 17220 places :
Also discarding 20556 output transitions
Drop transitions removed 20556 transitions
Drop transitions removed 561 transitions
Reduce isomorphic transitions removed 561 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 563 rules applied. Total rules applied 564 place count 11 transition count 12
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 568 place count 9 transition count 10
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 570 place count 9 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 572 place count 7 transition count 8
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 574 place count 7 transition count 6
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 576 place count 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 578 place count 5 transition count 4
Applied a total of 578 rules in 30 ms. Remains 5 /17233 variables (removed 17228) and now considering 4/21129 (removed 21125) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/17233 places, 4/21129 transitions.
Finished random walk after 12 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 1635 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 66 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:58:16] [INFO ] Computed 198 place invariants in 1576 ms
[2022-05-17 15:58:18] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:58:18] [INFO ] Implicit Places using invariants in 3062 ms returned []
Implicit Place search using SMT only with invariants took 3063 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:58:19] [INFO ] Computed 198 place invariants in 1587 ms
[2022-05-17 15:58:21] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:58:21] [INFO ] Dead Transitions using invariants and state equation in 3028 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Computed a total of 17233 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17233 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 548 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 8071 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8071 steps, saw 4401 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:58:45] [INFO ] Computed 198 place invariants in 1589 ms
[2022-05-17 15:58:47] [INFO ] [Real]Absence check using 0 positive and 198 generalized place invariants in 325 ms returned sat
[2022-05-17 15:59:10] [INFO ] After 25011ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 17233 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 38156 edges and 17233 vertex of which 13 are kept as prefixes of interest. Removing 17220 places using SCC suffix rule.5 ms
Discarding 17220 places :
Also discarding 20556 output transitions
Drop transitions removed 20556 transitions
Drop transitions removed 561 transitions
Reduce isomorphic transitions removed 561 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 563 rules applied. Total rules applied 564 place count 11 transition count 12
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 568 place count 9 transition count 10
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 570 place count 9 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 572 place count 7 transition count 8
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 574 place count 7 transition count 6
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 576 place count 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 578 place count 5 transition count 4
Applied a total of 578 rules in 24 ms. Remains 5 /17233 variables (removed 17228) and now considering 4/21129 (removed 21125) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/17233 places, 4/21129 transitions.
Finished random walk after 12 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5489 reset in 1538 ms.
Product exploration explored 100000 steps with 5491 reset in 1523 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 17233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.21 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 8318 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8318 rules applied. Total rules applied 8319 place count 17231 transition count 21127
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8448 places in 8 ms
Iterating global reduction 1 with 130 rules applied. Total rules applied 8449 place count 17231 transition count 21127
Deduced a syphon composed of 8448 places in 8 ms
Applied a total of 8449 rules in 3193 ms. Remains 17231 /17233 variables (removed 2) and now considering 21127/21129 (removed 2) transitions.
// Phase 1: matrix 21127 rows 17231 cols
[2022-05-17 15:59:19] [INFO ] Computed 198 place invariants in 2072 ms
[2022-05-17 15:59:20] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:59:20] [INFO ] Dead Transitions using invariants and state equation in 3695 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17231/17233 places, 21127/21129 transitions.
Finished structural reductions, in 1 iterations. Remains : 17231/17233 places, 21127/21129 transitions.
Product exploration timeout after 66520 steps with 5471 reset in 10002 ms.
Product exploration timeout after 69260 steps with 5708 reset in 10002 ms.
Built C files in :
/tmp/ltsmin13264895998051612632
[2022-05-17 15:59:41] [INFO ] Built C files in 273ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13264895998051612632
Running compilation step : cd /tmp/ltsmin13264895998051612632;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13264895998051612632;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13264895998051612632;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 66 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:59:45] [INFO ] Computed 198 place invariants in 1592 ms
[2022-05-17 15:59:47] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:59:47] [INFO ] Implicit Places using invariants in 3102 ms returned []
Implicit Place search using SMT only with invariants took 3114 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 15:59:48] [INFO ] Computed 198 place invariants in 1597 ms
[2022-05-17 15:59:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 15:59:50] [INFO ] Dead Transitions using invariants and state equation in 3108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Built C files in :
/tmp/ltsmin12220003593823707576
[2022-05-17 15:59:50] [INFO ] Built C files in 204ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12220003593823707576
Running compilation step : cd /tmp/ltsmin12220003593823707576;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12220003593823707576;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12220003593823707576;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 15:59:55] [INFO ] Flatten gal took : 1074 ms
[2022-05-17 15:59:56] [INFO ] Flatten gal took : 703 ms
[2022-05-17 15:59:56] [INFO ] Time to serialize gal into /tmp/LTL5602258727023581587.gal : 336 ms
[2022-05-17 15:59:56] [INFO ] Time to serialize properties into /tmp/LTL15525498194034407447.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5602258727023581587.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15525498194034407447.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5602258...267
Read 1 LTL properties
Checking formula 0 : !((X(G("((Node5ManageTheBreakDownOfNode15<1)||(Node24ManageTheBreakDownOfNode12<1))"))))
Formula 0 simplified : !XG"((Node5ManageTheBreakDownOfNode15<1)||(Node24ManageTheBreakDownOfNode12<1))"
Detected timeout of ITS tools.
[2022-05-17 16:00:12] [INFO ] Flatten gal took : 560 ms
[2022-05-17 16:00:12] [INFO ] Applying decomposition
[2022-05-17 16:00:13] [INFO ] Flatten gal took : 569 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2589892562117731898.txt' '-o' '/tmp/graph2589892562117731898.bin' '-w' '/tmp/graph2589892562117731898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2589892562117731898.bin' '-l' '-1' '-v' '-w' '/tmp/graph2589892562117731898.weights' '-q' '0' '-e' '0.001'
[2022-05-17 16:00:16] [INFO ] Decomposing Gal with order
[2022-05-17 16:00:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 16:00:46] [INFO ] Removed a total of 16050 redundant transitions.
[2022-05-17 16:00:47] [INFO ] Flatten gal took : 8102 ms
[2022-05-17 16:00:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 353 ms.
[2022-05-17 16:00:49] [INFO ] Time to serialize gal into /tmp/LTL13440099021094106769.gal : 202 ms
[2022-05-17 16:00:49] [INFO ] Time to serialize properties into /tmp/LTL16283769340541663663.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13440099021094106769.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16283769340541663663.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1344009...247
Read 1 LTL properties
Checking formula 0 : !((X(G("((i40.i2.u372.Node5ManageTheBreakDownOfNode15<1)||(i1.i0.u1598.Node24ManageTheBreakDownOfNode12<1))"))))
Formula 0 simplified : !XG"((i40.i2.u372.Node5ManageTheBreakDownOfNode15<1)||(i1.i0.u1598.Node24ManageTheBreakDownOfNode12<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7440403613419858831
[2022-05-17 16:01:04] [INFO ] Built C files in 174ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7440403613419858831
Running compilation step : cd /tmp/ltsmin7440403613419858831;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7440403613419858831;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7440403613419858831;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-13 finished in 231484 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((!(F(p0) U p0)&&p1))||X(F(p2)))))'
Support contains 5 out of 17233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.30 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8253 transitions
Trivial Post-agglo rules discarded 8253 transitions
Performed 8253 trivial Post agglomeration. Transition count delta: 8253
Iterating post reduction 0 with 8253 rules applied. Total rules applied 8254 place count 17231 transition count 12874
Reduce places removed 8253 places and 0 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 1 with 8317 rules applied. Total rules applied 16571 place count 8978 transition count 12810
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 16635 place count 8914 transition count 12810
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 128 Pre rules applied. Total rules applied 16635 place count 8914 transition count 12682
Deduced a syphon composed of 128 places in 4 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 16891 place count 8786 transition count 12682
Discarding 4028 places :
Symmetric choice reduction at 3 with 4028 rule applications. Total rules 20919 place count 4758 transition count 8654
Iterating global reduction 3 with 4028 rules applied. Total rules applied 24947 place count 4758 transition count 8654
Applied a total of 24947 rules in 2699 ms. Remains 4758 /17233 variables (removed 12475) and now considering 8654/21129 (removed 12475) transitions.
// Phase 1: matrix 8654 rows 4758 cols
[2022-05-17 16:01:10] [INFO ] Computed 198 place invariants in 110 ms
[2022-05-17 16:01:10] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:01:13] [INFO ] Implicit Places using invariants in 3458 ms returned [1784, 2065, 2101, 2776]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3464 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4754/17233 places, 8654/21129 transitions.
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 1 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 0 with 260 rules applied. Total rules applied 260 place count 4624 transition count 8524
Applied a total of 260 rules in 1406 ms. Remains 4624 /4754 variables (removed 130) and now considering 8524/8654 (removed 130) transitions.
// Phase 1: matrix 8524 rows 4624 cols
[2022-05-17 16:01:15] [INFO ] Computed 194 place invariants in 83 ms
[2022-05-17 16:01:15] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:01:18] [INFO ] Implicit Places using invariants in 3276 ms returned [696, 1248, 2561, 3732, 4112]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3280 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4619/17233 places, 8524/21129 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4618 transition count 8523
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4618 transition count 8523
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4617 transition count 8522
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4617 transition count 8522
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 15 place count 4606 transition count 8511
Iterating global reduction 0 with 11 rules applied. Total rules applied 26 place count 4606 transition count 8511
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 1 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 0 with 258 rules applied. Total rules applied 284 place count 4477 transition count 8382
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 286 place count 4475 transition count 8380
Iterating global reduction 0 with 2 rules applied. Total rules applied 288 place count 4475 transition count 8380
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 323 place count 4440 transition count 8345
Iterating global reduction 0 with 35 rules applied. Total rules applied 358 place count 4440 transition count 8345
Applied a total of 358 rules in 3856 ms. Remains 4440 /4619 variables (removed 179) and now considering 8345/8524 (removed 179) transitions.
[2022-05-17 16:01:22] [INFO ] Flow matrix only has 8294 transitions (discarded 51 similar events)
// Phase 1: matrix 8294 rows 4440 cols
[2022-05-17 16:01:22] [INFO ] Computed 189 place invariants in 78 ms
[2022-05-17 16:01:22] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:01:25] [INFO ] Implicit Places using invariants in 3065 ms returned [706, 1077, 1697, 1796, 3915]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3069 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4435/17233 places, 8345/21129 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 4370 transition count 8280
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 4370 transition count 8280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 131 place count 4369 transition count 8279
Iterating global reduction 0 with 1 rules applied. Total rules applied 132 place count 4369 transition count 8279
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 162 place count 4339 transition count 8249
Iterating global reduction 0 with 30 rules applied. Total rules applied 192 place count 4339 transition count 8249
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 1 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 0 with 252 rules applied. Total rules applied 444 place count 4213 transition count 8123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 445 place count 4212 transition count 8122
Iterating global reduction 0 with 1 rules applied. Total rules applied 446 place count 4212 transition count 8122
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 475 place count 4183 transition count 8093
Iterating global reduction 0 with 29 rules applied. Total rules applied 504 place count 4183 transition count 8093
Applied a total of 504 rules in 3356 ms. Remains 4183 /4435 variables (removed 252) and now considering 8093/8345 (removed 252) transitions.
[2022-05-17 16:01:28] [INFO ] Flow matrix only has 7975 transitions (discarded 118 similar events)
// Phase 1: matrix 7975 rows 4183 cols
[2022-05-17 16:01:28] [INFO ] Computed 184 place invariants in 73 ms
[2022-05-17 16:01:33] [INFO ] Implicit Places using invariants in 4516 ms returned [3, 32, 64, 98, 131, 134, 163, 195, 198, 227, 259, 262, 291, 323, 326, 355, 387, 390, 419, 451, 454, 483, 515, 518, 547, 579, 582, 611, 643, 705, 708, 737, 769, 772, 801, 833, 836, 865, 897, 900, 929, 961, 964, 1031, 1060, 1092, 1095, 1125, 1159, 1188, 1220, 1223, 1252, 1284, 1287, 1316, 1348, 1351, 1380, 1412, 1415, 1444, 1476, 1479, 1508, 1540, 1543, 1572, 1604, 1620, 1623, 1653, 1687, 1716, 1748, 1751, 1781, 1815, 1845, 1848, 1877, 1909, 1912, 1941, 1973, 1975, 1977, 2006, 2038, 2041, 2070, 2102, 2105, 2134, 2166, 2169, 2198, 2230, 2233, 2262, 2294, 2302, 2333, 2336, 2365, 2400, 2429, 2461, 2464, 2493, 2525, 2528, 2557, 2589, 2592, 2621, 2653, 2656, 2685, 2717, 2720, 2749, 2781, 2784, 2813, 2845, 2848, 2877, 2909, 2912, 2941, 2973, 2976, 3006, 3038, 3041, 3070, 3102, 3105, 3134, 3166, 3169, 3198, 3230, 3233, 3262, 3294, 3297, 3326, 3361, 3390, 3422, 3425, 3454, 3486, 3489, 3518, 3550, 3553, 3582, 3614, 3617, 3646, 3681, 3735, 3738, 3767, 3799, 3802, 3831, 3863, 3866, 3895, 3927, 3930, 3959, 3991, 3994, 4023, 4055]
Discarding 180 places :
Implicit Place search using SMT only with invariants took 4521 ms to find 180 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 4003/17233 places, 8093/21129 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 4003 transition count 8091
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 4001 transition count 8091
Discarding 3602 places :
Symmetric choice reduction at 0 with 3602 rule applications. Total rules 3606 place count 399 transition count 4489
Iterating global reduction 0 with 3602 rules applied. Total rules applied 7208 place count 399 transition count 4489
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 7327 place count 280 transition count 4370
Iterating global reduction 0 with 119 rules applied. Total rules applied 7446 place count 280 transition count 4370
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 7565 place count 161 transition count 4251
Iterating global reduction 0 with 119 rules applied. Total rules applied 7684 place count 161 transition count 4251
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 7700 place count 153 transition count 4243
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7702 place count 151 transition count 4241
Iterating global reduction 0 with 2 rules applied. Total rules applied 7704 place count 151 transition count 4241
Applied a total of 7704 rules in 234 ms. Remains 151 /4003 variables (removed 3852) and now considering 4241/8093 (removed 3852) transitions.
[2022-05-17 16:01:33] [INFO ] Flow matrix only has 212 transitions (discarded 4029 similar events)
// Phase 1: matrix 212 rows 151 cols
[2022-05-17 16:01:33] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 16:01:33] [INFO ] Implicit Places using invariants in 234 ms returned []
[2022-05-17 16:01:33] [INFO ] Flow matrix only has 212 transitions (discarded 4029 similar events)
// Phase 1: matrix 212 rows 151 cols
[2022-05-17 16:01:33] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 16:01:33] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 151/17233 places, 4241/21129 transitions.
Finished structural reductions, in 5 iterations. Remains : 151/17233 places, 4241/21129 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s111 1) (LT s8 1) (LT s10 1)), p0:(GEQ s111 1), p2:(AND (GEQ s41 1) (GEQ s43 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 9845 reset in 729 ms.
Product exploration explored 100000 steps with 9856 reset in 678 ms.
Computed a total of 151 stabilizing places and 4241 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 151 transition count 4241
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2))))), (F (G p1)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 570 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 94 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Finished random walk after 24 steps, including 2 resets, run visited all 5 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 (NOT p2))))), (F (G p1)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p0)), (F (OR (NOT p1) p0)), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0)))]
Knowledge based reduction with 10 factoid took 397 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 86 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 87 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 4241/4241 transitions.
Applied a total of 0 rules in 40 ms. Remains 151 /151 variables (removed 0) and now considering 4241/4241 (removed 0) transitions.
[2022-05-17 16:01:37] [INFO ] Flow matrix only has 212 transitions (discarded 4029 similar events)
// Phase 1: matrix 212 rows 151 cols
[2022-05-17 16:01:37] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 16:01:37] [INFO ] Implicit Places using invariants in 234 ms returned []
[2022-05-17 16:01:37] [INFO ] Flow matrix only has 212 transitions (discarded 4029 similar events)
// Phase 1: matrix 212 rows 151 cols
[2022-05-17 16:01:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 16:01:37] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2022-05-17 16:01:38] [INFO ] Redundant transitions in 296 ms returned []
[2022-05-17 16:01:38] [INFO ] Flow matrix only has 212 transitions (discarded 4029 similar events)
// Phase 1: matrix 212 rows 151 cols
[2022-05-17 16:01:38] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 16:01:39] [INFO ] Dead Transitions using invariants and state equation in 1176 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 151/151 places, 4241/4241 transitions.
Computed a total of 151 stabilizing places and 4241 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 151 transition count 4241
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (F (G p1)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 319 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Finished random walk after 861 steps, including 80 resets, run visited all 5 properties in 29 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (F (G p1)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p0)), (F (OR (NOT p1) p0)), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0)))]
Knowledge based reduction with 10 factoid took 637 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 9894 reset in 514 ms.
Product exploration explored 100000 steps with 9899 reset in 484 ms.
Built C files in :
/tmp/ltsmin458063378262296447
[2022-05-17 16:01:42] [INFO ] Too many transitions (4241) to apply POR reductions. Disabling POR matrices.
[2022-05-17 16:01:42] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin458063378262296447
Running compilation step : cd /tmp/ltsmin458063378262296447;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin458063378262296447;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin458063378262296447;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 4241/4241 transitions.
Applied a total of 0 rules in 76 ms. Remains 151 /151 variables (removed 0) and now considering 4241/4241 (removed 0) transitions.
[2022-05-17 16:01:45] [INFO ] Flow matrix only has 212 transitions (discarded 4029 similar events)
// Phase 1: matrix 212 rows 151 cols
[2022-05-17 16:01:45] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 16:01:45] [INFO ] Implicit Places using invariants in 338 ms returned []
[2022-05-17 16:01:45] [INFO ] Flow matrix only has 212 transitions (discarded 4029 similar events)
// Phase 1: matrix 212 rows 151 cols
[2022-05-17 16:01:45] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 16:01:45] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
[2022-05-17 16:01:46] [INFO ] Redundant transitions in 298 ms returned []
[2022-05-17 16:01:46] [INFO ] Flow matrix only has 212 transitions (discarded 4029 similar events)
// Phase 1: matrix 212 rows 151 cols
[2022-05-17 16:01:46] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 16:01:47] [INFO ] Dead Transitions using invariants and state equation in 1349 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 151/151 places, 4241/4241 transitions.
Built C files in :
/tmp/ltsmin13568538710109160370
[2022-05-17 16:01:47] [INFO ] Too many transitions (4241) to apply POR reductions. Disabling POR matrices.
[2022-05-17 16:01:47] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13568538710109160370
Running compilation step : cd /tmp/ltsmin13568538710109160370;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13568538710109160370;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13568538710109160370;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 16:01:51] [INFO ] Flatten gal took : 137 ms
[2022-05-17 16:01:51] [INFO ] Flatten gal took : 100 ms
[2022-05-17 16:01:51] [INFO ] Time to serialize gal into /tmp/LTL15159601210711596582.gal : 16 ms
[2022-05-17 16:01:51] [INFO ] Time to serialize properties into /tmp/LTL16876079816261092851.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15159601210711596582.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16876079816261092851.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1515960...268
Read 1 LTL properties
Checking formula 0 : !((G((F((!((F("(Node48ManageTheBreakDownOfNode14>=1)"))U("(Node48ManageTheBreakDownOfNode14>=1)")))&&("(((Node48ManageTheBreakDownOfNo...343
Formula 0 simplified : !G(F("(((Node48ManageTheBreakDownOfNode14<1)||(Node1HasAskedItsLeafSetToLxToReplaceNode32<1))||(LeafSetOfLxIsSentToNode1<1))" & !(F"...327
Detected timeout of ITS tools.
[2022-05-17 16:02:06] [INFO ] Flatten gal took : 73 ms
[2022-05-17 16:02:06] [INFO ] Applying decomposition
[2022-05-17 16:02:07] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1975195833182093665.txt' '-o' '/tmp/graph1975195833182093665.bin' '-w' '/tmp/graph1975195833182093665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1975195833182093665.bin' '-l' '-1' '-v' '-w' '/tmp/graph1975195833182093665.weights' '-q' '0' '-e' '0.001'
[2022-05-17 16:02:07] [INFO ] Decomposing Gal with order
[2022-05-17 16:02:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 16:02:07] [INFO ] Removed a total of 4215 redundant transitions.
[2022-05-17 16:02:07] [INFO ] Flatten gal took : 534 ms
[2022-05-17 16:02:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 244 labels/synchronizations in 42 ms.
[2022-05-17 16:02:07] [INFO ] Time to serialize gal into /tmp/LTL18251744258353396923.gal : 14 ms
[2022-05-17 16:02:07] [INFO ] Time to serialize properties into /tmp/LTL13080328967291525828.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18251744258353396923.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13080328967291525828.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1825174...247
Read 1 LTL properties
Checking formula 0 : !((G((F((!((F("(u5.Node48ManageTheBreakDownOfNode14>=1)"))U("(u5.Node48ManageTheBreakDownOfNode14>=1)")))&&("(((u5.Node48ManageTheBrea...376
Formula 0 simplified : !G(F("(((u5.Node48ManageTheBreakDownOfNode14<1)||(i2.u3.Node1HasAskedItsLeafSetToLxToReplaceNode32<1))||(i2.u3.LeafSetOfLxIsSentToNo...360
Reverse transition relation is NOT exact ! Due to transitions t15483, t5001_t5002_t5003, t447_t393_t394, t15486_t15487_t15488, t15807_t15808_t15809, t2082_...38282
Computing Next relation with stutter on 4318 deadlock states
72 unique states visited
0 strongly connected components in search stack
100 transitions explored
15 items max in DFS search stack
1252 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,12.7318,379268,1,0,138116,1.10548e+06,9149,201541,11492,3.80422e+06,291443
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-14 finished in 75666 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (F(G(X(p0))) U X(p1))))'
Support contains 6 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 65 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 16:02:24] [INFO ] Computed 198 place invariants in 1783 ms
[2022-05-17 16:02:26] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:02:26] [INFO ] Implicit Places using invariants in 3166 ms returned []
Implicit Place search using SMT only with invariants took 3168 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 16:02:27] [INFO ] Computed 198 place invariants in 1622 ms
[2022-05-17 16:02:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:02:29] [INFO ] Dead Transitions using invariants and state equation in 2928 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s738 1) (GEQ s787 1)) (AND (GEQ s3419 1) (GEQ s12675 1))), p0:(AND (GEQ s6809 1) (GEQ s15781 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-15 finished in 6390 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a SL insensitive property : LeafsetExtension-PT-S64C2-LTLFireability-13
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 17233 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.60 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8318 transitions
Trivial Post-agglo rules discarded 8318 transitions
Performed 8318 trivial Post agglomeration. Transition count delta: 8318
Iterating post reduction 0 with 8318 rules applied. Total rules applied 8319 place count 17231 transition count 12809
Reduce places removed 8318 places and 0 transitions.
Iterating post reduction 1 with 8318 rules applied. Total rules applied 16637 place count 8913 transition count 12809
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 16637 place count 8913 transition count 12679
Deduced a syphon composed of 130 places in 6 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 16897 place count 8783 transition count 12679
Discarding 4030 places :
Symmetric choice reduction at 2 with 4030 rule applications. Total rules 20927 place count 4753 transition count 8649
Iterating global reduction 2 with 4030 rules applied. Total rules applied 24957 place count 4753 transition count 8649
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 24957 place count 4753 transition count 8647
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24961 place count 4751 transition count 8647
Applied a total of 24961 rules in 2254 ms. Remains 4751 /17233 variables (removed 12482) and now considering 8647/21129 (removed 12482) transitions.
// Phase 1: matrix 8647 rows 4751 cols
[2022-05-17 16:02:31] [INFO ] Computed 198 place invariants in 85 ms
[2022-05-17 16:02:32] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:02:34] [INFO ] Implicit Places using invariants in 3080 ms returned [427, 3092, 3343, 3660, 4228]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3084 ms to find 5 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 4746/17233 places, 8647/21129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4744 transition count 8645
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4744 transition count 8645
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 4742 transition count 8643
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4742 transition count 8643
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 56 place count 4694 transition count 8595
Iterating global reduction 0 with 48 rules applied. Total rules applied 104 place count 4694 transition count 8595
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 0 with 128 rules applied. Total rules applied 232 place count 4630 transition count 8531
Applied a total of 232 rules in 2807 ms. Remains 4630 /4746 variables (removed 116) and now considering 8531/8647 (removed 116) transitions.
[2022-05-17 16:02:37] [INFO ] Flow matrix only has 8483 transitions (discarded 48 similar events)
// Phase 1: matrix 8483 rows 4630 cols
[2022-05-17 16:02:37] [INFO ] Computed 193 place invariants in 138 ms
[2022-05-17 16:02:38] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:02:40] [INFO ] Implicit Places using invariants in 3063 ms returned [526, 2172, 3152, 3618, 3828]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3067 ms to find 5 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 4625/17233 places, 8531/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 4621 transition count 8527
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 4621 transition count 8527
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 4618 transition count 8524
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 4618 transition count 8524
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 97 place count 4535 transition count 8441
Iterating global reduction 0 with 83 rules applied. Total rules applied 180 place count 4535 transition count 8441
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 2 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 0 with 246 rules applied. Total rules applied 426 place count 4412 transition count 8318
Applied a total of 426 rules in 2760 ms. Remains 4412 /4625 variables (removed 213) and now considering 8318/8531 (removed 213) transitions.
[2022-05-17 16:02:43] [INFO ] Flow matrix only has 8184 transitions (discarded 134 similar events)
// Phase 1: matrix 8184 rows 4412 cols
[2022-05-17 16:02:43] [INFO ] Computed 188 place invariants in 74 ms
[2022-05-17 16:02:43] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:02:46] [INFO ] Implicit Places using invariants in 2801 ms returned [1224, 1735, 2179, 2858, 3661]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2805 ms to find 5 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 3 : 4407/17233 places, 8318/21129 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 4344 transition count 8255
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 4344 transition count 8255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 4343 transition count 8254
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 4343 transition count 8254
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 158 place count 4313 transition count 8224
Iterating global reduction 0 with 30 rules applied. Total rules applied 188 place count 4313 transition count 8224
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 2 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 0 with 246 rules applied. Total rules applied 434 place count 4190 transition count 8101
Applied a total of 434 rules in 2408 ms. Remains 4190 /4407 variables (removed 217) and now considering 8101/8318 (removed 217) transitions.
[2022-05-17 16:02:48] [INFO ] Flow matrix only has 7933 transitions (discarded 168 similar events)
// Phase 1: matrix 7933 rows 4190 cols
[2022-05-17 16:02:48] [INFO ] Computed 183 place invariants in 71 ms
[2022-05-17 16:02:52] [INFO ] Implicit Places using invariants in 4181 ms returned [3, 33, 65, 68, 98, 130, 133, 163, 195, 198, 228, 260, 263, 293, 325, 328, 360, 394, 424, 456, 459, 520, 523, 553, 585, 588, 618, 650, 653, 683, 715, 718, 748, 780, 783, 813, 845, 848, 878, 910, 913, 943, 975, 978, 1008, 1040, 1043, 1073, 1105, 1108, 1139, 1173, 1203, 1235, 1238, 1268, 1300, 1303, 1333, 1365, 1368, 1398, 1430, 1433, 1463, 1495, 1498, 1528, 1560, 1563, 1594, 1626, 1629, 1660, 1663, 1693, 1725, 1728, 1758, 1790, 1793, 1823, 1855, 1858, 1888, 1920, 1923, 1954, 1988, 2018, 2050, 2053, 2083, 2115, 2118, 2148, 2180, 2183, 2213, 2245, 2248, 2278, 2310, 2313, 2343, 2375, 2378, 2408, 2440, 2443, 2473, 2505, 2508, 2538, 2570, 2573, 2603, 2635, 2638, 2668, 2703, 2733, 2765, 2768, 2809, 2812, 2842, 2877, 2907, 2939, 2942, 2972, 3004, 3036, 3068, 3071, 3101, 3133, 3136, 3166, 3198, 3201, 3231, 3263, 3266, 3304, 3307, 3338, 3341, 3371, 3403, 3406, 3436, 3471, 3502, 3505, 3535, 3567, 3570, 3600, 3632, 3635, 3665, 3697, 3700, 3738, 3741, 3771, 3803, 3806, 3836, 3868, 3871, 3901, 3933, 3936, 3966, 3998, 4001, 4031, 4063]
Discarding 181 places :
Implicit Place search using SMT only with invariants took 4194 ms to find 181 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 4 : 4009/17233 places, 8101/21129 transitions.
Discarding 3622 places :
Symmetric choice reduction at 0 with 3622 rule applications. Total rules 3622 place count 387 transition count 4479
Iterating global reduction 0 with 3622 rules applied. Total rules applied 7244 place count 387 transition count 4479
Discarding 122 places :
Symmetric choice reduction at 0 with 122 rule applications. Total rules 7366 place count 265 transition count 4357
Iterating global reduction 0 with 122 rules applied. Total rules applied 7488 place count 265 transition count 4357
Discarding 122 places :
Symmetric choice reduction at 0 with 122 rule applications. Total rules 7610 place count 143 transition count 4235
Iterating global reduction 0 with 122 rules applied. Total rules applied 7732 place count 143 transition count 4235
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7736 place count 141 transition count 4233
Applied a total of 7736 rules in 148 ms. Remains 141 /4009 variables (removed 3868) and now considering 4233/8101 (removed 3868) transitions.
[2022-05-17 16:02:53] [INFO ] Flow matrix only has 141 transitions (discarded 4092 similar events)
// Phase 1: matrix 141 rows 141 cols
[2022-05-17 16:02:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 16:02:53] [INFO ] Implicit Places using invariants in 234 ms returned []
[2022-05-17 16:02:53] [INFO ] Flow matrix only has 141 transitions (discarded 4092 similar events)
// Phase 1: matrix 141 rows 141 cols
[2022-05-17 16:02:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 16:02:53] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 5 : 141/17233 places, 4233/21129 transitions.
Finished structural reductions, in 5 iterations. Remains : 141/17233 places, 4233/21129 transitions.
Running random walk in product with property : LeafsetExtension-PT-S64C2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s15 1) (LT s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 19210 steps with 2318 reset in 163 ms.
Treatment of property LeafsetExtension-PT-S64C2-LTLFireability-13 finished in 24411 ms.
FORMULA LeafsetExtension-PT-S64C2-LTLFireability-13 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-17 16:02:54] [INFO ] Flatten gal took : 630 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 613713 ms.

BK_STOP 1652803374990

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LeafsetExtension-PT-S64C2"
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-S64C2, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271821000524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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