Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 7.7K Apr 30 08:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 08:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 30 08:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 30 08:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 134K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652698092700

Running Version 202205111006
[2022-05-16 10:48:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 10:48:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 10:48:13] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 10:48:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 10:48:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 642 ms
[2022-05-16 10:48:14] [INFO ] Detected 5 constant HL places corresponding to 10 PT places.
[2022-05-16 10:48:14] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 1486 PT places and 1245.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 10:48:14] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 6 ms.
[2022-05-16 10:48:14] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 13 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 25) seen :23
Finished Best-First random walk after 9910 steps, including 2 resets, run visited all 2 properties in 17 ms. (steps per millisecond=582 )
[2022-05-16 10:48:14] [INFO ] Flatten gal took : 26 ms
[2022-05-16 10:48:14] [INFO ] Flatten gal took : 8 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 2
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
[2022-05-16 10:48:14] [INFO ] Unfolded HLPN to a Petri net with 1379 places and 1069 transitions 3062 arcs in 24 ms.
[2022-05-16 10:48:14] [INFO ] Unfolded 12 HLPN properties in 1 ms.
[2022-05-16 10:48:15] [INFO ] Reduced 11 identical enabling conditions.
Deduced a syphon composed of 11 places in 12 ms
Reduce places removed 19 places and 0 transitions.
Support contains 499 out of 1360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1069/1069 transitions.
Reduce places removed 42 places and 0 transitions.
Discarding 99 places :
Implicit places reduction removed 99 places
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 1219 transition count 1069
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 173 place count 1187 transition count 1037
Iterating global reduction 1 with 32 rules applied. Total rules applied 205 place count 1187 transition count 1037
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 216 place count 1176 transition count 1026
Iterating global reduction 1 with 11 rules applied. Total rules applied 227 place count 1176 transition count 1026
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 238 place count 1165 transition count 1015
Iterating global reduction 1 with 11 rules applied. Total rules applied 249 place count 1165 transition count 1015
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 250 place count 1164 transition count 1004
Iterating global reduction 1 with 1 rules applied. Total rules applied 251 place count 1164 transition count 1004
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 262 place count 1153 transition count 1004
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 273 place count 1142 transition count 993
Iterating global reduction 2 with 11 rules applied. Total rules applied 284 place count 1142 transition count 993
Applied a total of 284 rules in 317 ms. Remains 1142 /1360 variables (removed 218) and now considering 993/1069 (removed 76) transitions.
// Phase 1: matrix 993 rows 1142 cols
[2022-05-16 10:48:15] [INFO ] Computed 192 place invariants in 52 ms
[2022-05-16 10:48:15] [INFO ] Implicit Places using invariants in 483 ms returned [99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 674]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 508 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1119/1360 places, 993/1069 transitions.
Applied a total of 0 rules in 33 ms. Remains 1119 /1119 variables (removed 0) and now considering 993/993 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1119/1360 places, 993/1069 transitions.
Support contains 499 out of 1119 places after structural reductions.
[2022-05-16 10:48:16] [INFO ] Flatten gal took : 68 ms
[2022-05-16 10:48:16] [INFO ] Flatten gal took : 63 ms
[2022-05-16 10:48:16] [INFO ] Input system was already deterministic with 993 transitions.
Finished random walk after 4174 steps, including 6 resets, run visited all 25 properties in 94 ms. (steps per millisecond=44 )
Computed a total of 1119 stabilizing places and 993 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1119 transition count 993
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(!(p1 U p2))||X(p3))&&p0)))'
Support contains 110 out of 1119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1119/1119 places, 993/993 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 1064 transition count 993
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 90 place count 1029 transition count 958
Iterating global reduction 1 with 35 rules applied. Total rules applied 125 place count 1029 transition count 958
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 137 place count 1017 transition count 936
Iterating global reduction 1 with 12 rules applied. Total rules applied 149 place count 1017 transition count 936
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 160 place count 1006 transition count 936
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 182 place count 984 transition count 914
Iterating global reduction 2 with 22 rules applied. Total rules applied 204 place count 984 transition count 914
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 226 place count 962 transition count 892
Iterating global reduction 2 with 22 rules applied. Total rules applied 248 place count 962 transition count 892
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 259 place count 951 transition count 881
Iterating global reduction 2 with 11 rules applied. Total rules applied 270 place count 951 transition count 881
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 281 place count 940 transition count 870
Iterating global reduction 2 with 11 rules applied. Total rules applied 292 place count 940 transition count 870
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 303 place count 929 transition count 859
Iterating global reduction 2 with 11 rules applied. Total rules applied 314 place count 929 transition count 859
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 325 place count 918 transition count 848
Iterating global reduction 2 with 11 rules applied. Total rules applied 336 place count 918 transition count 848
Applied a total of 336 rules in 501 ms. Remains 918 /1119 variables (removed 201) and now considering 848/993 (removed 145) transitions.
// Phase 1: matrix 848 rows 918 cols
[2022-05-16 10:48:17] [INFO ] Computed 103 place invariants in 21 ms
[2022-05-16 10:48:17] [INFO ] Implicit Places using invariants in 245 ms returned [209, 409, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 785]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 247 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 904/1119 places, 848/993 transitions.
Applied a total of 0 rules in 24 ms. Remains 904 /904 variables (removed 0) and now considering 848/848 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 904/1119 places, 848/993 transitions.
Stuttering acceptance computed with spot in 308 ms :[true, (NOT p3), (OR (NOT p0) (AND p2 (NOT p3))), (OR (NOT p0) (AND p2 (NOT p3))), (AND p2 (NOT p3)), p2]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(AND (OR (LT s147 1) (LT s169 1)) (OR (LT s144 1) (LT s166 1)) (OR (LT s146 1) (LT s168 1)) (OR (LT s148 1) (LT s170 1)) (OR (LT s150 1) (LT s172 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 693 ms.
Product exploration explored 100000 steps with 33333 reset in 633 ms.
Computed a total of 904 stabilizing places and 848 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 904 transition count 848
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p3 p0 (NOT p2)), (X p0), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p3)), (F (G p3)), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p3) (NOT p2)))))
Knowledge based reduction with 11 factoid took 224 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-00 finished in 2863 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!(p0 U !p1)&&(X(G(p2))||p2)))))'
Support contains 24 out of 1119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1119/1119 places, 993/993 transitions.
Graph (complete) has 1430 edges and 1119 vertex of which 1051 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.6 ms
Discarding 68 places :
Also discarding 78 output transitions
Drop transitions removed 78 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 77 places :
Implicit places reduction removed 77 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 561 rules applied. Total rules applied 562 place count 963 transition count 420
Reduce places removed 484 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 1 with 506 rules applied. Total rules applied 1068 place count 479 transition count 398
Reduce places removed 11 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 22 rules applied. Total rules applied 1090 place count 468 transition count 387
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1101 place count 457 transition count 387
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 143 Pre rules applied. Total rules applied 1101 place count 457 transition count 244
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 4 with 341 rules applied. Total rules applied 1442 place count 259 transition count 244
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 11 rules applied. Total rules applied 1453 place count 259 transition count 233
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1464 place count 248 transition count 233
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 1486 place count 226 transition count 211
Iterating global reduction 6 with 22 rules applied. Total rules applied 1508 place count 226 transition count 211
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 22 rules applied. Total rules applied 1530 place count 226 transition count 189
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 1552 place count 204 transition count 189
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1553 place count 203 transition count 178
Iterating global reduction 8 with 1 rules applied. Total rules applied 1554 place count 203 transition count 178
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 8 with 22 rules applied. Total rules applied 1576 place count 192 transition count 167
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 1587 place count 181 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 11 Pre rules applied. Total rules applied 1587 place count 181 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 1609 place count 170 transition count 156
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 1620 place count 159 transition count 145
Iterating global reduction 10 with 11 rules applied. Total rules applied 1631 place count 159 transition count 145
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 1697 place count 126 transition count 112
Applied a total of 1697 rules in 96 ms. Remains 126 /1119 variables (removed 993) and now considering 112/993 (removed 881) transitions.
// Phase 1: matrix 112 rows 126 cols
[2022-05-16 10:48:19] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 10:48:19] [INFO ] Implicit Places using invariants in 64 ms returned [22, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 125]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 65 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/1119 places, 112/993 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 102 transition count 101
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 91 transition count 101
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 91 transition count 90
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 80 transition count 90
Applied a total of 44 rules in 8 ms. Remains 80 /102 variables (removed 22) and now considering 90/112 (removed 22) transitions.
// Phase 1: matrix 90 rows 80 cols
[2022-05-16 10:48:19] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 10:48:19] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 90 rows 80 cols
[2022-05-16 10:48:19] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 10:48:19] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/1119 places, 90/993 transitions.
Finished structural reductions, in 2 iterations. Remains : 80/1119 places, 90/993 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=2 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=4 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s36 1) (GEQ s37 1) (GEQ s34 1) (GEQ s35 1) (GEQ s40 1) (GEQ s41 1) (GEQ s38 1) (GEQ s39 1) (GEQ s44 1) (GEQ s43 1) (GEQ s42 1)), p2:(AND (LT s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 174 steps with 14 reset in 2 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-02 finished in 472 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(!(X(F(p0)) U p1))))'
Support contains 22 out of 1119 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1119/1119 places, 993/993 transitions.
Discarding 77 places :
Implicit places reduction removed 77 places
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 1042 transition count 993
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 133 place count 986 transition count 937
Iterating global reduction 1 with 56 rules applied. Total rules applied 189 place count 986 transition count 937
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 222 place count 953 transition count 894
Iterating global reduction 1 with 33 rules applied. Total rules applied 255 place count 953 transition count 894
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 266 place count 942 transition count 894
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 298 place count 910 transition count 852
Iterating global reduction 2 with 32 rules applied. Total rules applied 330 place count 910 transition count 852
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 362 place count 878 transition count 820
Iterating global reduction 2 with 32 rules applied. Total rules applied 394 place count 878 transition count 820
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 415 place count 857 transition count 799
Iterating global reduction 2 with 21 rules applied. Total rules applied 436 place count 857 transition count 799
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 457 place count 836 transition count 778
Iterating global reduction 2 with 21 rules applied. Total rules applied 478 place count 836 transition count 778
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 499 place count 815 transition count 757
Iterating global reduction 2 with 21 rules applied. Total rules applied 520 place count 815 transition count 757
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 521 place count 814 transition count 757
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 542 place count 793 transition count 736
Iterating global reduction 3 with 21 rules applied. Total rules applied 563 place count 793 transition count 736
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 574 place count 782 transition count 725
Iterating global reduction 3 with 11 rules applied. Total rules applied 585 place count 782 transition count 725
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 596 place count 771 transition count 714
Iterating global reduction 3 with 11 rules applied. Total rules applied 607 place count 771 transition count 714
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 618 place count 760 transition count 703
Iterating global reduction 3 with 11 rules applied. Total rules applied 629 place count 760 transition count 703
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 640 place count 749 transition count 692
Iterating global reduction 3 with 11 rules applied. Total rules applied 651 place count 749 transition count 692
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 662 place count 749 transition count 681
Applied a total of 662 rules in 318 ms. Remains 749 /1119 variables (removed 370) and now considering 681/993 (removed 312) transitions.
// Phase 1: matrix 681 rows 749 cols
[2022-05-16 10:48:20] [INFO ] Computed 80 place invariants in 10 ms
[2022-05-16 10:48:20] [INFO ] Implicit Places using invariants in 161 ms returned [143, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 616]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 162 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 736/1119 places, 681/993 transitions.
Applied a total of 0 rules in 18 ms. Remains 736 /736 variables (removed 0) and now considering 681/681 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 736/1119 places, 681/993 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, p1, p1]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (OR (GEQ s306 1) (GEQ s307 1) (GEQ s304 1) (GEQ s305 1) (GEQ s310 1) (GEQ s311 1) (GEQ s308 1) (GEQ s309 1) (GEQ s314 1) (GEQ s312 1) (GEQ s313 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1538 steps with 2 reset in 5 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-04 finished in 618 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X(!(p0 U X(p1)))&&p2)))))'
Support contains 88 out of 1119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1119/1119 places, 993/993 transitions.
Graph (complete) has 1430 edges and 1119 vertex of which 1038 are kept as prefixes of interest. Removing 81 places using SCC suffix rule.4 ms
Discarding 81 places :
Also discarding 91 output transitions
Drop transitions removed 91 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 484 rules applied. Total rules applied 485 place count 983 transition count 451
Reduce places removed 440 places and 0 transitions.
Iterating post reduction 1 with 440 rules applied. Total rules applied 925 place count 543 transition count 451
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 925 place count 543 transition count 352
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 33 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 231 rules applied. Total rules applied 1156 place count 411 transition count 352
Discarding 22 places :
Implicit places reduction removed 22 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 2 with 33 rules applied. Total rules applied 1189 place count 389 transition count 341
Reduce places removed 11 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 3 with 33 rules applied. Total rules applied 1222 place count 378 transition count 319
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1244 place count 356 transition count 319
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 1266 place count 334 transition count 297
Iterating global reduction 5 with 22 rules applied. Total rules applied 1288 place count 334 transition count 297
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 1310 place count 334 transition count 275
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 1332 place count 312 transition count 275
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1333 place count 311 transition count 264
Iterating global reduction 7 with 1 rules applied. Total rules applied 1334 place count 311 transition count 264
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 1356 place count 300 transition count 253
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1367 place count 289 transition count 253
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 1367 place count 289 transition count 242
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 1389 place count 278 transition count 242
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 9 with 44 rules applied. Total rules applied 1433 place count 256 transition count 220
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1455 place count 245 transition count 220
Applied a total of 1455 rules in 60 ms. Remains 245 /1119 variables (removed 874) and now considering 220/993 (removed 773) transitions.
// Phase 1: matrix 220 rows 245 cols
[2022-05-16 10:48:20] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 10:48:20] [INFO ] Implicit Places using invariants in 81 ms returned [22, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 244]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 83 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/1119 places, 220/993 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 221 transition count 209
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 210 transition count 198
Applied a total of 44 rules in 9 ms. Remains 210 /232 variables (removed 22) and now considering 198/220 (removed 22) transitions.
// Phase 1: matrix 198 rows 210 cols
[2022-05-16 10:48:20] [INFO ] Computed 45 place invariants in 1 ms
[2022-05-16 10:48:20] [INFO ] Implicit Places using invariants in 51 ms returned [11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 52 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 199/1119 places, 198/993 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 199/1119 places, 198/993 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (AND (LT s196 1) (LT s197 1) (LT s198 1) (LT s177 1) (LT s178 1) (LT s179 1) (LT s180 1) (LT s181 1) (LT s182 1) (LT s183 1) (LT s184 1) (LT s185 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1190 reset in 512 ms.
Product exploration explored 100000 steps with 1190 reset in 496 ms.
Computed a total of 199 stabilizing places and 198 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 199 transition count 198
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X p2), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X p2)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 292 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1)]
Finished random walk after 63 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X p2), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X p2)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p2 p1)), (F (NOT (AND p2 (NOT p1))))]
Knowledge based reduction with 9 factoid took 381 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1)]
Support contains 88 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Applied a total of 0 rules in 9 ms. Remains 199 /199 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 199 cols
[2022-05-16 10:48:22] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 10:48:22] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 198 rows 199 cols
[2022-05-16 10:48:22] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 10:48:23] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2022-05-16 10:48:23] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 198 rows 199 cols
[2022-05-16 10:48:23] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 10:48:23] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 199/199 places, 198/198 transitions.
Computed a total of 199 stabilizing places and 198 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 199 transition count 198
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X p2), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X p2)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 274 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1)]
Finished random walk after 60 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X p2), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X p2)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p2 p1)), (F (NOT (AND p2 (NOT p1))))]
Knowledge based reduction with 9 factoid took 334 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 52 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1)]
Product exploration explored 100000 steps with 1190 reset in 459 ms.
Product exploration explored 100000 steps with 1190 reset in 523 ms.
Built C files in :
/tmp/ltsmin6429530491239926853
[2022-05-16 10:48:25] [INFO ] Computing symmetric may disable matrix : 198 transitions.
[2022-05-16 10:48:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:48:25] [INFO ] Computing symmetric may enable matrix : 198 transitions.
[2022-05-16 10:48:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:48:25] [INFO ] Computing Do-Not-Accords matrix : 198 transitions.
[2022-05-16 10:48:25] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:48:25] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6429530491239926853
Running compilation step : cd /tmp/ltsmin6429530491239926853;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 417 ms.
Running link step : cd /tmp/ltsmin6429530491239926853;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6429530491239926853;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8895296844941144467.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 88 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Applied a total of 0 rules in 13 ms. Remains 199 /199 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 199 cols
[2022-05-16 10:48:40] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-16 10:48:40] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 198 rows 199 cols
[2022-05-16 10:48:40] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-16 10:48:40] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2022-05-16 10:48:40] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 198 rows 199 cols
[2022-05-16 10:48:40] [INFO ] Computed 34 place invariants in 3 ms
[2022-05-16 10:48:40] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 199/199 places, 198/198 transitions.
Built C files in :
/tmp/ltsmin1297360422312548148
[2022-05-16 10:48:40] [INFO ] Computing symmetric may disable matrix : 198 transitions.
[2022-05-16 10:48:40] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:48:40] [INFO ] Computing symmetric may enable matrix : 198 transitions.
[2022-05-16 10:48:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:48:40] [INFO ] Computing Do-Not-Accords matrix : 198 transitions.
[2022-05-16 10:48:40] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:48:40] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1297360422312548148
Running compilation step : cd /tmp/ltsmin1297360422312548148;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 318 ms.
Running link step : cd /tmp/ltsmin1297360422312548148;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1297360422312548148;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17090963474652948439.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 10:48:55] [INFO ] Flatten gal took : 10 ms
[2022-05-16 10:48:55] [INFO ] Flatten gal took : 10 ms
[2022-05-16 10:48:55] [INFO ] Time to serialize gal into /tmp/LTL1825133595221898081.gal : 1 ms
[2022-05-16 10:48:55] [INFO ] Time to serialize properties into /tmp/LTL1241750353676751373.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1825133595221898081.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1241750353676751373.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1825133...266
Read 1 LTL properties
Checking formula 0 : !((G(F(G((X(!(("((((((p2_19>=1)||(p2_20>=1))||((p2_21>=1)||(p2_0>=1)))||(((p2_1>=1)||(p2_2>=1))||((p2_3>=1)||(p2_4>=1))))||((((p2_5>=1...1529
Formula 0 simplified : !GFG("(((((((p2_19<1)&&(p2_20<1))&&((p2_21<1)&&(p2_0<1)))&&(((p2_1<1)&&(p2_2<1))&&((p2_3<1)&&(p2_4<1))))&&((((p2_5<1)&&(p2_6<1))&&((...1514
Reverse transition relation is NOT exact ! Due to transitions t242, t243, t244, t245, t246, t247, t248, t249, t250, t251, t252, Intersection with reachabl...228
Computing Next relation with stutter on 55 deadlock states
Detected timeout of ITS tools.
[2022-05-16 10:49:10] [INFO ] Flatten gal took : 9 ms
[2022-05-16 10:49:10] [INFO ] Applying decomposition
[2022-05-16 10:49:10] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4523499336363991389.txt' '-o' '/tmp/graph4523499336363991389.bin' '-w' '/tmp/graph4523499336363991389.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4523499336363991389.bin' '-l' '-1' '-v' '-w' '/tmp/graph4523499336363991389.weights' '-q' '0' '-e' '0.001'
[2022-05-16 10:49:10] [INFO ] Decomposing Gal with order
[2022-05-16 10:49:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 10:49:10] [INFO ] Removed a total of 52 redundant transitions.
[2022-05-16 10:49:10] [INFO ] Flatten gal took : 36 ms
[2022-05-16 10:49:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 10:49:10] [INFO ] Time to serialize gal into /tmp/LTL7587301220048897381.gal : 3 ms
[2022-05-16 10:49:10] [INFO ] Time to serialize properties into /tmp/LTL15195425862985199393.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7587301220048897381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15195425862985199393.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7587301...246
Read 1 LTL properties
Checking formula 0 : !((G(F(G((X(!(("((((((i5.u12.p2_19>=1)||(i11.u65.p2_20>=1))||((i11.u66.p2_21>=1)||(i6.u53.p2_0>=1)))||(((i6.u48.p2_1>=1)||(i3.u49.p2_2...2306
Formula 0 simplified : !GFG("(((((((i5.u12.p2_19<1)&&(i11.u65.p2_20<1))&&((i11.u66.p2_21<1)&&(i6.u53.p2_0<1)))&&(((i6.u48.p2_1<1)&&(i3.u49.p2_2<1))&&((i3.u...2291
Reverse transition relation is NOT exact ! Due to transitions t242, t245, t246, t247, t248, t252, i1.t249, i3.t243, i4.t250, i5.t251, i7.t244, Intersectio...243
Computing Next relation with stutter on 55 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3617112434270860028
[2022-05-16 10:49:25] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3617112434270860028
Running compilation step : cd /tmp/ltsmin3617112434270860028;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 284 ms.
Running link step : cd /tmp/ltsmin3617112434270860028;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3617112434270860028;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]((X(!((LTLAPp0==true) U X((LTLAPp1==true))))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-05 finished in 80367 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 11 out of 1119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1119/1119 places, 993/993 transitions.
Discarding 77 places :
Implicit places reduction removed 77 places
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 1042 transition count 993
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 133 place count 986 transition count 937
Iterating global reduction 1 with 56 rules applied. Total rules applied 189 place count 986 transition count 937
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 222 place count 953 transition count 894
Iterating global reduction 1 with 33 rules applied. Total rules applied 255 place count 953 transition count 894
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 266 place count 942 transition count 894
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 298 place count 910 transition count 852
Iterating global reduction 2 with 32 rules applied. Total rules applied 330 place count 910 transition count 852
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 362 place count 878 transition count 820
Iterating global reduction 2 with 32 rules applied. Total rules applied 394 place count 878 transition count 820
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 415 place count 857 transition count 799
Iterating global reduction 2 with 21 rules applied. Total rules applied 436 place count 857 transition count 799
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 457 place count 836 transition count 778
Iterating global reduction 2 with 21 rules applied. Total rules applied 478 place count 836 transition count 778
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 499 place count 815 transition count 757
Iterating global reduction 2 with 21 rules applied. Total rules applied 520 place count 815 transition count 757
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 521 place count 814 transition count 757
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 542 place count 793 transition count 736
Iterating global reduction 3 with 21 rules applied. Total rules applied 563 place count 793 transition count 736
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 584 place count 772 transition count 715
Iterating global reduction 3 with 21 rules applied. Total rules applied 605 place count 772 transition count 715
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 616 place count 761 transition count 704
Iterating global reduction 3 with 11 rules applied. Total rules applied 627 place count 761 transition count 704
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 638 place count 750 transition count 693
Iterating global reduction 3 with 11 rules applied. Total rules applied 649 place count 750 transition count 693
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 660 place count 739 transition count 682
Iterating global reduction 3 with 11 rules applied. Total rules applied 671 place count 739 transition count 682
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 682 place count 739 transition count 671
Applied a total of 682 rules in 350 ms. Remains 739 /1119 variables (removed 380) and now considering 671/993 (removed 322) transitions.
// Phase 1: matrix 671 rows 739 cols
[2022-05-16 10:49:41] [INFO ] Computed 80 place invariants in 10 ms
[2022-05-16 10:49:41] [INFO ] Implicit Places using invariants in 191 ms returned [143, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 606]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 199 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 726/1119 places, 671/993 transitions.
Applied a total of 0 rules in 19 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 726/1119 places, 671/993 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s646 1) (GEQ s645 1) (GEQ s644 1) (GEQ s643 1) (GEQ s648 1) (GEQ s647 1) (GEQ s638 1) (GEQ s642 1) (GEQ s641 1) (GEQ s640 1) (GEQ s639 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-06 finished in 669 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(!p0))))'
Support contains 22 out of 1119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1119/1119 places, 993/993 transitions.
Discarding 77 places :
Implicit places reduction removed 77 places
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 1042 transition count 993
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 133 place count 986 transition count 937
Iterating global reduction 1 with 56 rules applied. Total rules applied 189 place count 986 transition count 937
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 222 place count 953 transition count 894
Iterating global reduction 1 with 33 rules applied. Total rules applied 255 place count 953 transition count 894
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 266 place count 942 transition count 894
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 298 place count 910 transition count 852
Iterating global reduction 2 with 32 rules applied. Total rules applied 330 place count 910 transition count 852
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 362 place count 878 transition count 820
Iterating global reduction 2 with 32 rules applied. Total rules applied 394 place count 878 transition count 820
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 415 place count 857 transition count 799
Iterating global reduction 2 with 21 rules applied. Total rules applied 436 place count 857 transition count 799
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 457 place count 836 transition count 778
Iterating global reduction 2 with 21 rules applied. Total rules applied 478 place count 836 transition count 778
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 499 place count 815 transition count 757
Iterating global reduction 2 with 21 rules applied. Total rules applied 520 place count 815 transition count 757
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 521 place count 814 transition count 757
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 542 place count 793 transition count 736
Iterating global reduction 3 with 21 rules applied. Total rules applied 563 place count 793 transition count 736
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 584 place count 772 transition count 715
Iterating global reduction 3 with 21 rules applied. Total rules applied 605 place count 772 transition count 715
Applied a total of 605 rules in 269 ms. Remains 772 /1119 variables (removed 347) and now considering 715/993 (removed 278) transitions.
// Phase 1: matrix 715 rows 772 cols
[2022-05-16 10:49:41] [INFO ] Computed 80 place invariants in 8 ms
[2022-05-16 10:49:42] [INFO ] Implicit Places using invariants in 189 ms returned [176, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 639]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 190 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 759/1119 places, 715/993 transitions.
Applied a total of 0 rules in 19 ms. Remains 759 /759 variables (removed 0) and now considering 715/715 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 759/1119 places, 715/993 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), p0]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s110 1) (GEQ s113 1) (GEQ s114 1) (GEQ s111 1) (GEQ s112 1) (GEQ s117 1) (GEQ s118 1) (GEQ s115 1) (GEQ s116 1) (GEQ s121 1) (GEQ s122 1) (GEQ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10005 reset in 286 ms.
Product exploration explored 100000 steps with 10015 reset in 300 ms.
Computed a total of 759 stabilizing places and 715 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 759 transition count 715
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
// Phase 1: matrix 715 rows 759 cols
[2022-05-16 10:49:43] [INFO ] Computed 67 place invariants in 3 ms
[2022-05-16 10:49:43] [INFO ] [Real]Absence check using 0 positive and 67 generalized place invariants in 19 ms returned sat
[2022-05-16 10:49:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:49:43] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2022-05-16 10:49:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:49:44] [INFO ] [Nat]Absence check using 0 positive and 67 generalized place invariants in 18 ms returned sat
[2022-05-16 10:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:49:44] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2022-05-16 10:49:44] [INFO ] Computed and/alt/rep : 702/791/702 causal constraints (skipped 2 transitions) in 33 ms.
[2022-05-16 10:49:44] [INFO ] Added : 22 causal constraints over 5 iterations in 307 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 22 out of 759 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 759/759 places, 715/715 transitions.
Graph (complete) has 858 edges and 759 vertex of which 88 are kept as prefixes of interest. Removing 671 places using SCC suffix rule.1 ms
Discarding 671 places :
Also discarding 616 output transitions
Drop transitions removed 616 transitions
Reduce places removed 11 places and 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 77 transition count 66
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 55 transition count 66
Applied a total of 45 rules in 12 ms. Remains 55 /759 variables (removed 704) and now considering 66/715 (removed 649) transitions.
// Phase 1: matrix 66 rows 55 cols
[2022-05-16 10:49:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 10:49:44] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 66 rows 55 cols
[2022-05-16 10:49:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 10:49:44] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-16 10:49:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 66 rows 55 cols
[2022-05-16 10:49:44] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 10:49:44] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/759 places, 66/715 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/759 places, 66/715 transitions.
Computed a total of 55 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 55 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
// Phase 1: matrix 66 rows 55 cols
[2022-05-16 10:49:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 10:49:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:49:45] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 10:49:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:49:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:49:45] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-16 10:49:45] [INFO ] Computed and/alt/rep : 44/44/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 10:49:45] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14387 reset in 209 ms.
Product exploration explored 100000 steps with 14485 reset in 190 ms.
Built C files in :
/tmp/ltsmin18084802155111095770
[2022-05-16 10:49:45] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2022-05-16 10:49:45] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:49:45] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2022-05-16 10:49:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:49:45] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2022-05-16 10:49:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:49:45] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18084802155111095770
Running compilation step : cd /tmp/ltsmin18084802155111095770;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 137 ms.
Running link step : cd /tmp/ltsmin18084802155111095770;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18084802155111095770;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased337346903540621637.hoa' '--buchi-type=spotba'
LTSmin run took 289 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-07 finished in 4730 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(p0) U p1)&&X(F(p2))))))'
Support contains 22 out of 1119 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1119/1119 places, 993/993 transitions.
Graph (complete) has 1430 edges and 1119 vertex of which 917 are kept as prefixes of interest. Removing 202 places using SCC suffix rule.4 ms
Discarding 202 places :
Also discarding 188 output transitions
Drop transitions removed 188 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions removed 462 transitions
Trivial Post-agglo rules discarded 462 transitions
Performed 462 trivial Post agglomeration. Transition count delta: 462
Iterating post reduction 0 with 528 rules applied. Total rules applied 529 place count 840 transition count 332
Reduce places removed 462 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 1 with 484 rules applied. Total rules applied 1013 place count 378 transition count 310
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1024 place count 367 transition count 310
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 1024 place count 367 transition count 200
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 44 places
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 1288 place count 213 transition count 200
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 1299 place count 202 transition count 200
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 1321 place count 180 transition count 178
Iterating global reduction 4 with 22 rules applied. Total rules applied 1343 place count 180 transition count 178
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 11 rules applied. Total rules applied 1354 place count 180 transition count 167
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1365 place count 169 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1365 place count 169 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1387 place count 158 transition count 156
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1388 place count 157 transition count 145
Iterating global reduction 6 with 1 rules applied. Total rules applied 1389 place count 157 transition count 145
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 6 with 11 rules applied. Total rules applied 1400 place count 146 transition count 145
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1400 place count 146 transition count 134
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 1422 place count 135 transition count 134
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1433 place count 124 transition count 123
Iterating global reduction 7 with 11 rules applied. Total rules applied 1444 place count 124 transition count 123
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 1488 place count 102 transition count 101
Applied a total of 1488 rules in 31 ms. Remains 102 /1119 variables (removed 1017) and now considering 101/993 (removed 892) transitions.
// Phase 1: matrix 101 rows 102 cols
[2022-05-16 10:49:46] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 10:49:46] [INFO ] Implicit Places using invariants in 43 ms returned [22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 68]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 44 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/1119 places, 101/993 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 90 transition count 90
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 79 transition count 90
Applied a total of 22 rules in 3 ms. Remains 79 /90 variables (removed 11) and now considering 90/101 (removed 11) transitions.
// Phase 1: matrix 90 rows 79 cols
[2022-05-16 10:49:46] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 10:49:46] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 90 rows 79 cols
[2022-05-16 10:49:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 10:49:46] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/1119 places, 90/993 transitions.
Finished structural reductions, in 2 iterations. Remains : 79/1119 places, 90/993 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (LT s59 1) (LT s58 1) (LT s57 1) (LT s63 1) (LT s62 1) (LT s61 1) (LT s60 1) (LT s67 1) (LT s66 1) (LT s65 1) (LT s64 1)), p1:(OR (GEQ s17 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3421 reset in 172 ms.
Product exploration explored 100000 steps with 3392 reset in 172 ms.
Computed a total of 79 stabilizing places and 90 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 79 transition count 90
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X p2), (X (X (NOT p1))), (X (X p2)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 239 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Finished random walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X p2), (X (X (NOT p1))), (X (X p2)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 221 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 90 rows 79 cols
[2022-05-16 10:49:47] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-16 10:49:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:49:47] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 10:49:47] [INFO ] Computed and/alt/rep : 66/77/66 causal constraints (skipped 2 transitions) in 4 ms.
[2022-05-16 10:49:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:49:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:49:47] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-16 10:49:47] [INFO ] Computed and/alt/rep : 66/77/66 causal constraints (skipped 2 transitions) in 4 ms.
[2022-05-16 10:49:47] [INFO ] Added : 36 causal constraints over 8 iterations in 54 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 11 out of 79 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 79 cols
[2022-05-16 10:49:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 10:49:47] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 90 rows 79 cols
[2022-05-16 10:49:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 10:49:48] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-16 10:49:48] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 90 rows 79 cols
[2022-05-16 10:49:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 10:49:48] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 90/90 transitions.
Computed a total of 79 stabilizing places and 90 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 79 transition count 90
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 90 rows 79 cols
[2022-05-16 10:49:48] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 10:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:49:48] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 10:49:48] [INFO ] Computed and/alt/rep : 66/77/66 causal constraints (skipped 2 transitions) in 4 ms.
[2022-05-16 10:49:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:49:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:49:48] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 10:49:48] [INFO ] Computed and/alt/rep : 66/77/66 causal constraints (skipped 2 transitions) in 3 ms.
[2022-05-16 10:49:48] [INFO ] Added : 36 causal constraints over 8 iterations in 51 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3392 reset in 167 ms.
Product exploration explored 100000 steps with 3397 reset in 176 ms.
Built C files in :
/tmp/ltsmin1078830228540971571
[2022-05-16 10:49:49] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2022-05-16 10:49:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:49:49] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2022-05-16 10:49:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:49:49] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2022-05-16 10:49:49] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:49:49] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1078830228540971571
Running compilation step : cd /tmp/ltsmin1078830228540971571;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 162 ms.
Running link step : cd /tmp/ltsmin1078830228540971571;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1078830228540971571;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5473867233265037195.hoa' '--buchi-type=spotba'
LTSmin run took 59 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-08 finished in 3157 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((G(p2)||p1))))'
Support contains 33 out of 1119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1119/1119 places, 993/993 transitions.
Discarding 77 places :
Implicit places reduction removed 77 places
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 1042 transition count 993
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 133 place count 986 transition count 937
Iterating global reduction 1 with 56 rules applied. Total rules applied 189 place count 986 transition count 937
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 222 place count 953 transition count 894
Iterating global reduction 1 with 33 rules applied. Total rules applied 255 place count 953 transition count 894
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 266 place count 942 transition count 894
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 298 place count 910 transition count 852
Iterating global reduction 2 with 32 rules applied. Total rules applied 330 place count 910 transition count 852
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 362 place count 878 transition count 820
Iterating global reduction 2 with 32 rules applied. Total rules applied 394 place count 878 transition count 820
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 415 place count 857 transition count 799
Iterating global reduction 2 with 21 rules applied. Total rules applied 436 place count 857 transition count 799
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 457 place count 836 transition count 778
Iterating global reduction 2 with 21 rules applied. Total rules applied 478 place count 836 transition count 778
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 489 place count 825 transition count 767
Iterating global reduction 2 with 11 rules applied. Total rules applied 500 place count 825 transition count 767
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 511 place count 814 transition count 756
Iterating global reduction 2 with 11 rules applied. Total rules applied 522 place count 814 transition count 756
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 533 place count 803 transition count 745
Iterating global reduction 2 with 11 rules applied. Total rules applied 544 place count 803 transition count 745
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 555 place count 792 transition count 734
Iterating global reduction 2 with 11 rules applied. Total rules applied 566 place count 792 transition count 734
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 577 place count 781 transition count 723
Iterating global reduction 2 with 11 rules applied. Total rules applied 588 place count 781 transition count 723
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 599 place count 770 transition count 712
Iterating global reduction 2 with 11 rules applied. Total rules applied 610 place count 770 transition count 712
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 621 place count 770 transition count 701
Applied a total of 621 rules in 319 ms. Remains 770 /1119 variables (removed 349) and now considering 701/993 (removed 292) transitions.
// Phase 1: matrix 701 rows 770 cols
[2022-05-16 10:49:49] [INFO ] Computed 81 place invariants in 9 ms
[2022-05-16 10:49:50] [INFO ] Implicit Places using invariants in 181 ms returned [143, 313, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 637]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 182 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 756/1119 places, 701/993 transitions.
Applied a total of 0 rules in 19 ms. Remains 756 /756 variables (removed 0) and now considering 701/701 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 756/1119 places, 701/993 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (OR (GEQ s267 1) (GEQ s266 1) (GEQ s265 1) (GEQ s275 1) (GEQ s274 1) (GEQ s273 1) (GEQ s272 1) (GEQ s271 1) (GEQ s270 1) (GEQ s269 1) (GEQ s26...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-09 finished in 675 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(p0)))))'
Support contains 22 out of 1119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1119/1119 places, 993/993 transitions.
Discarding 77 places :
Implicit places reduction removed 77 places
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 1042 transition count 993
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 133 place count 986 transition count 937
Iterating global reduction 1 with 56 rules applied. Total rules applied 189 place count 986 transition count 937
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 222 place count 953 transition count 894
Iterating global reduction 1 with 33 rules applied. Total rules applied 255 place count 953 transition count 894
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 266 place count 942 transition count 894
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 288 place count 920 transition count 872
Iterating global reduction 2 with 22 rules applied. Total rules applied 310 place count 920 transition count 872
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 332 place count 898 transition count 850
Iterating global reduction 2 with 22 rules applied. Total rules applied 354 place count 898 transition count 850
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 365 place count 887 transition count 839
Iterating global reduction 2 with 11 rules applied. Total rules applied 376 place count 887 transition count 839
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 387 place count 876 transition count 828
Iterating global reduction 2 with 11 rules applied. Total rules applied 398 place count 876 transition count 828
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 409 place count 865 transition count 817
Iterating global reduction 2 with 11 rules applied. Total rules applied 420 place count 865 transition count 817
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 431 place count 854 transition count 806
Iterating global reduction 2 with 11 rules applied. Total rules applied 442 place count 854 transition count 806
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 453 place count 843 transition count 795
Iterating global reduction 2 with 11 rules applied. Total rules applied 464 place count 843 transition count 795
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 475 place count 832 transition count 784
Iterating global reduction 2 with 11 rules applied. Total rules applied 486 place count 832 transition count 784
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 497 place count 821 transition count 773
Iterating global reduction 2 with 11 rules applied. Total rules applied 508 place count 821 transition count 773
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 519 place count 810 transition count 762
Iterating global reduction 2 with 11 rules applied. Total rules applied 530 place count 810 transition count 762
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 541 place count 810 transition count 751
Applied a total of 541 rules in 354 ms. Remains 810 /1119 variables (removed 309) and now considering 751/993 (removed 242) transitions.
// Phase 1: matrix 751 rows 810 cols
[2022-05-16 10:49:50] [INFO ] Computed 81 place invariants in 7 ms
[2022-05-16 10:49:50] [INFO ] Implicit Places using invariants in 193 ms returned [143, 343, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 677]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 194 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 796/1119 places, 751/993 transitions.
Applied a total of 0 rules in 21 ms. Remains 796 /796 variables (removed 0) and now considering 751/751 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 796/1119 places, 751/993 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s729 1) (GEQ s720 1) (GEQ s719 1) (GEQ s724 1) (GEQ s723 1) (GEQ s722 1) (GEQ s721 1) (GEQ s728 1) (GEQ s727 1) (GEQ s726 1) (GEQ s725 1) (AND...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 292 ms.
Product exploration explored 100000 steps with 25000 reset in 293 ms.
Computed a total of 796 stabilizing places and 751 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 796 transition count 751
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-10 finished in 1513 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0) U X(X(p1))) U (F(p2)&&(p3 U p0))))))'
Support contains 68 out of 1119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1119/1119 places, 993/993 transitions.
Graph (complete) has 1430 edges and 1119 vertex of which 1061 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.3 ms
Discarding 58 places :
Also discarding 69 output transitions
Drop transitions removed 69 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 77 places :
Implicit places reduction removed 77 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 550 rules applied. Total rules applied 551 place count 973 transition count 440
Reduce places removed 473 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 1 with 495 rules applied. Total rules applied 1046 place count 500 transition count 418
Reduce places removed 11 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 22 rules applied. Total rules applied 1068 place count 489 transition count 407
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1079 place count 478 transition count 407
Performed 165 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 165 Pre rules applied. Total rules applied 1079 place count 478 transition count 242
Deduced a syphon composed of 165 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 4 with 385 rules applied. Total rules applied 1464 place count 258 transition count 242
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 1464 place count 258 transition count 231
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1486 place count 247 transition count 231
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1497 place count 236 transition count 220
Iterating global reduction 4 with 11 rules applied. Total rules applied 1508 place count 236 transition count 220
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 1508 place count 236 transition count 209
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1530 place count 225 transition count 209
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1531 place count 224 transition count 198
Iterating global reduction 4 with 1 rules applied. Total rules applied 1532 place count 224 transition count 198
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 4 with 11 rules applied. Total rules applied 1543 place count 213 transition count 198
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1543 place count 213 transition count 187
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1565 place count 202 transition count 187
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 5 with 22 rules applied. Total rules applied 1587 place count 191 transition count 176
Applied a total of 1587 rules in 40 ms. Remains 191 /1119 variables (removed 928) and now considering 176/993 (removed 817) transitions.
// Phase 1: matrix 176 rows 191 cols
[2022-05-16 10:49:51] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 10:49:51] [INFO ] Implicit Places using invariants in 50 ms returned [67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 168]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 51 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/1119 places, 176/993 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 179 transition count 165
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 168 transition count 165
Applied a total of 22 rules in 3 ms. Remains 168 /179 variables (removed 11) and now considering 165/176 (removed 11) transitions.
// Phase 1: matrix 165 rows 168 cols
[2022-05-16 10:49:51] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 10:49:51] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 165 rows 168 cols
[2022-05-16 10:49:51] [INFO ] Computed 14 place invariants in 7 ms
[2022-05-16 10:49:52] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 168/1119 places, 165/993 transitions.
Finished structural reductions, in 2 iterations. Remains : 168/1119 places, 165/993 transitions.
Stuttering acceptance computed with spot in 508 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={0} source=1 dest: 3}, { cond=(OR p0 p3), acceptance={} source=1 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(OR (AND p0 (NOT p1)) (AND p3 (NOT p1))), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=8 dest: 8}, { cond=(OR (AND (NOT p2) p0 (NOT p1)) (AND (NOT p2) p3 (NOT p1))), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0} source=8 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=10 dest: 8}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0} source=10 dest: 10}], [{ cond=(NOT p0), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=12 dest: 12}]], initial=0, aps=[p0:(OR (AND (GEQ s44 1) (GEQ s55 1)) (AND (GEQ s50 1) (GEQ s55 1)) (AND (GEQ s49 1) (GEQ s55 1)) (AND (GEQ s48 1) (GEQ s55 1)) (AND (GEQ s51 1) (GEQ s55 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 3080 reset in 407 ms.
Product exploration explored 100000 steps with 3110 reset in 418 ms.
Computed a total of 168 stabilizing places and 165 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 168 transition count 165
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p3))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p3)))), (X (NOT (OR p0 p3))), (X (NOT (AND (NOT p0) p3))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (OR (AND (NOT p2) p0 (NOT p1)) (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) p0 (NOT p1)) (AND (NOT p2) p3 (NOT p1)))))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p3))))), (X (X (OR p0 p3))), (X (X (NOT (OR p0 p3)))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p0) p3 (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (OR (AND p0 (NOT p1)) (AND p3 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p3 (NOT p1))))))]
Knowledge based reduction with 12 factoid took 1289 ms. Reduced automaton from 13 states, 27 edges and 4 AP to 13 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 538 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2))]
Finished random walk after 35 steps, including 0 resets, run visited all 14 properties in 3 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p3))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p3)))), (X (NOT (OR p0 p3))), (X (NOT (AND (NOT p0) p3))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (OR (AND (NOT p2) p0 (NOT p1)) (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) p0 (NOT p1)) (AND (NOT p2) p3 (NOT p1)))))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p3))))), (X (X (OR p0 p3))), (X (X (NOT (OR p0 p3)))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p0) p3 (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (OR (AND p0 (NOT p1)) (AND p3 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p3 (NOT p1)))))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (OR (AND p0 (NOT p1)) (AND (NOT p1) p3))), (F (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) p3 (NOT p2)))), (F p2), (F (OR p0 p3)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND (NOT p0) p3)), (F (OR (AND p0 (NOT p2)) (AND p3 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) p3))]
Knowledge based reduction with 12 factoid took 1718 ms. Reduced automaton from 13 states, 27 edges and 4 AP to 13 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 522 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 490 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 165 rows 168 cols
[2022-05-16 10:49:58] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 10:49:58] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 4 ms returned sat
[2022-05-16 10:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:49:58] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2022-05-16 10:49:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:49:58] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-16 10:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:49:58] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2022-05-16 10:49:58] [INFO ] Computed and/alt/rep : 121/176/121 causal constraints (skipped 22 transitions) in 11 ms.
[2022-05-16 10:49:58] [INFO ] Added : 58 causal constraints over 12 iterations in 153 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 165 rows 168 cols
[2022-05-16 10:49:58] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 10:49:58] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-16 10:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:49:58] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-16 10:49:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:49:58] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-16 10:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:49:58] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-16 10:49:58] [INFO ] Computed and/alt/rep : 121/176/121 causal constraints (skipped 22 transitions) in 10 ms.
[2022-05-16 10:49:58] [INFO ] Added : 52 causal constraints over 11 iterations in 149 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 68 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 165/165 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 165/165 (removed 0) transitions.
// Phase 1: matrix 165 rows 168 cols
[2022-05-16 10:49:58] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 10:49:58] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 165 rows 168 cols
[2022-05-16 10:49:58] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 10:49:59] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2022-05-16 10:49:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 165 rows 168 cols
[2022-05-16 10:49:59] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 10:49:59] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 168/168 places, 165/165 transitions.
Computed a total of 168 stabilizing places and 165 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 168 transition count 165
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT (OR (AND p0 (NOT p2)) (AND p3 (NOT p2))))), (X (AND (NOT p0) (NOT p3))), (X (NOT (OR p0 p3))), (X (NOT (AND (NOT p0) p3))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p3 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p3 (NOT p2)))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p3)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) p3 (NOT p2)))))), (X (X (OR p0 p3))), (X (X (NOT (OR p0 p3)))), (X (X (AND (NOT p0) (NOT p1) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3))))]
Knowledge based reduction with 12 factoid took 1222 ms. Reduced automaton from 13 states, 27 edges and 4 AP to 13 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 682 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2))]
Finished random walk after 34 steps, including 0 resets, run visited all 14 properties in 4 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT (OR (AND p0 (NOT p2)) (AND p3 (NOT p2))))), (X (AND (NOT p0) (NOT p3))), (X (NOT (OR p0 p3))), (X (NOT (AND (NOT p0) p3))), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p3 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p3 (NOT p2)))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p3)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) p3 (NOT p2)))))), (X (X (OR p0 p3))), (X (X (NOT (OR p0 p3)))), (X (X (AND (NOT p0) (NOT p1) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (OR (AND p0 (NOT p1)) (AND (NOT p1) p3))), (F (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) p3 (NOT p2)))), (F p2), (F (OR p0 p3)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND (NOT p0) p3)), (F (OR (AND p0 (NOT p2)) (AND p3 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) p3))]
Knowledge based reduction with 12 factoid took 1602 ms. Reduced automaton from 13 states, 27 edges and 4 AP to 13 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 549 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 506 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 165 rows 168 cols
[2022-05-16 10:50:03] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 10:50:03] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 5 ms returned sat
[2022-05-16 10:50:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:50:03] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2022-05-16 10:50:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:50:03] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 4 ms returned sat
[2022-05-16 10:50:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:50:04] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2022-05-16 10:50:04] [INFO ] Computed and/alt/rep : 121/176/121 causal constraints (skipped 22 transitions) in 10 ms.
[2022-05-16 10:50:04] [INFO ] Added : 58 causal constraints over 12 iterations in 152 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 165 rows 168 cols
[2022-05-16 10:50:04] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 10:50:04] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-16 10:50:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 10:50:04] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-16 10:50:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 10:50:04] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 3 ms returned sat
[2022-05-16 10:50:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 10:50:04] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-16 10:50:04] [INFO ] Computed and/alt/rep : 121/176/121 causal constraints (skipped 22 transitions) in 15 ms.
[2022-05-16 10:50:04] [INFO ] Added : 52 causal constraints over 11 iterations in 149 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 537 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3100 reset in 402 ms.
Product exploration explored 100000 steps with 3100 reset in 410 ms.
Built C files in :
/tmp/ltsmin13339816376188665324
[2022-05-16 10:50:05] [INFO ] Computing symmetric may disable matrix : 165 transitions.
[2022-05-16 10:50:05] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:50:05] [INFO ] Computing symmetric may enable matrix : 165 transitions.
[2022-05-16 10:50:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:50:05] [INFO ] Computing Do-Not-Accords matrix : 165 transitions.
[2022-05-16 10:50:05] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:50:05] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13339816376188665324
Running compilation step : cd /tmp/ltsmin13339816376188665324;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 295 ms.
Running link step : cd /tmp/ltsmin13339816376188665324;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13339816376188665324;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8773118149822079623.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 68 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 165/165 transitions.
Applied a total of 0 rules in 7 ms. Remains 168 /168 variables (removed 0) and now considering 165/165 (removed 0) transitions.
// Phase 1: matrix 165 rows 168 cols
[2022-05-16 10:50:21] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 10:50:21] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 165 rows 168 cols
[2022-05-16 10:50:21] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 10:50:21] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2022-05-16 10:50:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 165 rows 168 cols
[2022-05-16 10:50:21] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 10:50:21] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 168/168 places, 165/165 transitions.
Built C files in :
/tmp/ltsmin5631480352485257397
[2022-05-16 10:50:21] [INFO ] Computing symmetric may disable matrix : 165 transitions.
[2022-05-16 10:50:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:50:21] [INFO ] Computing symmetric may enable matrix : 165 transitions.
[2022-05-16 10:50:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:50:21] [INFO ] Computing Do-Not-Accords matrix : 165 transitions.
[2022-05-16 10:50:21] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:50:21] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5631480352485257397
Running compilation step : cd /tmp/ltsmin5631480352485257397;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 282 ms.
Running link step : cd /tmp/ltsmin5631480352485257397;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5631480352485257397;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16757880772453502656.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 10:50:36] [INFO ] Flatten gal took : 8 ms
[2022-05-16 10:50:36] [INFO ] Flatten gal took : 7 ms
[2022-05-16 10:50:36] [INFO ] Time to serialize gal into /tmp/LTL15208088248848898787.gal : 1 ms
[2022-05-16 10:50:36] [INFO ] Time to serialize properties into /tmp/LTL5821988183126776997.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15208088248848898787.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5821988183126776997.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1520808...267
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("((((((lc2_0>=1)&&(c4_0>=1))||((lc2_6>=1)&&(c4_0>=1)))||(((lc2_5>=1)&&(c4_0>=1))||((lc2_4>=1)&&(c4_0>=1))))||((((lc2_7>=1)&...1734
Formula 0 simplified : !FG((F"((((((lc2_0>=1)&&(c4_0>=1))||((lc2_6>=1)&&(c4_0>=1)))||(((lc2_5>=1)&&(c4_0>=1))||((lc2_4>=1)&&(c4_0>=1))))||((((lc2_7>=1)&&(c...1719
Detected timeout of ITS tools.
[2022-05-16 10:50:51] [INFO ] Flatten gal took : 7 ms
[2022-05-16 10:50:51] [INFO ] Applying decomposition
[2022-05-16 10:50:51] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5164659920266240175.txt' '-o' '/tmp/graph5164659920266240175.bin' '-w' '/tmp/graph5164659920266240175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5164659920266240175.bin' '-l' '-1' '-v' '-w' '/tmp/graph5164659920266240175.weights' '-q' '0' '-e' '0.001'
[2022-05-16 10:50:51] [INFO ] Decomposing Gal with order
[2022-05-16 10:50:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 10:50:51] [INFO ] Removed a total of 80 redundant transitions.
[2022-05-16 10:50:51] [INFO ] Flatten gal took : 15 ms
[2022-05-16 10:50:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 10:50:51] [INFO ] Time to serialize gal into /tmp/LTL6436400062805342242.gal : 3 ms
[2022-05-16 10:50:51] [INFO ] Time to serialize properties into /tmp/LTL1443482515367260607.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6436400062805342242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1443482515367260607.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6436400...245
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("((((((i0.u18.lc2_0>=1)&&(i4.i0.u8.c4_0>=1))||((i5.u27.lc2_6>=1)&&(i4.i0.u8.c4_0>=1)))||(((i1.u26.lc2_5>=1)&&(i4.i0.u8.c4_0...2717
Formula 0 simplified : !FG((F"((((((i0.u18.lc2_0>=1)&&(i4.i0.u8.c4_0>=1))||((i5.u27.lc2_6>=1)&&(i4.i0.u8.c4_0>=1)))||(((i1.u26.lc2_5>=1)&&(i4.i0.u8.c4_0>=1...2702
Reverse transition relation is NOT exact ! Due to transitions t464, t466, t471, i9.t472, i9.t470, i9.t469, i9.t468, i9.t467, i9.t465, i9.t463, i9.t462, In...252
Computing Next relation with stutter on 55 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8452442674076435707
[2022-05-16 10:51:06] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8452442674076435707
Running compilation step : cd /tmp/ltsmin8452442674076435707;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 259 ms.
Running link step : cd /tmp/ltsmin8452442674076435707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8452442674076435707;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((<>((LTLAPp0==true)) U X(X((LTLAPp1==true)))) U (<>((LTLAPp2==true))&&((LTLAPp3==true) U (LTLAPp0==true))))))' '--buchi-type=spotba'
LTSmin run took 4291 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-12 finished in 79440 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(X(p0))))))'
Support contains 33 out of 1119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1119/1119 places, 993/993 transitions.
Graph (complete) has 1430 edges and 1119 vertex of which 783 are kept as prefixes of interest. Removing 336 places using SCC suffix rule.2 ms
Discarding 336 places :
Also discarding 289 output transitions
Drop transitions removed 289 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions removed 495 transitions
Trivial Post-agglo rules discarded 495 transitions
Performed 495 trivial Post agglomeration. Transition count delta: 495
Iterating post reduction 0 with 561 rules applied. Total rules applied 562 place count 706 transition count 198
Reduce places removed 495 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 1 with 517 rules applied. Total rules applied 1079 place count 211 transition count 176
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1090 place count 200 transition count 176
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 1090 place count 200 transition count 132
Deduced a syphon composed of 44 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 1200 place count 134 transition count 132
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 22 rules applied. Total rules applied 1222 place count 134 transition count 110
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1244 place count 112 transition count 110
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1255 place count 101 transition count 99
Iterating global reduction 5 with 11 rules applied. Total rules applied 1266 place count 101 transition count 99
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1266 place count 101 transition count 88
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1288 place count 90 transition count 88
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 33 rules applied. Total rules applied 1321 place count 68 transition count 77
Applied a total of 1321 rules in 15 ms. Remains 68 /1119 variables (removed 1051) and now considering 77/993 (removed 916) transitions.
// Phase 1: matrix 77 rows 68 cols
[2022-05-16 10:51:11] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 10:51:11] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 77 rows 68 cols
[2022-05-16 10:51:11] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 10:51:11] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2022-05-16 10:51:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 77 rows 68 cols
[2022-05-16 10:51:11] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 10:51:11] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/1119 places, 77/993 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/1119 places, 77/993 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s40 1) (LT s56 1)) (OR (LT s37 1) (LT s50 1)) (OR (LT s40 1) (LT s57 1)) (OR (LT s43 1) (LT s63 1)) (OR (LT s37 1) (LT s51 1)) (OR (LT s38...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2857 reset in 235 ms.
Product exploration explored 100000 steps with 2844 reset in 243 ms.
Computed a total of 68 stabilizing places and 77 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 68 transition count 77
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-13 finished in 840 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 44 out of 1119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1119/1119 places, 993/993 transitions.
Graph (complete) has 1430 edges and 1119 vertex of which 242 are kept as prefixes of interest. Removing 877 places using SCC suffix rule.3 ms
Discarding 877 places :
Also discarding 784 output transitions
Drop transitions removed 784 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 209 transition count 110
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 199 place count 121 transition count 110
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 199 place count 121 transition count 88
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 243 place count 99 transition count 88
Applied a total of 243 rules in 11 ms. Remains 99 /1119 variables (removed 1020) and now considering 88/993 (removed 905) transitions.
// Phase 1: matrix 88 rows 99 cols
[2022-05-16 10:51:12] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 10:51:12] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 88 rows 99 cols
[2022-05-16 10:51:12] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-16 10:51:12] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2022-05-16 10:51:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 88 rows 99 cols
[2022-05-16 10:51:12] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-16 10:51:12] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/1119 places, 88/993 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/1119 places, 88/993 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s56 1) (LT s78 1)) (OR (LT s61 1) (LT s83 1)) (OR (LT s64 1) (LT s86 1)) (OR (LT s69 1) (LT s91 1)) (OR (LT s72 1) (LT s94 1)) (OR (LT s63...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2222 reset in 265 ms.
Product exploration explored 100000 steps with 2222 reset in 299 ms.
Computed a total of 99 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-14 finished in 878 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X(!(p0 U X(p1)))&&p2)))))'
[2022-05-16 10:51:13] [INFO ] Flatten gal took : 66 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15916843955639943646
[2022-05-16 10:51:13] [INFO ] Computing symmetric may disable matrix : 993 transitions.
[2022-05-16 10:51:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:51:13] [INFO ] Computing symmetric may enable matrix : 993 transitions.
[2022-05-16 10:51:13] [INFO ] Applying decomposition
[2022-05-16 10:51:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:51:13] [INFO ] Flatten gal took : 32 ms
[2022-05-16 10:51:13] [INFO ] Computing Do-Not-Accords matrix : 993 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12560910719366519243.txt' '-o' '/tmp/graph12560910719366519243.bin' '-w' '/tmp/graph12560910719366519243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12560910719366519243.bin' '-l' '-1' '-v' '-w' '/tmp/graph12560910719366519243.weights' '-q' '0' '-e' '0.001'
[2022-05-16 10:51:13] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:51:13] [INFO ] Built C files in 127ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15916843955639943646
Running compilation step : cd /tmp/ltsmin15916843955639943646;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 10:51:13] [INFO ] Decomposing Gal with order
[2022-05-16 10:51:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 10:51:13] [INFO ] Removed a total of 126 redundant transitions.
[2022-05-16 10:51:13] [INFO ] Flatten gal took : 86 ms
[2022-05-16 10:51:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 20 ms.
[2022-05-16 10:51:13] [INFO ] Time to serialize gal into /tmp/LTLFireability2555457655935736489.gal : 26 ms
[2022-05-16 10:51:13] [INFO ] Time to serialize properties into /tmp/LTLFireability2904356138181107423.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2555457655935736489.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2904356138181107423.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((G(F(G((X(!(("((((((i20.u297.p2_19>=1)||(i19.u298.p2_20>=1))||((i19.u309.p2_21>=1)||(i13.u299.p2_0>=1)))||(((i13.u300.p2_1>=1)||(i21...2757
Formula 0 simplified : !GFG("(((((((i20.u297.p2_19<1)&&(i19.u298.p2_20<1))&&((i19.u309.p2_21<1)&&(i13.u299.p2_0<1)))&&(((i13.u300.p2_1<1)&&(i21.i1.i1.u288....2742
Compilation finished in 2609 ms.
Running link step : cd /tmp/ltsmin15916843955639943646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin15916843955639943646;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]((X(!((LTLAPp0==true) U X((LTLAPp1==true))))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 11:12:13] [INFO ] Applying decomposition
[2022-05-16 11:12:13] [INFO ] Flatten gal took : 51 ms
[2022-05-16 11:12:13] [INFO ] Decomposing Gal with order
[2022-05-16 11:12:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 11:12:13] [INFO ] Removed a total of 185 redundant transitions.
[2022-05-16 11:12:13] [INFO ] Flatten gal took : 99 ms
[2022-05-16 11:12:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 11:12:14] [INFO ] Time to serialize gal into /tmp/LTLFireability12289178873734209390.gal : 24 ms
[2022-05-16 11:12:14] [INFO ] Time to serialize properties into /tmp/LTLFireability8539453762509262184.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12289178873734209390.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8539453762509262184.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((G(F(G((X(!(("((((((LegalResidentPublicAdminOffice19.p2_19>=1)||(LegalResidentPublicAdminOffice20.p2_20>=1))||((LegalResidentPublicA...4593
Formula 0 simplified : !GFG("(((((((LegalResidentPublicAdminOffice19.p2_19<1)&&(LegalResidentPublicAdminOffice20.p2_20<1))&&((LegalResidentPublicAdminOffic...4578
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.058: LTL layer: formula: [](<>([]((X(!((LTLAPp0==true) U X((LTLAPp1==true))))&&(LTLAPp2==true)))))
pins2lts-mc-linux64( 7/ 8), 0.058: "[](<>([]((X(!((LTLAPp0==true) U X((LTLAPp1==true))))&&(LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.058: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.081: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.081: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.183: There are 997 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.183: State length is 1120, there are 998 groups
pins2lts-mc-linux64( 0/ 8), 0.183: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.183: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.183: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.183: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.329: [Blue] ~120 levels ~960 states ~10912 transitions
pins2lts-mc-linux64( 7/ 8), 0.443: [Blue] ~240 levels ~1920 states ~21624 transitions
pins2lts-mc-linux64( 6/ 8), 0.621: [Blue] ~480 levels ~3840 states ~37736 transitions
pins2lts-mc-linux64( 2/ 8), 0.831: [Blue] ~646 levels ~7680 states ~51400 transitions
pins2lts-mc-linux64( 6/ 8), 1.177: [Blue] ~645 levels ~15360 states ~71368 transitions
pins2lts-mc-linux64( 7/ 8), 1.930: [Blue] ~646 levels ~30720 states ~129784 transitions
pins2lts-mc-linux64( 1/ 8), 3.336: [Blue] ~644 levels ~61440 states ~265840 transitions
pins2lts-mc-linux64( 1/ 8), 6.153: [Blue] ~644 levels ~122880 states ~542808 transitions
pins2lts-mc-linux64( 1/ 8), 11.696: [Blue] ~644 levels ~245760 states ~1102968 transitions
pins2lts-mc-linux64( 3/ 8), 22.640: [Blue] ~645 levels ~491520 states ~2188464 transitions
pins2lts-mc-linux64( 0/ 8), 43.547: [Blue] ~645 levels ~983040 states ~4507184 transitions
pins2lts-mc-linux64( 0/ 8), 85.620: [Blue] ~645 levels ~1966080 states ~9175488 transitions
pins2lts-mc-linux64( 3/ 8), 169.923: [Blue] ~645 levels ~3932160 states ~19827552 transitions
pins2lts-mc-linux64( 0/ 8), 339.682: [Blue] ~645 levels ~7864320 states ~41329224 transitions
pins2lts-mc-linux64( 0/ 8), 677.364: [Blue] ~645 levels ~15728640 states ~80665416 transitions
pins2lts-mc-linux64( 3/ 8), 1359.082: [Blue] ~645 levels ~31457280 states ~177761688 transitions
pins2lts-mc-linux64( 3/ 8), 2357.679: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2357.711:
pins2lts-mc-linux64( 0/ 8), 2357.711: Explored 53898130 states 327205902 transitions, fanout: 6.071
pins2lts-mc-linux64( 0/ 8), 2357.711: Total exploration time 2357.510 sec (2357.480 sec minimum, 2357.492 sec on average)
pins2lts-mc-linux64( 0/ 8), 2357.711: States per second: 22862, Transitions per second: 138793
pins2lts-mc-linux64( 0/ 8), 2357.711:
pins2lts-mc-linux64( 0/ 8), 2357.711: State space has 53935616 states, 28546 are accepting
pins2lts-mc-linux64( 0/ 8), 2357.711: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 2357.711: blue states: 53898130 (99.93%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 2357.711: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 2357.711: all-red states: 29718 (0.06%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 2357.711:
pins2lts-mc-linux64( 0/ 8), 2357.711: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 2357.711:
pins2lts-mc-linux64( 0/ 8), 2357.711: Queue width: 8B, total height: 5163, memory: 0.04MB
pins2lts-mc-linux64( 0/ 8), 2357.711: Tree memory: 667.5MB, 13.0 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 2357.711: Tree fill ratio (roots/leafs): 40.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 2357.711: Stored 1004 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2357.711: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2357.711: Est. total memory use: 667.5MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15916843955639943646;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]((X(!((LTLAPp0==true) U X((LTLAPp1==true))))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15916843955639943646;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]((X(!((LTLAPp0==true) U X((LTLAPp1==true))))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 11:33:13] [INFO ] Flatten gal took : 26 ms
[2022-05-16 11:33:13] [INFO ] Input system was already deterministic with 993 transitions.
[2022-05-16 11:33:13] [INFO ] Transformed 1119 places.
[2022-05-16 11:33:13] [INFO ] Transformed 993 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 11:33:13] [INFO ] Time to serialize gal into /tmp/LTLFireability13383570908797986835.gal : 4 ms
[2022-05-16 11:33:13] [INFO ] Time to serialize properties into /tmp/LTLFireability18249437813557737767.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13383570908797986835.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18249437813557737767.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(G((X(!(("((((((p2_19>=1)||(p2_20>=1))||((p2_21>=1)||(p2_0>=1)))||(((p2_1>=1)||(p2_2>=1))||((p2_3>=1)||(p2_4>=1))))||((((p2_5>=1...1529
Formula 0 simplified : !GFG("(((((((p2_19<1)&&(p2_20<1))&&((p2_21<1)&&(p2_0<1)))&&(((p2_1<1)&&(p2_2<1))&&((p2_3<1)&&(p2_4<1))))&&((((p2_5<1)&&(p2_6<1))&&((...1514

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-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 r078-tall-165260110600620"
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 ;