Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860101900100.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
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 r086-smll-174860101900100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 24 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 134K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml 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 1748667890955

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00010M0001C001P001G001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-05-31 05:04:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 05:04:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 05:04:53] [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.
[2025-05-31 05:04:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-31 05:04:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1367 ms
[2025-05-31 05:04:55] [INFO ] Detected 5 constant HL places corresponding to 10 PT places.
[2025-05-31 05:04:55] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 1486 PT places and 1245.0 transition bindings in 48 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2025-05-31 05:04:55] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 12 ms.
[2025-05-31 05:04:55] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 2 formulas.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-14 FALSE 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 13 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).
RANDOM walk for 40016 steps (56 resets) in 531 ms. (75 steps per ms) remains 1/31 properties
BEST_FIRST walk for 6665 steps (0 resets) in 64 ms. (102 steps per ms) remains 0/1 properties
[2025-05-31 05:04:56] [INFO ] Flatten gal took : 52 ms
[2025-05-31 05:04:56] [INFO ] Flatten gal took : 21 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
[2025-05-31 05:04:56] [INFO ] Unfolded HLPN to a Petri net with 1379 places and 1069 transitions 3062 arcs in 89 ms.
[2025-05-31 05:04:56] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2025-05-31 05:04:56] [INFO ] Reduced 11 identical enabling conditions.
Deduced a syphon composed of 11 places in 26 ms
Reduce places removed 19 places and 0 transitions.
Support contains 720 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 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 1263 transition count 1069
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 130 place count 1230 transition count 1036
Iterating global reduction 1 with 33 rules applied. Total rules applied 163 place count 1230 transition count 1036
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 174 place count 1219 transition count 1025
Iterating global reduction 1 with 11 rules applied. Total rules applied 185 place count 1219 transition count 1025
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 196 place count 1208 transition count 1014
Iterating global reduction 1 with 11 rules applied. Total rules applied 207 place count 1208 transition count 1014
Applied a total of 207 rules in 389 ms. Remains 1208 /1360 variables (removed 152) and now considering 1014/1069 (removed 55) transitions.
// Phase 1: matrix 1014 rows 1208 cols
[2025-05-31 05:04:57] [INFO ] Computed 247 invariants in 107 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:04:58] [INFO ] Implicit Places using invariants in 1287 ms returned [231, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 863, 864, 865, 866, 867, 868, 869, 870, 871, 872, 873]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 1360 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1185/1360 places, 1014/1069 transitions.
Applied a total of 0 rules in 41 ms. Remains 1185 /1185 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1811 ms. Remains : 1185/1360 places, 1014/1069 transitions.
Support contains 720 out of 1185 places after structural reductions.
[2025-05-31 05:04:58] [INFO ] Flatten gal took : 168 ms
[2025-05-31 05:04:58] [INFO ] Flatten gal took : 166 ms
[2025-05-31 05:04:59] [INFO ] Input system was already deterministic with 1014 transitions.
Support contains 687 out of 1185 places (down from 720) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 32264 steps (48 resets) in 877 ms. (36 steps per ms) remains 0/32 properties
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1185 stabilizing places and 1014 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1185 transition count 1014
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p1)||p0))||(F(G(p2)) U p3)))'
Support contains 57 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1014/1014 transitions.
Discarding 121 places :
Implicit places reduction removed 121 places
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 1064 transition count 1014
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 155 place count 1030 transition count 980
Iterating global reduction 1 with 34 rules applied. Total rules applied 189 place count 1030 transition count 980
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 200 place count 1019 transition count 959
Iterating global reduction 1 with 11 rules applied. Total rules applied 211 place count 1019 transition count 959
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 222 place count 1008 transition count 959
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 233 place count 997 transition count 948
Iterating global reduction 2 with 11 rules applied. Total rules applied 244 place count 997 transition count 948
Applied a total of 244 rules in 1221 ms. Remains 997 /1185 variables (removed 188) and now considering 948/1014 (removed 66) transitions.
// Phase 1: matrix 948 rows 997 cols
[2025-05-31 05:05:01] [INFO ] Computed 92 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:05:02] [INFO ] Implicit Places using invariants in 635 ms returned [99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 496, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 864]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 642 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 973/1185 places, 948/1014 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 952 transition count 927
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 952 transition count 927
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 942 transition count 907
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 942 transition count 907
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 932 transition count 897
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 932 transition count 897
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 922 transition count 887
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 922 transition count 887
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 912 transition count 877
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 912 transition count 877
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 902 transition count 867
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 902 transition count 867
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 892 transition count 857
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 892 transition count 857
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 882 transition count 847
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 882 transition count 847
Applied a total of 182 rules in 786 ms. Remains 882 /973 variables (removed 91) and now considering 847/948 (removed 101) transitions.
// Phase 1: matrix 847 rows 882 cols
[2025-05-31 05:05:02] [INFO ] Computed 68 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:05:03] [INFO ] Implicit Places using invariants in 432 ms returned []
[2025-05-31 05:05:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:05:04] [INFO ] Implicit Places using invariants and state equation in 1302 ms returned []
Implicit Place search using SMT with State Equation took 1751 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 882/1185 places, 847/1014 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4401 ms. Remains : 882/1185 places, 847/1014 transitions.
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-00
Product exploration explored 100000 steps with 859 reset in 1136 ms.
Product exploration explored 100000 steps with 863 reset in 675 ms.
Computed a total of 882 stabilizing places and 847 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 882 transition count 847
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 148 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 17 states, 60 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1048 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false, false, false, false, false, false, false]
RANDOM walk for 40000 steps (60 resets) in 1206 ms. (33 steps per ms) remains 1/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 945 ms. (42 steps per ms) remains 1/1 properties
[2025-05-31 05:05:09] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 687/744 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/744 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/874 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/874 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1712/1729 variables, and 942 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1639 ms.
Refiners :[Generalized P Invariants (flows): 68/68 constraints, State Equation: 874/882 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 687/744 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/744 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/874 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/874 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1712/1729 variables, and 942 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1710 ms.
Refiners :[Generalized P Invariants (flows): 68/68 constraints, State Equation: 874/882 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3408ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 882 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 882/882 places, 847/847 transitions.
Graph (complete) has 1034 edges and 882 vertex of which 618 are kept as prefixes of interest. Removing 264 places using SCC suffix rule.5 ms
Discarding 264 places :
Also discarding 220 output transitions
Drop transitions (Output transitions of discarded places.) removed 220 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 363 transitions
Trivial Post-agglo rules discarded 363 transitions
Performed 363 trivial Post agglomeration. Transition count delta: 363
Iterating post reduction 0 with 363 rules applied. Total rules applied 364 place count 618 transition count 264
Reduce places removed 363 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 385 rules applied. Total rules applied 749 place count 255 transition count 242
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 771 place count 233 transition count 242
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 771 place count 233 transition count 176
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 925 place count 145 transition count 176
Free-agglomeration rule applied 22 times.
Iterating global reduction 3 with 22 rules applied. Total rules applied 947 place count 145 transition count 154
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 969 place count 123 transition count 154
Applied a total of 969 rules in 99 ms. Remains 123 /882 variables (removed 759) and now considering 154/847 (removed 693) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 123/882 places, 154/847 transitions.
RANDOM walk for 188 steps (0 resets) in 5 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p0 p1 p2 (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR p0 (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT (OR p0 p1 (NOT p2) (NOT p3)))), (F p0), (F p2), (F (NOT (OR (NOT p0) p1 (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F p3), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F p1), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3)))]
Knowledge based reduction with 19 factoid took 1333 ms. Reduced automaton from 17 states, 60 edges and 4 AP (stutter insensitive) to 17 states, 60 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 927 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 914 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false, false, false, false, false, false, false]
[2025-05-31 05:05:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:05:17] [INFO ] [Real]Absence check using 0 positive and 68 generalized place invariants in 61 ms returned sat
[2025-05-31 05:05:30] [INFO ] [Real]Absence check using state equation in 13675 ms returned sat
[2025-05-31 05:05:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:05:31] [INFO ] [Nat]Absence check using 0 positive and 68 generalized place invariants in 68 ms returned sat
[2025-05-31 05:05:45] [INFO ] [Nat]Absence check using state equation in 13828 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
[2025-05-31 05:05:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:05:46] [INFO ] [Real]Absence check using 0 positive and 68 generalized place invariants in 56 ms returned sat
[2025-05-31 05:05:56] [INFO ] [Real]Absence check using state equation in 9868 ms returned sat
[2025-05-31 05:05:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:05:57] [INFO ] [Nat]Absence check using 0 positive and 68 generalized place invariants in 57 ms returned sat
[2025-05-31 05:06:07] [INFO ] [Nat]Absence check using state equation in 9936 ms returned sat
[2025-05-31 05:06:07] [INFO ] Computed and/alt/rep : 812/912/812 causal constraints (skipped 24 transitions) in 67 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-05-31 05:06:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1) (NOT p3))
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p3))
Support contains 57 out of 882 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 882/882 places, 847/847 transitions.
Graph (complete) has 1034 edges and 882 vertex of which 618 are kept as prefixes of interest. Removing 264 places using SCC suffix rule.9 ms
Discarding 264 places :
Also discarding 220 output transitions
Drop transitions (Output transitions of discarded places.) removed 220 transitions
Reduce places removed 11 places and 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 363 transitions
Trivial Post-agglo rules discarded 363 transitions
Performed 363 trivial Post agglomeration. Transition count delta: 363
Iterating post reduction 0 with 363 rules applied. Total rules applied 364 place count 607 transition count 253
Reduce places removed 363 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 385 rules applied. Total rules applied 749 place count 244 transition count 231
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 771 place count 222 transition count 231
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 771 place count 222 transition count 176
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 903 place count 145 transition count 176
Applied a total of 903 rules in 72 ms. Remains 145 /882 variables (removed 737) and now considering 176/847 (removed 671) transitions.
// Phase 1: matrix 176 rows 145 cols
[2025-05-31 05:06:11] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:06:11] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-05-31 05:06:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:06:12] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:06:12] [INFO ] Redundant transitions in 11 ms returned []
Running 154 sub problems to find dead transitions.
[2025-05-31 05:06:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 176/310 variables, 134/135 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 11/321 variables, 11/146 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/321 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 146 constraints, problems are : Problem set: 0 solved, 154 unsolved in 13123 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 176/310 variables, 134/135 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 154/289 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 11/321 variables, 11/300 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 300 constraints, problems are : Problem set: 0 solved, 154 unsolved in 19133 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32354ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 32357ms
Starting structural reductions in SI_LTL mode, iteration 1 : 145/882 places, 176/847 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32718 ms. Remains : 145/882 places, 176/847 transitions.
Computed a total of 145 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 145 transition count 176
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT p0)), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 49 factoid took 208 ms. Reduced automaton from 17 states, 60 edges and 4 AP (stutter insensitive) to 17 states, 60 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1023 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false, false, false, false, false, false, false]
RANDOM walk for 1103 steps (8 resets) in 27 ms. (39 steps per ms) remains 0/22 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT p0)), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p0 p1 p2 (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR p0 (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT (OR p0 p1 (NOT p2) (NOT p3)))), (F p0), (F p2), (F (NOT (OR (NOT p0) p1 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F p3), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F p1), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3)))]
Knowledge based reduction with 49 factoid took 1412 ms. Reduced automaton from 17 states, 60 edges and 4 AP (stutter insensitive) to 17 states, 60 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1012 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 1011 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false, false, false, false, false, false, false]
[2025-05-31 05:06:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:06:49] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2025-05-31 05:06:50] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2025-05-31 05:06:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:06:50] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2025-05-31 05:06:50] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2025-05-31 05:06:50] [INFO ] Computed and/alt/rep : 132/154/132 causal constraints (skipped 22 transitions) in 20 ms.
[2025-05-31 05:06:51] [INFO ] Added : 66 causal constraints over 14 iterations in 495 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
[2025-05-31 05:06:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:06:51] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-31 05:06:51] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2025-05-31 05:06:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:06:51] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-31 05:06:52] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2025-05-31 05:06:52] [INFO ] Computed and/alt/rep : 132/154/132 causal constraints (skipped 22 transitions) in 19 ms.
[2025-05-31 05:06:52] [INFO ] Added : 49 causal constraints over 10 iterations in 335 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 1021 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 7492 reset in 1014 ms.
Product exploration explored 100000 steps with 7528 reset in 648 ms.
Built C files in :
/tmp/ltsmin12262363678571704499
[2025-05-31 05:06:55] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2025-05-31 05:06:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:06:55] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2025-05-31 05:06:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:06:55] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2025-05-31 05:06:55] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:06:55] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12262363678571704499
Running compilation step : cd /tmp/ltsmin12262363678571704499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 808 ms.
Running link step : cd /tmp/ltsmin12262363678571704499;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin12262363678571704499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8205834018743398963.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 57 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 145 /145 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-05-31 05:07:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:07:10] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-05-31 05:07:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:07:10] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:07:10] [INFO ] Redundant transitions in 11 ms returned []
Running 154 sub problems to find dead transitions.
[2025-05-31 05:07:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 176/310 variables, 134/135 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 11/321 variables, 11/146 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/321 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 146 constraints, problems are : Problem set: 0 solved, 154 unsolved in 9696 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 176/310 variables, 134/135 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 154/289 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 11/321 variables, 11/300 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 300 constraints, problems are : Problem set: 0 solved, 154 unsolved in 15571 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25298ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 25300ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25529 ms. Remains : 145/145 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin11014343430660192707
[2025-05-31 05:07:35] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2025-05-31 05:07:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:07:35] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2025-05-31 05:07:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:07:35] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2025-05-31 05:07:35] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:07:35] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11014343430660192707
Running compilation step : cd /tmp/ltsmin11014343430660192707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 800 ms.
Running link step : cd /tmp/ltsmin11014343430660192707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin11014343430660192707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18207010457852518154.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 05:07:51] [INFO ] Flatten gal took : 10 ms
[2025-05-31 05:07:51] [INFO ] Flatten gal took : 8 ms
[2025-05-31 05:07:51] [INFO ] Time to serialize gal into /tmp/LTL2787182438355759908.gal : 3 ms
[2025-05-31 05:07:51] [INFO ] Time to serialize properties into /tmp/LTL8811035420137145753.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2787182438355759908.gal' '-t' 'CGAL' '-hoa' '/tmp/aut353836581321331775.hoa' '-atoms' '/tmp/LTL8811035420137145753.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL8811035420137145753.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut353836581321331775.hoa
Reverse transition relation is NOT exact ! Due to transitions t847, t848, t849, t850, t851, t852, t853, t854, t855, t856, t857, t858, t859, t860, t861, t86...294
Computing Next relation with stutter on 1 deadlock states
25 unique states visited
0 strongly connected components in search stack
24 transitions explored
24 items max in DFS search stack
1011 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.1544,256252,1,0,400,1.40684e+06,472,287,4529,1.27889e+06,940
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-00 finished in 182565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X(p1)))))'
Support contains 55 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1014/1014 transitions.
Discarding 99 places :
Implicit places reduction removed 99 places
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1086 transition count 1014
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 134 place count 1051 transition count 969
Iterating global reduction 1 with 35 rules applied. Total rules applied 169 place count 1051 transition count 969
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 191 place count 1029 transition count 937
Iterating global reduction 1 with 22 rules applied. Total rules applied 213 place count 1029 transition count 937
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 224 place count 1018 transition count 937
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 235 place count 1007 transition count 926
Iterating global reduction 2 with 11 rules applied. Total rules applied 246 place count 1007 transition count 926
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 257 place count 996 transition count 915
Iterating global reduction 2 with 11 rules applied. Total rules applied 268 place count 996 transition count 915
Applied a total of 268 rules in 236 ms. Remains 996 /1185 variables (removed 189) and now considering 915/1014 (removed 99) transitions.
// Phase 1: matrix 915 rows 996 cols
[2025-05-31 05:08:02] [INFO ] Computed 114 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:08:03] [INFO ] Implicit Places using invariants in 602 ms returned [99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 507, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 598, 863]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 609 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 971/1185 places, 915/1014 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 950 transition count 894
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 950 transition count 894
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 940 transition count 874
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 940 transition count 874
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 930 transition count 864
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 930 transition count 864
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 920 transition count 854
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 920 transition count 854
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 910 transition count 844
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 910 transition count 844
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 900 transition count 834
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 900 transition count 834
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 890 transition count 824
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 890 transition count 824
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 880 transition count 814
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 880 transition count 814
Applied a total of 182 rules in 469 ms. Remains 880 /971 variables (removed 91) and now considering 814/915 (removed 101) transitions.
// Phase 1: matrix 814 rows 880 cols
[2025-05-31 05:08:04] [INFO ] Computed 89 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:08:04] [INFO ] Implicit Places using invariants in 444 ms returned []
[2025-05-31 05:08:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:08:05] [INFO ] Implicit Places using invariants and state equation in 1248 ms returned []
Implicit Place search using SMT with State Equation took 1696 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 880/1185 places, 814/1014 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3010 ms. Remains : 880/1185 places, 814/1014 transitions.
Stuttering acceptance computed with spot in 354 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 460 ms.
Product exploration explored 100000 steps with 25000 reset in 484 ms.
Computed a total of 880 stabilizing places and 814 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 880 transition count 814
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 151 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 144 steps (0 resets) in 5 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 11 out of 880 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 880/880 places, 814/814 transitions.
Applied a total of 0 rules in 56 ms. Remains 880 /880 variables (removed 0) and now considering 814/814 (removed 0) transitions.
[2025-05-31 05:08:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:08:09] [INFO ] Implicit Places using invariants in 458 ms returned []
[2025-05-31 05:08:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:08:10] [INFO ] Implicit Places using invariants and state equation in 1244 ms returned []
Implicit Place search using SMT with State Equation took 1706 ms to find 0 implicit places.
Running 803 sub problems to find dead transitions.
[2025-05-31 05:08:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 803 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/1694 variables, and 87 constraints, problems are : Problem set: 0 solved, 803 unsolved in 30068 ms.
Refiners :[Generalized P Invariants (flows): 87/89 constraints, State Equation: 0/880 constraints, PredecessorRefiner: 803/803 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 803 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 803 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/1694 variables, and 87 constraints, problems are : Problem set: 0 solved, 803 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 87/89 constraints, State Equation: 0/880 constraints, PredecessorRefiner: 0/803 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 803 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Finished structural reductions in LTL mode , in 1 iterations and 62033 ms. Remains : 880/880 places, 814/814 transitions.
Computed a total of 880 stabilizing places and 814 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 880 transition count 814
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p1, (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 131 steps (0 resets) in 5 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 369 ms.
Product exploration explored 100000 steps with 25000 reset in 398 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 11 out of 880 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 880/880 places, 814/814 transitions.
Graph (complete) has 1001 edges and 880 vertex of which 11 are kept as prefixes of interest. Removing 869 places using SCC suffix rule.5 ms
Discarding 869 places :
Also discarding 803 output transitions
Drop transitions (Output transitions of discarded places.) removed 803 transitions
Applied a total of 1 rules in 11 ms. Remains 11 /880 variables (removed 869) and now considering 11/814 (removed 803) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:09:13] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/880 places, 11/814 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21 ms. Remains : 11/880 places, 11/814 transitions.
Built C files in :
/tmp/ltsmin2660010152783565188
[2025-05-31 05:09:13] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2660010152783565188
Running compilation step : cd /tmp/ltsmin2660010152783565188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2541 ms.
Running link step : cd /tmp/ltsmin2660010152783565188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin2660010152783565188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6718528103583990689.hoa' '--buchi-type=spotba'
LTSmin run took 548 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-01 finished in 74053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p0||X(p1)))&&F((G(F(p2))||(F(p2)&&p3)))))))'
Support contains 57 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1014/1014 transitions.
Discarding 121 places :
Implicit places reduction removed 121 places
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 1064 transition count 1014
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 154 place count 1031 transition count 971
Iterating global reduction 1 with 33 rules applied. Total rules applied 187 place count 1031 transition count 971
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 209 place count 1009 transition count 939
Iterating global reduction 1 with 22 rules applied. Total rules applied 231 place count 1009 transition count 939
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 242 place count 998 transition count 939
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 264 place count 976 transition count 917
Iterating global reduction 2 with 22 rules applied. Total rules applied 286 place count 976 transition count 917
Applied a total of 286 rules in 266 ms. Remains 976 /1185 variables (removed 209) and now considering 917/1014 (removed 97) transitions.
// Phase 1: matrix 917 rows 976 cols
[2025-05-31 05:09:17] [INFO ] Computed 92 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:17] [INFO ] Implicit Places using invariants in 717 ms returned [99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 474, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 565, 843]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 726 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 951/1185 places, 917/1014 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 930 transition count 896
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 930 transition count 896
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 920 transition count 876
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 920 transition count 876
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 910 transition count 866
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 910 transition count 866
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 900 transition count 856
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 900 transition count 856
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 890 transition count 846
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 890 transition count 846
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 880 transition count 836
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 880 transition count 836
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 870 transition count 826
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 870 transition count 826
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 860 transition count 816
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 860 transition count 816
Applied a total of 182 rules in 481 ms. Remains 860 /951 variables (removed 91) and now considering 816/917 (removed 101) transitions.
// Phase 1: matrix 816 rows 860 cols
[2025-05-31 05:09:18] [INFO ] Computed 67 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:18] [INFO ] Implicit Places using invariants in 415 ms returned []
[2025-05-31 05:09:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:20] [INFO ] Implicit Places using invariants and state equation in 1526 ms returned []
Implicit Place search using SMT with State Equation took 1965 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 860/1185 places, 816/1014 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3439 ms. Remains : 860/1185 places, 816/1014 transitions.
Stuttering acceptance computed with spot in 512 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 571 ms.
Product exploration explored 100000 steps with 33333 reset in 573 ms.
Computed a total of 860 stabilizing places and 816 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 860 transition count 816
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p2 p3 p0 p1), (X p3), (X p2), (X (X p2)), (X (X p3)), (X (X p0)), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (F (G p2)), (F (G p3)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 24 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-02 finished in 5458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0))||(G(p1)&&X(F(!p0)))))))'
Support contains 33 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1014/1014 transitions.
Discarding 121 places :
Implicit places reduction removed 121 places
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 1064 transition count 1014
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 145 place count 1040 transition count 980
Iterating global reduction 1 with 24 rules applied. Total rules applied 169 place count 1040 transition count 980
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 170 place count 1039 transition count 969
Iterating global reduction 1 with 1 rules applied. Total rules applied 171 place count 1039 transition count 969
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 182 place count 1028 transition count 969
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 193 place count 1017 transition count 958
Iterating global reduction 2 with 11 rules applied. Total rules applied 204 place count 1017 transition count 958
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 215 place count 1006 transition count 947
Iterating global reduction 2 with 11 rules applied. Total rules applied 226 place count 1006 transition count 947
Applied a total of 226 rules in 290 ms. Remains 1006 /1185 variables (removed 179) and now considering 947/1014 (removed 67) transitions.
// Phase 1: matrix 947 rows 1006 cols
[2025-05-31 05:09:22] [INFO ] Computed 92 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:23] [INFO ] Implicit Places using invariants in 742 ms returned [99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 496, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 597, 873]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 747 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 981/1185 places, 947/1014 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 971 transition count 937
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 971 transition count 937
Applied a total of 20 rules in 138 ms. Remains 971 /981 variables (removed 10) and now considering 937/947 (removed 10) transitions.
// Phase 1: matrix 937 rows 971 cols
[2025-05-31 05:09:23] [INFO ] Computed 67 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:23] [INFO ] Implicit Places using invariants in 503 ms returned []
[2025-05-31 05:09:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:25] [INFO ] Implicit Places using invariants and state equation in 1881 ms returned []
Implicit Place search using SMT with State Equation took 2391 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 971/1185 places, 937/1014 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3566 ms. Remains : 971/1185 places, 937/1014 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-03
Product exploration explored 100000 steps with 25000 reset in 529 ms.
Product exploration explored 100000 steps with 25000 reset in 455 ms.
Computed a total of 971 stabilizing places and 937 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 971 transition count 937
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 24 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-03 finished in 5299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 22 out of 1185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1185/1185 places, 1014/1014 transitions.
Graph (complete) has 1584 edges and 1185 vertex of which 44 are kept as prefixes of interest. Removing 1141 places using SCC suffix rule.7 ms
Discarding 1141 places :
Also discarding 959 output transitions
Drop transitions (Output transitions of discarded places.) removed 959 transitions
Reduce places removed 11 places and 11 transitions.
Applied a total of 1 rules in 13 ms. Remains 33 /1185 variables (removed 1152) and now considering 44/1014 (removed 970) transitions.
// Phase 1: matrix 44 rows 33 cols
[2025-05-31 05:09:27] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-31 05:09:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:27] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:09:27] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2025-05-31 05:09:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 44/66 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 11/77 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 0/77 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 33 constraints, problems are : Problem set: 0 solved, 22 unsolved in 635 ms.
Refiners :[State Equation: 33/33 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 44/66 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 22/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 11/77 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/77 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 55 constraints, problems are : Problem set: 0 solved, 22 unsolved in 611 ms.
Refiners :[State Equation: 33/33 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1251ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 1251ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/1185 places, 44/1014 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1366 ms. Remains : 33/1185 places, 44/1014 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-04
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-04 finished in 1438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((F(p0)&&(!p1 U (p2||G(!p1)))))&&X((p3||F(p0))))))'
Support contains 112 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1014/1014 transitions.
Discarding 99 places :
Implicit places reduction removed 99 places
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1086 transition count 1014
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 133 place count 1052 transition count 980
Iterating global reduction 1 with 34 rules applied. Total rules applied 167 place count 1052 transition count 980
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 178 place count 1041 transition count 959
Iterating global reduction 1 with 11 rules applied. Total rules applied 189 place count 1041 transition count 959
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 200 place count 1030 transition count 959
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 211 place count 1019 transition count 948
Iterating global reduction 2 with 11 rules applied. Total rules applied 222 place count 1019 transition count 948
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 233 place count 1008 transition count 937
Iterating global reduction 2 with 11 rules applied. Total rules applied 244 place count 1008 transition count 937
Applied a total of 244 rules in 306 ms. Remains 1008 /1185 variables (removed 177) and now considering 937/1014 (removed 77) transitions.
// Phase 1: matrix 937 rows 1008 cols
[2025-05-31 05:09:29] [INFO ] Computed 114 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:29] [INFO ] Implicit Places using invariants in 669 ms returned [99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 518, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 875]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 670 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 984/1185 places, 937/1014 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 963 transition count 916
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 963 transition count 916
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 953 transition count 896
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 953 transition count 896
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 943 transition count 886
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 943 transition count 886
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 933 transition count 876
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 933 transition count 876
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 923 transition count 866
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 923 transition count 866
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 913 transition count 856
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 913 transition count 856
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 903 transition count 846
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 903 transition count 846
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 893 transition count 836
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 893 transition count 836
Applied a total of 182 rules in 464 ms. Remains 893 /984 variables (removed 91) and now considering 836/937 (removed 101) transitions.
// Phase 1: matrix 836 rows 893 cols
[2025-05-31 05:09:30] [INFO ] Computed 90 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:30] [INFO ] Implicit Places using invariants in 408 ms returned []
[2025-05-31 05:09:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:32] [INFO ] Implicit Places using invariants and state equation in 1307 ms returned []
Implicit Place search using SMT with State Equation took 1719 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 893/1185 places, 836/1014 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3160 ms. Remains : 893/1185 places, 836/1014 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p3)), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 780 ms.
Product exploration explored 100000 steps with 33333 reset in 573 ms.
Computed a total of 893 stabilizing places and 836 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 836
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X p2), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (OR (AND p0 p2) (AND p0 (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G p2)), (F (G (NOT p1))), (F (G p3))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 29 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-06 finished in 5210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((X(p2)||p1)))||p0)))'
Support contains 46 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1014/1014 transitions.
Discarding 121 places :
Implicit places reduction removed 121 places
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 1064 transition count 1014
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 154 place count 1031 transition count 971
Iterating global reduction 1 with 33 rules applied. Total rules applied 187 place count 1031 transition count 971
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 209 place count 1009 transition count 939
Iterating global reduction 1 with 22 rules applied. Total rules applied 231 place count 1009 transition count 939
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 242 place count 998 transition count 939
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 264 place count 976 transition count 917
Iterating global reduction 2 with 22 rules applied. Total rules applied 286 place count 976 transition count 917
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 297 place count 965 transition count 906
Iterating global reduction 2 with 11 rules applied. Total rules applied 308 place count 965 transition count 906
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 319 place count 954 transition count 895
Iterating global reduction 2 with 11 rules applied. Total rules applied 330 place count 954 transition count 895
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 341 place count 943 transition count 884
Iterating global reduction 2 with 11 rules applied. Total rules applied 352 place count 943 transition count 884
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 363 place count 932 transition count 873
Iterating global reduction 2 with 11 rules applied. Total rules applied 374 place count 932 transition count 873
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 385 place count 921 transition count 862
Iterating global reduction 2 with 11 rules applied. Total rules applied 396 place count 921 transition count 862
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 407 place count 910 transition count 851
Iterating global reduction 2 with 11 rules applied. Total rules applied 418 place count 910 transition count 851
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 429 place count 899 transition count 840
Iterating global reduction 2 with 11 rules applied. Total rules applied 440 place count 899 transition count 840
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 451 place count 888 transition count 829
Iterating global reduction 2 with 11 rules applied. Total rules applied 462 place count 888 transition count 829
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 473 place count 877 transition count 818
Iterating global reduction 2 with 11 rules applied. Total rules applied 484 place count 877 transition count 818
Applied a total of 484 rules in 674 ms. Remains 877 /1185 variables (removed 308) and now considering 818/1014 (removed 196) transitions.
// Phase 1: matrix 818 rows 877 cols
[2025-05-31 05:09:34] [INFO ] Computed 92 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:35] [INFO ] Implicit Places using invariants in 629 ms returned [375, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 466, 744]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 632 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 863/1185 places, 818/1014 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 842 transition count 797
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 842 transition count 797
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 832 transition count 777
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 832 transition count 777
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 822 transition count 767
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 822 transition count 767
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 812 transition count 757
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 812 transition count 757
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 802 transition count 747
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 802 transition count 747
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 792 transition count 737
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 792 transition count 737
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 782 transition count 727
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 782 transition count 727
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 772 transition count 717
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 772 transition count 717
Applied a total of 182 rules in 414 ms. Remains 772 /863 variables (removed 91) and now considering 717/818 (removed 101) transitions.
// Phase 1: matrix 717 rows 772 cols
[2025-05-31 05:09:35] [INFO ] Computed 78 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:36] [INFO ] Implicit Places using invariants in 420 ms returned []
[2025-05-31 05:09:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:37] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1609 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 772/1185 places, 717/1014 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3329 ms. Remains : 772/1185 places, 717/1014 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-07
Entered a terminal (fully accepting) state of product in 290 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-07 finished in 3568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 77 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1014/1014 transitions.
Discarding 88 places :
Implicit places reduction removed 88 places
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 1097 transition count 1014
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 123 place count 1062 transition count 969
Iterating global reduction 1 with 35 rules applied. Total rules applied 158 place count 1062 transition count 969
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 180 place count 1040 transition count 937
Iterating global reduction 1 with 22 rules applied. Total rules applied 202 place count 1040 transition count 937
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 213 place count 1029 transition count 937
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 235 place count 1007 transition count 915
Iterating global reduction 2 with 22 rules applied. Total rules applied 257 place count 1007 transition count 915
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 279 place count 985 transition count 893
Iterating global reduction 2 with 22 rules applied. Total rules applied 301 place count 985 transition count 893
Applied a total of 301 rules in 329 ms. Remains 985 /1185 variables (removed 200) and now considering 893/1014 (removed 121) transitions.
// Phase 1: matrix 893 rows 985 cols
[2025-05-31 05:09:38] [INFO ] Computed 125 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:38] [INFO ] Implicit Places using invariants in 806 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 496, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 587, 852]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 809 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 960/1185 places, 893/1014 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 939 transition count 872
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 939 transition count 872
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 929 transition count 852
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 929 transition count 852
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 919 transition count 842
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 919 transition count 842
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 909 transition count 832
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 909 transition count 832
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 899 transition count 822
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 899 transition count 822
Applied a total of 122 rules in 201 ms. Remains 899 /960 variables (removed 61) and now considering 822/893 (removed 71) transitions.
// Phase 1: matrix 822 rows 899 cols
[2025-05-31 05:09:39] [INFO ] Computed 100 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:39] [INFO ] Implicit Places using invariants in 468 ms returned []
[2025-05-31 05:09:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:41] [INFO ] Implicit Places using invariants and state equation in 1474 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 899/1185 places, 822/1014 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3287 ms. Remains : 899/1185 places, 822/1014 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 599 ms.
Product exploration explored 100000 steps with 50000 reset in 501 ms.
Computed a total of 899 stabilizing places and 822 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 899 transition count 822
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 29 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-08 finished in 5123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 33 out of 1185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1185/1185 places, 1014/1014 transitions.
Graph (complete) has 1584 edges and 1185 vertex of which 1083 are kept as prefixes of interest. Removing 102 places using SCC suffix rule.8 ms
Discarding 102 places :
Also discarding 101 output transitions
Drop transitions (Output transitions of discarded places.) removed 101 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 110 places :
Implicit places reduction removed 110 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 506 transitions
Trivial Post-agglo rules discarded 506 transitions
Performed 506 trivial Post agglomeration. Transition count delta: 506
Iterating post reduction 0 with 616 rules applied. Total rules applied 617 place count 962 transition count 396
Reduce places removed 506 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 517 rules applied. Total rules applied 1134 place count 456 transition count 385
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1145 place count 445 transition count 385
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 143 Pre rules applied. Total rules applied 1145 place count 445 transition count 242
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 3 with 341 rules applied. Total rules applied 1486 place count 247 transition count 242
Drop transitions (Trivial Post-Agglo cleanup.) 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 1508 place count 247 transition count 220
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1530 place count 225 transition count 220
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1530 place count 225 transition count 209
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 1552 place count 214 transition count 209
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1564 place count 202 transition count 187
Iterating global reduction 5 with 12 rules applied. Total rules applied 1576 place count 202 transition count 187
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1576 place count 202 transition count 176
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1598 place count 191 transition count 176
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1610 place count 179 transition count 154
Iterating global reduction 5 with 12 rules applied. Total rules applied 1622 place count 179 transition count 154
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 44 rules applied. Total rules applied 1666 place count 168 transition count 121
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1677 place count 157 transition count 121
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 1677 place count 157 transition count 99
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 55 rules applied. Total rules applied 1732 place count 124 transition count 99
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 7 with 11 rules applied. Total rules applied 1743 place count 113 transition count 88
Applied a total of 1743 rules in 97 ms. Remains 113 /1185 variables (removed 1072) and now considering 88/1014 (removed 926) transitions.
// Phase 1: matrix 88 rows 113 cols
[2025-05-31 05:09:42] [INFO ] Computed 25 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:43] [INFO ] Implicit Places using invariants in 177 ms returned [11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 89, 101]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 179 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/1185 places, 88/1014 transitions.
Reduce places removed 11 places and 11 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 89 transition count 66
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 78 transition count 66
Applied a total of 22 rules in 6 ms. Remains 78 /100 variables (removed 22) and now considering 66/88 (removed 22) transitions.
// Phase 1: matrix 66 rows 78 cols
[2025-05-31 05:09:43] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:43] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-05-31 05:09:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:43] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/1185 places, 66/1014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 464 ms. Remains : 78/1185 places, 66/1014 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 278 ms.
Product exploration explored 100000 steps with 50000 reset in 276 ms.
Computed a total of 78 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 78 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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-09 finished in 1155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&F(p2)))'
Support contains 45 out of 1185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1185/1185 places, 1014/1014 transitions.
Graph (complete) has 1584 edges and 1185 vertex of which 1106 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.5 ms
Discarding 79 places :
Also discarding 79 output transitions
Drop transitions (Output transitions of discarded places.) removed 79 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 110 places :
Implicit places reduction removed 110 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 462 transitions
Trivial Post-agglo rules discarded 462 transitions
Performed 462 trivial Post agglomeration. Transition count delta: 462
Iterating post reduction 0 with 572 rules applied. Total rules applied 573 place count 985 transition count 462
Reduce places removed 462 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 473 rules applied. Total rules applied 1046 place count 523 transition count 451
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1057 place count 512 transition count 451
Performed 165 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 165 Pre rules applied. Total rules applied 1057 place count 512 transition count 286
Deduced a syphon composed of 165 places in 0 ms
Ensure Unique test removed 66 places
Reduce places removed 231 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 1453 place count 281 transition count 286
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 33 rules applied. Total rules applied 1486 place count 281 transition count 253
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 1519 place count 248 transition count 253
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1519 place count 248 transition count 242
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 1541 place count 237 transition count 242
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1553 place count 225 transition count 220
Iterating global reduction 5 with 12 rules applied. Total rules applied 1565 place count 225 transition count 220
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1565 place count 225 transition count 209
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 214 transition count 209
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1599 place count 202 transition count 187
Iterating global reduction 5 with 12 rules applied. Total rules applied 1611 place count 202 transition count 187
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 5 with 33 rules applied. Total rules applied 1644 place count 202 transition count 154
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1655 place count 191 transition count 154
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1655 place count 191 transition count 143
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 7 with 33 rules applied. Total rules applied 1688 place count 169 transition count 143
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 7 with 22 rules applied. Total rules applied 1710 place count 158 transition count 132
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 7 with 11 rules applied. Total rules applied 1721 place count 147 transition count 121
Applied a total of 1721 rules in 57 ms. Remains 147 /1185 variables (removed 1038) and now considering 121/1014 (removed 893) transitions.
// Phase 1: matrix 121 rows 147 cols
[2025-05-31 05:09:44] [INFO ] Computed 26 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:44] [INFO ] Implicit Places using invariants in 109 ms returned [68, 113, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 111 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/1185 places, 121/1014 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 134 transition count 99
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 112 transition count 99
Applied a total of 44 rules in 5 ms. Remains 112 /134 variables (removed 22) and now considering 99/121 (removed 22) transitions.
// Phase 1: matrix 99 rows 112 cols
[2025-05-31 05:09:44] [INFO ] Computed 13 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-05-31 05:09:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:44] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1185 places, 99/1014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 344 ms. Remains : 112/1185 places, 99/1014 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 288 ms.
Product exploration explored 100000 steps with 50000 reset in 353 ms.
Computed a total of 112 stabilizing places and 99 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 99
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p0), (X p1), (X p2), (X (X p1)), (X (X p2)), (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 22 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-11 finished in 1335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 22 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1014/1014 transitions.
Discarding 121 places :
Implicit places reduction removed 121 places
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 1064 transition count 1014
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 156 place count 1029 transition count 969
Iterating global reduction 1 with 35 rules applied. Total rules applied 191 place count 1029 transition count 969
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 213 place count 1007 transition count 937
Iterating global reduction 1 with 22 rules applied. Total rules applied 235 place count 1007 transition count 937
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 246 place count 996 transition count 937
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 268 place count 974 transition count 915
Iterating global reduction 2 with 22 rules applied. Total rules applied 290 place count 974 transition count 915
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 312 place count 952 transition count 893
Iterating global reduction 2 with 22 rules applied. Total rules applied 334 place count 952 transition count 893
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 345 place count 941 transition count 882
Iterating global reduction 2 with 11 rules applied. Total rules applied 356 place count 941 transition count 882
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 367 place count 930 transition count 871
Iterating global reduction 2 with 11 rules applied. Total rules applied 378 place count 930 transition count 871
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 389 place count 919 transition count 860
Iterating global reduction 2 with 11 rules applied. Total rules applied 400 place count 919 transition count 860
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 411 place count 908 transition count 849
Iterating global reduction 2 with 11 rules applied. Total rules applied 422 place count 908 transition count 849
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 433 place count 897 transition count 838
Iterating global reduction 2 with 11 rules applied. Total rules applied 444 place count 897 transition count 838
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 455 place count 886 transition count 827
Iterating global reduction 2 with 11 rules applied. Total rules applied 466 place count 886 transition count 827
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 477 place count 875 transition count 816
Iterating global reduction 2 with 11 rules applied. Total rules applied 488 place count 875 transition count 816
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 499 place count 864 transition count 805
Iterating global reduction 2 with 11 rules applied. Total rules applied 510 place count 864 transition count 805
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 521 place count 853 transition count 794
Iterating global reduction 2 with 11 rules applied. Total rules applied 532 place count 853 transition count 794
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 543 place count 842 transition count 783
Iterating global reduction 2 with 11 rules applied. Total rules applied 554 place count 842 transition count 783
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 22 rules applied. Total rules applied 576 place count 831 transition count 772
Applied a total of 576 rules in 910 ms. Remains 831 /1185 variables (removed 354) and now considering 772/1014 (removed 242) transitions.
// Phase 1: matrix 772 rows 831 cols
[2025-05-31 05:09:46] [INFO ] Computed 81 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:46] [INFO ] Implicit Places using invariants in 524 ms returned [342, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 433, 698]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 531 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 817/1185 places, 772/1014 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 796 transition count 751
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 796 transition count 751
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 786 transition count 731
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 786 transition count 731
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 776 transition count 721
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 776 transition count 721
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 766 transition count 711
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 766 transition count 711
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 756 transition count 701
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 756 transition count 701
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 746 transition count 691
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 746 transition count 691
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 736 transition count 681
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 736 transition count 681
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 726 transition count 671
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 726 transition count 671
Applied a total of 182 rules in 379 ms. Remains 726 /817 variables (removed 91) and now considering 671/772 (removed 101) transitions.
// Phase 1: matrix 671 rows 726 cols
[2025-05-31 05:09:47] [INFO ] Computed 67 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:47] [INFO ] Implicit Places using invariants in 385 ms returned []
[2025-05-31 05:09:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:09:48] [INFO ] Implicit Places using invariants and state equation in 1131 ms returned []
Implicit Place search using SMT with State Equation took 1520 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 726/1185 places, 671/1014 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3342 ms. Remains : 726/1185 places, 671/1014 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-12
Product exploration explored 100000 steps with 219 reset in 438 ms.
Product exploration explored 100000 steps with 221 reset in 368 ms.
Computed a total of 726 stabilizing places and 671 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 726 transition count 671
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 371 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 7 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 374 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 38855 steps (58 resets) in 205 ms. (188 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 13 factoid took 1060 ms. Reduced automaton from 7 states, 19 edges and 2 AP (stutter insensitive) to 7 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 377 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 358 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
[2025-05-31 05:09:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:09:53] [INFO ] [Real]Absence check using 0 positive and 67 generalized place invariants in 56 ms returned sat
[2025-05-31 05:09:55] [INFO ] [Real]Absence check using state equation in 1845 ms returned sat
[2025-05-31 05:09:55] [INFO ] Computed and/alt/rep : 658/736/658 causal constraints (skipped 2 transitions) in 72 ms.
[2025-05-31 05:10:07] [INFO ] Added : 320 causal constraints over 64 iterations in 12218 ms. Result :unknown
Could not prove EG (NOT p1)
[2025-05-31 05:10:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:10:08] [INFO ] [Real]Absence check using 0 positive and 67 generalized place invariants in 54 ms returned sat
[2025-05-31 05:10:09] [INFO ] [Real]Absence check using state equation in 1100 ms returned sat
[2025-05-31 05:10:09] [INFO ] Computed and/alt/rep : 658/736/658 causal constraints (skipped 2 transitions) in 48 ms.
[2025-05-31 05:10:12] [INFO ] Added : 165 causal constraints over 33 iterations in 2928 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 22 out of 726 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 726/726 places, 671/671 transitions.
Graph (complete) has 814 edges and 726 vertex of which 682 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.3 ms
Discarding 44 places :
Also discarding 33 output transitions
Drop transitions (Output transitions of discarded places.) removed 33 transitions
Reduce places removed 11 places and 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 407 transitions
Trivial Post-agglo rules discarded 407 transitions
Performed 407 trivial Post agglomeration. Transition count delta: 407
Iterating post reduction 0 with 407 rules applied. Total rules applied 408 place count 671 transition count 220
Reduce places removed 407 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 418 rules applied. Total rules applied 826 place count 264 transition count 209
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 837 place count 253 transition count 209
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 837 place count 253 transition count 88
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 3 with 297 rules applied. Total rules applied 1134 place count 77 transition count 88
Drop transitions (Trivial Post-Agglo cleanup.) 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 1156 place count 77 transition count 66
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 4 with 44 rules applied. Total rules applied 1200 place count 55 transition count 44
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1211 place count 44 transition count 44
Applied a total of 1211 rules in 27 ms. Remains 44 /726 variables (removed 682) and now considering 44/671 (removed 627) transitions.
// Phase 1: matrix 44 rows 44 cols
[2025-05-31 05:10:12] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:10:12] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-31 05:10:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:10:12] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:10:12] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2025-05-31 05:10:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 44/77 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 11/88 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 0/88 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 44 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1078 ms.
Refiners :[State Equation: 44/44 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 44/77 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 33/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 11/88 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 0/88 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 77 constraints, problems are : Problem set: 0 solved, 33 unsolved in 638 ms.
Refiners :[State Equation: 44/44 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1722ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 1722ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/726 places, 44/671 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1862 ms. Remains : 44/726 places, 44/671 transitions.
Computed a total of 44 stabilizing places and 44 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 44 transition count 44
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 12 factoid took 650 ms. Reduced automaton from 7 states, 19 edges and 2 AP (stutter insensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 45 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1)]
Knowledge based reduction with 12 factoid took 827 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2025-05-31 05:10:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:10:16] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-05-31 05:10:16] [INFO ] Computed and/alt/rep : 33/33/33 causal constraints (skipped 0 transitions) in 6 ms.
[2025-05-31 05:10:16] [INFO ] Added : 11 causal constraints over 3 iterations in 38 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 8879 reset in 275 ms.
Product exploration explored 100000 steps with 8906 reset in 274 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 11 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 44/44 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 44 transition count 44
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 11 place count 44 transition count 44
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 22 place count 44 transition count 44
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 33 place count 33 transition count 33
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 44 place count 33 transition count 33
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 44 rules in 4 ms. Remains 33 /44 variables (removed 11) and now considering 33/44 (removed 11) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:10:17] [INFO ] Redundant transitions in 1 ms returned []
Running 22 sub problems to find dead transitions.
// Phase 1: matrix 33 rows 33 cols
[2025-05-31 05:10:17] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
At refinement iteration 1 (OVERLAPS) 33/55 variables, 22/22 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/22 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 11/66 variables, 11/33 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/66 variables, 0/33 constraints. Problems are: Problem set: 11 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 33 constraints, problems are : Problem set: 11 solved, 11 unsolved in 390 ms.
Refiners :[State Equation: 33/33 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 33/44 variables, 11/11 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 11/22 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/22 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 22/66 variables, 22/44 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/44 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/66 variables, 0/44 constraints. Problems are: Problem set: 11 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 44 constraints, problems are : Problem set: 11 solved, 11 unsolved in 219 ms.
Refiners :[State Equation: 33/33 constraints, PredecessorRefiner: 11/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 614ms problems are : Problem set: 11 solved, 11 unsolved
Search for dead transitions found 11 dead transitions in 615ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 33/44 places, 22/44 transitions.
Graph (complete) has 11 edges and 33 vertex of which 22 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 22 /33 variables (removed 11) and now considering 22/22 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/44 places, 22/44 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 633 ms. Remains : 22/44 places, 22/44 transitions.
Built C files in :
/tmp/ltsmin17851669884868311601
[2025-05-31 05:10:18] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17851669884868311601
Running compilation step : cd /tmp/ltsmin17851669884868311601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 194 ms.
Running link step : cd /tmp/ltsmin17851669884868311601;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin17851669884868311601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14146209534497754749.hoa' '--buchi-type=spotba'
LTSmin run took 6594 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-12 finished in 39836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((X(X(X(p2)))||p1))))))'
Support contains 33 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1014/1014 transitions.
Discarding 121 places :
Implicit places reduction removed 121 places
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 1064 transition count 1014
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 145 place count 1040 transition count 980
Iterating global reduction 1 with 24 rules applied. Total rules applied 169 place count 1040 transition count 980
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 181 place count 1028 transition count 958
Iterating global reduction 1 with 12 rules applied. Total rules applied 193 place count 1028 transition count 958
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 204 place count 1017 transition count 958
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 226 place count 995 transition count 936
Iterating global reduction 2 with 22 rules applied. Total rules applied 248 place count 995 transition count 936
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 270 place count 973 transition count 914
Iterating global reduction 2 with 22 rules applied. Total rules applied 292 place count 973 transition count 914
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 303 place count 962 transition count 903
Iterating global reduction 2 with 11 rules applied. Total rules applied 314 place count 962 transition count 903
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 325 place count 951 transition count 892
Iterating global reduction 2 with 11 rules applied. Total rules applied 336 place count 951 transition count 892
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 347 place count 940 transition count 881
Iterating global reduction 2 with 11 rules applied. Total rules applied 358 place count 940 transition count 881
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 369 place count 929 transition count 870
Iterating global reduction 2 with 11 rules applied. Total rules applied 380 place count 929 transition count 870
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 391 place count 918 transition count 859
Iterating global reduction 2 with 11 rules applied. Total rules applied 402 place count 918 transition count 859
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 413 place count 907 transition count 848
Iterating global reduction 2 with 11 rules applied. Total rules applied 424 place count 907 transition count 848
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 435 place count 896 transition count 837
Iterating global reduction 2 with 11 rules applied. Total rules applied 446 place count 896 transition count 837
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 457 place count 885 transition count 826
Iterating global reduction 2 with 11 rules applied. Total rules applied 468 place count 885 transition count 826
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 479 place count 874 transition count 815
Iterating global reduction 2 with 11 rules applied. Total rules applied 490 place count 874 transition count 815
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 501 place count 863 transition count 804
Iterating global reduction 2 with 11 rules applied. Total rules applied 512 place count 863 transition count 804
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 22 rules applied. Total rules applied 534 place count 852 transition count 793
Applied a total of 534 rules in 604 ms. Remains 852 /1185 variables (removed 333) and now considering 793/1014 (removed 221) transitions.
// Phase 1: matrix 793 rows 852 cols
[2025-05-31 05:10:25] [INFO ] Computed 81 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:10:26] [INFO ] Implicit Places using invariants in 435 ms returned [342, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 453, 719]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 437 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 838/1185 places, 793/1014 transitions.
Applied a total of 0 rules in 31 ms. Remains 838 /838 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1072 ms. Remains : 838/1185 places, 793/1014 transitions.
Stuttering acceptance computed with spot in 525 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-13
Product exploration explored 100000 steps with 203 reset in 444 ms.
Product exploration explored 100000 steps with 202 reset in 354 ms.
Computed a total of 838 stabilizing places and 793 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 838 transition count 793
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 459 ms. Reduced automaton from 10 states, 20 edges and 3 AP (stutter sensitive) to 14 states, 45 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 850 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 12 to 7
RANDOM walk for 40000 steps (60 resets) in 436 ms. (91 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 210 ms. (189 steps per ms) remains 3/3 properties
// Phase 1: matrix 793 rows 838 cols
[2025-05-31 05:10:29] [INFO ] Computed 67 invariants in 4 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 33/1631 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 32 ms.
Refiners :[Generalized P Invariants (flows): 0/67 constraints, State Equation: 0/838 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (G (OR p2 (NOT p1))), (G (OR (NOT p2) p1)), (G (OR (NOT p2) (NOT p0) p1)), (G (OR (NOT p2) p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F p2), (F p0), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p2) (NOT p0) (NOT p1))))
Knowledge based reduction with 12 factoid took 491 ms. Reduced automaton from 14 states, 45 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-13 finished in 5072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U !p1))))'
Support contains 77 out of 1185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1185/1185 places, 1014/1014 transitions.
Graph (complete) has 1584 edges and 1185 vertex of which 1150 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.3 ms
Discarding 35 places :
Also discarding 35 output transitions
Drop transitions (Output transitions of discarded places.) removed 35 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 462 transitions
Trivial Post-agglo rules discarded 462 transitions
Performed 462 trivial Post agglomeration. Transition count delta: 462
Iterating post reduction 0 with 561 rules applied. Total rules applied 562 place count 1040 transition count 506
Reduce places removed 462 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 484 rules applied. Total rules applied 1046 place count 578 transition count 484
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1068 place count 556 transition count 484
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 1068 place count 556 transition count 330
Deduced a syphon composed of 154 places in 0 ms
Ensure Unique test removed 66 places
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 3 with 374 rules applied. Total rules applied 1442 place count 336 transition count 330
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 33 rules applied. Total rules applied 1475 place count 336 transition count 297
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 1508 place count 303 transition count 297
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1508 place count 303 transition count 286
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 1530 place count 292 transition count 286
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1542 place count 280 transition count 264
Iterating global reduction 5 with 12 rules applied. Total rules applied 1554 place count 280 transition count 264
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1554 place count 280 transition count 253
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1576 place count 269 transition count 253
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1577 place count 268 transition count 242
Iterating global reduction 5 with 1 rules applied. Total rules applied 1578 place count 268 transition count 242
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 22 rules applied. Total rules applied 1600 place count 268 transition count 220
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1611 place count 257 transition count 220
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 7 with 22 rules applied. Total rules applied 1633 place count 246 transition count 209
Applied a total of 1633 rules in 73 ms. Remains 246 /1185 variables (removed 939) and now considering 209/1014 (removed 805) transitions.
// Phase 1: matrix 209 rows 246 cols
[2025-05-31 05:10:30] [INFO ] Computed 59 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:10:30] [INFO ] Implicit Places using invariants in 301 ms returned [55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 155, 211, 212, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 303 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 221/1185 places, 209/1014 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 221 transition count 198
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 210 transition count 198
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 22 place count 210 transition count 154
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 110 place count 166 transition count 154
Applied a total of 110 rules in 11 ms. Remains 166 /221 variables (removed 55) and now considering 154/209 (removed 55) transitions.
// Phase 1: matrix 154 rows 166 cols
[2025-05-31 05:10:30] [INFO ] Computed 34 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:10:30] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-05-31 05:10:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:10:30] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 166/1185 places, 154/1014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 732 ms. Remains : 166/1185 places, 154/1014 transitions.
Stuttering acceptance computed with spot in 115 ms :[p1, p1]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-15
Product exploration explored 100000 steps with 2154 reset in 978 ms.
Product exploration explored 100000 steps with 2151 reset in 522 ms.
Computed a total of 166 stabilizing places and 154 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 166 transition count 154
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (OR (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 23 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-15 finished in 2500 ms.
All properties solved by simple procedures.
Total runtime 339166 ms.

BK_STOP 1748668233155

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-5832"
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 r086-smll-174860101900100"
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.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 ;