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.r078-tall-165260110700716.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 FamilyReunion-PT-L00010M0001C001P001G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110700716
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 22K Apr 30 08:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 172K Apr 30 08:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 30 08:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 188K Apr 30 08:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.6K May 9 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 9 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 9 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 9 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K May 9 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 552K May 10 09:33 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 FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-00
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-02
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-03
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-05
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-06
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-07
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-12
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-13
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-14
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652718431707

Running Version 202205111006
[2022-05-16 16:27:12] [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-16 16:27:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 16:27:13] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2022-05-16 16:27:13] [INFO ] Transformed 1475 places.
[2022-05-16 16:27:13] [INFO ] Transformed 1234 transitions.
[2022-05-16 16:27:13] [INFO ] Parsed PT model containing 1475 places and 1234 transitions in 247 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 344 out of 1465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1465/1465 places, 1234/1234 transitions.
Reduce places removed 45 places and 0 transitions.
Discarding 87 places :
Implicit places reduction removed 87 places
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 1333 transition count 1234
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 215 place count 1250 transition count 1141
Iterating global reduction 1 with 83 rules applied. Total rules applied 298 place count 1250 transition count 1141
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 309 place count 1239 transition count 1141
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 331 place count 1217 transition count 1109
Iterating global reduction 2 with 22 rules applied. Total rules applied 353 place count 1217 transition count 1109
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 2 with 33 rules applied. Total rules applied 386 place count 1195 transition count 1098
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 407 place count 1174 transition count 1077
Iterating global reduction 3 with 21 rules applied. Total rules applied 428 place count 1174 transition count 1077
Applied a total of 428 rules in 289 ms. Remains 1174 /1465 variables (removed 291) and now considering 1077/1234 (removed 157) transitions.
// Phase 1: matrix 1077 rows 1174 cols
[2022-05-16 16:27:13] [INFO ] Computed 182 place invariants in 62 ms
[2022-05-16 16:27:14] [INFO ] Implicit Places using invariants in 538 ms returned [77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 110, 111, 112, 113, 114, 115, 116, 118, 120, 636, 637, 639, 640, 641, 642, 643, 644, 645, 646, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 907, 908, 909, 910, 911, 912, 913, 914, 915, 916, 917, 1074]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 568 ms to find 53 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1121/1465 places, 1077/1234 transitions.
Applied a total of 0 rules in 47 ms. Remains 1121 /1121 variables (removed 0) and now considering 1077/1077 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1121/1465 places, 1077/1234 transitions.
Support contains 344 out of 1121 places after structural reductions.
[2022-05-16 16:27:14] [INFO ] Flatten gal took : 100 ms
[2022-05-16 16:27:14] [INFO ] Flatten gal took : 59 ms
[2022-05-16 16:27:14] [INFO ] Input system was already deterministic with 1077 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 33) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1077 rows 1121 cols
[2022-05-16 16:27:15] [INFO ] Computed 129 place invariants in 13 ms
[2022-05-16 16:27:15] [INFO ] [Real]Absence check using 0 positive and 129 generalized place invariants in 41 ms returned sat
[2022-05-16 16:27:15] [INFO ] After 531ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-16 16:27:16] [INFO ] After 747ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 103 ms.
[2022-05-16 16:27:16] [INFO ] After 1120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 510 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=56 )
Parikh walk visited 2 properties in 11 ms.
Computed a total of 1121 stabilizing places and 1077 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1121 transition count 1077
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(((G(!(p1 U p2))||X(p3))&&p0)))'
Support contains 121 out of 1121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1121/1121 places, 1077/1077 transitions.
Discarding 23 places :
Implicit places reduction removed 23 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1098 transition count 1077
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 52 place count 1069 transition count 1047
Iterating global reduction 1 with 29 rules applied. Total rules applied 81 place count 1069 transition count 1047
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 105 place count 1045 transition count 1013
Iterating global reduction 1 with 24 rules applied. Total rules applied 129 place count 1045 transition count 1013
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 142 place count 1032 transition count 980
Iterating global reduction 1 with 13 rules applied. Total rules applied 155 place count 1032 transition count 980
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 167 place count 1020 transition count 958
Iterating global reduction 1 with 12 rules applied. Total rules applied 179 place count 1020 transition count 958
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 190 place count 1009 transition count 958
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 201 place count 998 transition count 947
Iterating global reduction 2 with 11 rules applied. Total rules applied 212 place count 998 transition count 947
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 223 place count 987 transition count 936
Iterating global reduction 2 with 11 rules applied. Total rules applied 234 place count 987 transition count 936
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 245 place count 976 transition count 925
Iterating global reduction 2 with 11 rules applied. Total rules applied 256 place count 976 transition count 925
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 267 place count 965 transition count 914
Iterating global reduction 2 with 11 rules applied. Total rules applied 278 place count 965 transition count 914
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 289 place count 954 transition count 903
Iterating global reduction 2 with 11 rules applied. Total rules applied 300 place count 954 transition count 903
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 311 place count 943 transition count 892
Iterating global reduction 2 with 11 rules applied. Total rules applied 322 place count 943 transition count 892
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 333 place count 932 transition count 881
Iterating global reduction 2 with 11 rules applied. Total rules applied 344 place count 932 transition count 881
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 355 place count 921 transition count 870
Iterating global reduction 2 with 11 rules applied. Total rules applied 366 place count 921 transition count 870
Applied a total of 366 rules in 1335 ms. Remains 921 /1121 variables (removed 200) and now considering 870/1077 (removed 207) transitions.
// Phase 1: matrix 870 rows 921 cols
[2022-05-16 16:27:18] [INFO ] Computed 95 place invariants in 20 ms
[2022-05-16 16:27:18] [INFO ] Implicit Places using invariants in 261 ms returned [99, 100, 211, 422, 445, 468]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 263 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 915/1121 places, 870/1077 transitions.
Applied a total of 0 rules in 24 ms. Remains 915 /915 variables (removed 0) and now considering 870/870 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 915/1121 places, 870/1077 transitions.
Stuttering acceptance computed with spot in 331 ms :[true, (NOT p3), (OR (NOT p0) (AND p2 (NOT p3))), (OR (NOT p0) (AND p2 (NOT p3))), (AND p2 (NOT p3)), p2]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(AND (OR (LT s136 1) (LT s224 1)) (OR (LT s134 1) (LT s222 1)) (OR (LT s148 1) (LT s236 1)) (OR (LT s150 1) (LT s238 1)) (OR (LT s152 1) (LT s240 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 725 ms.
Product exploration explored 100000 steps with 33333 reset in 680 ms.
Computed a total of 915 stabilizing places and 870 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 915 transition count 870
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 p3 p0 (NOT p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X p0), (X (X p3)), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (F (G p3)), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p3))
Knowledge based reduction with 11 factoid took 214 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-00 finished in 3813 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!(p0 U !p1)&&(X(G(p2))||p2)))))'
Support contains 24 out of 1121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1121/1121 places, 1077/1077 transitions.
Graph (complete) has 1480 edges and 1121 vertex of which 1049 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.6 ms
Discarding 72 places :
Also discarding 92 output transitions
Drop transitions removed 92 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 606 rules applied. Total rules applied 607 place count 993 transition count 413
Reduce places removed 561 places and 0 transitions.
Iterating post reduction 1 with 561 rules applied. Total rules applied 1168 place count 432 transition count 413
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 141 Pre rules applied. Total rules applied 1168 place count 432 transition count 272
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 2 with 337 rules applied. Total rules applied 1505 place count 236 transition count 272
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 1507 place count 236 transition count 270
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1509 place count 234 transition count 270
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 1509 place count 234 transition count 261
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 1527 place count 225 transition count 261
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1552 place count 200 transition count 226
Iterating global reduction 4 with 25 rules applied. Total rules applied 1577 place count 200 transition count 226
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 13 rules applied. Total rules applied 1590 place count 200 transition count 213
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1592 place count 198 transition count 213
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1592 place count 198 transition count 202
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1614 place count 187 transition count 202
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1616 place count 185 transition count 180
Iterating global reduction 6 with 2 rules applied. Total rules applied 1618 place count 185 transition count 180
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 26 rules applied. Total rules applied 1644 place count 172 transition count 167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1646 place count 170 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 1646 place count 170 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1668 place count 159 transition count 156
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 8 with 66 rules applied. Total rules applied 1734 place count 126 transition count 123
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 8 with 11 rules applied. Total rules applied 1745 place count 115 transition count 112
Applied a total of 1745 rules in 84 ms. Remains 115 /1121 variables (removed 1006) and now considering 112/1077 (removed 965) transitions.
// Phase 1: matrix 112 rows 115 cols
[2022-05-16 16:27:20] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 16:27:20] [INFO ] Implicit Places using invariants in 61 ms returned [0, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 68]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 63 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/1121 places, 112/1077 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 102 transition count 101
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 91 transition count 101
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 80 transition count 90
Applied a total of 44 rules in 13 ms. Remains 80 /102 variables (removed 22) and now considering 90/112 (removed 22) transitions.
// Phase 1: matrix 90 rows 80 cols
[2022-05-16 16:27:20] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 16:27:20] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 90 rows 80 cols
[2022-05-16 16:27:20] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 16:27:20] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/1121 places, 90/1077 transitions.
Finished structural reductions, in 2 iterations. Remains : 80/1121 places, 90/1077 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=2 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=4 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s52 1) (GEQ s51 1) (GEQ s54 1) (GEQ s53 1) (GEQ s48 1) (GEQ s47 1) (GEQ s50 1) (GEQ s49 1) (GEQ s45 1) (GEQ s46 1) (GEQ s55 1)), p2:(AND (LT s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 209 steps with 15 reset in 3 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-02 finished in 563 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(!(X(F(p0)) U p1))))'
Support contains 22 out of 1121 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1121/1121 places, 1077/1077 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1076 transition count 1077
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 83 place count 1038 transition count 1038
Iterating global reduction 1 with 38 rules applied. Total rules applied 121 place count 1038 transition count 1038
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 153 place count 1006 transition count 996
Iterating global reduction 1 with 32 rules applied. Total rules applied 185 place count 1006 transition count 996
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 206 place count 985 transition count 957
Iterating global reduction 1 with 21 rules applied. Total rules applied 227 place count 985 transition count 957
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 248 place count 964 transition count 925
Iterating global reduction 1 with 21 rules applied. Total rules applied 269 place count 964 transition count 925
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 289 place count 944 transition count 905
Iterating global reduction 1 with 20 rules applied. Total rules applied 309 place count 944 transition count 905
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 321 place count 932 transition count 893
Iterating global reduction 1 with 12 rules applied. Total rules applied 333 place count 932 transition count 893
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 344 place count 921 transition count 882
Iterating global reduction 1 with 11 rules applied. Total rules applied 355 place count 921 transition count 882
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 366 place count 910 transition count 871
Iterating global reduction 1 with 11 rules applied. Total rules applied 377 place count 910 transition count 871
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 388 place count 899 transition count 860
Iterating global reduction 1 with 11 rules applied. Total rules applied 399 place count 899 transition count 860
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 410 place count 888 transition count 849
Iterating global reduction 1 with 11 rules applied. Total rules applied 421 place count 888 transition count 849
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 432 place count 877 transition count 838
Iterating global reduction 1 with 11 rules applied. Total rules applied 443 place count 877 transition count 838
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 454 place count 866 transition count 827
Iterating global reduction 1 with 11 rules applied. Total rules applied 465 place count 866 transition count 827
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 476 place count 855 transition count 816
Iterating global reduction 1 with 11 rules applied. Total rules applied 487 place count 855 transition count 816
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 498 place count 844 transition count 805
Iterating global reduction 1 with 11 rules applied. Total rules applied 509 place count 844 transition count 805
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 520 place count 833 transition count 794
Iterating global reduction 1 with 11 rules applied. Total rules applied 531 place count 833 transition count 794
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 542 place count 822 transition count 783
Iterating global reduction 1 with 11 rules applied. Total rules applied 553 place count 822 transition count 783
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 564 place count 822 transition count 772
Applied a total of 564 rules in 471 ms. Remains 822 /1121 variables (removed 299) and now considering 772/1077 (removed 305) transitions.
// Phase 1: matrix 772 rows 822 cols
[2022-05-16 16:27:21] [INFO ] Computed 84 place invariants in 9 ms
[2022-05-16 16:27:21] [INFO ] Implicit Places using invariants in 238 ms returned [88, 89, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 381, 395, 418]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 239 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 806/1121 places, 772/1077 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 795 transition count 761
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 795 transition count 761
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 785 transition count 750
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 785 transition count 750
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 775 transition count 740
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 775 transition count 740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 774 transition count 739
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 774 transition count 739
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 773 transition count 738
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 773 transition count 738
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 772 transition count 737
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 772 transition count 737
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 771 transition count 736
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 771 transition count 736
Applied a total of 70 rules in 179 ms. Remains 771 /806 variables (removed 35) and now considering 736/772 (removed 36) transitions.
// Phase 1: matrix 736 rows 771 cols
[2022-05-16 16:27:21] [INFO ] Computed 68 place invariants in 22 ms
[2022-05-16 16:27:22] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 736 rows 771 cols
[2022-05-16 16:27:22] [INFO ] Computed 68 place invariants in 3 ms
[2022-05-16 16:27:22] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 771/1121 places, 736/1077 transitions.
Finished structural reductions, in 2 iterations. Remains : 771/1121 places, 736/1077 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, p1, p1]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (OR (GEQ s379 1) (GEQ s380 1) (GEQ s381 1) (GEQ s382 1) (GEQ s375 1) (GEQ s376 1) (GEQ s377 1) (GEQ s378 1) (GEQ s372 1) (GEQ s373 1) (GEQ s374 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]]
Entered a terminal (fully accepting) state of product in 5431 steps with 8 reset in 27 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04 finished in 1725 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X(!(p0 U X(p1)))&&p2)))))'
Support contains 99 out of 1121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1121/1121 places, 1077/1077 transitions.
Graph (complete) has 1480 edges and 1121 vertex of which 1036 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.3 ms
Discarding 85 places :
Also discarding 105 output transitions
Drop transitions removed 105 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 23 places :
Implicit places reduction removed 23 places
Drop transitions removed 451 transitions
Trivial Post-agglo rules discarded 451 transitions
Performed 451 trivial Post agglomeration. Transition count delta: 451
Iterating post reduction 0 with 474 rules applied. Total rules applied 475 place count 1002 transition count 510
Reduce places removed 451 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 473 rules applied. Total rules applied 948 place count 551 transition count 488
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 970 place count 529 transition count 488
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 970 place count 529 transition count 358
Deduced a syphon composed of 130 places in 1 ms
Ensure Unique test removed 33 places
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 3 with 293 rules applied. Total rules applied 1263 place count 366 transition count 358
Discarding 22 places :
Implicit places reduction removed 22 places
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 3 with 44 rules applied. Total rules applied 1307 place count 344 transition count 336
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1329 place count 322 transition count 336
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 1343 place count 308 transition count 312
Iterating global reduction 5 with 14 rules applied. Total rules applied 1357 place count 308 transition count 312
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 1359 place count 308 transition count 310
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1361 place count 306 transition count 310
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1361 place count 306 transition count 299
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1383 place count 295 transition count 299
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1384 place count 294 transition count 288
Iterating global reduction 7 with 1 rules applied. Total rules applied 1385 place count 294 transition count 288
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 15 rules applied. Total rules applied 1400 place count 292 transition count 275
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1402 place count 290 transition count 275
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 9 with 66 rules applied. Total rules applied 1468 place count 257 transition count 242
Applied a total of 1468 rules in 63 ms. Remains 257 /1121 variables (removed 864) and now considering 242/1077 (removed 835) transitions.
// Phase 1: matrix 242 rows 257 cols
[2022-05-16 16:27:22] [INFO ] Computed 47 place invariants in 2 ms
[2022-05-16 16:27:22] [INFO ] Implicit Places using invariants in 91 ms returned [11, 212]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 92 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 255/1121 places, 242/1077 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 255 transition count 231
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 244 transition count 231
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 233 transition count 231
Applied a total of 44 rules in 10 ms. Remains 233 /255 variables (removed 22) and now considering 231/242 (removed 11) transitions.
// Phase 1: matrix 231 rows 233 cols
[2022-05-16 16:27:22] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-16 16:27:22] [INFO ] Implicit Places using invariants in 64 ms returned [11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 65 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 222/1121 places, 231/1077 transitions.
Applied a total of 0 rules in 5 ms. Remains 222 /222 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 222/1121 places, 231/1077 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (AND (LT s209 1) (LT s210 1) (LT s207 1) (LT s208 1) (LT s213 1) (LT s214 1) (LT s211 1) (LT s212 1) (LT s217 1) (LT s218 1) (LT s215 1) (LT s216 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1190 reset in 647 ms.
Product exploration explored 100000 steps with 1190 reset in 634 ms.
Computed a total of 222 stabilizing places and 231 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 222 transition count 231
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 p2 (NOT p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X p2), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X p2)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 292 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1)]
Finished random walk after 42 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X p2), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X p2)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p2 p1)), (F (NOT (AND p2 (NOT p1))))]
Knowledge based reduction with 9 factoid took 315 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1)]
Support contains 99 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 231/231 transitions.
Applied a total of 0 rules in 11 ms. Remains 222 /222 variables (removed 0) and now considering 231/231 (removed 0) transitions.
// Phase 1: matrix 231 rows 222 cols
[2022-05-16 16:27:25] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 16:27:25] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 231 rows 222 cols
[2022-05-16 16:27:25] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-16 16:27:25] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2022-05-16 16:27:25] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 231 rows 222 cols
[2022-05-16 16:27:25] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 16:27:25] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 222/222 places, 231/231 transitions.
Computed a total of 222 stabilizing places and 231 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 222 transition count 231
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 p2 (NOT p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X p2), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X p2)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 383 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1)]
Finished random walk after 75 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X p2), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X p2)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p2 p1)), (F (NOT (AND p2 (NOT p1))))]
Knowledge based reduction with 9 factoid took 373 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1)]
Product exploration explored 100000 steps with 1190 reset in 555 ms.
Product exploration explored 100000 steps with 1190 reset in 584 ms.
Built C files in :
/tmp/ltsmin5437455224389448691
[2022-05-16 16:27:27] [INFO ] Computing symmetric may disable matrix : 231 transitions.
[2022-05-16 16:27:27] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:27:27] [INFO ] Computing symmetric may enable matrix : 231 transitions.
[2022-05-16 16:27:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:27:27] [INFO ] Computing Do-Not-Accords matrix : 231 transitions.
[2022-05-16 16:27:28] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:27:28] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5437455224389448691
Running compilation step : cd /tmp/ltsmin5437455224389448691;'/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'
Compilation finished in 511 ms.
Running link step : cd /tmp/ltsmin5437455224389448691;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5437455224389448691;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14280832735976453702.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 99 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 231/231 transitions.
Applied a total of 0 rules in 8 ms. Remains 222 /222 variables (removed 0) and now considering 231/231 (removed 0) transitions.
// Phase 1: matrix 231 rows 222 cols
[2022-05-16 16:27:43] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 16:27:43] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 231 rows 222 cols
[2022-05-16 16:27:43] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-16 16:27:43] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2022-05-16 16:27:43] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 231 rows 222 cols
[2022-05-16 16:27:43] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-16 16:27:43] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 222/222 places, 231/231 transitions.
Built C files in :
/tmp/ltsmin11275480567116703455
[2022-05-16 16:27:43] [INFO ] Computing symmetric may disable matrix : 231 transitions.
[2022-05-16 16:27:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:27:43] [INFO ] Computing symmetric may enable matrix : 231 transitions.
[2022-05-16 16:27:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:27:43] [INFO ] Computing Do-Not-Accords matrix : 231 transitions.
[2022-05-16 16:27:43] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:27:43] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11275480567116703455
Running compilation step : cd /tmp/ltsmin11275480567116703455;'/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'
Compilation finished in 415 ms.
Running link step : cd /tmp/ltsmin11275480567116703455;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11275480567116703455;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3338553583732790484.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 16:27:58] [INFO ] Flatten gal took : 11 ms
[2022-05-16 16:27:58] [INFO ] Flatten gal took : 9 ms
[2022-05-16 16:27:58] [INFO ] Time to serialize gal into /tmp/LTL6706074370150667297.gal : 2 ms
[2022-05-16 16:27:58] [INFO ] Time to serialize properties into /tmp/LTL1307495573183302266.ltl : 1 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/LTL6706074370150667297.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1307495573183302266.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/LTL6706074...266
Read 1 LTL properties
Checking formula 0 : !((G(F(G((X(!(("((((((p2_9_0>=1)||(p2_10_0>=1))||((p2_7_0>=1)||(p2_8_0>=1)))||(((p2_2_1>=1)||(p2_3_1>=1))||((p2_0_1>=1)||(p2_1_1>=1)))...1997
Formula 0 simplified : !GFG("(((((((p2_9_0<1)&&(p2_10_0<1))&&((p2_7_0<1)&&(p2_8_0<1)))&&(((p2_2_1<1)&&(p2_3_1<1))&&((p2_0_1<1)&&(p2_1_1<1))))&&((((p2_6_1<1...1982
Detected timeout of ITS tools.
[2022-05-16 16:28:13] [INFO ] Flatten gal took : 9 ms
[2022-05-16 16:28:13] [INFO ] Applying decomposition
[2022-05-16 16:28:13] [INFO ] Flatten gal took : 9 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/graph4772578918982012133.txt' '-o' '/tmp/graph4772578918982012133.bin' '-w' '/tmp/graph4772578918982012133.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4772578918982012133.bin' '-l' '-1' '-v' '-w' '/tmp/graph4772578918982012133.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:28:13] [INFO ] Decomposing Gal with order
[2022-05-16 16:28:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:28:13] [INFO ] Removed a total of 71 redundant transitions.
[2022-05-16 16:28:13] [INFO ] Flatten gal took : 49 ms
[2022-05-16 16:28:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 8 ms.
[2022-05-16 16:28:13] [INFO ] Time to serialize gal into /tmp/LTL2461457610029395701.gal : 5 ms
[2022-05-16 16:28:13] [INFO ] Time to serialize properties into /tmp/LTL18049459007260420296.ltl : 1 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/LTL2461457610029395701.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18049459007260420296.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/LTL2461457...246
Read 1 LTL properties
Checking formula 0 : !((G(F(G((X(!(("((((((i13.u73.p2_9_0>=1)||(i16.u74.p2_10_0>=1))||((i1.u11.p2_7_0>=1)||(i2.u12.p2_8_0>=1)))||(((i11.u64.p2_2_1>=1)||(i0...3013
Formula 0 simplified : !GFG("(((((((i13.u73.p2_9_0<1)&&(i16.u74.p2_10_0<1))&&((i1.u11.p2_7_0<1)&&(i2.u12.p2_8_0<1)))&&(((i11.u64.p2_2_1<1)&&(i0.u9.p2_3_1<1...2998
Reverse transition relation is NOT exact ! Due to transitions t277, t278, t280, t281, t282, t283, t284, t285, t286, t288, t290, t298, Intersection with re...234
Computing Next relation with stutter on 55 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12615331040962256520
[2022-05-16 16:28:28] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12615331040962256520
Running compilation step : cd /tmp/ltsmin12615331040962256520;'/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'
Compilation finished in 328 ms.
Running link step : cd /tmp/ltsmin12615331040962256520;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin12615331040962256520;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]((X(!((LTLAPp0==true) U X((LTLAPp1==true))))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-05 finished in 81283 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 11 out of 1121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1121/1121 places, 1077/1077 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1076 transition count 1077
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 94 place count 1027 transition count 1027
Iterating global reduction 1 with 49 rules applied. Total rules applied 143 place count 1027 transition count 1027
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 186 place count 984 transition count 974
Iterating global reduction 1 with 43 rules applied. Total rules applied 229 place count 984 transition count 974
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 251 place count 962 transition count 924
Iterating global reduction 1 with 22 rules applied. Total rules applied 273 place count 962 transition count 924
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 305 place count 930 transition count 881
Iterating global reduction 1 with 32 rules applied. Total rules applied 337 place count 930 transition count 881
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 1 with 24 rules applied. Total rules applied 361 place count 917 transition count 870
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 381 place count 897 transition count 850
Iterating global reduction 2 with 20 rules applied. Total rules applied 401 place count 897 transition count 850
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 421 place count 877 transition count 830
Iterating global reduction 2 with 20 rules applied. Total rules applied 441 place count 877 transition count 830
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 461 place count 857 transition count 810
Iterating global reduction 2 with 20 rules applied. Total rules applied 481 place count 857 transition count 810
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 501 place count 837 transition count 790
Iterating global reduction 2 with 20 rules applied. Total rules applied 521 place count 837 transition count 790
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 541 place count 817 transition count 770
Iterating global reduction 2 with 20 rules applied. Total rules applied 561 place count 817 transition count 770
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 573 place count 805 transition count 758
Iterating global reduction 2 with 12 rules applied. Total rules applied 585 place count 805 transition count 758
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 596 place count 794 transition count 747
Iterating global reduction 2 with 11 rules applied. Total rules applied 607 place count 794 transition count 747
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 618 place count 783 transition count 736
Iterating global reduction 2 with 11 rules applied. Total rules applied 629 place count 783 transition count 736
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 640 place count 772 transition count 725
Iterating global reduction 2 with 11 rules applied. Total rules applied 651 place count 772 transition count 725
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 662 place count 761 transition count 714
Iterating global reduction 2 with 11 rules applied. Total rules applied 673 place count 761 transition count 714
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 684 place count 750 transition count 703
Iterating global reduction 2 with 11 rules applied. Total rules applied 695 place count 750 transition count 703
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 706 place count 739 transition count 692
Iterating global reduction 2 with 11 rules applied. Total rules applied 717 place count 739 transition count 692
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 728 place count 739 transition count 681
Applied a total of 728 rules in 432 ms. Remains 739 /1121 variables (removed 382) and now considering 681/1077 (removed 396) transitions.
// Phase 1: matrix 681 rows 739 cols
[2022-05-16 16:28:44] [INFO ] Computed 71 place invariants in 9 ms
[2022-05-16 16:28:44] [INFO ] Implicit Places using invariants in 205 ms returned [143, 298, 312, 335]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 206 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 735/1121 places, 681/1077 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 733 transition count 679
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 733 transition count 679
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 732 transition count 677
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 732 transition count 677
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 731 transition count 676
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 731 transition count 676
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 730 transition count 675
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 730 transition count 675
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 729 transition count 674
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 729 transition count 674
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 728 transition count 673
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 728 transition count 673
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 727 transition count 672
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 727 transition count 672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 726 transition count 671
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 726 transition count 671
Applied a total of 18 rules in 172 ms. Remains 726 /735 variables (removed 9) and now considering 671/681 (removed 10) transitions.
// Phase 1: matrix 671 rows 726 cols
[2022-05-16 16:28:44] [INFO ] Computed 67 place invariants in 8 ms
[2022-05-16 16:28:45] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 671 rows 726 cols
[2022-05-16 16:28:45] [INFO ] Computed 67 place invariants in 3 ms
[2022-05-16 16:28:45] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 726/1121 places, 671/1077 transitions.
Finished structural reductions, in 2 iterations. Remains : 726/1121 places, 671/1077 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-06 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 (GEQ s682 1) (GEQ s692 1) (GEQ s691 1) (GEQ s688 1) (GEQ s687 1) (GEQ s690 1) (GEQ s689 1) (GEQ s684 1) (GEQ s683 1) (GEQ s686 1) (GEQ s685 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-06 finished in 1544 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(!p0))))'
Support contains 22 out of 1121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1121/1121 places, 1077/1077 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1076 transition count 1077
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 94 place count 1027 transition count 1027
Iterating global reduction 1 with 49 rules applied. Total rules applied 143 place count 1027 transition count 1027
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 186 place count 984 transition count 974
Iterating global reduction 1 with 43 rules applied. Total rules applied 229 place count 984 transition count 974
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 251 place count 962 transition count 924
Iterating global reduction 1 with 22 rules applied. Total rules applied 273 place count 962 transition count 924
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 305 place count 930 transition count 881
Iterating global reduction 1 with 32 rules applied. Total rules applied 337 place count 930 transition count 881
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 1 with 24 rules applied. Total rules applied 361 place count 917 transition count 870
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 381 place count 897 transition count 850
Iterating global reduction 2 with 20 rules applied. Total rules applied 401 place count 897 transition count 850
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 421 place count 877 transition count 830
Iterating global reduction 2 with 20 rules applied. Total rules applied 441 place count 877 transition count 830
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 461 place count 857 transition count 810
Iterating global reduction 2 with 20 rules applied. Total rules applied 481 place count 857 transition count 810
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 501 place count 837 transition count 790
Iterating global reduction 2 with 20 rules applied. Total rules applied 521 place count 837 transition count 790
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 541 place count 817 transition count 770
Iterating global reduction 2 with 20 rules applied. Total rules applied 561 place count 817 transition count 770
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 573 place count 805 transition count 758
Iterating global reduction 2 with 12 rules applied. Total rules applied 585 place count 805 transition count 758
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 596 place count 794 transition count 747
Iterating global reduction 2 with 11 rules applied. Total rules applied 607 place count 794 transition count 747
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 618 place count 783 transition count 736
Iterating global reduction 2 with 11 rules applied. Total rules applied 629 place count 783 transition count 736
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 640 place count 772 transition count 725
Iterating global reduction 2 with 11 rules applied. Total rules applied 651 place count 772 transition count 725
Applied a total of 651 rules in 356 ms. Remains 772 /1121 variables (removed 349) and now considering 725/1077 (removed 352) transitions.
// Phase 1: matrix 725 rows 772 cols
[2022-05-16 16:28:45] [INFO ] Computed 71 place invariants in 10 ms
[2022-05-16 16:28:46] [INFO ] Implicit Places using invariants in 177 ms returned [176, 331, 345, 368]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 179 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 768/1121 places, 725/1077 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 766 transition count 723
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 766 transition count 723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 765 transition count 721
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 765 transition count 721
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 764 transition count 720
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 764 transition count 720
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 763 transition count 719
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 763 transition count 719
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 762 transition count 718
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 762 transition count 718
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 761 transition count 717
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 761 transition count 717
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 760 transition count 716
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 760 transition count 716
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 759 transition count 715
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 759 transition count 715
Applied a total of 18 rules in 180 ms. Remains 759 /768 variables (removed 9) and now considering 715/725 (removed 10) transitions.
// Phase 1: matrix 715 rows 759 cols
[2022-05-16 16:28:46] [INFO ] Computed 67 place invariants in 5 ms
[2022-05-16 16:28:46] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 715 rows 759 cols
[2022-05-16 16:28:46] [INFO ] Computed 67 place invariants in 3 ms
[2022-05-16 16:28:46] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 759/1121 places, 715/1077 transitions.
Finished structural reductions, in 2 iterations. Remains : 759/1121 places, 715/1077 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), p0]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s144 1) (GEQ s143 1) (GEQ s148 1) (GEQ s147 1) (GEQ s146 1) (GEQ s145 1) (GEQ s152 1) (GEQ s151 1) (GEQ s150 1) (GEQ s149 1) (GEQ s156 1) (GEQ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10120 reset in 440 ms.
Product exploration explored 100000 steps with 9893 reset in 418 ms.
Computed a total of 759 stabilizing places and 715 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 759 transition count 715
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 715 rows 759 cols
[2022-05-16 16:28:48] [INFO ] Computed 67 place invariants in 3 ms
[2022-05-16 16:28:49] [INFO ] [Real]Absence check using 0 positive and 67 generalized place invariants in 31 ms returned sat
[2022-05-16 16:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:28:49] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2022-05-16 16:28:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:28:49] [INFO ] [Nat]Absence check using 0 positive and 67 generalized place invariants in 19 ms returned sat
[2022-05-16 16:28:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:28:50] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2022-05-16 16:28:50] [INFO ] Computed and/alt/rep : 702/791/702 causal constraints (skipped 2 transitions) in 35 ms.
[2022-05-16 16:28:50] [INFO ] Added : 22 causal constraints over 5 iterations in 313 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 22 out of 759 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 759/759 places, 715/715 transitions.
Graph (complete) has 858 edges and 759 vertex of which 88 are kept as prefixes of interest. Removing 671 places using SCC suffix rule.2 ms
Discarding 671 places :
Also discarding 616 output transitions
Drop transitions removed 616 transitions
Reduce places removed 11 places and 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 77 transition count 66
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 55 transition count 66
Applied a total of 45 rules in 9 ms. Remains 55 /759 variables (removed 704) and now considering 66/715 (removed 649) transitions.
// Phase 1: matrix 66 rows 55 cols
[2022-05-16 16:28:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 16:28:50] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 66 rows 55 cols
[2022-05-16 16:28:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 16:28:50] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-05-16 16:28:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 66 rows 55 cols
[2022-05-16 16:28:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 16:28:50] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/759 places, 66/715 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/759 places, 66/715 transitions.
Computed a total of 55 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 55 transition count 66
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 : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 66 rows 55 cols
[2022-05-16 16:28:51] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 16:28:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:28:51] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 16:28:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:28:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:28:51] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:28:51] [INFO ] Computed and/alt/rep : 44/44/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:28:51] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14403 reset in 186 ms.
Product exploration explored 100000 steps with 14326 reset in 187 ms.
Built C files in :
/tmp/ltsmin18374301941743886269
[2022-05-16 16:28:51] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2022-05-16 16:28:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:28:51] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2022-05-16 16:28:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:28:51] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2022-05-16 16:28:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:28:51] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18374301941743886269
Running compilation step : cd /tmp/ltsmin18374301941743886269;'/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'
Compilation finished in 155 ms.
Running link step : cd /tmp/ltsmin18374301941743886269;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin18374301941743886269;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12936026115899229379.hoa' '--buchi-type=spotba'
LTSmin run took 340 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-07 finished in 6621 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F((F(p0)||p1))))))'
Support contains 2 out of 1121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1121/1121 places, 1077/1077 transitions.
Graph (complete) has 1480 edges and 1121 vertex of which 1064 are kept as prefixes of interest. Removing 57 places using SCC suffix rule.4 ms
Discarding 57 places :
Also discarding 67 output transitions
Drop transitions removed 67 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Drop transitions removed 605 transitions
Trivial Post-agglo rules discarded 605 transitions
Performed 605 trivial Post agglomeration. Transition count delta: 605
Iterating post reduction 0 with 650 rules applied. Total rules applied 651 place count 1008 transition count 394
Reduce places removed 605 places and 0 transitions.
Iterating post reduction 1 with 605 rules applied. Total rules applied 1256 place count 403 transition count 394
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 141 Pre rules applied. Total rules applied 1256 place count 403 transition count 253
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 2 with 337 rules applied. Total rules applied 1593 place count 207 transition count 253
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 2 with 21 rules applied. Total rules applied 1614 place count 207 transition count 232
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 33 rules applied. Total rules applied 1647 place count 186 transition count 220
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1650 place count 184 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1651 place count 183 transition count 219
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1651 place count 183 transition count 211
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1667 place count 175 transition count 211
Discarding 35 places :
Symmetric choice reduction at 6 with 35 rule applications. Total rules 1702 place count 140 transition count 156
Iterating global reduction 6 with 35 rules applied. Total rules applied 1737 place count 140 transition count 156
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 15 rules applied. Total rules applied 1752 place count 140 transition count 141
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1756 place count 136 transition count 141
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 13 Pre rules applied. Total rules applied 1756 place count 136 transition count 128
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1782 place count 123 transition count 128
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1784 place count 121 transition count 106
Iterating global reduction 8 with 2 rules applied. Total rules applied 1786 place count 121 transition count 106
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 8 with 23 rules applied. Total rules applied 1809 place count 119 transition count 85
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1819 place count 109 transition count 85
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 10 with 48 rules applied. Total rules applied 1867 place count 85 transition count 61
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1868 place count 85 transition count 61
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 10 with 11 rules applied. Total rules applied 1879 place count 74 transition count 50
Applied a total of 1879 rules in 40 ms. Remains 74 /1121 variables (removed 1047) and now considering 50/1077 (removed 1027) transitions.
// Phase 1: matrix 50 rows 74 cols
[2022-05-16 16:28:52] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 16:28:52] [INFO ] Implicit Places using invariants in 55 ms returned [0, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 57, 69]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 58 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/1121 places, 50/1077 transitions.
Graph (complete) has 49 edges and 49 vertex of which 39 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Reduce places removed 10 places and 10 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 29 transition count 19
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 18 transition count 19
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 32 place count 9 transition count 10
Iterating global reduction 0 with 9 rules applied. Total rules applied 41 place count 9 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 43 place count 8 transition count 9
Applied a total of 43 rules in 3 ms. Remains 8 /49 variables (removed 41) and now considering 9/50 (removed 41) transitions.
// Phase 1: matrix 9 rows 8 cols
[2022-05-16 16:28:52] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 16:28:52] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2022-05-16 16:28:52] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 16:28:52] [INFO ] Implicit Places using invariants and state equation in 24 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 42 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/1121 places, 9/1077 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 7/1121 places, 9/1077 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s6 1), p1:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 17137 reset in 55 ms.
Product exploration explored 100000 steps with 17186 reset in 50 ms.
Computed a total of 7 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 9
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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08 finished in 473 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||(G(p1) U p2))))'
Support contains 6 out of 1121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1121/1121 places, 1077/1077 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1076 transition count 1077
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 93 place count 1028 transition count 1028
Iterating global reduction 1 with 48 rules applied. Total rules applied 141 place count 1028 transition count 1028
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 184 place count 985 transition count 975
Iterating global reduction 1 with 43 rules applied. Total rules applied 227 place count 985 transition count 975
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 249 place count 963 transition count 925
Iterating global reduction 1 with 22 rules applied. Total rules applied 271 place count 963 transition count 925
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 301 place count 933 transition count 884
Iterating global reduction 1 with 30 rules applied. Total rules applied 331 place count 933 transition count 884
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 20 rules applied. Total rules applied 351 place count 922 transition count 875
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 371 place count 902 transition count 855
Iterating global reduction 2 with 20 rules applied. Total rules applied 391 place count 902 transition count 855
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 411 place count 882 transition count 835
Iterating global reduction 2 with 20 rules applied. Total rules applied 431 place count 882 transition count 835
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 451 place count 862 transition count 815
Iterating global reduction 2 with 20 rules applied. Total rules applied 471 place count 862 transition count 815
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 491 place count 842 transition count 795
Iterating global reduction 2 with 20 rules applied. Total rules applied 511 place count 842 transition count 795
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 531 place count 822 transition count 775
Iterating global reduction 2 with 20 rules applied. Total rules applied 551 place count 822 transition count 775
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 562 place count 811 transition count 764
Iterating global reduction 2 with 11 rules applied. Total rules applied 573 place count 811 transition count 764
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 583 place count 801 transition count 754
Iterating global reduction 2 with 10 rules applied. Total rules applied 593 place count 801 transition count 754
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 603 place count 791 transition count 744
Iterating global reduction 2 with 10 rules applied. Total rules applied 613 place count 791 transition count 744
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 623 place count 781 transition count 734
Iterating global reduction 2 with 10 rules applied. Total rules applied 633 place count 781 transition count 734
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 643 place count 771 transition count 724
Iterating global reduction 2 with 10 rules applied. Total rules applied 653 place count 771 transition count 724
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 663 place count 761 transition count 714
Iterating global reduction 2 with 10 rules applied. Total rules applied 673 place count 761 transition count 714
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 683 place count 751 transition count 704
Iterating global reduction 2 with 10 rules applied. Total rules applied 693 place count 751 transition count 704
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 703 place count 751 transition count 694
Applied a total of 703 rules in 403 ms. Remains 751 /1121 variables (removed 370) and now considering 694/1077 (removed 383) transitions.
// Phase 1: matrix 694 rows 751 cols
[2022-05-16 16:28:53] [INFO ] Computed 73 place invariants in 8 ms
[2022-05-16 16:28:53] [INFO ] Implicit Places using invariants in 172 ms returned [89, 151, 310, 347]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 173 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 747/1121 places, 694/1077 transitions.
Applied a total of 0 rules in 19 ms. Remains 747 /747 variables (removed 0) and now considering 694/694 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 747/1121 places, 694/1077 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND p2 p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 1}]], initial=6, aps=[p1:(AND (GEQ s321 1) (GEQ s360 1)), p2:(GEQ s124 1), p0:(OR (AND (GEQ s89 1) (GEQ s147 1)) (GEQ s240 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09 finished in 849 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0)) U p1))'
Support contains 4 out of 1121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1121/1121 places, 1077/1077 transitions.
Graph (complete) has 1480 edges and 1121 vertex of which 1061 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.2 ms
Discarding 60 places :
Also discarding 70 output transitions
Drop transitions removed 70 transitions
Reduce places removed 11 places and 11 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Drop transitions removed 598 transitions
Trivial Post-agglo rules discarded 598 transitions
Performed 598 trivial Post agglomeration. Transition count delta: 598
Iterating post reduction 0 with 644 rules applied. Total rules applied 645 place count 1005 transition count 397
Reduce places removed 598 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 600 rules applied. Total rules applied 1245 place count 407 transition count 395
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1247 place count 405 transition count 395
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 141 Pre rules applied. Total rules applied 1247 place count 405 transition count 254
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 54 places
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 3 with 336 rules applied. Total rules applied 1583 place count 210 transition count 254
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 3 with 20 rules applied. Total rules applied 1603 place count 210 transition count 234
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 32 rules applied. Total rules applied 1635 place count 190 transition count 222
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 1638 place count 188 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1639 place count 187 transition count 221
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 1639 place count 187 transition count 213
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1655 place count 179 transition count 213
Discarding 35 places :
Symmetric choice reduction at 7 with 35 rule applications. Total rules 1690 place count 144 transition count 159
Iterating global reduction 7 with 35 rules applied. Total rules applied 1725 place count 144 transition count 159
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 7 with 15 rules applied. Total rules applied 1740 place count 144 transition count 144
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1744 place count 140 transition count 144
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 12 Pre rules applied. Total rules applied 1744 place count 140 transition count 132
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1768 place count 128 transition count 132
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1769 place count 127 transition count 121
Iterating global reduction 9 with 1 rules applied. Total rules applied 1770 place count 127 transition count 121
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 9 with 23 rules applied. Total rules applied 1793 place count 124 transition count 101
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 10 with 11 rules applied. Total rules applied 1804 place count 115 transition count 99
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1806 place count 113 transition count 99
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 12 with 44 rules applied. Total rules applied 1850 place count 91 transition count 77
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1852 place count 90 transition count 85
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 1862 place count 80 transition count 75
Applied a total of 1862 rules in 45 ms. Remains 80 /1121 variables (removed 1041) and now considering 75/1077 (removed 1002) transitions.
// Phase 1: matrix 75 rows 80 cols
[2022-05-16 16:28:53] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 16:28:53] [INFO ] Implicit Places using invariants in 74 ms returned [1, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 74]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 75 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/1121 places, 75/1077 transitions.
Reduce places removed 10 places and 10 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 64
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 45 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 43 transition count 62
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 6 place count 43 transition count 53
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 24 place count 34 transition count 53
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 33 place count 25 transition count 35
Iterating global reduction 3 with 9 rules applied. Total rules applied 42 place count 25 transition count 35
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 50 place count 17 transition count 19
Iterating global reduction 3 with 8 rules applied. Total rules applied 58 place count 17 transition count 19
Applied a total of 58 rules in 5 ms. Remains 17 /56 variables (removed 39) and now considering 19/75 (removed 56) transitions.
// Phase 1: matrix 19 rows 17 cols
[2022-05-16 16:28:53] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 16:28:53] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 19 rows 17 cols
[2022-05-16 16:28:53] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 16:28:53] [INFO ] Implicit Places using invariants and state equation in 31 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/1121 places, 19/1077 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 16/1121 places, 19/1077 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NOT (OR (GEQ s11 1) (LT s12 1))) (GEQ s15 1)), p0:(GEQ s5 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][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10 finished in 316 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((F(G(p1))&&X(p2)))&&p0))))'
Support contains 5 out of 1121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1121/1121 places, 1077/1077 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1077 transition count 1077
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 93 place count 1028 transition count 1027
Iterating global reduction 1 with 49 rules applied. Total rules applied 142 place count 1028 transition count 1027
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 185 place count 985 transition count 974
Iterating global reduction 1 with 43 rules applied. Total rules applied 228 place count 985 transition count 974
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 250 place count 963 transition count 924
Iterating global reduction 1 with 22 rules applied. Total rules applied 272 place count 963 transition count 924
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 303 place count 932 transition count 892
Iterating global reduction 1 with 31 rules applied. Total rules applied 334 place count 932 transition count 892
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 13 rules applied. Total rules applied 347 place count 930 transition count 881
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 367 place count 910 transition count 861
Iterating global reduction 2 with 20 rules applied. Total rules applied 387 place count 910 transition count 861
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 399 place count 898 transition count 849
Iterating global reduction 2 with 12 rules applied. Total rules applied 411 place count 898 transition count 849
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 422 place count 887 transition count 838
Iterating global reduction 2 with 11 rules applied. Total rules applied 433 place count 887 transition count 838
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 444 place count 876 transition count 827
Iterating global reduction 2 with 11 rules applied. Total rules applied 455 place count 876 transition count 827
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 465 place count 866 transition count 817
Iterating global reduction 2 with 10 rules applied. Total rules applied 475 place count 866 transition count 817
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 485 place count 856 transition count 807
Iterating global reduction 2 with 10 rules applied. Total rules applied 495 place count 856 transition count 807
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 505 place count 846 transition count 797
Iterating global reduction 2 with 10 rules applied. Total rules applied 515 place count 846 transition count 797
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 525 place count 836 transition count 787
Iterating global reduction 2 with 10 rules applied. Total rules applied 535 place count 836 transition count 787
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 545 place count 826 transition count 777
Iterating global reduction 2 with 10 rules applied. Total rules applied 555 place count 826 transition count 777
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 565 place count 816 transition count 767
Iterating global reduction 2 with 10 rules applied. Total rules applied 575 place count 816 transition count 767
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 585 place count 806 transition count 757
Iterating global reduction 2 with 10 rules applied. Total rules applied 595 place count 806 transition count 757
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 605 place count 796 transition count 747
Iterating global reduction 2 with 10 rules applied. Total rules applied 615 place count 796 transition count 747
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 625 place count 796 transition count 737
Applied a total of 625 rules in 422 ms. Remains 796 /1121 variables (removed 325) and now considering 737/1077 (removed 340) transitions.
// Phase 1: matrix 737 rows 796 cols
[2022-05-16 16:28:54] [INFO ] Computed 83 place invariants in 6 ms
[2022-05-16 16:28:54] [INFO ] Implicit Places using invariants in 198 ms returned [146, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 355, 369, 392]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 200 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 781/1121 places, 737/1077 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 770 transition count 726
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 770 transition count 726
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 760 transition count 715
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 760 transition count 715
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 751 transition count 698
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 751 transition count 698
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 742 transition count 689
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 742 transition count 689
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 741 transition count 688
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 741 transition count 688
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 740 transition count 687
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 740 transition count 687
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 739 transition count 685
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 739 transition count 685
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 738 transition count 684
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 738 transition count 684
Applied a total of 86 rules in 141 ms. Remains 738 /781 variables (removed 43) and now considering 684/737 (removed 53) transitions.
// Phase 1: matrix 684 rows 738 cols
[2022-05-16 16:28:54] [INFO ] Computed 68 place invariants in 6 ms
[2022-05-16 16:28:54] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 684 rows 738 cols
[2022-05-16 16:28:54] [INFO ] Computed 68 place invariants in 2 ms
[2022-05-16 16:28:55] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 738/1121 places, 684/1077 transitions.
Finished structural reductions, in 2 iterations. Remains : 738/1121 places, 684/1077 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 6}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s277 1) (GEQ s302 1)), p2:(LT s513 1), p1:(OR (LT s226 1) (LT s263 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11 finished in 1675 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(!(p1 U p2))||p0))))'
Support contains 4 out of 1121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1121/1121 places, 1077/1077 transitions.
Graph (complete) has 1480 edges and 1121 vertex of which 471 are kept as prefixes of interest. Removing 650 places using SCC suffix rule.2 ms
Discarding 650 places :
Also discarding 636 output transitions
Drop transitions removed 636 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Drop transitions removed 339 transitions
Trivial Post-agglo rules discarded 339 transitions
Performed 339 trivial Post agglomeration. Transition count delta: 339
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 415 transition count 91
Reduce places removed 339 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 340 rules applied. Total rules applied 725 place count 76 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 726 place count 75 transition count 90
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 726 place count 75 transition count 61
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 65 rules applied. Total rules applied 791 place count 39 transition count 61
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 793 place count 39 transition count 59
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 796 place count 37 transition count 58
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 796 place count 37 transition count 57
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 798 place count 36 transition count 57
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 808 place count 26 transition count 37
Iterating global reduction 5 with 10 rules applied. Total rules applied 818 place count 26 transition count 37
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 12 rules applied. Total rules applied 830 place count 26 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 831 place count 25 transition count 25
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 838 place count 18 transition count 18
Iterating global reduction 7 with 7 rules applied. Total rules applied 845 place count 18 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 847 place count 17 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 850 place count 14 transition count 14
Applied a total of 850 rules in 18 ms. Remains 14 /1121 variables (removed 1107) and now considering 14/1077 (removed 1063) transitions.
// Phase 1: matrix 14 rows 14 cols
[2022-05-16 16:28:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 16:28:55] [INFO ] Implicit Places using invariants in 20 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/1121 places, 14/1077 transitions.
Graph (complete) has 11 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Applied a total of 1 rules in 1 ms. Remains 10 /13 variables (removed 3) and now considering 11/14 (removed 3) transitions.
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 16:28:55] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 16:28:55] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 16:28:55] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 16:28:55] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/1121 places, 11/1077 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/1121 places, 11/1077 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s3 1)), p2:(GEQ s6 1), p1:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13491 reset in 60 ms.
Product exploration explored 100000 steps with 13471 reset in 56 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 11
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 p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 8 factoid took 168 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-12 finished in 512 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0)) U p0) U F(G(p1))))'
Support contains 2 out of 1121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1121/1121 places, 1077/1077 transitions.
Graph (complete) has 1480 edges and 1121 vertex of which 446 are kept as prefixes of interest. Removing 675 places using SCC suffix rule.2 ms
Discarding 675 places :
Also discarding 659 output transitions
Drop transitions removed 659 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Drop transitions removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 375 rules applied. Total rules applied 376 place count 390 transition count 77
Reduce places removed 330 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 333 rules applied. Total rules applied 709 place count 60 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 711 place count 58 transition count 74
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 711 place count 58 transition count 52
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 760 place count 31 transition count 52
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 762 place count 31 transition count 50
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 765 place count 29 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 765 place count 29 transition count 48
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 767 place count 28 transition count 48
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 776 place count 19 transition count 30
Iterating global reduction 5 with 9 rules applied. Total rules applied 785 place count 19 transition count 30
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 794 place count 10 transition count 12
Iterating global reduction 5 with 9 rules applied. Total rules applied 803 place count 10 transition count 12
Applied a total of 803 rules in 11 ms. Remains 10 /1121 variables (removed 1111) and now considering 12/1077 (removed 1065) transitions.
// Phase 1: matrix 12 rows 10 cols
[2022-05-16 16:28:56] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 16:28:56] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 12 rows 10 cols
[2022-05-16 16:28:56] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 16:28:56] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-16 16:28:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 10 cols
[2022-05-16 16:28:56] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 16:28:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/1121 places, 12/1077 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/1121 places, 12/1077 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (GEQ s8 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-14 finished in 135 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((X(p0)&&X(p1))))||X((!(p2 U p3)&&p1))))'
Support contains 6 out of 1121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1121/1121 places, 1077/1077 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1076 transition count 1077
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 94 place count 1027 transition count 1027
Iterating global reduction 1 with 49 rules applied. Total rules applied 143 place count 1027 transition count 1027
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 184 place count 986 transition count 976
Iterating global reduction 1 with 41 rules applied. Total rules applied 225 place count 986 transition count 976
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 246 place count 965 transition count 937
Iterating global reduction 1 with 21 rules applied. Total rules applied 267 place count 965 transition count 937
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 288 place count 944 transition count 905
Iterating global reduction 1 with 21 rules applied. Total rules applied 309 place count 944 transition count 905
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 1 with 9 rules applied. Total rules applied 318 place count 935 transition count 905
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 338 place count 915 transition count 885
Iterating global reduction 2 with 20 rules applied. Total rules applied 358 place count 915 transition count 885
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 377 place count 896 transition count 866
Iterating global reduction 2 with 19 rules applied. Total rules applied 396 place count 896 transition count 866
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 415 place count 877 transition count 847
Iterating global reduction 2 with 19 rules applied. Total rules applied 434 place count 877 transition count 847
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 453 place count 858 transition count 828
Iterating global reduction 2 with 19 rules applied. Total rules applied 472 place count 858 transition count 828
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 491 place count 839 transition count 809
Iterating global reduction 2 with 19 rules applied. Total rules applied 510 place count 839 transition count 809
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 521 place count 828 transition count 798
Iterating global reduction 2 with 11 rules applied. Total rules applied 532 place count 828 transition count 798
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 542 place count 818 transition count 788
Iterating global reduction 2 with 10 rules applied. Total rules applied 552 place count 818 transition count 788
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 562 place count 808 transition count 778
Iterating global reduction 2 with 10 rules applied. Total rules applied 572 place count 808 transition count 778
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 582 place count 798 transition count 768
Iterating global reduction 2 with 10 rules applied. Total rules applied 592 place count 798 transition count 768
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 602 place count 788 transition count 758
Iterating global reduction 2 with 10 rules applied. Total rules applied 612 place count 788 transition count 758
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 622 place count 778 transition count 748
Iterating global reduction 2 with 10 rules applied. Total rules applied 632 place count 778 transition count 748
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 642 place count 768 transition count 738
Iterating global reduction 2 with 10 rules applied. Total rules applied 652 place count 768 transition count 738
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 662 place count 768 transition count 728
Applied a total of 662 rules in 450 ms. Remains 768 /1121 variables (removed 353) and now considering 728/1077 (removed 349) transitions.
// Phase 1: matrix 728 rows 768 cols
[2022-05-16 16:28:56] [INFO ] Computed 75 place invariants in 8 ms
[2022-05-16 16:28:56] [INFO ] Implicit Places using invariants in 189 ms returned [89, 90, 255, 256, 327, 341, 364]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 194 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 761/1121 places, 728/1077 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 758 transition count 725
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 758 transition count 725
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 756 transition count 722
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 756 transition count 722
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 754 transition count 720
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 754 transition count 720
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 752 transition count 718
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 752 transition count 718
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 751 transition count 717
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 751 transition count 717
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 750 transition count 716
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 750 transition count 716
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 749 transition count 715
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 749 transition count 715
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 748 transition count 714
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 748 transition count 714
Applied a total of 26 rules in 182 ms. Remains 748 /761 variables (removed 13) and now considering 714/728 (removed 14) transitions.
// Phase 1: matrix 714 rows 748 cols
[2022-05-16 16:28:56] [INFO ] Computed 68 place invariants in 6 ms
[2022-05-16 16:28:57] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 714 rows 748 cols
[2022-05-16 16:28:57] [INFO ] Computed 68 place invariants in 2 ms
[2022-05-16 16:28:57] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 748/1121 places, 714/1077 transitions.
Finished structural reductions, in 2 iterations. Remains : 748/1121 places, 714/1077 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) p3)), (OR (NOT p1) (AND (NOT p0) p3)), (OR (AND (NOT p1) p3) (AND (NOT p0) p3))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) p3), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p1) p3) (AND p3 (NOT p0))), acceptance={} source=3 dest: 0}, { cond=(OR (AND (NOT p1) p2 (NOT p3)) (AND p2 (NOT p3) (NOT p0))), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LT s693 1), p0:(OR (LT s228 1) (LT s263 1)), p3:(GEQ s251 1), p2:(AND (GEQ s218 1) (GEQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 693 ms.
Product exploration explored 100000 steps with 50000 reset in 703 ms.
Computed a total of 748 stabilizing places and 714 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 748 transition count 714
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 p0 (NOT p3) (NOT p2)), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (OR (NOT p1) p3))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND p2 (NOT p3) (NOT p0)))))), (X (X (NOT (OR (AND (NOT p1) p3) (AND p3 (NOT p0)))))), (F (G p1)), (F (G p0)), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (NOT p1) p3)))
Knowledge based reduction with 10 factoid took 146 ms. Reduced automaton from 4 states, 6 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15 finished in 3326 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X(!(p0 U X(p1)))&&p2)))))'
[2022-05-16 16:28:59] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin230474007042539238
[2022-05-16 16:28:59] [INFO ] Computing symmetric may disable matrix : 1077 transitions.
[2022-05-16 16:28:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:28:59] [INFO ] Computing symmetric may enable matrix : 1077 transitions.
[2022-05-16 16:28:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:28:59] [INFO ] Applying decomposition
[2022-05-16 16:28:59] [INFO ] Flatten gal took : 45 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/graph13789483301144607395.txt' '-o' '/tmp/graph13789483301144607395.bin' '-w' '/tmp/graph13789483301144607395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13789483301144607395.bin' '-l' '-1' '-v' '-w' '/tmp/graph13789483301144607395.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:28:59] [INFO ] Decomposing Gal with order
[2022-05-16 16:28:59] [INFO ] Computing Do-Not-Accords matrix : 1077 transitions.
[2022-05-16 16:28:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:28:59] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:28:59] [INFO ] Built C files in 227ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin230474007042539238
Running compilation step : cd /tmp/ltsmin230474007042539238;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
[2022-05-16 16:29:00] [INFO ] Removed a total of 193 redundant transitions.
[2022-05-16 16:29:00] [INFO ] Flatten gal took : 78 ms
[2022-05-16 16:29:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 12 ms.
[2022-05-16 16:29:00] [INFO ] Time to serialize gal into /tmp/LTLFireability8296884658739826058.gal : 13 ms
[2022-05-16 16:29:00] [INFO ] Time to serialize properties into /tmp/LTLFireability16081065160733150214.ltl : 1 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/LTLFireability8296884658739826058.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16081065160733150214.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/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((G(F(G((X(!(("((((((i26.u316.p2_9_0>=1)||(i23.u317.p2_10_0>=1))||((i25.u324.p2_7_0>=1)||(i27.i1.i0.u325.p2_8_0>=1)))||(((i16.i1.i1.u...3393
Formula 0 simplified : !GFG("(((((((i26.u316.p2_9_0<1)&&(i23.u317.p2_10_0<1))&&((i25.u324.p2_7_0<1)&&(i27.i1.i0.u325.p2_8_0<1)))&&(((i16.i1.i1.u328.p2_2_1<...3378
Compilation finished in 3104 ms.
Running link step : cd /tmp/ltsmin230474007042539238;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin230474007042539238;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]((X(!((LTLAPp0==true) U X((LTLAPp1==true))))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 16:49:35] [INFO ] Flatten gal took : 78 ms
[2022-05-16 16:49:35] [INFO ] Time to serialize gal into /tmp/LTLFireability15014954197794744295.gal : 36 ms
[2022-05-16 16:49:35] [INFO ] Time to serialize properties into /tmp/LTLFireability13820783092174397718.ltl : 1 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/LTLFireability15014954197794744295.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13820783092174397718.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/LTLFireabi...290
Read 1 LTL properties
Checking formula 0 : !((G(F(G((X(!(("((((((p2_9_0>=1)||(p2_10_0>=1))||((p2_7_0>=1)||(p2_8_0>=1)))||(((p2_2_1>=1)||(p2_3_1>=1))||((p2_0_1>=1)||(p2_1_1>=1)))...1997
Formula 0 simplified : !GFG("(((((((p2_9_0<1)&&(p2_10_0<1))&&((p2_7_0<1)&&(p2_8_0<1)))&&(((p2_2_1<1)&&(p2_3_1<1))&&((p2_0_1<1)&&(p2_1_1<1))))&&((((p2_6_1<1...1982
Detected timeout of ITS tools.
[2022-05-16 17:10:12] [INFO ] Flatten gal took : 115 ms
[2022-05-16 17:10:12] [INFO ] Input system was already deterministic with 1077 transitions.
[2022-05-16 17:10:12] [INFO ] Transformed 1121 places.
[2022-05-16 17:10:12] [INFO ] Transformed 1077 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 17:10:12] [INFO ] Time to serialize gal into /tmp/LTLFireability5618679156854450322.gal : 12 ms
[2022-05-16 17:10:12] [INFO ] Time to serialize properties into /tmp/LTLFireability17008449754184012025.ltl : 1 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/LTLFireability5618679156854450322.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17008449754184012025.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(G((X(!(("((((((p2_9_0>=1)||(p2_10_0>=1))||((p2_7_0>=1)||(p2_8_0>=1)))||(((p2_2_1>=1)||(p2_3_1>=1))||((p2_0_1>=1)||(p2_1_1>=1)))...1997
Formula 0 simplified : !GFG("(((((((p2_9_0<1)&&(p2_10_0<1))&&((p2_7_0<1)&&(p2_8_0<1)))&&(((p2_2_1<1)&&(p2_3_1<1))&&((p2_0_1<1)&&(p2_1_1<1))))&&((((p2_6_1<1...1982

BK_TIME_CONFINEMENT_REACHED

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="FamilyReunion-PT-L00010M0001C001P001G001"
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 FamilyReunion-PT-L00010M0001C001P001G001, 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 r078-tall-165260110700716"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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