Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 22 18:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 18:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 24 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 134K May 5 16:51 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-COL-L00010M0001C001P001G001-00
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-01
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-02
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-03
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-04
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-05
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-06
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-07
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-08
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-09
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-10
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-11
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-12
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-13
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-14
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-15

=== Now, execution of the tool begins

BK_START 1620675178541

Running Version 0
[2021-05-10 19:33:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-10 19:33:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 19:33:00] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-10 19:33:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-10 19:33:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 628 ms
[2021-05-10 19:33:00] [INFO ] Detected 5 constant HL places corresponding to 10 PT places.
[2021-05-10 19:33:00] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 1486 PT places and 1245.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 19:33:00] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions in 4 ms.
[2021-05-10 19:33:00] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_6887083408832966617.dot
Reduce places removed 5 places and 0 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-05-10 19:33:00] [INFO ] Flatten gal took : 27 ms
[2021-05-10 19:33:00] [INFO ] Flatten gal took : 8 ms
[2021-05-10 19:33:01] [INFO ] Unfolded HLPN to a Petri net with 1486 places and 1234 transitions in 22 ms.
[2021-05-10 19:33:01] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_15199200246037822303.dot
[2021-05-10 19:33:01] [INFO ] Reduced 11 identical enabling conditions.
[2021-05-10 19:33:01] [INFO ] Reduced 22 identical enabling conditions.
[2021-05-10 19:33:01] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 11 places in 15 ms
Reduce places removed 21 places and 0 transitions.
Support contains 629 out of 1465 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1465/1465 places, 1234/1234 transitions.
Reduce places removed 45 places and 0 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 1376 transition count 1234
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 145 place count 1320 transition count 1178
Iterating global reduction 1 with 56 rules applied. Total rules applied 201 place count 1320 transition count 1178
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 212 place count 1309 transition count 1178
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 234 place count 1287 transition count 1156
Iterating global reduction 2 with 22 rules applied. Total rules applied 256 place count 1287 transition count 1156
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 22 rules applied. Total rules applied 278 place count 1276 transition count 1145
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 289 place count 1265 transition count 1134
Iterating global reduction 3 with 11 rules applied. Total rules applied 300 place count 1265 transition count 1134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 301 place count 1264 transition count 1123
Iterating global reduction 3 with 1 rules applied. Total rules applied 302 place count 1264 transition count 1123
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 313 place count 1253 transition count 1123
Applied a total of 313 rules in 280 ms. Remains 1253 /1465 variables (removed 212) and now considering 1123/1234 (removed 111) transitions.
// Phase 1: matrix 1123 rows 1253 cols
[2021-05-10 19:33:01] [INFO ] Computed 225 place invariants in 52 ms
[2021-05-10 19:33:01] [INFO ] Implicit Places using invariants in 463 ms returned [409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 788, 910, 911, 912, 913, 914, 915, 916, 917, 918, 919, 920]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 491 ms to find 23 implicit places.
// Phase 1: matrix 1123 rows 1230 cols
[2021-05-10 19:33:01] [INFO ] Computed 202 place invariants in 26 ms
[2021-05-10 19:33:02] [INFO ] Dead Transitions using invariants and state equation in 581 ms returned []
Starting structural reductions, iteration 1 : 1230/1465 places, 1123/1234 transitions.
Applied a total of 0 rules in 24 ms. Remains 1230 /1230 variables (removed 0) and now considering 1123/1123 (removed 0) transitions.
// Phase 1: matrix 1123 rows 1230 cols
[2021-05-10 19:33:02] [INFO ] Computed 202 place invariants in 31 ms
[2021-05-10 19:33:03] [INFO ] Dead Transitions using invariants and state equation in 550 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1230/1465 places, 1123/1234 transitions.
[2021-05-10 19:33:03] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2021-05-10 19:33:03] [INFO ] Flatten gal took : 74 ms
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 19:33:03] [INFO ] Flatten gal took : 61 ms
[2021-05-10 19:33:03] [INFO ] Input system was already deterministic with 1123 transitions.
Finished random walk after 613 steps, including 0 resets, run visited all 19 properties in 25 ms. (steps per millisecond=24 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 35 out of 1230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1230/1230 places, 1123/1123 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 88 places :
Implicit places reduction removed 88 places
Drop transitions removed 550 transitions
Trivial Post-agglo rules discarded 550 transitions
Performed 550 trivial Post agglomeration. Transition count delta: 550
Iterating post reduction 0 with 638 rules applied. Total rules applied 638 place count 1141 transition count 572
Reduce places removed 550 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 572 rules applied. Total rules applied 1210 place count 591 transition count 550
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1232 place count 569 transition count 550
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 1232 place count 569 transition count 440
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 3 with 275 rules applied. Total rules applied 1507 place count 404 transition count 440
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 33 rules applied. Total rules applied 1540 place count 404 transition count 407
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 1573 place count 371 transition count 407
Discarding 44 places :
Symmetric choice reduction at 5 with 44 rule applications. Total rules 1617 place count 327 transition count 352
Iterating global reduction 5 with 44 rules applied. Total rules applied 1661 place count 327 transition count 352
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 5 with 63 rules applied. Total rules applied 1724 place count 317 transition count 299
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 1766 place count 275 transition count 299
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1766 place count 275 transition count 287
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 25 rules applied. Total rules applied 1791 place count 262 transition count 287
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1793 place count 260 transition count 265
Iterating global reduction 7 with 2 rules applied. Total rules applied 1795 place count 260 transition count 265
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 22 rules applied. Total rules applied 1817 place count 249 transition count 254
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1828 place count 238 transition count 254
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 1828 place count 238 transition count 243
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1850 place count 227 transition count 243
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 1861 place count 216 transition count 232
Iterating global reduction 9 with 11 rules applied. Total rules applied 1872 place count 216 transition count 232
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 1883 place count 216 transition count 221
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 10 with 101 rules applied. Total rules applied 1984 place count 160 transition count 176
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 1995 place count 149 transition count 165
Iterating global reduction 10 with 11 rules applied. Total rules applied 2006 place count 149 transition count 165
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 2017 place count 149 transition count 154
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 11 with 22 rules applied. Total rules applied 2039 place count 138 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2040 place count 137 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2041 place count 136 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2042 place count 135 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2043 place count 134 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2044 place count 133 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2045 place count 132 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2046 place count 131 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2047 place count 130 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2048 place count 129 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2049 place count 128 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2050 place count 127 transition count 132
Applied a total of 2050 rules in 155 ms. Remains 127 /1230 variables (removed 1103) and now considering 132/1123 (removed 991) transitions.
// Phase 1: matrix 132 rows 127 cols
[2021-05-10 19:33:03] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-10 19:33:03] [INFO ] Implicit Places using invariants in 77 ms returned [35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 126]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 78 ms to find 24 implicit places.
[2021-05-10 19:33:03] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 132 rows 103 cols
[2021-05-10 19:33:03] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 19:33:03] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Starting structural reductions, iteration 1 : 103/1230 places, 132/1123 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 103 transition count 121
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 92 transition count 121
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 82 transition count 111
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 82 transition count 111
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 2 with 2 rules applied. Total rules applied 44 place count 81 transition count 110
Applied a total of 44 rules in 7 ms. Remains 81 /103 variables (removed 22) and now considering 110/132 (removed 22) transitions.
// Phase 1: matrix 110 rows 81 cols
[2021-05-10 19:33:03] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 19:33:03] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 110 rows 81 cols
[2021-05-10 19:33:03] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-10 19:33:03] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 81/1230 places, 110/1123 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s57 1) (GEQ s68 1)) (AND (GEQ s57 1) (GEQ s69 1)) (AND (GEQ s62 1) (GEQ s68 1)) (AND (GEQ s62 1) (GEQ s69 1)) (AND (GEQ s59 1) (GEQ s68 1)) (AND (GEQ s59 1) (GEQ s69 1)) (AND (GEQ s65 1) (GEQ s69 1)) (AND (GEQ s61 1) (GEQ s68 1)) (AND (GEQ s67 1) (GEQ s68 1)) (AND (GEQ s67 1) (GEQ s69 1)) (AND (GEQ s65 1) (GEQ s68 1)) (AND (GEQ s63 1) (GEQ s68 1)) (AND (GEQ s63 1) (GEQ s69 1)) (AND (GEQ s61 1) (GEQ s69 1)) (AND (GEQ s58 1) (GEQ s68 1)) (AND (GEQ s58 1) (GEQ s69 1)) (AND (GEQ s60 1) (GEQ s68 1)) (AND (GEQ s60 1) (GEQ s69 1)) (AND (GEQ s64 1) (GEQ s68 1)) (AND (GEQ s64 1) (GEQ s69 1)) (AND (GEQ s66 1) (GEQ s68 1)) (AND (GEQ s66 1) (GEQ s69 1))), p1:(OR (GEQ s44 1) (GEQ s43 1) (GEQ s42 1) (GEQ s41 1) (GEQ s40 1) (GEQ s39 1) (GEQ s38 1) (GEQ s37 1) (GEQ s52 1) (GEQ s51 1) (GEQ s50 1) (GEQ s49 1) (GEQ s48 1) (GEQ s47 1) (GEQ s46 1) (GEQ s45 1) (GEQ s56 1) (GEQ s55 1) (GEQ s54 1) (GEQ s53 1) (GEQ s36 1) (GEQ s35 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][true, true]]
Product exploration explored 100000 steps with 4822 reset in 456 ms.
Product exploration explored 100000 steps with 4817 reset in 384 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 81 transition count 110
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 : [(F (G (NOT p0))), (F (G (NOT p1))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4827 reset in 349 ms.
Product exploration explored 100000 steps with 4825 reset in 377 ms.
[2021-05-10 19:33:05] [INFO ] Flatten gal took : 5 ms
[2021-05-10 19:33:05] [INFO ] Flatten gal took : 5 ms
[2021-05-10 19:33:05] [INFO ] Time to serialize gal into /tmp/LTL17713748657685617052.gal : 1 ms
[2021-05-10 19:33:05] [INFO ] Time to serialize properties into /tmp/LTL8457458795257874094.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17713748657685617052.gal, -t, CGAL, -LTL, /tmp/LTL8457458795257874094.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17713748657685617052.gal -t CGAL -LTL /tmp/LTL8457458795257874094.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((((((((((((((cg0_0>=1)&&(g0_0>=1))||((cg0_0>=1)&&(g0_1>=1)))||((cg0_5>=1)&&(g0_0>=1)))||((cg0_5>=1)&&(g0_1>=1)))||((cg0_2>=1)&&(g0_0>=1)))||((cg0_2>=1)&&(g0_1>=1)))||((cg0_8>=1)&&(g0_1>=1)))||((cg0_4>=1)&&(g0_0>=1)))||((cg0_10>=1)&&(g0_0>=1)))||((cg0_10>=1)&&(g0_1>=1)))||((cg0_8>=1)&&(g0_0>=1)))||((cg0_6>=1)&&(g0_0>=1)))||((cg0_6>=1)&&(g0_1>=1)))||((cg0_4>=1)&&(g0_1>=1)))||((cg0_1>=1)&&(g0_0>=1)))||((cg0_1>=1)&&(g0_1>=1)))||((cg0_3>=1)&&(g0_0>=1)))||((cg0_3>=1)&&(g0_1>=1)))||((cg0_7>=1)&&(g0_0>=1)))||((cg0_7>=1)&&(g0_1>=1)))||((cg0_9>=1)&&(g0_0>=1)))||((cg0_9>=1)&&(g0_1>=1)))"))||(G("((((((((((((((((((((((c6_9>=1)||(c6_8>=1))||(c6_7>=1))||(c6_6>=1))||(c6_5>=1))||(c6_4>=1))||(c6_3>=1))||(c6_2>=1))||(c6_17>=1))||(c6_16>=1))||(c6_15>=1))||(c6_14>=1))||(c6_13>=1))||(c6_12>=1))||(c6_11>=1))||(c6_10>=1))||(c6_21>=1))||(c6_20>=1))||(c6_19>=1))||(c6_18>=1))||(c6_1>=1))||(c6_0>=1))"))))
Formula 0 simplified : !(F"(((((((((((((((((((((((cg0_0>=1)&&(g0_0>=1))||((cg0_0>=1)&&(g0_1>=1)))||((cg0_5>=1)&&(g0_0>=1)))||((cg0_5>=1)&&(g0_1>=1)))||((cg0_2>=1)&&(g0_0>=1)))||((cg0_2>=1)&&(g0_1>=1)))||((cg0_8>=1)&&(g0_1>=1)))||((cg0_4>=1)&&(g0_0>=1)))||((cg0_10>=1)&&(g0_0>=1)))||((cg0_10>=1)&&(g0_1>=1)))||((cg0_8>=1)&&(g0_0>=1)))||((cg0_6>=1)&&(g0_0>=1)))||((cg0_6>=1)&&(g0_1>=1)))||((cg0_4>=1)&&(g0_1>=1)))||((cg0_1>=1)&&(g0_0>=1)))||((cg0_1>=1)&&(g0_1>=1)))||((cg0_3>=1)&&(g0_0>=1)))||((cg0_3>=1)&&(g0_1>=1)))||((cg0_7>=1)&&(g0_0>=1)))||((cg0_7>=1)&&(g0_1>=1)))||((cg0_9>=1)&&(g0_0>=1)))||((cg0_9>=1)&&(g0_1>=1)))" | G"((((((((((((((((((((((c6_9>=1)||(c6_8>=1))||(c6_7>=1))||(c6_6>=1))||(c6_5>=1))||(c6_4>=1))||(c6_3>=1))||(c6_2>=1))||(c6_17>=1))||(c6_16>=1))||(c6_15>=1))||(c6_14>=1))||(c6_13>=1))||(c6_12>=1))||(c6_11>=1))||(c6_10>=1))||(c6_21>=1))||(c6_20>=1))||(c6_19>=1))||(c6_18>=1))||(c6_1>=1))||(c6_0>=1))")
Reverse transition relation is NOT exact ! Due to transitions t440.t462.t286.t506.t561.t616.t682.t715.t738, t451.t473.t286.t506.t561.t616.t682.t715.t738, t441.t463.t287.t507.t561.t616.t682.t715.t738, t452.t474.t287.t507.t561.t616.t682.t715.t738, t442.t464.t288.t508.t561.t616.t682.t715.t738, t453.t475.t288.t508.t561.t616.t682.t715.t738, t443.t465.t289.t509.t561.t616.t682.t715.t738, t454.t476.t289.t509.t561.t616.t682.t715.t738, t444.t466.t290.t510.t561.t616.t682.t715.t738, t455.t477.t290.t510.t561.t616.t682.t715.t738, t445.t467.t291.t511.t561.t616.t682.t715.t738, t456.t478.t291.t511.t561.t616.t682.t715.t738, t446.t468.t292.t512.t561.t616.t682.t715.t738, t457.t479.t292.t512.t561.t616.t682.t715.t738, t447.t469.t293.t513.t561.t616.t682.t715.t738, t458.t480.t293.t513.t561.t616.t682.t715.t738, t448.t470.t294.t514.t561.t616.t682.t715.t738, t459.t481.t294.t514.t561.t616.t682.t715.t738, t449.t471.t295.t515.t561.t616.t682.t715.t738, t460.t482.t295.t515.t561.t616.t682.t715.t738, t450.t472.t296.t516.t561.t616.t682.t715.t738, t461.t483.t296.t516.t561.t616.t682.t715.t738, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/88/22/110
Computing Next relation with stutter on 55 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
674 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.75274,199192,1,0,327,1.01876e+06,255,203,2589,1.02548e+06,565
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-01 finished in 10363 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((((p0 U G(p1)) U p2) U p0)||X(p2)))], workingDir=/home/mcc/execution]
Support contains 99 out of 1230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1230/1230 places, 1123/1123 transitions.
Discarding 88 places :
Implicit places reduction removed 88 places
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 1142 transition count 1123
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 143 place count 1087 transition count 1057
Iterating global reduction 1 with 55 rules applied. Total rules applied 198 place count 1087 transition count 1057
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 220 place count 1065 transition count 1025
Iterating global reduction 1 with 22 rules applied. Total rules applied 242 place count 1065 transition count 1025
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 264 place count 1043 transition count 1003
Iterating global reduction 1 with 22 rules applied. Total rules applied 286 place count 1043 transition count 1003
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 298 place count 1031 transition count 981
Iterating global reduction 1 with 12 rules applied. Total rules applied 310 place count 1031 transition count 981
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 321 place count 1020 transition count 970
Iterating global reduction 1 with 11 rules applied. Total rules applied 332 place count 1020 transition count 970
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 343 place count 1009 transition count 959
Iterating global reduction 1 with 11 rules applied. Total rules applied 354 place count 1009 transition count 959
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 365 place count 998 transition count 948
Iterating global reduction 1 with 11 rules applied. Total rules applied 376 place count 998 transition count 948
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 387 place count 987 transition count 937
Iterating global reduction 1 with 11 rules applied. Total rules applied 398 place count 987 transition count 937
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 409 place count 976 transition count 926
Iterating global reduction 1 with 11 rules applied. Total rules applied 420 place count 976 transition count 926
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 431 place count 965 transition count 915
Iterating global reduction 1 with 11 rules applied. Total rules applied 442 place count 965 transition count 915
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 453 place count 954 transition count 904
Iterating global reduction 1 with 11 rules applied. Total rules applied 464 place count 954 transition count 904
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 475 place count 943 transition count 893
Iterating global reduction 1 with 11 rules applied. Total rules applied 486 place count 943 transition count 893
Applied a total of 486 rules in 556 ms. Remains 943 /1230 variables (removed 287) and now considering 893/1123 (removed 230) transitions.
// Phase 1: matrix 893 rows 943 cols
[2021-05-10 19:33:14] [INFO ] Computed 114 place invariants in 7 ms
[2021-05-10 19:33:14] [INFO ] Implicit Places using invariants in 204 ms returned [66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 410, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 206 ms to find 23 implicit places.
// Phase 1: matrix 893 rows 920 cols
[2021-05-10 19:33:14] [INFO ] Computed 91 place invariants in 5 ms
[2021-05-10 19:33:14] [INFO ] Dead Transitions using invariants and state equation in 395 ms returned []
Starting structural reductions, iteration 1 : 920/1230 places, 893/1123 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 899 transition count 872
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 899 transition count 872
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 889 transition count 852
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 889 transition count 852
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 879 transition count 842
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 879 transition count 842
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 869 transition count 832
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 869 transition count 832
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 859 transition count 822
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 859 transition count 822
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 849 transition count 812
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 849 transition count 812
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 839 transition count 802
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 839 transition count 802
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 829 transition count 792
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 829 transition count 792
Applied a total of 182 rules in 211 ms. Remains 829 /920 variables (removed 91) and now considering 792/893 (removed 101) transitions.
// Phase 1: matrix 792 rows 829 cols
[2021-05-10 19:33:15] [INFO ] Computed 91 place invariants in 5 ms
[2021-05-10 19:33:15] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 792 rows 829 cols
[2021-05-10 19:33:15] [INFO ] Computed 91 place invariants in 5 ms
[2021-05-10 19:33:15] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 829/1230 places, 792/1123 transitions.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-03 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=2 dest: 3}, { cond=(NOT p1), acceptance={0} source=2 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 7}, { cond=(AND p0 p2 p1), acceptance={0} source=2 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 6}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 8}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 7}, { cond=(AND p2 p1), acceptance={0} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 6}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(OR (AND (GEQ s698 1) (GEQ s711 1)) (AND (GEQ s698 1) (GEQ s710 1)) (AND (GEQ s701 1) (GEQ s716 1)) (AND (GEQ s703 1) (GEQ s720 1)) (AND (GEQ s701 1) (GEQ s717 1)) (AND (GEQ s697 1) (GEQ s708 1)) (AND (GEQ s704 1) (GEQ s722 1)) (AND (GEQ s697 1) (GEQ s709 1)) (AND (GEQ s704 1) (GEQ s723 1)) (AND (GEQ s706 1) (GEQ s726 1)) (AND (GEQ s706 1) (GEQ s727 1)) (AND (GEQ s702 1) (GEQ s718 1)) (AND (GEQ s705 1) (GEQ s725 1)) (AND (GEQ s702 1) (GEQ s719 1)) (AND (GEQ s699 1) (GEQ s712 1)) (AND (GEQ s705 1) (GEQ s724 1)) (AND (GEQ s699 1) (GEQ s713 1)) (AND (GEQ s700 1) (GEQ s715 1)) (AND (GEQ s700 1) (GEQ s714 1)) (AND (GEQ s707 1) (GEQ s728 1)) (AND (GEQ s703 1) (GEQ s721 1)) (AND (GEQ s707 1) (GEQ s729 1))), p2:(OR (AND (GEQ s229 1) (GEQ s264 1)) (AND (GEQ s219 1) (GEQ s259 1)) (AND (GEQ s224 1) (GEQ s261 1)) (AND (GEQ s226 1) (GEQ s262 1)) (AND (GEQ s232 1) (GEQ s265 1)) (AND (GEQ s231 1) (GEQ s265 1)) (AND (GEQ s222 1) (GEQ s260 1)) (AND (GEQ s218 1) (GEQ s258 1)) (AND (GEQ s214 1) (GEQ s256 1)) (AND (GEQ s216 1) (GEQ s257 1)) (AND (GEQ s212 1) (GEQ s255 1)) (AND (GEQ s215 1) (GEQ s257 1)) (AND (GEQ s225 1) (GEQ s262 1)) (AND (GEQ s220 1) (GEQ s259 1)) (AND (GEQ s223 1) (GEQ s261 1)) (AND (GEQ s228 1) (GEQ s263 1)) (AND (GEQ s230 1) (GEQ s264 1)) (AND (GEQ s217 1) (GEQ s258 1)) (AND (GEQ s227 1) (GEQ s263 1)) (AND (GEQ s221 1) (GEQ s260 1)) (AND (GEQ s213 1) (GEQ s256 1)) (AND (GEQ s211 1) (GEQ s255 1))), p1:(OR (AND (GEQ s82 1) (GEQ s101 1)) (AND (GEQ s87 1) (GEQ s104 1)) (AND (GEQ s85 1) (GEQ s103 1)) (AND (GEQ s80 1) (GEQ s100 1)) (AND (GEQ s77 1) (GEQ s99 1)) (AND (GEQ s79 1) (GEQ s100 1)) (AND (GEQ s93 1) (GEQ s107 1)) (AND (GEQ s83 1) (GEQ s102 1)) (AND (GEQ s89 1) (GEQ s105 1)) (AND (GEQ s95 1) (GEQ s108 1)) (AND (GEQ s97 1) (GEQ s109 1)) (AND (GEQ s81 1) (GEQ s101 1)) (AND (GEQ s91 1) (GEQ s106 1)) (AND (GEQ s86 1) (GEQ s103 1)) (AND (GEQ s78 1) (GEQ s99 1)) (AND (GEQ s98 1) (GEQ s109 1)) (AND (GEQ s88 1) (GEQ s104 1)) (AND (GEQ s84 1) (GEQ s102 1)) (AND (GEQ s92 1) (GEQ s106 1)) (AND (GEQ s90 1) (GEQ s105 1)) (AND (GEQ s94 1) (GEQ s107 1)) (AND (GEQ s96 1) (GEQ s108 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-03 finished in 2324 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 33 out of 1230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1230/1230 places, 1123/1123 transitions.
Discarding 88 places :
Implicit places reduction removed 88 places
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 1142 transition count 1123
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 143 place count 1087 transition count 1057
Iterating global reduction 1 with 55 rules applied. Total rules applied 198 place count 1087 transition count 1057
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 232 place count 1053 transition count 1003
Iterating global reduction 1 with 34 rules applied. Total rules applied 266 place count 1053 transition count 1003
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 277 place count 1042 transition count 1003
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 311 place count 1008 transition count 959
Iterating global reduction 2 with 34 rules applied. Total rules applied 345 place count 1008 transition count 959
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 368 place count 985 transition count 926
Iterating global reduction 2 with 23 rules applied. Total rules applied 391 place count 985 transition count 926
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 402 place count 974 transition count 915
Iterating global reduction 2 with 11 rules applied. Total rules applied 413 place count 974 transition count 915
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 424 place count 963 transition count 904
Iterating global reduction 2 with 11 rules applied. Total rules applied 435 place count 963 transition count 904
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 446 place count 952 transition count 893
Iterating global reduction 2 with 11 rules applied. Total rules applied 457 place count 952 transition count 893
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 468 place count 941 transition count 882
Iterating global reduction 2 with 11 rules applied. Total rules applied 479 place count 941 transition count 882
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 490 place count 930 transition count 871
Iterating global reduction 2 with 11 rules applied. Total rules applied 501 place count 930 transition count 871
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 512 place count 919 transition count 860
Iterating global reduction 2 with 11 rules applied. Total rules applied 523 place count 919 transition count 860
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 534 place count 908 transition count 849
Iterating global reduction 2 with 11 rules applied. Total rules applied 545 place count 908 transition count 849
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 556 place count 897 transition count 838
Iterating global reduction 2 with 11 rules applied. Total rules applied 567 place count 897 transition count 838
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 578 place count 886 transition count 827
Iterating global reduction 2 with 11 rules applied. Total rules applied 589 place count 886 transition count 827
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 600 place count 875 transition count 816
Iterating global reduction 2 with 11 rules applied. Total rules applied 611 place count 875 transition count 816
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 22 rules applied. Total rules applied 633 place count 864 transition count 805
Applied a total of 633 rules in 484 ms. Remains 864 /1230 variables (removed 366) and now considering 805/1123 (removed 318) transitions.
// Phase 1: matrix 805 rows 864 cols
[2021-05-10 19:33:16] [INFO ] Computed 92 place invariants in 5 ms
[2021-05-10 19:33:16] [INFO ] Implicit Places using invariants in 278 ms returned [176, 376, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 731]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 280 ms to find 14 implicit places.
// Phase 1: matrix 805 rows 850 cols
[2021-05-10 19:33:16] [INFO ] Computed 78 place invariants in 4 ms
[2021-05-10 19:33:17] [INFO ] Dead Transitions using invariants and state equation in 359 ms returned []
Starting structural reductions, iteration 1 : 850/1230 places, 805/1123 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 829 transition count 784
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 829 transition count 784
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 819 transition count 764
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 819 transition count 764
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 809 transition count 754
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 809 transition count 754
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 799 transition count 744
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 799 transition count 744
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 789 transition count 734
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 789 transition count 734
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 779 transition count 724
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 779 transition count 724
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 769 transition count 714
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 769 transition count 714
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 759 transition count 704
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 759 transition count 704
Applied a total of 182 rules in 189 ms. Remains 759 /850 variables (removed 91) and now considering 704/805 (removed 101) transitions.
// Phase 1: matrix 704 rows 759 cols
[2021-05-10 19:33:17] [INFO ] Computed 78 place invariants in 3 ms
[2021-05-10 19:33:17] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 704 rows 759 cols
[2021-05-10 19:33:17] [INFO ] Computed 78 place invariants in 6 ms
[2021-05-10 19:33:18] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 759/1230 places, 704/1123 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (LT s60 1) (LT s131 1)) (OR (LT s57 1) (LT s125 1)) (OR (LT s60 1) (LT s132 1)) (OR (LT s63 1) (LT s138 1)) (OR (LT s63 1) (LT s137 1)) (OR (LT s57 1) (LT s126 1)) (OR (LT s65 1) (LT s141 1)) (OR (LT s61 1) (LT s134 1)) (OR (LT s65 1) (LT s142 1)) (OR (LT s56 1) (LT s123 1)) (OR (LT s59 1) (LT s130 1)) (OR (LT s61 1) (LT s133 1)) (OR (LT s56 1) (LT s124 1)) (OR (LT s58 1) (LT s127 1)) (OR (LT s59 1) (LT s129 1)) (OR (LT s58 1) (LT s128 1)) (OR (LT s55 1) (LT s122 1)) (OR (LT s62 1) (LT s135 1)) (OR (LT s55 1) (LT s121 1)) (OR (LT s62 1) (LT s136 1)) (OR (LT s64 1) (LT s140 1)) (OR (LT s64 1) (LT s139 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 469 steps with 0 reset in 3 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-04 finished in 1984 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0) U (G(F(p2))||p1))))], workingDir=/home/mcc/execution]
Support contains 77 out of 1230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1230/1230 places, 1123/1123 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions removed 473 transitions
Trivial Post-agglo rules discarded 473 transitions
Performed 473 trivial Post agglomeration. Transition count delta: 473
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 1163 transition count 649
Reduce places removed 473 places and 0 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 1 with 506 rules applied. Total rules applied 1045 place count 690 transition count 616
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 1078 place count 657 transition count 616
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 1078 place count 657 transition count 506
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 3 with 275 rules applied. Total rules applied 1353 place count 492 transition count 506
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 33 rules applied. Total rules applied 1386 place count 492 transition count 473
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 1419 place count 459 transition count 473
Discarding 44 places :
Symmetric choice reduction at 5 with 44 rule applications. Total rules 1463 place count 415 transition count 418
Iterating global reduction 5 with 44 rules applied. Total rules applied 1507 place count 415 transition count 418
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 5 with 22 rules applied. Total rules applied 1529 place count 415 transition count 396
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 1551 place count 393 transition count 396
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1551 place count 393 transition count 385
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 1573 place count 382 transition count 385
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1576 place count 379 transition count 352
Iterating global reduction 7 with 3 rules applied. Total rules applied 1579 place count 379 transition count 352
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 7 with 55 rules applied. Total rules applied 1634 place count 357 transition count 319
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 1656 place count 335 transition count 319
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 1656 place count 335 transition count 308
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1678 place count 324 transition count 308
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 1690 place count 312 transition count 286
Iterating global reduction 9 with 12 rules applied. Total rules applied 1702 place count 312 transition count 286
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 9 with 22 rules applied. Total rules applied 1724 place count 312 transition count 264
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1735 place count 301 transition count 264
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 11 with 90 rules applied. Total rules applied 1825 place count 256 transition count 219
Discarding 11 places :
Symmetric choice reduction at 11 with 11 rule applications. Total rules 1836 place count 245 transition count 208
Iterating global reduction 11 with 11 rules applied. Total rules applied 1847 place count 245 transition count 208
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 1858 place count 245 transition count 197
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1859 place count 244 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1860 place count 243 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1861 place count 242 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1862 place count 241 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1863 place count 240 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1864 place count 239 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1865 place count 238 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1866 place count 237 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1867 place count 236 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1868 place count 235 transition count 187
Applied a total of 1868 rules in 101 ms. Remains 235 /1230 variables (removed 995) and now considering 187/1123 (removed 936) transitions.
// Phase 1: matrix 187 rows 235 cols
[2021-05-10 19:33:18] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-10 19:33:18] [INFO ] Implicit Places using invariants in 109 ms returned [66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 154, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 234]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 111 ms to find 36 implicit places.
[2021-05-10 19:33:18] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 187 rows 199 cols
[2021-05-10 19:33:18] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-10 19:33:18] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Starting structural reductions, iteration 1 : 199/1230 places, 187/1123 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 199 transition count 154
Reduce places removed 33 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 44 rules applied. Total rules applied 77 place count 166 transition count 143
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 88 place count 155 transition count 143
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 88 place count 155 transition count 121
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 132 place count 133 transition count 121
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 142 place count 123 transition count 111
Iterating global reduction 3 with 10 rules applied. Total rules applied 152 place count 123 transition count 111
Applied a total of 152 rules in 6 ms. Remains 123 /199 variables (removed 76) and now considering 111/187 (removed 76) transitions.
// Phase 1: matrix 111 rows 123 cols
[2021-05-10 19:33:18] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-10 19:33:18] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 111 rows 123 cols
[2021-05-10 19:33:18] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-10 19:33:18] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 123/1230 places, 111/1123 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-05 automaton TGBA [mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s68 1) (GEQ s90 1)) (AND (GEQ s76 1) (GEQ s98 1)) (AND (GEQ s84 1) (GEQ s106 1)) (AND (GEQ s70 1) (GEQ s92 1)) (AND (GEQ s74 1) (GEQ s96 1)) (AND (GEQ s78 1) (GEQ s100 1)) (AND (GEQ s82 1) (GEQ s104 1)) (AND (GEQ s86 1) (GEQ s108 1)) (AND (GEQ s66 1) (GEQ s88 1)) (AND (GEQ s72 1) (GEQ s94 1)) (AND (GEQ s80 1) (GEQ s102 1)) (AND (GEQ s87 1) (GEQ s109 1)) (AND (GEQ s67 1) (GEQ s89 1)) (AND (GEQ s69 1) (GEQ s91 1)) (AND (GEQ s71 1) (GEQ s93 1)) (AND (GEQ s73 1) (GEQ s95 1)) (AND (GEQ s75 1) (GEQ s97 1)) (AND (GEQ s77 1) (GEQ s99 1)) (AND (GEQ s79 1) (GEQ s101 1)) (AND (GEQ s81 1) (GEQ s103 1)) (AND (GEQ s83 1) (GEQ s105 1)) (AND (GEQ s85 1) (GEQ s107 1))), p0:(OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1) (GEQ s20 1) (GEQ s21 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s15 1)), p2:(OR (AND (OR (AND (GEQ s68 1) (GEQ s90 1)) (AND (GEQ s76 1) (GEQ s98 1)) (AND (GEQ s84 1) (GEQ s106 1)) (AND (GEQ s70 1) (GEQ s92 1)) (AND (GEQ s74 1) (GEQ s96 1)) (AND (GEQ s78 1) (GEQ s100 1)) (AND (GEQ s82 1) (GEQ s104 1)) (AND (GEQ s86 1) (GEQ s108 1)) (AND (GEQ s66 1) (GEQ s88 1)) (AND (GEQ s72 1) (GEQ s94 1)) (AND (GEQ s80 1) (GEQ s102 1)) (AND (GEQ s87 1) (GEQ s109 1)) (AND (GEQ s67 1) (GEQ s89 1)) (AND (GEQ s69 1) (GEQ s91 1)) (AND (GEQ s71 1) (GEQ s93 1)) (AND (GEQ s73 1) (GEQ s95 1)) (AND (GEQ s75 1) (GEQ s97 1)) (AND (GEQ s77 1) (GEQ s99 1)) (AND (GEQ s79 1) (GEQ s101 1)) (AND (GEQ s81 1) (GEQ s103 1)) (AND (GEQ s83 1) (GEQ s105 1)) (AND (GEQ s85 1) (GEQ s107 1))) (OR (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GEQ s23 1) (GEQ s22 1) (GEQ s25 1) (GEQ s24 1) (GEQ s27 1) (GEQ s26 1) (GEQ s29 1) (GEQ s28 1) (GEQ s31 1) (GEQ s30 1) (GEQ s33 1) (GEQ s32 1) (GEQ s35 1) (GEQ s34 1) (GEQ s37 1) (GEQ s36 1) (GEQ s39 1) (GEQ s38 1))) (AND (GEQ s68 1) (GEQ s90 1)) (AND (GEQ s76 1) (GEQ s98 1)) (AND (GEQ s84 1) (GEQ s106 1)) (AND (GEQ s70 1) (GEQ s92 1)) (AND (GEQ s74 1) (GEQ s96 1)) (AND (GEQ s78 1) (GEQ s100 1)) (AND (GEQ s82 1) (GEQ s104 1)) (AND (GEQ s86 1) (GEQ s108 1)) (AND (GEQ s66 1) (GEQ s88 1)) (AND (GEQ s72 1) (GEQ s94 1)) (AND (GEQ s80 1) (GEQ s102 1)) (AND (GEQ s87 1) (GEQ s109 1)) (AND (GEQ s67 1) (GEQ s89 1)) (AND (GEQ s69 1) (GEQ s91 1)) (AND (GEQ s71 1) (GEQ s93 1)) (AND (GEQ s73 1) (GEQ s95 1)) (AND (GEQ s75 1) (GEQ s97 1)) (AND (GEQ s77 1) (GEQ s99 1)) (AND (GEQ s79 1) (GEQ s101 1)) (AND (GEQ s81 1) (GEQ s103 1)) (AND (GEQ s83 1) (GEQ s105 1)) (AND (GEQ s85 1) (GEQ s107 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 29596 steps with 2205 reset in 145 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-05 finished in 716 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 11 out of 1230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1230/1230 places, 1123/1123 transitions.
Discarding 88 places :
Implicit places reduction removed 88 places
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 1142 transition count 1123
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 154 place count 1076 transition count 1046
Iterating global reduction 1 with 66 rules applied. Total rules applied 220 place count 1076 transition count 1046
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 254 place count 1042 transition count 992
Iterating global reduction 1 with 34 rules applied. Total rules applied 288 place count 1042 transition count 992
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 299 place count 1031 transition count 992
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 333 place count 997 transition count 948
Iterating global reduction 2 with 34 rules applied. Total rules applied 367 place count 997 transition count 948
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 401 place count 963 transition count 904
Iterating global reduction 2 with 34 rules applied. Total rules applied 435 place count 963 transition count 904
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 22 rules applied. Total rules applied 457 place count 952 transition count 893
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 468 place count 941 transition count 882
Iterating global reduction 3 with 11 rules applied. Total rules applied 479 place count 941 transition count 882
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 490 place count 930 transition count 871
Iterating global reduction 3 with 11 rules applied. Total rules applied 501 place count 930 transition count 871
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 512 place count 919 transition count 860
Iterating global reduction 3 with 11 rules applied. Total rules applied 523 place count 919 transition count 860
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 534 place count 908 transition count 849
Iterating global reduction 3 with 11 rules applied. Total rules applied 545 place count 908 transition count 849
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 556 place count 897 transition count 838
Iterating global reduction 3 with 11 rules applied. Total rules applied 567 place count 897 transition count 838
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 578 place count 886 transition count 827
Iterating global reduction 3 with 11 rules applied. Total rules applied 589 place count 886 transition count 827
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 600 place count 875 transition count 816
Iterating global reduction 3 with 11 rules applied. Total rules applied 611 place count 875 transition count 816
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 622 place count 864 transition count 805
Iterating global reduction 3 with 11 rules applied. Total rules applied 633 place count 864 transition count 805
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 644 place count 853 transition count 794
Iterating global reduction 3 with 11 rules applied. Total rules applied 655 place count 853 transition count 794
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 666 place count 842 transition count 783
Iterating global reduction 3 with 11 rules applied. Total rules applied 677 place count 842 transition count 783
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 22 rules applied. Total rules applied 699 place count 831 transition count 772
Applied a total of 699 rules in 429 ms. Remains 831 /1230 variables (removed 399) and now considering 772/1123 (removed 351) transitions.
// Phase 1: matrix 772 rows 831 cols
[2021-05-10 19:33:19] [INFO ] Computed 81 place invariants in 5 ms
[2021-05-10 19:33:19] [INFO ] Implicit Places using invariants in 208 ms returned [143, 343, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 698]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 210 ms to find 14 implicit places.
// Phase 1: matrix 772 rows 817 cols
[2021-05-10 19:33:19] [INFO ] Computed 67 place invariants in 2 ms
[2021-05-10 19:33:19] [INFO ] Dead Transitions using invariants and state equation in 383 ms returned []
Starting structural reductions, iteration 1 : 817/1230 places, 772/1123 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 796 transition count 751
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 796 transition count 751
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 786 transition count 731
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 786 transition count 731
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 776 transition count 721
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 776 transition count 721
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 766 transition count 711
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 766 transition count 711
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 756 transition count 701
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 756 transition count 701
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 746 transition count 691
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 746 transition count 691
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 736 transition count 681
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 736 transition count 681
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 726 transition count 671
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 726 transition count 671
Applied a total of 182 rules in 187 ms. Remains 726 /817 variables (removed 91) and now considering 671/772 (removed 101) transitions.
// Phase 1: matrix 671 rows 726 cols
[2021-05-10 19:33:20] [INFO ] Computed 67 place invariants in 3 ms
[2021-05-10 19:33:20] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 671 rows 726 cols
[2021-05-10 19:33:20] [INFO ] Computed 67 place invariants in 3 ms
[2021-05-10 19:33:20] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 726/1230 places, 671/1123 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s57 1) (GEQ s56 1) (GEQ s59 1) (GEQ s58 1) (GEQ s61 1) (GEQ s60 1) (GEQ s63 1) (GEQ s62 1) (GEQ s65 1) (GEQ s64 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 248 reset in 220 ms.
Product exploration explored 100000 steps with 246 reset in 230 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 726 transition count 671
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 : [(F (G (NOT p0))), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 247 reset in 201 ms.
Product exploration explored 100000 steps with 247 reset in 216 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 726 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 726/726 places, 671/671 transitions.
Performed 245 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 726 transition count 671
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 247 place count 726 transition count 670
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 300 Pre rules applied. Total rules applied 247 place count 726 transition count 824
Deduced a syphon composed of 546 places in 0 ms
Iterating global reduction 2 with 300 rules applied. Total rules applied 547 place count 726 transition count 824
Discarding 356 places :
Symmetric choice reduction at 2 with 356 rule applications. Total rules 903 place count 370 transition count 468
Deduced a syphon composed of 190 places in 0 ms
Iterating global reduction 2 with 356 rules applied. Total rules applied 1259 place count 370 transition count 468
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 1294 place count 370 transition count 468
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 1341 place count 323 transition count 421
Deduced a syphon composed of 178 places in 0 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 1388 place count 323 transition count 421
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 189 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1399 place count 323 transition count 443
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1410 place count 312 transition count 421
Deduced a syphon composed of 178 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1421 place count 312 transition count 421
Deduced a syphon composed of 178 places in 0 ms
Applied a total of 1421 rules in 91 ms. Remains 312 /726 variables (removed 414) and now considering 421/671 (removed 250) transitions.
[2021-05-10 19:33:22] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 421 rows 312 cols
[2021-05-10 19:33:22] [INFO ] Computed 67 place invariants in 2 ms
[2021-05-10 19:33:22] [INFO ] Dead Transitions using invariants and state equation in 171 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/726 places, 421/671 transitions.
Product exploration explored 100000 steps with 6514 reset in 765 ms.
Product exploration explored 100000 steps with 6516 reset in 607 ms.
[2021-05-10 19:33:23] [INFO ] Flatten gal took : 24 ms
[2021-05-10 19:33:23] [INFO ] Flatten gal took : 24 ms
[2021-05-10 19:33:23] [INFO ] Time to serialize gal into /tmp/LTL8663455023646192418.gal : 6 ms
[2021-05-10 19:33:23] [INFO ] Time to serialize properties into /tmp/LTL16813505398506393676.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8663455023646192418.gal, -t, CGAL, -LTL, /tmp/LTL16813505398506393676.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8663455023646192418.gal -t CGAL -LTL /tmp/LTL16813505398506393676.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((((((((lc1_2>=1)||(lc1_1>=1))||(lc1_4>=1))||(lc1_3>=1))||(lc1_6>=1))||(lc1_5>=1))||(lc1_8>=1))||(lc1_7>=1))||(lc1_10>=1))||(lc1_9>=1))||(lc1_0>=1))")))))
Formula 0 simplified : !XXF"(((((((((((lc1_2>=1)||(lc1_1>=1))||(lc1_4>=1))||(lc1_3>=1))||(lc1_6>=1))||(lc1_5>=1))||(lc1_8>=1))||(lc1_7>=1))||(lc1_10>=1))||(lc1_9>=1))||(lc1_0>=1))"
Detected timeout of ITS tools.
[2021-05-10 19:33:38] [INFO ] Flatten gal took : 26 ms
[2021-05-10 19:33:38] [INFO ] Applying decomposition
[2021-05-10 19:33:38] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5871780754751101381.txt, -o, /tmp/graph5871780754751101381.bin, -w, /tmp/graph5871780754751101381.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5871780754751101381.bin, -l, -1, -v, -w, /tmp/graph5871780754751101381.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 19:33:38] [INFO ] Decomposing Gal with order
[2021-05-10 19:33:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 19:33:39] [INFO ] Removed a total of 20 redundant transitions.
[2021-05-10 19:33:39] [INFO ] Flatten gal took : 107 ms
[2021-05-10 19:33:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-05-10 19:33:39] [INFO ] Time to serialize gal into /tmp/LTL10201217499803427189.gal : 21 ms
[2021-05-10 19:33:39] [INFO ] Time to serialize properties into /tmp/LTL5260479467703493120.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10201217499803427189.gal, -t, CGAL, -LTL, /tmp/LTL5260479467703493120.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10201217499803427189.gal -t CGAL -LTL /tmp/LTL5260479467703493120.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((((((((i5.u30.lc1_2>=1)||(i7.u17.lc1_1>=1))||(i2.u18.lc1_4>=1))||(i29.u31.lc1_3>=1))||(i32.u32.lc1_6>=1))||(i31.u19.lc1_5>=1))||(i9.u21.lc1_8>=1))||(i3.u20.lc1_7>=1))||(i10.u22.lc1_10>=1))||(i6.u33.lc1_9>=1))||(i30.u29.lc1_0>=1))")))))
Formula 0 simplified : !XXF"(((((((((((i5.u30.lc1_2>=1)||(i7.u17.lc1_1>=1))||(i2.u18.lc1_4>=1))||(i29.u31.lc1_3>=1))||(i32.u32.lc1_6>=1))||(i31.u19.lc1_5>=1))||(i9.u21.lc1_8>=1))||(i3.u20.lc1_7>=1))||(i10.u22.lc1_10>=1))||(i6.u33.lc1_9>=1))||(i30.u29.lc1_0>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16175825600038125127
[2021-05-10 19:33:54] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16175825600038125127
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16175825600038125127]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16175825600038125127] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16175825600038125127] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-06 finished in 36547 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (G(p2)||X(G((p0&&X(p2))))||p1))))], workingDir=/home/mcc/execution]
Support contains 66 out of 1230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1230/1230 places, 1123/1123 transitions.
Discarding 88 places :
Implicit places reduction removed 88 places
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 1142 transition count 1123
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 154 place count 1076 transition count 1046
Iterating global reduction 1 with 66 rules applied. Total rules applied 220 place count 1076 transition count 1046
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 254 place count 1042 transition count 992
Iterating global reduction 1 with 34 rules applied. Total rules applied 288 place count 1042 transition count 992
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 299 place count 1031 transition count 992
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 333 place count 997 transition count 948
Iterating global reduction 2 with 34 rules applied. Total rules applied 367 place count 997 transition count 948
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 390 place count 974 transition count 915
Iterating global reduction 2 with 23 rules applied. Total rules applied 413 place count 974 transition count 915
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 424 place count 963 transition count 904
Iterating global reduction 2 with 11 rules applied. Total rules applied 435 place count 963 transition count 904
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 446 place count 952 transition count 893
Iterating global reduction 2 with 11 rules applied. Total rules applied 457 place count 952 transition count 893
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 468 place count 941 transition count 882
Iterating global reduction 2 with 11 rules applied. Total rules applied 479 place count 941 transition count 882
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 490 place count 930 transition count 871
Iterating global reduction 2 with 11 rules applied. Total rules applied 501 place count 930 transition count 871
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 512 place count 919 transition count 860
Iterating global reduction 2 with 11 rules applied. Total rules applied 523 place count 919 transition count 860
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 534 place count 908 transition count 849
Iterating global reduction 2 with 11 rules applied. Total rules applied 545 place count 908 transition count 849
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 556 place count 897 transition count 838
Iterating global reduction 2 with 11 rules applied. Total rules applied 567 place count 897 transition count 838
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 578 place count 886 transition count 827
Iterating global reduction 2 with 11 rules applied. Total rules applied 589 place count 886 transition count 827
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 600 place count 875 transition count 816
Iterating global reduction 2 with 11 rules applied. Total rules applied 611 place count 875 transition count 816
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 622 place count 864 transition count 805
Iterating global reduction 2 with 11 rules applied. Total rules applied 633 place count 864 transition count 805
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 22 rules applied. Total rules applied 655 place count 853 transition count 794
Applied a total of 655 rules in 368 ms. Remains 853 /1230 variables (removed 377) and now considering 794/1123 (removed 329) transitions.
// Phase 1: matrix 794 rows 853 cols
[2021-05-10 19:33:55] [INFO ] Computed 92 place invariants in 6 ms
[2021-05-10 19:33:55] [INFO ] Implicit Places using invariants in 224 ms returned [55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 165, 365, 720]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 225 ms to find 14 implicit places.
// Phase 1: matrix 794 rows 839 cols
[2021-05-10 19:33:55] [INFO ] Computed 78 place invariants in 4 ms
[2021-05-10 19:33:56] [INFO ] Dead Transitions using invariants and state equation in 401 ms returned []
Starting structural reductions, iteration 1 : 839/1230 places, 794/1123 transitions.
Applied a total of 0 rules in 17 ms. Remains 839 /839 variables (removed 0) and now considering 794/794 (removed 0) transitions.
// Phase 1: matrix 794 rows 839 cols
[2021-05-10 19:33:56] [INFO ] Computed 78 place invariants in 4 ms
[2021-05-10 19:33:56] [INFO ] Dead Transitions using invariants and state equation in 401 ms returned []
Finished structural reductions, in 2 iterations. Remains : 839/1230 places, 794/1123 transitions.
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p2), true, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 6}, { cond=p0, acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=2 dest: 8}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=2 dest: 8}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 1}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=p0, acceptance={} source=5 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={} source=9 dest: 6}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(OR (AND (GEQ s380 1) (GEQ s418 1)) (AND (GEQ s383 1) (GEQ s425 1)) (AND (GEQ s377 1) (GEQ s412 1)) (AND (GEQ s380 1) (GEQ s419 1)) (AND (GEQ s383 1) (GEQ s424 1)) (AND (GEQ s382 1) (GEQ s422 1)) (AND (GEQ s382 1) (GEQ s423 1)) (AND (GEQ s376 1) (GEQ s410 1)) (AND (GEQ s376 1) (GEQ s411 1)) (AND (GEQ s378 1) (GEQ s414 1)) (AND (GEQ s378 1) (GEQ s415 1)) (AND (GEQ s384 1) (GEQ s427 1)) (AND (GEQ s384 1) (GEQ s426 1)) (AND (GEQ s385 1) (GEQ s429 1)) (AND (GEQ s375 1) (GEQ s408 1)) (AND (GEQ s385 1) (GEQ s428 1)) (AND (GEQ s381 1) (GEQ s421 1)) (AND (GEQ s375 1) (GEQ s409 1)) (AND (GEQ s379 1) (GEQ s417 1)) (AND (GEQ s381 1) (GEQ s420 1)) (AND (GEQ s377 1) (GEQ s413 1)) (AND (GEQ s379 1) (GEQ s416 1))), p1:(OR (GEQ s708 1) (GEQ s709 1) (GEQ s707 1) (GEQ s710 1) (GEQ s711 1) (GEQ s712 1) (GEQ s717 1) (GEQ s713 1) (GEQ s714 1) (GEQ s715 1) (GEQ s716 1)), p2:(OR (GEQ s82 1) (GEQ s83 1) (GEQ s80 1) (GEQ s81 1) (GEQ s86 1) (GEQ s87 1) (GEQ s84 1) (GEQ s85 1) (GEQ s90 1) (GEQ s91 1) (GEQ s88 1) (GEQ s89 1) (GEQ s94 1) (GEQ s95 1) (GEQ s92 1) (GEQ s93 1) (GEQ s98 1) (GEQ s96 1) (GEQ s97 1) (GEQ s78 1) (GEQ s79 1) (GEQ s77 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-07 finished in 1732 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 11 out of 1230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1230/1230 places, 1123/1123 transitions.
Discarding 88 places :
Implicit places reduction removed 88 places
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 1142 transition count 1123
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 143 place count 1087 transition count 1057
Iterating global reduction 1 with 55 rules applied. Total rules applied 198 place count 1087 transition count 1057
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 222 place count 1063 transition count 1013
Iterating global reduction 1 with 24 rules applied. Total rules applied 246 place count 1063 transition count 1013
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 257 place count 1052 transition count 1013
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 291 place count 1018 transition count 969
Iterating global reduction 2 with 34 rules applied. Total rules applied 325 place count 1018 transition count 969
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 359 place count 984 transition count 925
Iterating global reduction 2 with 34 rules applied. Total rules applied 393 place count 984 transition count 925
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 22 rules applied. Total rules applied 415 place count 973 transition count 914
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 426 place count 962 transition count 903
Iterating global reduction 3 with 11 rules applied. Total rules applied 437 place count 962 transition count 903
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 448 place count 951 transition count 892
Iterating global reduction 3 with 11 rules applied. Total rules applied 459 place count 951 transition count 892
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 470 place count 940 transition count 881
Iterating global reduction 3 with 11 rules applied. Total rules applied 481 place count 940 transition count 881
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 492 place count 929 transition count 870
Iterating global reduction 3 with 11 rules applied. Total rules applied 503 place count 929 transition count 870
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 514 place count 918 transition count 859
Iterating global reduction 3 with 11 rules applied. Total rules applied 525 place count 918 transition count 859
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 536 place count 907 transition count 848
Iterating global reduction 3 with 11 rules applied. Total rules applied 547 place count 907 transition count 848
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 558 place count 896 transition count 837
Iterating global reduction 3 with 11 rules applied. Total rules applied 569 place count 896 transition count 837
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 580 place count 885 transition count 826
Iterating global reduction 3 with 11 rules applied. Total rules applied 591 place count 885 transition count 826
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 602 place count 874 transition count 815
Iterating global reduction 3 with 11 rules applied. Total rules applied 613 place count 874 transition count 815
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 624 place count 863 transition count 804
Iterating global reduction 3 with 11 rules applied. Total rules applied 635 place count 863 transition count 804
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 22 rules applied. Total rules applied 657 place count 852 transition count 793
Applied a total of 657 rules in 380 ms. Remains 852 /1230 variables (removed 378) and now considering 793/1123 (removed 330) transitions.
// Phase 1: matrix 793 rows 852 cols
[2021-05-10 19:33:57] [INFO ] Computed 81 place invariants in 4 ms
[2021-05-10 19:33:57] [INFO ] Implicit Places using invariants in 240 ms returned [143, 343, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 719]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 242 ms to find 14 implicit places.
// Phase 1: matrix 793 rows 838 cols
[2021-05-10 19:33:57] [INFO ] Computed 67 place invariants in 3 ms
[2021-05-10 19:33:58] [INFO ] Dead Transitions using invariants and state equation in 376 ms returned []
Starting structural reductions, iteration 1 : 838/1230 places, 793/1123 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 828 transition count 783
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 828 transition count 783
Applied a total of 20 rules in 45 ms. Remains 828 /838 variables (removed 10) and now considering 783/793 (removed 10) transitions.
// Phase 1: matrix 783 rows 828 cols
[2021-05-10 19:33:58] [INFO ] Computed 67 place invariants in 3 ms
[2021-05-10 19:33:58] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 783 rows 828 cols
[2021-05-10 19:33:58] [INFO ] Computed 67 place invariants in 3 ms
[2021-05-10 19:33:58] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 828/1230 places, 783/1123 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-08 automaton TGBA [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:(AND (LT s428 1) (LT s421 1) (LT s429 1) (LT s426 1) (LT s427 1) (LT s424 1) (LT s425 1) (LT s422 1) (LT s430 1) (LT s423 1) (LT s431 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 540 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-08 finished in 1684 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 22 out of 1230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1230/1230 places, 1123/1123 transitions.
Discarding 88 places :
Implicit places reduction removed 88 places
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 1142 transition count 1123
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 154 place count 1076 transition count 1046
Iterating global reduction 1 with 66 rules applied. Total rules applied 220 place count 1076 transition count 1046
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 254 place count 1042 transition count 992
Iterating global reduction 1 with 34 rules applied. Total rules applied 288 place count 1042 transition count 992
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 299 place count 1031 transition count 992
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 333 place count 997 transition count 948
Iterating global reduction 2 with 34 rules applied. Total rules applied 367 place count 997 transition count 948
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 401 place count 963 transition count 904
Iterating global reduction 2 with 34 rules applied. Total rules applied 435 place count 963 transition count 904
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 22 rules applied. Total rules applied 457 place count 952 transition count 893
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 468 place count 941 transition count 882
Iterating global reduction 3 with 11 rules applied. Total rules applied 479 place count 941 transition count 882
Applied a total of 479 rules in 153 ms. Remains 941 /1230 variables (removed 289) and now considering 882/1123 (removed 241) transitions.
// Phase 1: matrix 882 rows 941 cols
[2021-05-10 19:33:58] [INFO ] Computed 92 place invariants in 7 ms
[2021-05-10 19:33:59] [INFO ] Implicit Places using invariants in 224 ms returned [99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 198, 453, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 808]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 225 ms to find 25 implicit places.
// Phase 1: matrix 882 rows 916 cols
[2021-05-10 19:33:59] [INFO ] Computed 67 place invariants in 3 ms
[2021-05-10 19:33:59] [INFO ] Dead Transitions using invariants and state equation in 370 ms returned []
Starting structural reductions, iteration 1 : 916/1230 places, 882/1123 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 895 transition count 861
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 895 transition count 861
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 885 transition count 841
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 885 transition count 841
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 875 transition count 831
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 875 transition count 831
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 865 transition count 821
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 865 transition count 821
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 855 transition count 811
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 855 transition count 811
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 845 transition count 801
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 845 transition count 801
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 835 transition count 791
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 835 transition count 791
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 825 transition count 781
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 825 transition count 781
Applied a total of 182 rules in 179 ms. Remains 825 /916 variables (removed 91) and now considering 781/882 (removed 101) transitions.
// Phase 1: matrix 781 rows 825 cols
[2021-05-10 19:33:59] [INFO ] Computed 67 place invariants in 3 ms
[2021-05-10 19:33:59] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 781 rows 825 cols
[2021-05-10 19:33:59] [INFO ] Computed 67 place invariants in 3 ms
[2021-05-10 19:34:00] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 825/1230 places, 781/1123 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s328 1) (GEQ s327 1) (GEQ s326 1) (GEQ s325 1) (GEQ s324 1) (GEQ s323 1) (GEQ s322 1) (GEQ s321 1) (GEQ s330 1) (GEQ s329 1) (GEQ s312 1) (GEQ s311 1) (GEQ s310 1) (GEQ s309 1) (GEQ s320 1) (GEQ s319 1) (GEQ s318 1) (GEQ s317 1) (GEQ s316 1) (GEQ s315 1) (GEQ s314 1) (GEQ s313 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1550 reset in 244 ms.
Product exploration explored 100000 steps with 1543 reset in 259 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 825 transition count 781
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 : [(F (G (NOT p0))), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1539 reset in 242 ms.
Product exploration explored 100000 steps with 1532 reset in 259 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Support contains 22 out of 825 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 825/825 places, 781/781 transitions.
Performed 289 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 289 rules applied. Total rules applied 289 place count 825 transition count 781
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 291 place count 825 transition count 780
Performed 322 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 322 Pre rules applied. Total rules applied 291 place count 825 transition count 945
Deduced a syphon composed of 612 places in 0 ms
Iterating global reduction 2 with 322 rules applied. Total rules applied 613 place count 825 transition count 945
Discarding 389 places :
Symmetric choice reduction at 2 with 389 rule applications. Total rules 1002 place count 436 transition count 556
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 2 with 389 rules applied. Total rules applied 1391 place count 436 transition count 556
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 258 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 1426 place count 436 transition count 556
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 1462 place count 400 transition count 520
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 1498 place count 400 transition count 520
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 233 places in 1 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1509 place count 400 transition count 553
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1520 place count 389 transition count 531
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1531 place count 389 transition count 531
Deduced a syphon composed of 222 places in 0 ms
Applied a total of 1531 rules in 77 ms. Remains 389 /825 variables (removed 436) and now considering 531/781 (removed 250) transitions.
[2021-05-10 19:34:01] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 531 rows 389 cols
[2021-05-10 19:34:01] [INFO ] Computed 67 place invariants in 2 ms
[2021-05-10 19:34:02] [INFO ] Dead Transitions using invariants and state equation in 321 ms returned []
Finished structural reductions, in 1 iterations. Remains : 389/825 places, 531/781 transitions.
Product exploration explored 100000 steps with 12580 reset in 794 ms.
Product exploration explored 100000 steps with 12604 reset in 813 ms.
[2021-05-10 19:34:03] [INFO ] Flatten gal took : 28 ms
[2021-05-10 19:34:03] [INFO ] Flatten gal took : 47 ms
[2021-05-10 19:34:03] [INFO ] Time to serialize gal into /tmp/LTL7434102738499163023.gal : 6 ms
[2021-05-10 19:34:03] [INFO ] Time to serialize properties into /tmp/LTL16264030032673992187.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7434102738499163023.gal, -t, CGAL, -LTL, /tmp/LTL16264030032673992187.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7434102738499163023.gal -t CGAL -LTL /tmp/LTL16264030032673992187.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((((((((((((((((m5_19>=1)||(m5_18>=1))||(m5_17>=1))||(m5_16>=1))||(m5_15>=1))||(m5_14>=1))||(m5_13>=1))||(m5_12>=1))||(m5_21>=1))||(m5_20>=1))||(m5_3>=1))||(m5_2>=1))||(m5_1>=1))||(m5_0>=1))||(m5_11>=1))||(m5_10>=1))||(m5_9>=1))||(m5_8>=1))||(m5_7>=1))||(m5_6>=1))||(m5_5>=1))||(m5_4>=1))"))))
Formula 0 simplified : !XF"((((((((((((((((((((((m5_19>=1)||(m5_18>=1))||(m5_17>=1))||(m5_16>=1))||(m5_15>=1))||(m5_14>=1))||(m5_13>=1))||(m5_12>=1))||(m5_21>=1))||(m5_20>=1))||(m5_3>=1))||(m5_2>=1))||(m5_1>=1))||(m5_0>=1))||(m5_11>=1))||(m5_10>=1))||(m5_9>=1))||(m5_8>=1))||(m5_7>=1))||(m5_6>=1))||(m5_5>=1))||(m5_4>=1))"
Detected timeout of ITS tools.
[2021-05-10 19:34:18] [INFO ] Flatten gal took : 20 ms
[2021-05-10 19:34:18] [INFO ] Applying decomposition
[2021-05-10 19:34:18] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10722207542979984134.txt, -o, /tmp/graph10722207542979984134.bin, -w, /tmp/graph10722207542979984134.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10722207542979984134.bin, -l, -1, -v, -w, /tmp/graph10722207542979984134.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 19:34:19] [INFO ] Decomposing Gal with order
[2021-05-10 19:34:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 19:34:19] [INFO ] Removed a total of 31 redundant transitions.
[2021-05-10 19:34:19] [INFO ] Flatten gal took : 83 ms
[2021-05-10 19:34:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-10 19:34:19] [INFO ] Time to serialize gal into /tmp/LTL9756956269653328110.gal : 7 ms
[2021-05-10 19:34:19] [INFO ] Time to serialize properties into /tmp/LTL9531019736875084865.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9756956269653328110.gal, -t, CGAL, -LTL, /tmp/LTL9531019736875084865.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9756956269653328110.gal -t CGAL -LTL /tmp/LTL9531019736875084865.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((((((((((((((((i15.i1.i1.u143.m5_19>=1)||(i15.i1.i0.u142.m5_18>=1))||(i4.i1.i0.u153.m5_17>=1))||(i4.i0.i2.u141.m5_16>=1))||(i17.i1.i1.u149.m5_15>=1))||(i17.i1.i0.u139.m5_14>=1))||(i3.i0.i1.u138.m5_13>=1))||(i3.i1.i1.u137.m5_12>=1))||(i23.u145.m5_21>=1))||(i23.u144.m5_20>=1))||(i1.u132.m5_3>=1))||(i1.u115.m5_2>=1))||(i0.i0.i1.u131.m5_1>=1))||(i0.i1.i1.u130.m5_0>=1))||(i16.i0.i2.u118.m5_11>=1))||(i16.i1.i1.u148.m5_10>=1))||(i2.i1.i1.u147.m5_9>=1))||(i2.i1.i1.u136.m5_8>=1))||(i20.i1.i0.u135.m5_7>=1))||(i20.i1.i1.u134.m5_6>=1))||(i21.i0.i3.u133.m5_5>=1))||(i21.i0.i3.u146.m5_4>=1))"))))
Formula 0 simplified : !XF"((((((((((((((((((((((i15.i1.i1.u143.m5_19>=1)||(i15.i1.i0.u142.m5_18>=1))||(i4.i1.i0.u153.m5_17>=1))||(i4.i0.i2.u141.m5_16>=1))||(i17.i1.i1.u149.m5_15>=1))||(i17.i1.i0.u139.m5_14>=1))||(i3.i0.i1.u138.m5_13>=1))||(i3.i1.i1.u137.m5_12>=1))||(i23.u145.m5_21>=1))||(i23.u144.m5_20>=1))||(i1.u132.m5_3>=1))||(i1.u115.m5_2>=1))||(i0.i0.i1.u131.m5_1>=1))||(i0.i1.i1.u130.m5_0>=1))||(i16.i0.i2.u118.m5_11>=1))||(i16.i1.i1.u148.m5_10>=1))||(i2.i1.i1.u147.m5_9>=1))||(i2.i1.i1.u136.m5_8>=1))||(i20.i1.i0.u135.m5_7>=1))||(i20.i1.i1.u134.m5_6>=1))||(i21.i0.i3.u133.m5_5>=1))||(i21.i0.i3.u146.m5_4>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4185544253599911938
[2021-05-10 19:34:34] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4185544253599911938
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4185544253599911938]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4185544253599911938] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4185544253599911938] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-09 finished in 36541 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 66 out of 1230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1230/1230 places, 1123/1123 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions removed 484 transitions
Trivial Post-agglo rules discarded 484 transitions
Performed 484 trivial Post agglomeration. Transition count delta: 484
Iterating post reduction 0 with 550 rules applied. Total rules applied 550 place count 1163 transition count 638
Reduce places removed 484 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 506 rules applied. Total rules applied 1056 place count 679 transition count 616
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1078 place count 657 transition count 616
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 1078 place count 657 transition count 484
Deduced a syphon composed of 132 places in 1 ms
Ensure Unique test removed 55 places
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 3 with 319 rules applied. Total rules applied 1397 place count 470 transition count 484
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 33 rules applied. Total rules applied 1430 place count 470 transition count 451
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 1463 place count 437 transition count 451
Discarding 33 places :
Symmetric choice reduction at 5 with 33 rule applications. Total rules 1496 place count 404 transition count 418
Iterating global reduction 5 with 33 rules applied. Total rules applied 1529 place count 404 transition count 418
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 5 with 22 rules applied. Total rules applied 1551 place count 404 transition count 396
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 1573 place count 382 transition count 396
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1573 place count 382 transition count 385
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 1595 place count 371 transition count 385
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1597 place count 369 transition count 363
Iterating global reduction 7 with 2 rules applied. Total rules applied 1599 place count 369 transition count 363
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 7 with 55 rules applied. Total rules applied 1654 place count 347 transition count 330
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 1676 place count 325 transition count 330
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 1676 place count 325 transition count 319
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1698 place count 314 transition count 319
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 1709 place count 303 transition count 308
Iterating global reduction 9 with 11 rules applied. Total rules applied 1720 place count 303 transition count 308
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 1731 place count 303 transition count 297
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 10 with 110 rules applied. Total rules applied 1841 place count 248 transition count 242
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 1852 place count 237 transition count 231
Iterating global reduction 10 with 11 rules applied. Total rules applied 1863 place count 237 transition count 231
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 10 with 22 rules applied. Total rules applied 1885 place count 237 transition count 209
Applied a total of 1885 rules in 38 ms. Remains 237 /1230 variables (removed 993) and now considering 209/1123 (removed 914) transitions.
// Phase 1: matrix 209 rows 237 cols
[2021-05-10 19:34:35] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-10 19:34:35] [INFO ] Implicit Places using invariants in 111 ms returned [33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 55, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 236]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 112 ms to find 35 implicit places.
[2021-05-10 19:34:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 209 rows 202 cols
[2021-05-10 19:34:35] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-10 19:34:35] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Starting structural reductions, iteration 1 : 202/1230 places, 209/1123 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 202 transition count 176
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 169 transition count 176
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 66 place count 169 transition count 165
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 88 place count 158 transition count 165
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 98 place count 148 transition count 155
Iterating global reduction 2 with 10 rules applied. Total rules applied 108 place count 148 transition count 155
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 2 with 2 rules applied. Total rules applied 110 place count 147 transition count 154
Applied a total of 110 rules in 4 ms. Remains 147 /202 variables (removed 55) and now considering 154/209 (removed 55) transitions.
// Phase 1: matrix 154 rows 147 cols
[2021-05-10 19:34:35] [INFO ] Computed 24 place invariants in 0 ms
[2021-05-10 19:34:35] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 154 rows 147 cols
[2021-05-10 19:34:35] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-10 19:34:35] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 147/1230 places, 154/1123 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s58 1) (GEQ s80 1)) (AND (GEQ s55 1) (GEQ s77 1)) (AND (GEQ s61 1) (GEQ s83 1)) (AND (GEQ s63 1) (GEQ s85 1)) (AND (GEQ s69 1) (GEQ s91 1)) (AND (GEQ s71 1) (GEQ s93 1)) (AND (GEQ s66 1) (GEQ s88 1)) (AND (GEQ s68 1) (GEQ s90 1)) (AND (GEQ s74 1) (GEQ s96 1)) (AND (GEQ s76 1) (GEQ s98 1)) (AND (GEQ s56 1) (GEQ s78 1)) (AND (GEQ s60 1) (GEQ s82 1)) (AND (GEQ s57 1) (GEQ s79 1)) (AND (GEQ s59 1) (GEQ s81 1)) (AND (GEQ s65 1) (GEQ s87 1)) (AND (GEQ s67 1) (GEQ s89 1)) (AND (GEQ s62 1) (GEQ s84 1)) (AND (GEQ s64 1) (GEQ s86 1)) (AND (GEQ s70 1) (GEQ s92 1)) (AND (GEQ s73 1) (GEQ s95 1)) (AND (GEQ s75 1) (GEQ s97 1)) (AND (GEQ s72 1) (GEQ s94 1))), p1:(OR (GEQ s116 1) (GEQ s115 1) (GEQ s114 1) (GEQ s135 1) (GEQ s134 1) (GEQ s133 1) (GEQ s128 1) (GEQ s127 1) (GEQ s126 1) (GEQ s125 1) (GEQ s132 1) (GEQ s131 1) (GEQ s130 1) (GEQ s129 1) (GEQ s120 1) (GEQ s119 1) (GEQ s118 1) (GEQ s117 1) (GEQ s124 1) (GEQ s123 1) (GEQ s122 1) (GEQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 88 steps with 2 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-11 finished in 460 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 11 out of 1230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1230/1230 places, 1123/1123 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 88 places :
Implicit places reduction removed 88 places
Drop transitions removed 594 transitions
Trivial Post-agglo rules discarded 594 transitions
Performed 594 trivial Post agglomeration. Transition count delta: 594
Iterating post reduction 0 with 682 rules applied. Total rules applied 682 place count 1141 transition count 528
Reduce places removed 594 places and 0 transitions.
Iterating post reduction 1 with 594 rules applied. Total rules applied 1276 place count 547 transition count 528
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 1276 place count 547 transition count 429
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 1529 place count 393 transition count 429
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 2 with 33 rules applied. Total rules applied 1562 place count 393 transition count 396
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 1595 place count 360 transition count 396
Discarding 55 places :
Symmetric choice reduction at 4 with 55 rule applications. Total rules 1650 place count 305 transition count 330
Iterating global reduction 4 with 55 rules applied. Total rules applied 1705 place count 305 transition count 330
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 4 with 52 rules applied. Total rules applied 1757 place count 295 transition count 288
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 1788 place count 264 transition count 288
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 34 Pre rules applied. Total rules applied 1788 place count 264 transition count 254
Deduced a syphon composed of 34 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 69 rules applied. Total rules applied 1857 place count 229 transition count 254
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1860 place count 226 transition count 221
Iterating global reduction 6 with 3 rules applied. Total rules applied 1863 place count 226 transition count 221
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 6 with 55 rules applied. Total rules applied 1918 place count 204 transition count 188
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 1940 place count 182 transition count 188
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 1940 place count 182 transition count 177
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 1962 place count 171 transition count 177
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1974 place count 159 transition count 155
Iterating global reduction 8 with 12 rules applied. Total rules applied 1986 place count 159 transition count 155
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1997 place count 159 transition count 144
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 9 with 68 rules applied. Total rules applied 2065 place count 125 transition count 110
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 2076 place count 114 transition count 99
Iterating global reduction 9 with 11 rules applied. Total rules applied 2087 place count 114 transition count 99
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 2098 place count 114 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2099 place count 113 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2100 place count 112 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2101 place count 111 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2102 place count 110 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2103 place count 109 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2104 place count 108 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2105 place count 107 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2106 place count 106 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2107 place count 105 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2108 place count 104 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2109 place count 103 transition count 77
Applied a total of 2109 rules in 47 ms. Remains 103 /1230 variables (removed 1127) and now considering 77/1123 (removed 1046) transitions.
// Phase 1: matrix 77 rows 103 cols
[2021-05-10 19:34:35] [INFO ] Computed 26 place invariants in 0 ms
[2021-05-10 19:34:35] [INFO ] Implicit Places using invariants in 64 ms returned [22, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 102]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 65 ms to find 14 implicit places.
[2021-05-10 19:34:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 77 rows 89 cols
[2021-05-10 19:34:35] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-10 19:34:35] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Starting structural reductions, iteration 1 : 89/1230 places, 77/1123 transitions.
Reduce places removed 1 places and 1 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 22 place count 88 transition count 54
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 66 transition count 54
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 44 place count 66 transition count 33
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 86 place count 45 transition count 33
Applied a total of 86 rules in 1 ms. Remains 45 /89 variables (removed 44) and now considering 33/77 (removed 44) transitions.
// Phase 1: matrix 33 rows 45 cols
[2021-05-10 19:34:35] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-10 19:34:35] [INFO ] Implicit Places using invariants in 37 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 38 ms to find 11 implicit places.
Starting structural reductions, iteration 2 : 34/1230 places, 33/1123 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 24 transition count 23
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 24 transition count 23
Applied a total of 20 rules in 1 ms. Remains 24 /34 variables (removed 10) and now considering 23/33 (removed 10) transitions.
// Phase 1: matrix 23 rows 24 cols
[2021-05-10 19:34:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 19:34:36] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 23 rows 24 cols
[2021-05-10 19:34:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 19:34:36] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 24/1230 places, 23/1123 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s11 1) (GEQ s10 1) (GEQ s7 1) (GEQ s6 1) (GEQ s9 1) (GEQ s8 1) (GEQ s3 1) (GEQ s2 1) (GEQ s5 1) (GEQ s4 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 48 steps with 1 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-14 finished in 325 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 55 out of 1230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1230/1230 places, 1123/1123 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 66 places :
Implicit places reduction removed 66 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 517 rules applied. Total rules applied 517 place count 1163 transition count 671
Reduce places removed 451 places and 0 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 1 with 484 rules applied. Total rules applied 1001 place count 712 transition count 638
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 1034 place count 679 transition count 638
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 1034 place count 679 transition count 506
Deduced a syphon composed of 132 places in 1 ms
Ensure Unique test removed 55 places
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 3 with 319 rules applied. Total rules applied 1353 place count 492 transition count 506
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 33 rules applied. Total rules applied 1386 place count 492 transition count 473
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 1419 place count 459 transition count 473
Discarding 44 places :
Symmetric choice reduction at 5 with 44 rule applications. Total rules 1463 place count 415 transition count 418
Iterating global reduction 5 with 44 rules applied. Total rules applied 1507 place count 415 transition count 418
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 5 with 22 rules applied. Total rules applied 1529 place count 415 transition count 396
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 1551 place count 393 transition count 396
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1551 place count 393 transition count 385
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 1573 place count 382 transition count 385
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1576 place count 379 transition count 352
Iterating global reduction 7 with 3 rules applied. Total rules applied 1579 place count 379 transition count 352
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 7 with 55 rules applied. Total rules applied 1634 place count 357 transition count 319
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 1656 place count 335 transition count 319
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 1656 place count 335 transition count 308
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1678 place count 324 transition count 308
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 1690 place count 312 transition count 286
Iterating global reduction 9 with 12 rules applied. Total rules applied 1702 place count 312 transition count 286
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 9 with 22 rules applied. Total rules applied 1724 place count 312 transition count 264
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1735 place count 301 transition count 264
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 11 with 110 rules applied. Total rules applied 1845 place count 246 transition count 209
Discarding 11 places :
Symmetric choice reduction at 11 with 11 rule applications. Total rules 1856 place count 235 transition count 198
Iterating global reduction 11 with 11 rules applied. Total rules applied 1867 place count 235 transition count 198
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 1878 place count 235 transition count 187
Applied a total of 1878 rules in 48 ms. Remains 235 /1230 variables (removed 995) and now considering 187/1123 (removed 936) transitions.
// Phase 1: matrix 187 rows 235 cols
[2021-05-10 19:34:36] [INFO ] Computed 59 place invariants in 1 ms
[2021-05-10 19:34:36] [INFO ] Implicit Places using invariants in 96 ms returned [44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 66, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 234]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 96 ms to find 36 implicit places.
[2021-05-10 19:34:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 187 rows 199 cols
[2021-05-10 19:34:36] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-10 19:34:36] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Starting structural reductions, iteration 1 : 199/1230 places, 187/1123 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 199 transition count 132
Reduce places removed 55 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 66 rules applied. Total rules applied 121 place count 144 transition count 121
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 132 place count 133 transition count 121
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 142 place count 123 transition count 111
Iterating global reduction 3 with 10 rules applied. Total rules applied 152 place count 123 transition count 111
Applied a total of 152 rules in 3 ms. Remains 123 /199 variables (removed 76) and now considering 111/187 (removed 76) transitions.
// Phase 1: matrix 111 rows 123 cols
[2021-05-10 19:34:36] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-10 19:34:36] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 111 rows 123 cols
[2021-05-10 19:34:36] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-10 19:34:36] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 123/1230 places, 111/1123 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1)) (OR (LT s83 1) (LT s106 1)) (OR (LT s67 1) (LT s90 1)) (OR (LT s75 1) (LT s98 1)) (OR (LT s77 1) (LT s100 1)) (OR (LT s81 1) (LT s104 1)) (OR (LT s85 1) (LT s108 1)) (OR (LT s69 1) (LT s92 1)) (OR (LT s73 1) (LT s96 1)) (OR (LT s87 1) (LT s110 1)) (OR (LT s79 1) (LT s102 1)) (OR (LT s71 1) (LT s94 1)) (OR (LT s78 1) (LT s101 1)) (OR (LT s80 1) (LT s103 1)) (OR (LT s82 1) (LT s105 1)) (OR (LT s84 1) (LT s107 1)) (OR (LT s68 1) (LT s91 1)) (OR (LT s70 1) (LT s93 1)) (OR (LT s72 1) (LT s95 1)) (OR (LT s74 1) (LT s97 1)) (OR (LT s76 1) (LT s99 1)) (OR (LT s86 1) (LT s109 1)) (OR (LT s88 1) (LT s111 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 68 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-15 finished in 368 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7413978191808182953
[2021-05-10 19:34:36] [INFO ] Computing symmetric may disable matrix : 1123 transitions.
[2021-05-10 19:34:36] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 19:34:36] [INFO ] Computing symmetric may enable matrix : 1123 transitions.
[2021-05-10 19:34:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 19:34:36] [INFO ] Applying decomposition
[2021-05-10 19:34:36] [INFO ] Flatten gal took : 76 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17445978091057829427.txt, -o, /tmp/graph17445978091057829427.bin, -w, /tmp/graph17445978091057829427.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17445978091057829427.bin, -l, -1, -v, -w, /tmp/graph17445978091057829427.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 19:34:36] [INFO ] Decomposing Gal with order
[2021-05-10 19:34:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 19:34:36] [INFO ] Computing Do-Not-Accords matrix : 1123 transitions.
[2021-05-10 19:34:36] [INFO ] Removed a total of 226 redundant transitions.
[2021-05-10 19:34:36] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 19:34:36] [INFO ] Built C files in 417ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7413978191808182953
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7413978191808182953]
[2021-05-10 19:34:36] [INFO ] Flatten gal took : 70 ms
[2021-05-10 19:34:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 49 ms.
[2021-05-10 19:34:37] [INFO ] Time to serialize gal into /tmp/LTLFireability2803300503971194474.gal : 21 ms
[2021-05-10 19:34:37] [INFO ] Time to serialize properties into /tmp/LTLFireability8303093204595586850.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability2803300503971194474.gal, -t, CGAL, -LTL, /tmp/LTLFireability8303093204595586850.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability2803300503971194474.gal -t CGAL -LTL /tmp/LTLFireability8303093204595586850.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X(X(F("(((((((((((i9.i0.i0.u28.lc1_2>=1)||(i22.u27.lc1_1>=1))||(i17.i0.i0.u43.lc1_4>=1))||(i9.i1.i0.u29.lc1_3>=1))||(i18.i1.i0.u30.lc1_6>=1))||(i10.u44.lc1_5>=1))||(i13.i1.i0.u32.lc1_8>=1))||(i8.u31.lc1_7>=1))||(i4.u33.lc1_10>=1))||(i24.i0.i0.u45.lc1_9>=1))||(i19.i1.i0.u42.lc1_0>=1))")))))
Formula 0 simplified : !XXF"(((((((((((i9.i0.i0.u28.lc1_2>=1)||(i22.u27.lc1_1>=1))||(i17.i0.i0.u43.lc1_4>=1))||(i9.i1.i0.u29.lc1_3>=1))||(i18.i1.i0.u30.lc1_6>=1))||(i10.u44.lc1_5>=1))||(i13.i1.i0.u32.lc1_8>=1))||(i8.u31.lc1_7>=1))||(i4.u33.lc1_10>=1))||(i24.i0.i0.u45.lc1_9>=1))||(i19.i1.i0.u42.lc1_0>=1))"
Compilation finished in 13200 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7413978191808182953]
Link finished in 68 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7413978191808182953]
WARNING : LTSmin timed out (>327 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7413978191808182953]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7413978191808182953]
WARNING : LTSmin timed out (>327 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7413978191808182953]
Retrying LTSmin with larger timeout 2616 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7413978191808182953]
Detected timeout of ITS tools.
[2021-05-10 19:55:09] [INFO ] Applying decomposition
[2021-05-10 19:55:09] [INFO ] Flatten gal took : 109 ms
[2021-05-10 19:55:09] [INFO ] Decomposing Gal with order
[2021-05-10 19:55:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 19:55:10] [INFO ] Removed a total of 369 redundant transitions.
[2021-05-10 19:55:10] [INFO ] Flatten gal took : 188 ms
[2021-05-10 19:55:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-10 19:55:10] [INFO ] Time to serialize gal into /tmp/LTLFireability5862173117212738284.gal : 6 ms
[2021-05-10 19:55:10] [INFO ] Time to serialize properties into /tmp/LTLFireability13440883296020606663.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability5862173117212738284.gal, -t, CGAL, -LTL, /tmp/LTLFireability13440883296020606663.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability5862173117212738284.gal -t CGAL -LTL /tmp/LTLFireability13440883296020606663.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X(X(F("(((((((((((LegalResident2.lc1_2>=1)||(LegalResident1.lc1_1>=1))||(LegalResident4.lc1_4>=1))||(LegalResident3.lc1_3>=1))||(LegalResident6.lc1_6>=1))||(LegalResident5.lc1_5>=1))||(LegalResident8.lc1_8>=1))||(LegalResident7.lc1_7>=1))||(LegalResident10.lc1_10>=1))||(LegalResident9.lc1_9>=1))||(LegalResident0.lc1_0>=1))")))))
Formula 0 simplified : !XXF"(((((((((((LegalResident2.lc1_2>=1)||(LegalResident1.lc1_1>=1))||(LegalResident4.lc1_4>=1))||(LegalResident3.lc1_3>=1))||(LegalResident6.lc1_6>=1))||(LegalResident5.lc1_5>=1))||(LegalResident8.lc1_8>=1))||(LegalResident7.lc1_7>=1))||(LegalResident10.lc1_10>=1))||(LegalResident9.lc1_9>=1))||(LegalResident0.lc1_0>=1))"
Detected timeout of ITS tools.
[2021-05-10 20:15:43] [INFO ] Flatten gal took : 153 ms
[2021-05-10 20:15:43] [INFO ] Input system was already deterministic with 1123 transitions.
[2021-05-10 20:15:43] [INFO ] Transformed 1230 places.
[2021-05-10 20:15:43] [INFO ] Transformed 1123 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-10 20:15:43] [INFO ] Time to serialize gal into /tmp/LTLFireability9942659530821121158.gal : 3 ms
[2021-05-10 20:15:43] [INFO ] Time to serialize properties into /tmp/LTLFireability8815958025455219384.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability9942659530821121158.gal, -t, CGAL, -LTL, /tmp/LTLFireability8815958025455219384.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability9942659530821121158.gal -t CGAL -LTL /tmp/LTLFireability8815958025455219384.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(F("(((((((((((lc1_2>=1)||(lc1_1>=1))||(lc1_4>=1))||(lc1_3>=1))||(lc1_6>=1))||(lc1_5>=1))||(lc1_8>=1))||(lc1_7>=1))||(lc1_10>=1))||(lc1_9>=1))||(lc1_0>=1))")))))
Formula 0 simplified : !XXF"(((((((((((lc1_2>=1)||(lc1_1>=1))||(lc1_4>=1))||(lc1_3>=1))||(lc1_6>=1))||(lc1_5>=1))||(lc1_8>=1))||(lc1_7>=1))||(lc1_10>=1))||(lc1_9>=1))||(lc1_0>=1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.621: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.622: LTL layer: formula: X(X(<>((LTLAPp0==true))))
pins2lts-mc-linux64( 1/ 8), 0.625: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.624: "X(X(<>((LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.630: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.635: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.640: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.647: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.645: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.651: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.668: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.673: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.860: DFS-FIFO for weak LTL, using special progress label 1126
pins2lts-mc-linux64( 0/ 8), 0.860: There are 1127 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.860: State length is 1231, there are 1126 groups
pins2lts-mc-linux64( 0/ 8), 0.860: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.860: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.860: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.860: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 1.136: ~119 levels ~960 states ~10768 transitions
pins2lts-mc-linux64( 0/ 8), 1.201: ~239 levels ~1920 states ~21696 transitions
pins2lts-mc-linux64( 0/ 8), 1.312: ~463 levels ~3840 states ~44744 transitions
pins2lts-mc-linux64( 0/ 8), 1.463: ~529 levels ~7680 states ~54144 transitions
pins2lts-mc-linux64( 3/ 8), 1.723: ~529 levels ~15360 states ~64352 transitions
pins2lts-mc-linux64( 3/ 8), 2.233: ~529 levels ~30720 states ~85008 transitions
pins2lts-mc-linux64( 3/ 8), 3.367: ~529 levels ~61440 states ~127440 transitions
pins2lts-mc-linux64( 3/ 8), 5.774: ~529 levels ~122880 states ~216952 transitions
pins2lts-mc-linux64( 0/ 8), 10.437: ~529 levels ~245760 states ~398328 transitions
pins2lts-mc-linux64( 1/ 8), 18.863: ~528 levels ~491520 states ~732400 transitions
pins2lts-mc-linux64( 3/ 8), 38.250: ~529 levels ~983040 states ~1578128 transitions
pins2lts-mc-linux64( 1/ 8), 75.673: ~528 levels ~1966080 states ~3025824 transitions
pins2lts-mc-linux64( 0/ 8), 150.196: ~529 levels ~3932160 states ~6503392 transitions
pins2lts-mc-linux64( 0/ 8), 298.521: ~529 levels ~7864320 states ~13438192 transitions
pins2lts-mc-linux64( 0/ 8), 605.840: ~529 levels ~15728640 states ~28220072 transitions
pins2lts-mc-linux64( 1/ 8), 1227.794: ~528 levels ~31457280 states ~55959240 transitions
pins2lts-mc-linux64( 5/ 8), 1888.506: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1888.673:
pins2lts-mc-linux64( 0/ 8), 1888.673: mean standard work distribution: 100.0% (states) 100.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 1888.673:
pins2lts-mc-linux64( 0/ 8), 1888.673: Explored 23752320 states 44979815 transitions, fanout: 1.894
pins2lts-mc-linux64( 0/ 8), 1888.673: Total exploration time 1887.790 sec (1887.620 sec minimum, 1887.661 sec on average)
pins2lts-mc-linux64( 0/ 8), 1888.673: States per second: 12582, Transitions per second: 23827
pins2lts-mc-linux64( 0/ 8), 1888.673:
pins2lts-mc-linux64( 0/ 8), 1888.673: Progress states detected: 2
pins2lts-mc-linux64( 0/ 8), 1888.673: Redundant explorations: -0.0939
pins2lts-mc-linux64( 0/ 8), 1888.673:
pins2lts-mc-linux64( 0/ 8), 1888.673: Queue width: 8B, total height: 2151, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 1888.673: Tree memory: 437.4MB, 19.3 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 1888.673: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1888.673: Stored 1183 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1888.673: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1888.673: Est. total memory use: 437.4MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7413978191808182953]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7413978191808182953]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-COL-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-COL-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 r083-tall-162048875900845"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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