Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102000196.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-PT-L00010M0001C001P001G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102000196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 21K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 161K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 146K 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 11K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 452K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 410K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 24 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 552K 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-PT-L00010M0001C001P001G001-LTLFireability-00
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-02
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-03
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-05
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-06
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-07
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-12
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-13
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-14
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748793695814

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00010M0001C001P001G001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 16:01:38] [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-06-01 16:01:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 16:01:38] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2025-06-01 16:01:38] [INFO ] Transformed 1475 places.
[2025-06-01 16:01:38] [INFO ] Transformed 1234 transitions.
[2025-06-01 16:01:38] [INFO ] Parsed PT model containing 1475 places and 1234 transitions and 3799 arcs in 420 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 394 out of 1465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1465/1465 places, 1234/1234 transitions.
Reduce places removed 45 places and 0 transitions.
Discarding 87 places :
Implicit places reduction removed 87 places
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 1333 transition count 1234
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 237 place count 1228 transition count 1119
Iterating global reduction 1 with 105 rules applied. Total rules applied 342 place count 1228 transition count 1119
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 353 place count 1217 transition count 1119
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 375 place count 1195 transition count 1087
Iterating global reduction 2 with 22 rules applied. Total rules applied 397 place count 1195 transition count 1087
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 408 place count 1184 transition count 1087
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 429 place count 1163 transition count 1066
Iterating global reduction 3 with 21 rules applied. Total rules applied 450 place count 1163 transition count 1066
Applied a total of 450 rules in 366 ms. Remains 1163 /1465 variables (removed 302) and now considering 1066/1234 (removed 168) transitions.
// Phase 1: matrix 1066 rows 1163 cols
[2025-06-01 16:01:39] [INFO ] Computed 193 invariants in 142 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:01:40] [INFO ] Implicit Places using invariants in 1239 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 828, 829, 830, 831, 832, 833, 834, 835, 836, 837, 838, 894, 895, 896, 897, 898, 900, 901, 902, 903, 904, 1062]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 1298 ms to find 66 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1097/1465 places, 1066/1234 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1087 transition count 1056
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1087 transition count 1056
Applied a total of 20 rules in 75 ms. Remains 1087 /1097 variables (removed 10) and now considering 1056/1066 (removed 10) transitions.
// Phase 1: matrix 1056 rows 1087 cols
[2025-06-01 16:01:40] [INFO ] Computed 127 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:01:41] [INFO ] Implicit Places using invariants in 566 ms returned []
[2025-06-01 16:01:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:01:42] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 2023 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1087/1465 places, 1056/1234 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3786 ms. Remains : 1087/1465 places, 1056/1234 transitions.
Support contains 394 out of 1087 places after structural reductions.
[2025-06-01 16:01:43] [INFO ] Flatten gal took : 177 ms
[2025-06-01 16:01:43] [INFO ] Flatten gal took : 106 ms
[2025-06-01 16:01:43] [INFO ] Input system was already deterministic with 1056 transitions.
Reduction of identical properties reduced properties to check from 39 to 38
RANDOM walk for 40000 steps (60 resets) in 1678 ms. (23 steps per ms) remains 0/38 properties
Computed a total of 1087 stabilizing places and 1056 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1087 transition count 1056
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 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1056/1056 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1042 transition count 1056
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 73 place count 1014 transition count 1027
Iterating global reduction 1 with 28 rules applied. Total rules applied 101 place count 1014 transition count 1027
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 112 place count 1014 transition count 1016
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 126 place count 1000 transition count 992
Iterating global reduction 2 with 14 rules applied. Total rules applied 140 place count 1000 transition count 992
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 162 place count 978 transition count 960
Iterating global reduction 2 with 22 rules applied. Total rules applied 184 place count 978 transition count 960
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 206 place count 956 transition count 918
Iterating global reduction 2 with 22 rules applied. Total rules applied 228 place count 956 transition count 918
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 239 place count 956 transition count 907
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 249 place count 946 transition count 897
Iterating global reduction 3 with 10 rules applied. Total rules applied 259 place count 946 transition count 897
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 269 place count 936 transition count 887
Iterating global reduction 3 with 10 rules applied. Total rules applied 279 place count 936 transition count 887
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 289 place count 926 transition count 877
Iterating global reduction 3 with 10 rules applied. Total rules applied 299 place count 926 transition count 877
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 309 place count 916 transition count 867
Iterating global reduction 3 with 10 rules applied. Total rules applied 319 place count 916 transition count 867
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 320 place count 915 transition count 867
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 330 place count 905 transition count 857
Iterating global reduction 4 with 10 rules applied. Total rules applied 340 place count 905 transition count 857
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 350 place count 895 transition count 847
Iterating global reduction 4 with 10 rules applied. Total rules applied 360 place count 895 transition count 847
Applied a total of 360 rules in 843 ms. Remains 895 /1087 variables (removed 192) and now considering 847/1056 (removed 209) transitions.
// Phase 1: matrix 847 rows 895 cols
[2025-06-01 16:01:46] [INFO ] Computed 81 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:01:46] [INFO ] Implicit Places using invariants in 599 ms returned [77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 187, 641]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 602 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 882/1087 places, 847/1056 transitions.
Applied a total of 0 rules in 378 ms. Remains 882 /882 variables (removed 0) and now considering 847/847 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1823 ms. Remains : 882/1087 places, 847/1056 transitions.
Stuttering acceptance computed with spot in 429 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-PT-L00010M0001C001P001G001-LTLFireability-00
Product exploration explored 100000 steps with 863 reset in 816 ms.
Product exploration explored 100000 steps with 857 reset in 615 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 (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2) (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 146 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 1045 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 1359 ms. (29 steps per ms) remains 0/22 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (OR p0 p1 (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F p2), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (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) p1 p2 p3))), (F p3), (F (NOT (OR p0 p1 p2 (NOT p3)))), (F p1), (F (NOT (OR p0 (NOT p1) p2 (NOT p3)))), (F p0)]
Knowledge based reduction with 19 factoid took 1276 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 1008 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 1004 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]
// Phase 1: matrix 847 rows 882 cols
[2025-06-01 16:01:54] [INFO ] Computed 68 invariants in 19 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 16:01:55] [INFO ] [Real]Absence check using 0 positive and 68 generalized place invariants in 84 ms returned sat
[2025-06-01 16:02:09] [INFO ] [Real]Absence check using state equation in 13541 ms returned sat
[2025-06-01 16:02:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 16:02:10] [INFO ] [Nat]Absence check using 0 positive and 68 generalized place invariants in 40 ms returned sat
[2025-06-01 16:02:24] [INFO ] [Nat]Absence check using state equation in 14080 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
[2025-06-01 16:02:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 16:02:25] [INFO ] [Real]Absence check using 0 positive and 68 generalized place invariants in 54 ms returned sat
[2025-06-01 16:02:34] [INFO ] [Real]Absence check using state equation in 9134 ms returned sat
[2025-06-01 16:02:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 16:02:35] [INFO ] [Nat]Absence check using 0 positive and 68 generalized place invariants in 39 ms returned sat
[2025-06-01 16:02:40] [INFO ] [Nat]Absence check using state equation in 5329 ms returned sat
[2025-06-01 16:02:40] [INFO ] Computed and/alt/rep : 812/912/812 causal constraints (skipped 24 transitions) in 98 ms.
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.10 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 85 ms. Remains 145 /882 variables (removed 737) and now considering 176/847 (removed 671) transitions.
// Phase 1: matrix 176 rows 145 cols
[2025-06-01 16:02:49] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:02:49] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-01 16:02:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:02:49] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:02:49] [INFO ] Redundant transitions in 11 ms returned []
Running 154 sub problems to find dead transitions.
[2025-06-01 16:02:49] [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 13409 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 18375 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 31865ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 31878ms
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 32238 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) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT p0)), (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) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT p0))), (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 142 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 1014 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 1170 steps (8 resets) in 31 ms. (36 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) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT p0)), (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) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT p0))), (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 (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F (NOT (OR p0 p1 (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F p2), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (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) p1 p2 p3))), (F p3), (F (NOT (OR p0 p1 p2 (NOT p3)))), (F p1), (F (NOT (OR p0 (NOT p1) p2 (NOT p3)))), (F p0)]
Knowledge based reduction with 49 factoid took 1390 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 999 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 1000 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-06-01 16:03:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 16:03:26] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2025-06-01 16:03:27] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2025-06-01 16:03:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 16:03:27] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 16:03:27] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2025-06-01 16:03:27] [INFO ] Computed and/alt/rep : 132/154/132 causal constraints (skipped 22 transitions) in 14 ms.
[2025-06-01 16:03:27] [INFO ] Added : 69 causal constraints over 15 iterations in 321 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
[2025-06-01 16:03:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 16:03:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 16:03:28] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2025-06-01 16:03:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 16:03:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 16:03:28] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2025-06-01 16:03:28] [INFO ] Computed and/alt/rep : 132/154/132 causal constraints (skipped 22 transitions) in 13 ms.
[2025-06-01 16:03:29] [INFO ] Added : 75 causal constraints over 15 iterations in 474 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 1017 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 7489 reset in 769 ms.
Product exploration explored 100000 steps with 7491 reset in 716 ms.
Built C files in :
/tmp/ltsmin7390864107600024907
[2025-06-01 16:03:31] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2025-06-01 16:03:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:03:31] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2025-06-01 16:03:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:03:31] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2025-06-01 16:03:31] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:03:31] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7390864107600024907
Running compilation step : cd /tmp/ltsmin7390864107600024907;'/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 676 ms.
Running link step : cd /tmp/ltsmin7390864107600024907;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin7390864107600024907;'/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/stateBased6521651105090118360.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 7 ms. Remains 145 /145 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-06-01 16:03:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:03:46] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-01 16:03:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:03:46] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:03:46] [INFO ] Redundant transitions in 7 ms returned []
Running 154 sub problems to find dead transitions.
[2025-06-01 16:03:46] [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 13377 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 18804 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 32200ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 32201ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32366 ms. Remains : 145/145 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin6875515022163771259
[2025-06-01 16:04:19] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2025-06-01 16:04:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:04:19] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2025-06-01 16:04:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:04:19] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2025-06-01 16:04:19] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 16:04:19] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6875515022163771259
Running compilation step : cd /tmp/ltsmin6875515022163771259;'/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 440 ms.
Running link step : cd /tmp/ltsmin6875515022163771259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6875515022163771259;'/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/stateBased5743275870730832503.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 16:04:34] [INFO ] Flatten gal took : 9 ms
[2025-06-01 16:04:34] [INFO ] Flatten gal took : 7 ms
[2025-06-01 16:04:34] [INFO ] Time to serialize gal into /tmp/LTL12288717523596427421.gal : 4 ms
[2025-06-01 16:04:34] [INFO ] Time to serialize properties into /tmp/LTL3393136254608497555.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/LTL12288717523596427421.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12547340942909106489.hoa' '-atoms' '/tmp/LTL3393136254608497555.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...319
Loading property file /tmp/LTL3393136254608497555.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12547340942909106489.hoa
Detected timeout of ITS tools.
[2025-06-01 16:04:49] [INFO ] Flatten gal took : 8 ms
[2025-06-01 16:04:49] [INFO ] Flatten gal took : 7 ms
[2025-06-01 16:04:49] [INFO ] Time to serialize gal into /tmp/LTL4678306562755884182.gal : 3 ms
[2025-06-01 16:04:49] [INFO ] Time to serialize properties into /tmp/LTL12621818704462738454.ltl : 4 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/LTL4678306562755884182.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12621818704462738454.ltl' '-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...276
Read 1 LTL properties
Checking formula 0 : !(((F(("((((l8_7>=1)||(l8_8>=1))||((l8_9>=1)||(l8_10>=1)))||(((l8_3>=1)||(l8_4>=1))||((l8_5>=1)||(l8_6>=1))))")||(("((l8_0>=1)||(l8_1>...1381
Formula 0 simplified : G(!"((((l8_7>=1)||(l8_8>=1))||((l8_9>=1)||(l8_10>=1)))||(((l8_3>=1)||(l8_4>=1))||((l8_5>=1)||(l8_6>=1))))" & !"((l8_0>=1)||(l8_1>=1)...1366
Detected timeout of ITS tools.
[2025-06-01 16:05:04] [INFO ] Flatten gal took : 10 ms
[2025-06-01 16:05:04] [INFO ] Applying decomposition
[2025-06-01 16:05:04] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10938562763364032850.txt' '-o' '/tmp/graph10938562763364032850.bin' '-w' '/tmp/graph10938562763364032850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10938562763364032850.bin' '-l' '-1' '-v' '-w' '/tmp/graph10938562763364032850.weights' '-q' '0' '-e' '0.001'
[2025-06-01 16:05:04] [INFO ] Decomposing Gal with order
[2025-06-01 16:05:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 16:05:04] [INFO ] Removed a total of 71 redundant transitions.
[2025-06-01 16:05:04] [INFO ] Flatten gal took : 69 ms
[2025-06-01 16:05:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-01 16:05:04] [INFO ] Time to serialize gal into /tmp/LTL4891001157286109870.gal : 6 ms
[2025-06-01 16:05:04] [INFO ] Time to serialize properties into /tmp/LTL8981033646966718183.ltl : 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/LTL4891001157286109870.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8981033646966718183.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !(((F(("((((i1.i0.u19.l8_7>=1)||(i7.i0.u13.l8_8>=1))||((i9.i0.u20.l8_9>=1)||(i2.i0.u21.l8_10>=1)))||(((i8.i0.u16.l8_3>=1)||(i3.i0.u12....2221
Formula 0 simplified : G(!"((((i1.i0.u19.l8_7>=1)||(i7.i0.u13.l8_8>=1))||((i9.i0.u20.l8_9>=1)||(i2.i0.u21.l8_10>=1)))||(((i8.i0.u16.l8_3>=1)||(i3.i0.u12.l8...2206
Reverse transition relation is NOT exact ! Due to transitions i0.i1.u24.t932, i0.i1.u30.t933, i1.i1.u25.t934, i1.i1.u41.t935, i2.i1.u26.t940, i2.i1.u43.t94...504
Computing Next relation with stutter on 1 deadlock states
47 unique states visited
0 strongly connected components in search stack
46 transitions explored
24 items max in DFS search stack
72 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,0.748041,40120,1,0,43819,2224,1627,78435,197,10306,95166
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-00 finished in 200299 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((G(p2)||p1))))))'
Support contains 55 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1056/1056 transitions.
Discarding 23 places :
Implicit places reduction removed 23 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1064 transition count 1056
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 52 place count 1035 transition count 1016
Iterating global reduction 1 with 29 rules applied. Total rules applied 81 place count 1035 transition count 1016
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 92 place count 1035 transition count 1005
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 127 place count 1000 transition count 960
Iterating global reduction 2 with 35 rules applied. Total rules applied 162 place count 1000 transition count 960
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 185 place count 977 transition count 927
Iterating global reduction 2 with 23 rules applied. Total rules applied 208 place count 977 transition count 927
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 230 place count 955 transition count 885
Iterating global reduction 2 with 22 rules applied. Total rules applied 252 place count 955 transition count 885
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 263 place count 955 transition count 874
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 273 place count 945 transition count 864
Iterating global reduction 3 with 10 rules applied. Total rules applied 283 place count 945 transition count 864
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 293 place count 935 transition count 854
Iterating global reduction 3 with 10 rules applied. Total rules applied 303 place count 935 transition count 854
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 313 place count 925 transition count 844
Iterating global reduction 3 with 10 rules applied. Total rules applied 323 place count 925 transition count 844
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 333 place count 915 transition count 834
Iterating global reduction 3 with 10 rules applied. Total rules applied 343 place count 915 transition count 834
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 344 place count 914 transition count 834
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 354 place count 904 transition count 824
Iterating global reduction 4 with 10 rules applied. Total rules applied 364 place count 904 transition count 824
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 374 place count 894 transition count 814
Iterating global reduction 4 with 10 rules applied. Total rules applied 384 place count 894 transition count 814
Applied a total of 384 rules in 473 ms. Remains 894 /1087 variables (removed 193) and now considering 814/1056 (removed 242) transitions.
// Phase 1: matrix 814 rows 894 cols
[2025-06-01 16:05:06] [INFO ] Computed 103 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:05:06] [INFO ] Implicit Places using invariants in 596 ms returned [77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 187, 492, 651]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 598 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 880/1087 places, 814/1056 transitions.
Applied a total of 0 rules in 50 ms. Remains 880 /880 variables (removed 0) and now considering 814/814 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1122 ms. Remains : 880/1087 places, 814/1056 transitions.
Stuttering acceptance computed with spot in 552 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 478 ms.
Product exploration explored 100000 steps with 25000 reset in 494 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 p2), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 185 ms. Reduced automaton from 11 states, 25 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 2
RANDOM walk for 40000 steps (60 resets) in 297 ms. (134 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 496 ms. (80 steps per ms) remains 1/1 properties
// Phase 1: matrix 814 rows 880 cols
[2025-06-01 16:05:09] [INFO ] Computed 89 invariants in 9 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
After SMT solving in domain Real declared 11/1694 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 26 ms.
Refiners :[Generalized P Invariants (flows): 0/89 constraints, State Equation: 0/880 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (G (OR p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p2))), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 547 ms. Reduced automaton from 6 states, 8 edges and 2 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 209 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 53 ms. Remains 880 /880 variables (removed 0) and now considering 814/814 (removed 0) transitions.
[2025-06-01 16:05:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:05:10] [INFO ] Implicit Places using invariants in 478 ms returned []
[2025-06-01 16:05:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:05:12] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 1812 ms to find 0 implicit places.
Running 803 sub problems to find dead transitions.
[2025-06-01 16:05: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/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 30061 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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30038 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 60256ms problems are : Problem set: 0 solved, 803 unsolved
Search for dead transitions found 0 dead transitions in 60260ms
Finished structural reductions in LTL mode , in 1 iterations and 62128 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 110 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 109 steps (0 resets) in 5 ms. (18 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 136 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 209 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 368 ms.
Product exploration explored 100000 steps with 25000 reset in 465 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 214 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.6 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 12 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-06-01 16:06:15] [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 38 ms. Remains : 11/880 places, 11/814 transitions.
Built C files in :
/tmp/ltsmin2684200427513491918
[2025-06-01 16:06:15] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2684200427513491918
Running compilation step : cd /tmp/ltsmin2684200427513491918;'/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 2372 ms.
Running link step : cd /tmp/ltsmin2684200427513491918;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2684200427513491918;'/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/stateBased2433815830225978023.hoa' '--buchi-type=spotba'
LTSmin run took 346 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01 finished in 72861 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))||(!p3&&F(!p2))))))))'
Support contains 57 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1056/1056 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1042 transition count 1056
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 72 place count 1015 transition count 1018
Iterating global reduction 1 with 27 rules applied. Total rules applied 99 place count 1015 transition count 1018
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 110 place count 1015 transition count 1007
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 135 place count 990 transition count 972
Iterating global reduction 2 with 25 rules applied. Total rules applied 160 place count 990 transition count 972
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 193 place count 957 transition count 929
Iterating global reduction 2 with 33 rules applied. Total rules applied 226 place count 957 transition count 929
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 248 place count 935 transition count 887
Iterating global reduction 2 with 22 rules applied. Total rules applied 270 place count 935 transition count 887
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 281 place count 935 transition count 876
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 291 place count 925 transition count 866
Iterating global reduction 3 with 10 rules applied. Total rules applied 301 place count 925 transition count 866
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 311 place count 915 transition count 856
Iterating global reduction 3 with 10 rules applied. Total rules applied 321 place count 915 transition count 856
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 331 place count 905 transition count 846
Iterating global reduction 3 with 10 rules applied. Total rules applied 341 place count 905 transition count 846
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 351 place count 895 transition count 836
Iterating global reduction 3 with 10 rules applied. Total rules applied 361 place count 895 transition count 836
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 362 place count 894 transition count 836
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 372 place count 884 transition count 826
Iterating global reduction 4 with 10 rules applied. Total rules applied 382 place count 884 transition count 826
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 392 place count 874 transition count 816
Iterating global reduction 4 with 10 rules applied. Total rules applied 402 place count 874 transition count 816
Applied a total of 402 rules in 593 ms. Remains 874 /1087 variables (removed 213) and now considering 816/1056 (removed 240) transitions.
// Phase 1: matrix 816 rows 874 cols
[2025-06-01 16:06:19] [INFO ] Computed 81 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:19] [INFO ] Implicit Places using invariants in 422 ms returned [77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 187, 459, 618]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 424 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 860/1087 places, 816/1056 transitions.
Applied a total of 0 rules in 35 ms. Remains 860 /860 variables (removed 0) and now considering 816/816 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1052 ms. Remains : 860/1087 places, 816/1056 transitions.
Stuttering acceptance computed with spot in 500 ms :[(OR p2 (AND (NOT p0) (NOT p1))), (OR p2 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), p2, p2, (AND (NOT p0) (NOT p1)), (AND (NOT p1) p2), (AND p2 (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 418 ms.
Product exploration explored 100000 steps with 33333 reset in 387 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 (NOT p3) (NOT p2) p0 p1), (X (NOT p2)), (X (NOT p3)), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT p3))), (X (X p0)), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (F (G (NOT p3))), (F (G (NOT p2))), (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 17 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-PT-L00010M0001C001P001G001-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-02 finished in 2713 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 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1056/1056 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1042 transition count 1056
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 63 place count 1024 transition count 1027
Iterating global reduction 1 with 18 rules applied. Total rules applied 81 place count 1024 transition count 1027
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 92 place count 1024 transition count 1016
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 105 place count 1011 transition count 993
Iterating global reduction 2 with 13 rules applied. Total rules applied 118 place count 1011 transition count 993
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 131 place count 998 transition count 970
Iterating global reduction 2 with 13 rules applied. Total rules applied 144 place count 998 transition count 970
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 156 place count 986 transition count 948
Iterating global reduction 2 with 12 rules applied. Total rules applied 168 place count 986 transition count 948
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 179 place count 986 transition count 937
Applied a total of 179 rules in 238 ms. Remains 986 /1087 variables (removed 101) and now considering 937/1056 (removed 119) transitions.
// Phase 1: matrix 937 rows 986 cols
[2025-06-01 16:06:21] [INFO ] Computed 82 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:21] [INFO ] Implicit Places using invariants in 505 ms returned [77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 187, 475, 542, 743]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 509 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 971/1087 places, 937/1056 transitions.
Applied a total of 0 rules in 47 ms. Remains 971 /971 variables (removed 0) and now considering 937/937 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 794 ms. Remains : 971/1087 places, 937/1056 transitions.
Stuttering acceptance computed with spot in 210 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-PT-L00010M0001C001P001G001-LTLFireability-03
Product exploration explored 100000 steps with 25000 reset in 485 ms.
Product exploration explored 100000 steps with 25000 reset in 501 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 12 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-PT-L00010M0001C001P001G001-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-03 finished in 2350 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 1087 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1087/1087 places, 1056/1056 transitions.
Graph (complete) has 1445 edges and 1087 vertex of which 44 are kept as prefixes of interest. Removing 1043 places using SCC suffix rule.4 ms
Discarding 1043 places :
Also discarding 1001 output transitions
Drop transitions (Output transitions of discarded places.) removed 1001 transitions
Reduce places removed 11 places and 11 transitions.
Applied a total of 1 rules in 8 ms. Remains 33 /1087 variables (removed 1054) and now considering 44/1056 (removed 1012) transitions.
// Phase 1: matrix 44 rows 33 cols
[2025-06-01 16:06:23] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:23] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-01 16:06:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:23] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:06:23] [INFO ] Redundant transitions in 1 ms returned []
Running 22 sub problems to find dead transitions.
[2025-06-01 16:06:23] [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 682 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 548 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 1234ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 1235ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/1087 places, 44/1056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1328 ms. Remains : 33/1087 places, 44/1056 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04 finished in 1389 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 123 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1056/1056 transitions.
Discarding 23 places :
Implicit places reduction removed 23 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1064 transition count 1056
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 40 place count 1047 transition count 1038
Iterating global reduction 1 with 17 rules applied. Total rules applied 57 place count 1047 transition count 1038
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 81 place count 1023 transition count 1004
Iterating global reduction 1 with 24 rules applied. Total rules applied 105 place count 1023 transition count 1004
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 128 place count 1000 transition count 971
Iterating global reduction 1 with 23 rules applied. Total rules applied 151 place count 1000 transition count 971
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 173 place count 978 transition count 929
Iterating global reduction 1 with 22 rules applied. Total rules applied 195 place count 978 transition count 929
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 206 place count 978 transition count 918
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 216 place count 968 transition count 908
Iterating global reduction 2 with 10 rules applied. Total rules applied 226 place count 968 transition count 908
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 236 place count 958 transition count 898
Iterating global reduction 2 with 10 rules applied. Total rules applied 246 place count 958 transition count 898
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 256 place count 948 transition count 888
Iterating global reduction 2 with 10 rules applied. Total rules applied 266 place count 948 transition count 888
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 276 place count 938 transition count 878
Iterating global reduction 2 with 10 rules applied. Total rules applied 286 place count 938 transition count 878
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 287 place count 937 transition count 878
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 297 place count 927 transition count 868
Iterating global reduction 3 with 10 rules applied. Total rules applied 307 place count 927 transition count 868
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 317 place count 917 transition count 858
Iterating global reduction 3 with 10 rules applied. Total rules applied 327 place count 917 transition count 858
Applied a total of 327 rules in 561 ms. Remains 917 /1087 variables (removed 170) and now considering 858/1056 (removed 198) transitions.
// Phase 1: matrix 858 rows 917 cols
[2025-06-01 16:06:25] [INFO ] Computed 103 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:26] [INFO ] Implicit Places using invariants in 510 ms returned [77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 187, 674]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 511 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 904/1087 places, 858/1056 transitions.
Applied a total of 0 rules in 43 ms. Remains 904 /904 variables (removed 0) and now considering 858/858 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1116 ms. Remains : 904/1087 places, 858/1056 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2))), (AND p0 p3), (OR p0 (AND p1 (NOT p2))), (AND p1 (NOT p2)), p0]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 847 ms.
Product exploration explored 100000 steps with 33333 reset in 584 ms.
Computed a total of 904 stabilizing places and 858 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 904 transition count 858
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) p2 (NOT p1) (NOT p3)), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1)))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p3)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 27 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-PT-L00010M0001C001P001G001-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-06 finished in 3314 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 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1056/1056 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1042 transition count 1056
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 72 place count 1015 transition count 1018
Iterating global reduction 1 with 27 rules applied. Total rules applied 99 place count 1015 transition count 1018
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 110 place count 1015 transition count 1007
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 135 place count 990 transition count 972
Iterating global reduction 2 with 25 rules applied. Total rules applied 160 place count 990 transition count 972
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 193 place count 957 transition count 929
Iterating global reduction 2 with 33 rules applied. Total rules applied 226 place count 957 transition count 929
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 259 place count 924 transition count 876
Iterating global reduction 2 with 33 rules applied. Total rules applied 292 place count 924 transition count 876
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 303 place count 924 transition count 865
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 324 place count 903 transition count 844
Iterating global reduction 3 with 21 rules applied. Total rules applied 345 place count 903 transition count 844
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 366 place count 882 transition count 823
Iterating global reduction 3 with 21 rules applied. Total rules applied 387 place count 882 transition count 823
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 408 place count 861 transition count 802
Iterating global reduction 3 with 21 rules applied. Total rules applied 429 place count 861 transition count 802
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 450 place count 840 transition count 781
Iterating global reduction 3 with 21 rules applied. Total rules applied 471 place count 840 transition count 781
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 472 place count 839 transition count 781
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 493 place count 818 transition count 760
Iterating global reduction 4 with 21 rules applied. Total rules applied 514 place count 818 transition count 760
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 535 place count 797 transition count 739
Iterating global reduction 4 with 21 rules applied. Total rules applied 556 place count 797 transition count 739
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 567 place count 786 transition count 728
Iterating global reduction 4 with 11 rules applied. Total rules applied 578 place count 786 transition count 728
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 589 place count 775 transition count 717
Iterating global reduction 4 with 11 rules applied. Total rules applied 600 place count 775 transition count 717
Applied a total of 600 rules in 693 ms. Remains 775 /1087 variables (removed 312) and now considering 717/1056 (removed 339) transitions.
// Phase 1: matrix 717 rows 775 cols
[2025-06-01 16:06:28] [INFO ] Computed 81 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:29] [INFO ] Implicit Places using invariants in 453 ms returned [176, 360, 519]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 455 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 772/1087 places, 717/1056 transitions.
Applied a total of 0 rules in 37 ms. Remains 772 /772 variables (removed 0) and now considering 717/717 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1185 ms. Remains : 772/1087 places, 717/1056 transitions.
Stuttering acceptance computed with spot in 211 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-PT-L00010M0001C001P001G001-LTLFireability-07
Entered a terminal (fully accepting) state of product in 253 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-07 finished in 1426 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' '!((p0&&(X((p0||G(p1))) U ((!p1&&X((p0||G(p1))))||X(G((p0||G(p1))))))))'
Support contains 2 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1056/1056 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1042 transition count 1056
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 74 place count 1013 transition count 1016
Iterating global reduction 1 with 29 rules applied. Total rules applied 103 place count 1013 transition count 1016
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 114 place count 1013 transition count 1005
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 149 place count 978 transition count 960
Iterating global reduction 2 with 35 rules applied. Total rules applied 184 place count 978 transition count 960
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 218 place count 944 transition count 916
Iterating global reduction 2 with 34 rules applied. Total rules applied 252 place count 944 transition count 916
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 284 place count 912 transition count 864
Iterating global reduction 2 with 32 rules applied. Total rules applied 316 place count 912 transition count 864
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 326 place count 912 transition count 854
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 347 place count 891 transition count 833
Iterating global reduction 3 with 21 rules applied. Total rules applied 368 place count 891 transition count 833
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 389 place count 870 transition count 812
Iterating global reduction 3 with 21 rules applied. Total rules applied 410 place count 870 transition count 812
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 431 place count 849 transition count 791
Iterating global reduction 3 with 21 rules applied. Total rules applied 452 place count 849 transition count 791
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 473 place count 828 transition count 770
Iterating global reduction 3 with 21 rules applied. Total rules applied 494 place count 828 transition count 770
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 495 place count 827 transition count 770
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 516 place count 806 transition count 749
Iterating global reduction 4 with 21 rules applied. Total rules applied 537 place count 806 transition count 749
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 558 place count 785 transition count 728
Iterating global reduction 4 with 21 rules applied. Total rules applied 579 place count 785 transition count 728
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 590 place count 774 transition count 717
Iterating global reduction 4 with 11 rules applied. Total rules applied 601 place count 774 transition count 717
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 612 place count 763 transition count 706
Iterating global reduction 4 with 11 rules applied. Total rules applied 623 place count 763 transition count 706
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 634 place count 752 transition count 695
Iterating global reduction 4 with 11 rules applied. Total rules applied 645 place count 752 transition count 695
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 656 place count 741 transition count 684
Iterating global reduction 4 with 11 rules applied. Total rules applied 667 place count 741 transition count 684
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 4 with 22 rules applied. Total rules applied 689 place count 730 transition count 673
Applied a total of 689 rules in 779 ms. Remains 730 /1087 variables (removed 357) and now considering 673/1056 (removed 383) transitions.
// Phase 1: matrix 673 rows 730 cols
[2025-06-01 16:06:30] [INFO ] Computed 70 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:30] [INFO ] Implicit Places using invariants in 464 ms returned [144, 328, 487]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 466 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 727/1087 places, 673/1056 transitions.
Applied a total of 0 rules in 40 ms. Remains 727 /727 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1286 ms. Remains : 727/1087 places, 673/1056 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08
Entered a terminal (fully accepting) state of product in 452 steps with 0 reset in 4 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08 finished in 1539 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)))'
Support contains 1 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1056/1056 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1042 transition count 1056
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 74 place count 1013 transition count 1016
Iterating global reduction 1 with 29 rules applied. Total rules applied 103 place count 1013 transition count 1016
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 114 place count 1013 transition count 1005
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 149 place count 978 transition count 960
Iterating global reduction 2 with 35 rules applied. Total rules applied 184 place count 978 transition count 960
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 218 place count 944 transition count 916
Iterating global reduction 2 with 34 rules applied. Total rules applied 252 place count 944 transition count 916
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 285 place count 911 transition count 863
Iterating global reduction 2 with 33 rules applied. Total rules applied 318 place count 911 transition count 863
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 329 place count 911 transition count 852
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 350 place count 890 transition count 831
Iterating global reduction 3 with 21 rules applied. Total rules applied 371 place count 890 transition count 831
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 392 place count 869 transition count 810
Iterating global reduction 3 with 21 rules applied. Total rules applied 413 place count 869 transition count 810
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 434 place count 848 transition count 789
Iterating global reduction 3 with 21 rules applied. Total rules applied 455 place count 848 transition count 789
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 475 place count 828 transition count 769
Iterating global reduction 3 with 20 rules applied. Total rules applied 495 place count 828 transition count 769
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 496 place count 827 transition count 769
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 516 place count 807 transition count 749
Iterating global reduction 4 with 20 rules applied. Total rules applied 536 place count 807 transition count 749
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 556 place count 787 transition count 729
Iterating global reduction 4 with 20 rules applied. Total rules applied 576 place count 787 transition count 729
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 586 place count 777 transition count 719
Iterating global reduction 4 with 10 rules applied. Total rules applied 596 place count 777 transition count 719
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 606 place count 767 transition count 709
Iterating global reduction 4 with 10 rules applied. Total rules applied 616 place count 767 transition count 709
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 626 place count 757 transition count 699
Iterating global reduction 4 with 10 rules applied. Total rules applied 636 place count 757 transition count 699
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 646 place count 747 transition count 689
Iterating global reduction 4 with 10 rules applied. Total rules applied 656 place count 747 transition count 689
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 4 with 20 rules applied. Total rules applied 676 place count 737 transition count 679
Applied a total of 676 rules in 835 ms. Remains 737 /1087 variables (removed 350) and now considering 679/1056 (removed 377) transitions.
// Phase 1: matrix 679 rows 737 cols
[2025-06-01 16:06:32] [INFO ] Computed 71 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:32] [INFO ] Implicit Places using invariants in 451 ms returned [77, 147, 335, 494]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 453 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 733/1087 places, 679/1056 transitions.
Applied a total of 0 rules in 38 ms. Remains 733 /733 variables (removed 0) and now considering 679/679 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1326 ms. Remains : 733/1087 places, 679/1056 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09
Stuttering criterion allowed to conclude after 846 steps with 3 reset in 4 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09 finished in 1444 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(G(p0)))'
Support contains 1 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1056/1056 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1042 transition count 1056
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 74 place count 1013 transition count 1016
Iterating global reduction 1 with 29 rules applied. Total rules applied 103 place count 1013 transition count 1016
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 114 place count 1013 transition count 1005
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 149 place count 978 transition count 960
Iterating global reduction 2 with 35 rules applied. Total rules applied 184 place count 978 transition count 960
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 218 place count 944 transition count 916
Iterating global reduction 2 with 34 rules applied. Total rules applied 252 place count 944 transition count 916
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 285 place count 911 transition count 863
Iterating global reduction 2 with 33 rules applied. Total rules applied 318 place count 911 transition count 863
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 329 place count 911 transition count 852
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 350 place count 890 transition count 831
Iterating global reduction 3 with 21 rules applied. Total rules applied 371 place count 890 transition count 831
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 392 place count 869 transition count 810
Iterating global reduction 3 with 21 rules applied. Total rules applied 413 place count 869 transition count 810
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 434 place count 848 transition count 789
Iterating global reduction 3 with 21 rules applied. Total rules applied 455 place count 848 transition count 789
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 476 place count 827 transition count 768
Iterating global reduction 3 with 21 rules applied. Total rules applied 497 place count 827 transition count 768
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 498 place count 826 transition count 768
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 519 place count 805 transition count 747
Iterating global reduction 4 with 21 rules applied. Total rules applied 540 place count 805 transition count 747
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 561 place count 784 transition count 726
Iterating global reduction 4 with 21 rules applied. Total rules applied 582 place count 784 transition count 726
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 593 place count 773 transition count 715
Iterating global reduction 4 with 11 rules applied. Total rules applied 604 place count 773 transition count 715
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 615 place count 762 transition count 704
Iterating global reduction 4 with 11 rules applied. Total rules applied 626 place count 762 transition count 704
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 637 place count 751 transition count 693
Iterating global reduction 4 with 11 rules applied. Total rules applied 648 place count 751 transition count 693
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 659 place count 740 transition count 682
Iterating global reduction 4 with 11 rules applied. Total rules applied 670 place count 740 transition count 682
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 4 with 22 rules applied. Total rules applied 692 place count 729 transition count 671
Applied a total of 692 rules in 779 ms. Remains 729 /1087 variables (removed 358) and now considering 671/1056 (removed 385) transitions.
// Phase 1: matrix 671 rows 729 cols
[2025-06-01 16:06:33] [INFO ] Computed 70 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:33] [INFO ] Implicit Places using invariants in 454 ms returned [143, 327, 486]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 456 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 726/1087 places, 671/1056 transitions.
Applied a total of 0 rules in 42 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1278 ms. Remains : 726/1087 places, 671/1056 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10 finished in 1407 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)) U p1) U (X(p2) U (X(p3)||!p2)))))'
Support contains 6 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1056/1056 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1042 transition count 1056
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 73 place count 1014 transition count 1027
Iterating global reduction 1 with 28 rules applied. Total rules applied 101 place count 1014 transition count 1027
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 112 place count 1014 transition count 1016
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 135 place count 991 transition count 993
Iterating global reduction 2 with 23 rules applied. Total rules applied 158 place count 991 transition count 993
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 170 place count 979 transition count 971
Iterating global reduction 2 with 12 rules applied. Total rules applied 182 place count 979 transition count 971
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 203 place count 958 transition count 940
Iterating global reduction 2 with 21 rules applied. Total rules applied 224 place count 958 transition count 940
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 235 place count 958 transition count 929
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 244 place count 949 transition count 911
Iterating global reduction 3 with 9 rules applied. Total rules applied 253 place count 949 transition count 911
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 262 place count 940 transition count 902
Iterating global reduction 3 with 9 rules applied. Total rules applied 271 place count 940 transition count 902
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 280 place count 931 transition count 893
Iterating global reduction 3 with 9 rules applied. Total rules applied 289 place count 931 transition count 893
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 307 place count 913 transition count 875
Iterating global reduction 3 with 18 rules applied. Total rules applied 325 place count 913 transition count 875
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 334 place count 904 transition count 857
Iterating global reduction 3 with 9 rules applied. Total rules applied 343 place count 904 transition count 857
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 352 place count 895 transition count 848
Iterating global reduction 3 with 9 rules applied. Total rules applied 361 place count 895 transition count 848
Applied a total of 361 rules in 672 ms. Remains 895 /1087 variables (removed 192) and now considering 848/1056 (removed 208) transitions.
// Phase 1: matrix 848 rows 895 cols
[2025-06-01 16:06:34] [INFO ] Computed 82 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:35] [INFO ] Implicit Places using invariants in 578 ms returned [77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 187, 652]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 580 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 882/1087 places, 848/1056 transitions.
Applied a total of 0 rules in 56 ms. Remains 882 /882 variables (removed 0) and now considering 848/848 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1308 ms. Remains : 882/1087 places, 848/1056 transitions.
Stuttering acceptance computed with spot in 433 ms :[(AND p2 (NOT p3)), (NOT p0), (AND p2 (NOT p3)), (AND p2 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11
Stuttering criterion allowed to conclude after 845 steps with 1 reset in 4 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11 finished in 1790 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(F(p0))&&F(p1))))'
Support contains 3 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1056/1056 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1043 transition count 1056
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 72 place count 1015 transition count 1017
Iterating global reduction 1 with 28 rules applied. Total rules applied 100 place count 1015 transition count 1017
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 111 place count 1015 transition count 1006
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 145 place count 981 transition count 962
Iterating global reduction 2 with 34 rules applied. Total rules applied 179 place count 981 transition count 962
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 212 place count 948 transition count 919
Iterating global reduction 2 with 33 rules applied. Total rules applied 245 place count 948 transition count 919
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 277 place count 916 transition count 867
Iterating global reduction 2 with 32 rules applied. Total rules applied 309 place count 916 transition count 867
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 320 place count 916 transition count 856
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 340 place count 896 transition count 836
Iterating global reduction 3 with 20 rules applied. Total rules applied 360 place count 896 transition count 836
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 380 place count 876 transition count 816
Iterating global reduction 3 with 20 rules applied. Total rules applied 400 place count 876 transition count 816
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 420 place count 856 transition count 796
Iterating global reduction 3 with 20 rules applied. Total rules applied 440 place count 856 transition count 796
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 460 place count 836 transition count 776
Iterating global reduction 3 with 20 rules applied. Total rules applied 480 place count 836 transition count 776
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 481 place count 835 transition count 776
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 501 place count 815 transition count 756
Iterating global reduction 4 with 20 rules applied. Total rules applied 521 place count 815 transition count 756
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 541 place count 795 transition count 736
Iterating global reduction 4 with 20 rules applied. Total rules applied 561 place count 795 transition count 736
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 571 place count 785 transition count 726
Iterating global reduction 4 with 10 rules applied. Total rules applied 581 place count 785 transition count 726
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 591 place count 775 transition count 716
Iterating global reduction 4 with 10 rules applied. Total rules applied 601 place count 775 transition count 716
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 611 place count 765 transition count 706
Iterating global reduction 4 with 10 rules applied. Total rules applied 621 place count 765 transition count 706
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 631 place count 755 transition count 696
Iterating global reduction 4 with 10 rules applied. Total rules applied 641 place count 755 transition count 696
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 4 with 20 rules applied. Total rules applied 661 place count 745 transition count 686
Applied a total of 661 rules in 775 ms. Remains 745 /1087 variables (removed 342) and now considering 686/1056 (removed 370) transitions.
// Phase 1: matrix 686 rows 745 cols
[2025-06-01 16:06:36] [INFO ] Computed 72 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:36] [INFO ] Implicit Places using invariants in 326 ms returned [77, 147, 343, 502]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 328 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 741/1087 places, 686/1056 transitions.
Applied a total of 0 rules in 24 ms. Remains 741 /741 variables (removed 0) and now considering 686/686 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1128 ms. Remains : 741/1087 places, 686/1056 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-12
Stuttering criterion allowed to conclude after 644 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-12 finished in 1316 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(F((G(F(p0))||(F(p0)&&X((p1 U (p2||G(p1))))))))||(p1&&F((G(F(p0))||(F(p0)&&X((p1 U (p2||G(p1)))))))))) U G(p3)))'
Support contains 8 out of 1087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1087/1087 places, 1056/1056 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1042 transition count 1056
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 72 place count 1015 transition count 1018
Iterating global reduction 1 with 27 rules applied. Total rules applied 99 place count 1015 transition count 1018
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 110 place count 1015 transition count 1007
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 143 place count 982 transition count 964
Iterating global reduction 2 with 33 rules applied. Total rules applied 176 place count 982 transition count 964
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 208 place count 950 transition count 932
Iterating global reduction 2 with 32 rules applied. Total rules applied 240 place count 950 transition count 932
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 262 place count 928 transition count 890
Iterating global reduction 2 with 22 rules applied. Total rules applied 284 place count 928 transition count 890
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 305 place count 907 transition count 869
Iterating global reduction 2 with 21 rules applied. Total rules applied 326 place count 907 transition count 869
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 347 place count 886 transition count 848
Iterating global reduction 2 with 21 rules applied. Total rules applied 368 place count 886 transition count 848
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 389 place count 865 transition count 827
Iterating global reduction 2 with 21 rules applied. Total rules applied 410 place count 865 transition count 827
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 431 place count 844 transition count 806
Iterating global reduction 2 with 21 rules applied. Total rules applied 452 place count 844 transition count 806
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 453 place count 843 transition count 806
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 474 place count 822 transition count 785
Iterating global reduction 3 with 21 rules applied. Total rules applied 495 place count 822 transition count 785
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 516 place count 801 transition count 764
Iterating global reduction 3 with 21 rules applied. Total rules applied 537 place count 801 transition count 764
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 548 place count 790 transition count 753
Iterating global reduction 3 with 11 rules applied. Total rules applied 559 place count 790 transition count 753
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 570 place count 779 transition count 742
Iterating global reduction 3 with 11 rules applied. Total rules applied 581 place count 779 transition count 742
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 592 place count 768 transition count 731
Iterating global reduction 3 with 11 rules applied. Total rules applied 603 place count 768 transition count 731
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 614 place count 757 transition count 720
Iterating global reduction 3 with 11 rules applied. Total rules applied 625 place count 757 transition count 720
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 22 rules applied. Total rules applied 647 place count 746 transition count 709
Applied a total of 647 rules in 792 ms. Remains 746 /1087 variables (removed 341) and now considering 709/1056 (removed 347) transitions.
// Phase 1: matrix 709 rows 746 cols
[2025-06-01 16:06:38] [INFO ] Computed 70 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:38] [INFO ] Implicit Places using invariants in 440 ms returned [341]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 442 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 745/1087 places, 709/1056 transitions.
Applied a total of 0 rules in 37 ms. Remains 745 /745 variables (removed 0) and now considering 709/709 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1271 ms. Remains : 745/1087 places, 709/1056 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p3), (AND (NOT p0) p3), (NOT p0), (AND (NOT p0) p3 (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-13
Product exploration explored 100000 steps with 366 reset in 317 ms.
Product exploration explored 100000 steps with 384 reset in 468 ms.
Computed a total of 745 stabilizing places and 709 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 745 transition count 709
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 p3) p1 (NOT p0) (NOT p2)), (X (AND (NOT p3) (NOT p0))), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p0)))), (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p3) p1)), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p3 p1))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p3 p1)))), (F (G (NOT p3))), (F (G p1)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 29 factoid took 188 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 324 ms :[(NOT p3), (AND (NOT p0) p3), (NOT p0), (AND (NOT p0) p3 (NOT p1) (NOT p2)), false, false]
RANDOM walk for 40000 steps (60 resets) in 375 ms. (106 steps per ms) remains 1/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
// Phase 1: matrix 709 rows 745 cols
[2025-06-01 16:06:40] [INFO ] Computed 69 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 608/616 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/616 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/737 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/737 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 700/1437 variables, 737/806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1437 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/1442 variables, 2/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1442 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/1447 variables, 2/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1447 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/1453 variables, 3/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1453 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1454 variables, 1/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1454 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1454 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1454/1454 variables, and 814 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1567 ms.
Refiners :[Generalized P Invariants (flows): 69/69 constraints, State Equation: 745/745 constraints, PredecessorRefiner: 1/1 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 608/616 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/616 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/737 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/737 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 700/1437 variables, 737/806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1437 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1437 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/1442 variables, 2/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1442 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/1447 variables, 2/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1447 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/1453 variables, 3/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1453 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1454 variables, 1/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1454 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1454 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1454/1454 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1475 ms.
Refiners :[Generalized P Invariants (flows): 69/69 constraints, State Equation: 745/745 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3067ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 515 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=103 )
Parikh walk visited 1 properties in 13 ms.
Knowledge obtained : [(AND (NOT p3) p1 (NOT p0) (NOT p2)), (X (AND (NOT p3) (NOT p0))), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p0)))), (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p3) p1)), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p3 p1))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p3 p1)))), (F (G (NOT p3))), (F (G p1)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p3) p1))), (F (NOT (OR p0 (NOT p3) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p3) p1))), (F (NOT (OR p0 (NOT p3) p2 p1))), (F (NOT (OR (NOT p3) (NOT p1)))), (F (NOT (OR p0 (NOT p3)))), (F (NOT p1)), (F (NOT (AND (NOT p0) (NOT p3)))), (F p2), (F (NOT (AND (OR (NOT p3) p2) (OR p2 p1)))), (F p3), (F p0), (F (NOT (OR p3 p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p3) p1)))
Knowledge based reduction with 29 factoid took 348 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-13 finished in 6808 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&&G(F(p1)))))'
Support contains 2 out of 1087 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1087/1087 places, 1056/1056 transitions.
Graph (complete) has 1445 edges and 1087 vertex of which 1039 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.7 ms
Discarding 48 places :
Also discarding 59 output transitions
Drop transitions (Output transitions of discarded places.) removed 59 transitions
Reduce places removed 11 places and 11 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 45 places :
Implicit places reduction removed 45 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 571 transitions
Trivial Post-agglo rules discarded 571 transitions
Performed 571 trivial Post agglomeration. Transition count delta: 571
Iterating post reduction 0 with 617 rules applied. Total rules applied 618 place count 983 transition count 414
Reduce places removed 571 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
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 1 with 604 rules applied. Total rules applied 1222 place count 412 transition count 381
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1244 place count 390 transition count 381
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 164 Pre rules applied. Total rules applied 1244 place count 390 transition count 217
Deduced a syphon composed of 164 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 219 places and 0 transitions.
Iterating global reduction 3 with 383 rules applied. Total rules applied 1627 place count 171 transition count 217
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 3 with 20 rules applied. Total rules applied 1647 place count 171 transition count 197
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 1677 place count 151 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 1677 place count 151 transition count 176
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 1699 place count 140 transition count 176
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1712 place count 127 transition count 144
Iterating global reduction 5 with 13 rules applied. Total rules applied 1725 place count 127 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 5 rules applied. Total rules applied 1730 place count 126 transition count 140
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1733 place count 123 transition count 140
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1733 place count 123 transition count 138
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1737 place count 121 transition count 138
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1749 place count 109 transition count 116
Iterating global reduction 7 with 12 rules applied. Total rules applied 1761 place count 109 transition count 116
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 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 7 with 32 rules applied. Total rules applied 1793 place count 109 transition count 84
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1804 place count 98 transition count 84
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 10 Pre rules applied. Total rules applied 1804 place count 98 transition count 74
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 1834 place count 78 transition count 74
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 9 with 22 rules applied. Total rules applied 1856 place count 67 transition count 63
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1866 place count 57 transition count 53
Applied a total of 1866 rules in 85 ms. Remains 57 /1087 variables (removed 1030) and now considering 53/1056 (removed 1003) transitions.
// Phase 1: matrix 53 rows 57 cols
[2025-06-01 16:06:44] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:44] [INFO ] Implicit Places using invariants in 155 ms returned [1, 4, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 55]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 157 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/1087 places, 53/1056 transitions.
Reduce places removed 10 places and 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 33 transition count 41
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 31 transition count 41
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 4 place count 31 transition count 30
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 26 place count 20 transition count 30
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 35 place count 11 transition count 12
Iterating global reduction 2 with 9 rules applied. Total rules applied 44 place count 11 transition count 12
Applied a total of 44 rules in 6 ms. Remains 11 /43 variables (removed 32) and now considering 12/53 (removed 41) transitions.
// Phase 1: matrix 12 rows 11 cols
[2025-06-01 16:06:44] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:44] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-01 16:06:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:44] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 77 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/1087 places, 12/1056 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 326 ms. Remains : 10/1087 places, 12/1056 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-14
Stuttering criterion allowed to conclude after 12 steps with 1 reset in 0 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-14 finished in 543 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((F(p1)||p0))))'
Support contains 4 out of 1087 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1087/1087 places, 1056/1056 transitions.
Graph (complete) has 1445 edges and 1087 vertex of which 429 are kept as prefixes of interest. Removing 658 places using SCC suffix rule.5 ms
Discarding 658 places :
Also discarding 662 output transitions
Drop transitions (Output transitions of discarded places.) removed 662 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 290 transitions
Trivial Post-agglo rules discarded 290 transitions
Performed 290 trivial Post agglomeration. Transition count delta: 290
Iterating post reduction 0 with 334 rules applied. Total rules applied 335 place count 374 transition count 93
Reduce places removed 290 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 293 rules applied. Total rules applied 628 place count 84 transition count 90
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 631 place count 82 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 632 place count 81 transition count 89
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 632 place count 81 transition count 76
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 658 place count 68 transition count 76
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 668 place count 58 transition count 56
Iterating global reduction 4 with 10 rules applied. Total rules applied 678 place count 58 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 678 place count 58 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 680 place count 57 transition count 55
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 691 place count 46 transition count 44
Iterating global reduction 4 with 11 rules applied. Total rules applied 702 place count 46 transition count 44
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 712 place count 46 transition count 34
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 712 place count 46 transition count 24
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 742 place count 26 transition count 24
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 750 place count 18 transition count 16
Iterating global reduction 5 with 8 rules applied. Total rules applied 758 place count 18 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 760 place count 17 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 762 place count 15 transition count 13
Applied a total of 762 rules in 29 ms. Remains 15 /1087 variables (removed 1072) and now considering 13/1056 (removed 1043) transitions.
// Phase 1: matrix 13 rows 15 cols
[2025-06-01 16:06:44] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:44] [INFO ] Implicit Places using invariants in 38 ms returned [1, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/1087 places, 13/1056 transitions.
Graph (complete) has 13 edges and 13 vertex of which 11 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 10 transition count 10
Applied a total of 3 rules in 1 ms. Remains 10 /13 variables (removed 3) and now considering 10/13 (removed 3) transitions.
// Phase 1: matrix 10 rows 10 cols
[2025-06-01 16:06:44] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:44] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-01 16:06:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:06:44] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/1087 places, 10/1056 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 132 ms. Remains : 10/1087 places, 10/1056 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15
Product exploration explored 100000 steps with 16806 reset in 108 ms.
Product exploration explored 100000 steps with 16875 reset in 144 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 10
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 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 21 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15 finished in 566 ms.
All properties solved by simple procedures.
Total runtime 306695 ms.

BK_STOP 1748794005424

--------------------
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-PT-L00010M0001C001P001G001"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FamilyReunion-PT-L00010M0001C001P001G001, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102000196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00010M0001C001P001G001.tgz
mv FamilyReunion-PT-L00010M0001C001P001G001 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.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 ;