Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r158-smll-171636267000500.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is FamilyReunion-PT-L00050M0005C002P002G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636267000500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 103K Apr 11 20:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 634K Apr 11 20:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 375K Apr 11 20:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 11 20:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 52K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 226K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 86K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 245K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 233K Apr 11 21:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 11 21:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 818K Apr 11 21:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.9M Apr 11 21:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 41K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.7M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716694655239

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-L00050M0005C002P002G001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-26 03:37:37] [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]
[2024-05-26 03:37:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:37:39] [INFO ] Load time of PNML (sax parser for PT used): 1107 ms
[2024-05-26 03:37:39] [INFO ] Transformed 12194 places.
[2024-05-26 03:37:39] [INFO ] Transformed 10560 transitions.
[2024-05-26 03:37:39] [INFO ] Parsed PT model containing 12194 places and 10560 transitions and 32238 arcs in 1595 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 17 places and 0 transitions.
Support contains 3032 out of 12177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Reduce places removed 173 places and 0 transitions.
Discarding 1223 places :
Implicit places reduction removed 1223 places
Iterating post reduction 0 with 1396 rules applied. Total rules applied 1396 place count 10781 transition count 10560
Discarding 665 places :
Symmetric choice reduction at 1 with 665 rule applications. Total rules 2061 place count 10116 transition count 9844
Iterating global reduction 1 with 665 rules applied. Total rules applied 2726 place count 10116 transition count 9844
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2777 place count 10065 transition count 9844
Discarding 406 places :
Symmetric choice reduction at 2 with 406 rule applications. Total rules 3183 place count 9659 transition count 9438
Iterating global reduction 2 with 406 rules applied. Total rules applied 3589 place count 9659 transition count 9438
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 153 rules applied. Total rules applied 3742 place count 9608 transition count 9336
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 3996 place count 9354 transition count 9082
Iterating global reduction 3 with 254 rules applied. Total rules applied 4250 place count 9354 transition count 9082
Applied a total of 4250 rules in 7473 ms. Remains 9354 /12177 variables (removed 2823) and now considering 9082/10560 (removed 1478) transitions.
// Phase 1: matrix 9082 rows 9354 cols
[2024-05-26 03:37:48] [INFO ] Computed 1332 invariants in 796 ms
[2024-05-26 03:37:54] [INFO ] Implicit Places using invariants in 7162 ms returned [357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 400, 401, 402, 403, 404, 405, 406, 407, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498, 3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 5873, 5874, 5875, 5876, 5877, 5878, 5879, 5880, 5881, 5882, 5883, 5884, 5885, 5886, 5887, 5888, 5889, 5890, 5891, 5892, 5893, 5894, 5895, 5896, 5897, 5898, 5899, 5900, 5901, 5902, 5903, 5904, 5905, 5906, 5907, 5908, 5909, 5910, 5911, 5912, 5913, 5914, 5915, 5916, 5918, 5919, 5920, 5921, 5922, 5923, 6848, 6849, 6850, 6851, 6852, 6853, 6854, 6855, 6856, 6857, 6858, 6859, 6860, 6861, 6862, 6863, 6864, 6865, 6866, 6867, 6868, 6869, 6870, 6871, 6872, 6873, 6874, 6875, 6876, 6877, 6878, 6879, 6880, 6881, 6882, 6883, 6884, 6885, 6886, 6887, 6888, 6889, 6890, 6891, 6892, 6893, 6894, 6895, 6896, 6897, 6898]
Discarding 253 places :
Implicit Place search using SMT only with invariants took 7238 ms to find 253 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9101/12177 places, 9082/10560 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 99 place count 9002 transition count 8983
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 9002 transition count 8983
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 247 place count 8953 transition count 8885
Iterating global reduction 0 with 49 rules applied. Total rules applied 296 place count 8953 transition count 8885
Applied a total of 296 rules in 4253 ms. Remains 8953 /9101 variables (removed 148) and now considering 8885/9082 (removed 197) transitions.
// Phase 1: matrix 8885 rows 8953 cols
[2024-05-26 03:37:59] [INFO ] Computed 1079 invariants in 247 ms
[2024-05-26 03:38:03] [INFO ] Implicit Places using invariants in 4054 ms returned []
[2024-05-26 03:38:03] [INFO ] Invariant cache hit.
[2024-05-26 03:38:27] [INFO ] Implicit Places using invariants and state equation in 24057 ms returned []
Implicit Place search using SMT with State Equation took 28115 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 8953/12177 places, 8885/10560 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47119 ms. Remains : 8953/12177 places, 8885/10560 transitions.
Support contains 3032 out of 8953 places after structural reductions.
[2024-05-26 03:38:28] [INFO ] Flatten gal took : 797 ms
[2024-05-26 03:38:29] [INFO ] Flatten gal took : 354 ms
[2024-05-26 03:38:30] [INFO ] Input system was already deterministic with 8885 transitions.
Reduction of identical properties reduced properties to check from 33 to 31
RANDOM walk for 40000 steps (12 resets) in 3761 ms. (10 steps per ms) remains 3/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
[2024-05-26 03:38:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6074/6082 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6082 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2593/8675 variables, 985/993 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8675/17838 variables, and 993 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5024 ms.
Refiners :[Generalized P Invariants (flows): 993/1079 constraints, State Equation: 0/8953 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6074/6082 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6082 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2593/8675 variables, 985/993 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8675 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 172/8847 variables, 86/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8847/17838 variables, and 1079 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 1079/1079 constraints, State Equation: 0/8953 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 10196ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 8953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Graph (complete) has 12420 edges and 8953 vertex of which 8799 are kept as prefixes of interest. Removing 154 places using SCC suffix rule.37 ms
Discarding 154 places :
Also discarding 105 output transitions
Drop transitions (Output transitions of discarded places.) removed 105 transitions
Drop transitions (Empty/Sink Transition effects.) removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Discarding 610 places :
Implicit places reduction removed 610 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5488 transitions
Trivial Post-agglo rules discarded 5488 transitions
Performed 5488 trivial Post agglomeration. Transition count delta: 5488
Iterating post reduction 0 with 6198 rules applied. Total rules applied 6199 place count 8189 transition count 3192
Reduce places removed 5488 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 5491 rules applied. Total rules applied 11690 place count 2701 transition count 3189
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 11693 place count 2698 transition count 3189
Performed 717 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 717 Pre rules applied. Total rules applied 11693 place count 2698 transition count 2472
Deduced a syphon composed of 717 places in 2 ms
Ensure Unique test removed 306 places
Reduce places removed 1023 places and 0 transitions.
Iterating global reduction 3 with 1740 rules applied. Total rules applied 13433 place count 1675 transition count 2472
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 3 with 153 rules applied. Total rules applied 13586 place count 1675 transition count 2319
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 4 with 153 rules applied. Total rules applied 13739 place count 1522 transition count 2319
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 13739 place count 1522 transition count 2268
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 13841 place count 1471 transition count 2268
Discarding 615 places :
Symmetric choice reduction at 5 with 615 rule applications. Total rules 14456 place count 856 transition count 1404
Iterating global reduction 5 with 615 rules applied. Total rules applied 15071 place count 856 transition count 1404
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 5 with 250 rules applied. Total rules applied 15321 place count 856 transition count 1154
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 6 with 52 rules applied. Total rules applied 15373 place count 804 transition count 1154
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 104 Pre rules applied. Total rules applied 15373 place count 804 transition count 1050
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 7 with 208 rules applied. Total rules applied 15581 place count 700 transition count 1050
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 15591 place count 690 transition count 789
Iterating global reduction 7 with 10 rules applied. Total rules applied 15601 place count 690 transition count 789
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Discarding 152 places :
Implicit places reduction removed 152 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 7 with 612 rules applied. Total rules applied 16213 place count 538 transition count 329
Reduce places removed 203 places and 0 transitions.
Iterating post reduction 8 with 203 rules applied. Total rules applied 16416 place count 335 transition count 329
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 16416 place count 335 transition count 228
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 16618 place count 234 transition count 228
Discarding 50 places :
Symmetric choice reduction at 9 with 50 rule applications. Total rules 16668 place count 184 transition count 178
Iterating global reduction 9 with 50 rules applied. Total rules applied 16718 place count 184 transition count 178
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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 4 rules applied. Total rules applied 16722 place count 183 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 16724 place count 181 transition count 175
Discarding 49 places :
Symmetric choice reduction at 11 with 49 rule applications. Total rules 16773 place count 132 transition count 126
Iterating global reduction 11 with 49 rules applied. Total rules applied 16822 place count 132 transition count 126
Discarding 49 places :
Symmetric choice reduction at 11 with 49 rule applications. Total rules 16871 place count 83 transition count 77
Iterating global reduction 11 with 49 rules applied. Total rules applied 16920 place count 83 transition count 77
Discarding 46 places :
Symmetric choice reduction at 11 with 46 rule applications. Total rules 16966 place count 37 transition count 31
Iterating global reduction 11 with 46 rules applied. Total rules applied 17012 place count 37 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 17014 place count 36 transition count 30
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 17017 place count 36 transition count 27
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 17020 place count 33 transition count 27
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 12 with 3 rules applied. Total rules applied 17023 place count 33 transition count 24
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 17027 place count 29 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 17029 place count 27 transition count 22
Applied a total of 17029 rules in 1075 ms. Remains 27 /8953 variables (removed 8926) and now considering 22/8885 (removed 8863) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1076 ms. Remains : 27/8953 places, 22/8885 transitions.
RANDOM walk for 2886 steps (24 resets) in 16 ms. (169 steps per ms) remains 0/3 properties
Computed a total of 8953 stabilizing places and 8885 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8953 transition count 8885
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((!p0||X(F((F(p0)&&p1))))))))))'
Support contains 153 out of 8953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 8340 transition count 8885
Discarding 514 places :
Symmetric choice reduction at 1 with 514 rule applications. Total rules 1127 place count 7826 transition count 8121
Iterating global reduction 1 with 514 rules applied. Total rules applied 1641 place count 7826 transition count 8121
Discarding 307 places :
Symmetric choice reduction at 1 with 307 rule applications. Total rules 1948 place count 7519 transition count 7714
Iterating global reduction 1 with 307 rules applied. Total rules applied 2255 place count 7519 transition count 7714
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2306 place count 7468 transition count 7714
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 2663 place count 7111 transition count 7257
Iterating global reduction 2 with 357 rules applied. Total rules applied 3020 place count 7111 transition count 7257
Discarding 406 places :
Symmetric choice reduction at 2 with 406 rule applications. Total rules 3426 place count 6705 transition count 6851
Iterating global reduction 2 with 406 rules applied. Total rules applied 3832 place count 6705 transition count 6851
Discarding 304 places :
Symmetric choice reduction at 2 with 304 rule applications. Total rules 4136 place count 6401 transition count 6547
Iterating global reduction 2 with 304 rules applied. Total rules applied 4440 place count 6401 transition count 6547
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4695 place count 6146 transition count 6292
Iterating global reduction 2 with 255 rules applied. Total rules applied 4950 place count 6146 transition count 6292
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5205 place count 5891 transition count 6037
Iterating global reduction 2 with 255 rules applied. Total rules applied 5460 place count 5891 transition count 6037
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5715 place count 5636 transition count 5782
Iterating global reduction 2 with 255 rules applied. Total rules applied 5970 place count 5636 transition count 5782
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6225 place count 5381 transition count 5527
Iterating global reduction 2 with 255 rules applied. Total rules applied 6480 place count 5381 transition count 5527
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6735 place count 5126 transition count 5272
Iterating global reduction 2 with 255 rules applied. Total rules applied 6990 place count 5126 transition count 5272
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7245 place count 4871 transition count 5017
Iterating global reduction 2 with 255 rules applied. Total rules applied 7500 place count 4871 transition count 5017
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7755 place count 4616 transition count 4762
Iterating global reduction 2 with 255 rules applied. Total rules applied 8010 place count 4616 transition count 4762
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8265 place count 4361 transition count 4507
Iterating global reduction 2 with 255 rules applied. Total rules applied 8520 place count 4361 transition count 4507
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8775 place count 4106 transition count 4252
Iterating global reduction 2 with 255 rules applied. Total rules applied 9030 place count 4106 transition count 4252
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 2 with 204 rules applied. Total rules applied 9234 place count 4106 transition count 4048
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 9285 place count 4055 transition count 3997
Iterating global reduction 3 with 51 rules applied. Total rules applied 9336 place count 4055 transition count 3997
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 9387 place count 4004 transition count 3946
Iterating global reduction 3 with 51 rules applied. Total rules applied 9438 place count 4004 transition count 3946
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 52 rules applied. Total rules applied 9490 place count 4003 transition count 3895
Applied a total of 9490 rules in 22105 ms. Remains 4003 /8953 variables (removed 4950) and now considering 3895/8885 (removed 4990) transitions.
// Phase 1: matrix 3895 rows 4003 cols
[2024-05-26 03:39:05] [INFO ] Computed 414 invariants in 50 ms
[2024-05-26 03:39:08] [INFO ] Implicit Places using invariants in 2362 ms returned [1695, 1749, 1852, 2574, 2575, 2576, 2577, 2578, 2579, 2580, 2581, 2582, 2583, 2584, 2585, 2586, 2587, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2602, 2603, 2604, 2605, 2606, 2607, 2608, 2609, 2610, 2611, 2612, 2613, 2614, 2615, 2616, 2617, 2618, 2619, 2620, 2621, 2622, 2623, 2624, 3543]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 2365 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3948/8953 places, 3895/8885 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3946 transition count 3893
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3946 transition count 3893
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 3945 transition count 3891
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3945 transition count 3891
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 3944 transition count 3890
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 3944 transition count 3890
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 3943 transition count 3889
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 3943 transition count 3889
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 3942 transition count 3888
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 3942 transition count 3888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3941 transition count 3887
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3941 transition count 3887
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 3940 transition count 3886
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 3940 transition count 3886
Applied a total of 16 rules in 4987 ms. Remains 3940 /3948 variables (removed 8) and now considering 3886/3895 (removed 9) transitions.
// Phase 1: matrix 3886 rows 3940 cols
[2024-05-26 03:39:13] [INFO ] Computed 359 invariants in 37 ms
[2024-05-26 03:39:14] [INFO ] Implicit Places using invariants in 1929 ms returned []
[2024-05-26 03:39:14] [INFO ] Invariant cache hit.
[2024-05-26 03:39:21] [INFO ] Implicit Places using invariants and state equation in 6828 ms returned []
Implicit Place search using SMT with State Equation took 8766 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3940/8953 places, 3886/8885 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38224 ms. Remains : 3940/8953 places, 3886/8885 transitions.
Stuttering acceptance computed with spot in 407 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-00
Product exploration explored 100000 steps with 20000 reset in 1740 ms.
Product exploration explored 100000 steps with 20000 reset in 1272 ms.
Computed a total of 3940 stabilizing places and 3886 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3940 transition count 3886
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-00 finished in 43371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(G(p0))) U (F(p1)&&(F(!p3)||p2))))))'
Support contains 669 out of 8953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 8340 transition count 8885
Discarding 612 places :
Symmetric choice reduction at 1 with 612 rule applications. Total rules 1225 place count 7728 transition count 8223
Iterating global reduction 1 with 612 rules applied. Total rules applied 1837 place count 7728 transition count 8223
Discarding 205 places :
Symmetric choice reduction at 1 with 205 rule applications. Total rules 2042 place count 7523 transition count 7918
Iterating global reduction 1 with 205 rules applied. Total rules applied 2247 place count 7523 transition count 7918
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2298 place count 7472 transition count 7918
Discarding 154 places :
Symmetric choice reduction at 2 with 154 rule applications. Total rules 2452 place count 7318 transition count 7614
Iterating global reduction 2 with 154 rules applied. Total rules applied 2606 place count 7318 transition count 7614
Discarding 253 places :
Symmetric choice reduction at 2 with 253 rule applications. Total rules 2859 place count 7065 transition count 7361
Iterating global reduction 2 with 253 rules applied. Total rules applied 3112 place count 7065 transition count 7361
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 2 with 102 rules applied. Total rules applied 3214 place count 7065 transition count 7259
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 3263 place count 7016 transition count 7210
Iterating global reduction 3 with 49 rules applied. Total rules applied 3312 place count 7016 transition count 7210
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 3361 place count 6967 transition count 7161
Iterating global reduction 3 with 49 rules applied. Total rules applied 3410 place count 6967 transition count 7161
Applied a total of 3410 rules in 14526 ms. Remains 6967 /8953 variables (removed 1986) and now considering 7161/8885 (removed 1724) transitions.
// Phase 1: matrix 7161 rows 6967 cols
[2024-05-26 03:39:41] [INFO ] Computed 415 invariants in 134 ms
[2024-05-26 03:39:44] [INFO ] Implicit Places using invariants in 3021 ms returned [357, 1429, 4144, 4453, 5538, 5539, 5540, 5541, 5542, 5543, 5544, 5545, 5546, 5547, 5548, 5549, 5550, 5551, 5552, 5553, 5554, 5555, 5556, 5557, 5558, 5559, 5560, 5561, 5562, 5563, 5564, 5565, 5566, 5567, 5568, 5569, 5570, 5571, 5572, 5573, 5574, 5575, 5576, 5577, 5578, 5579, 5580, 5581, 5582, 5583, 5584, 5585, 5586, 5587, 5588, 6507]
Discarding 56 places :
Implicit Place search using SMT only with invariants took 3030 ms to find 56 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6911/8953 places, 7161/8885 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6909 transition count 7159
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6909 transition count 7159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 6908 transition count 7157
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 6908 transition count 7157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 6907 transition count 7156
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 6907 transition count 7156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 6906 transition count 7155
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 6906 transition count 7155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 6905 transition count 7154
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 6905 transition count 7154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 6904 transition count 7153
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 6904 transition count 7153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 6903 transition count 7152
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 6903 transition count 7152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 6902 transition count 7151
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 6902 transition count 7151
Applied a total of 18 rules in 17053 ms. Remains 6902 /6911 variables (removed 9) and now considering 7151/7161 (removed 10) transitions.
// Phase 1: matrix 7151 rows 6902 cols
[2024-05-26 03:40:01] [INFO ] Computed 359 invariants in 124 ms
[2024-05-26 03:40:04] [INFO ] Implicit Places using invariants in 2687 ms returned []
[2024-05-26 03:40:04] [INFO ] Invariant cache hit.
[2024-05-26 03:40:13] [INFO ] Implicit Places using invariants and state equation in 9582 ms returned []
Implicit Place search using SMT with State Equation took 12275 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 6902/8953 places, 7151/8885 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46885 ms. Remains : 6902/8953 places, 7151/8885 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p1) (AND (NOT p2) p3)), (OR (NOT p1) (AND (NOT p2) p3)), (NOT p1), (OR (AND (NOT p1) p3) (AND (NOT p2) p3) (AND (NOT p0) p3)), (AND p3 (NOT p0)), (AND (NOT p1) p3), p3]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-01
Product exploration explored 100000 steps with 95 reset in 1488 ms.
Product exploration explored 100000 steps with 95 reset in 1401 ms.
Computed a total of 6902 stabilizing places and 7151 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6902 transition count 7151
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT p1)), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 104 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 4001 steps (0 resets) in 187 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT p1)), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 14 factoid took 198 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-01 finished in 53525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 210 out of 8953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Graph (complete) has 12420 edges and 8953 vertex of which 6079 are kept as prefixes of interest. Removing 2874 places using SCC suffix rule.29 ms
Discarding 2874 places :
Also discarding 2814 output transitions
Drop transitions (Output transitions of discarded places.) removed 2814 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4176 transitions
Trivial Post-agglo rules discarded 4176 transitions
Performed 4176 trivial Post agglomeration. Transition count delta: 4176
Iterating post reduction 0 with 4789 rules applied. Total rules applied 4790 place count 5415 transition count 1844
Reduce places removed 4176 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4177 rules applied. Total rules applied 8967 place count 1239 transition count 1843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8968 place count 1238 transition count 1843
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 8968 place count 1238 transition count 1690
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 9274 place count 1085 transition count 1690
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 9529 place count 830 transition count 1435
Iterating global reduction 3 with 255 rules applied. Total rules applied 9784 place count 830 transition count 1435
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9786 place count 829 transition count 1434
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -459
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 9888 place count 778 transition count 1893
Applied a total of 9888 rules in 464 ms. Remains 778 /8953 variables (removed 8175) and now considering 1893/8885 (removed 6992) transitions.
// Phase 1: matrix 1893 rows 778 cols
[2024-05-26 03:40:20] [INFO ] Computed 2 invariants in 20 ms
[2024-05-26 03:40:21] [INFO ] Implicit Places using invariants in 234 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 240 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 777/8953 places, 1893/8885 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 777 transition count 1887
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 771 transition count 1887
Applied a total of 12 rules in 71 ms. Remains 771 /777 variables (removed 6) and now considering 1887/1893 (removed 6) transitions.
// Phase 1: matrix 1887 rows 771 cols
[2024-05-26 03:40:21] [INFO ] Computed 1 invariants in 20 ms
[2024-05-26 03:40:21] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-26 03:40:21] [INFO ] Invariant cache hit.
[2024-05-26 03:40:22] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1254 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 771/8953 places, 1887/8885 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2031 ms. Remains : 771/8953 places, 1887/8885 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-02
Product exploration explored 100000 steps with 1040 reset in 2168 ms.
Product exploration explored 100000 steps with 1036 reset in 1923 ms.
Computed a total of 771 stabilizing places and 1887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 771 transition count 1887
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 16 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-L00050M0005C002P002G001-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-02 finished in 10598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(G(!p1)))))'
Support contains 663 out of 8953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Graph (complete) has 12420 edges and 8953 vertex of which 8892 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.10 ms
Discarding 61 places :
Also discarding 111 output transitions
Drop transitions (Output transitions of discarded places.) removed 111 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 307 places :
Implicit places reduction removed 307 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4585 transitions
Trivial Post-agglo rules discarded 4585 transitions
Performed 4585 trivial Post agglomeration. Transition count delta: 4585
Iterating post reduction 0 with 4892 rules applied. Total rules applied 4893 place count 8534 transition count 4138
Reduce places removed 4585 places and 0 transitions.
Iterating post reduction 1 with 4585 rules applied. Total rules applied 9478 place count 3949 transition count 4138
Performed 969 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 969 Pre rules applied. Total rules applied 9478 place count 3949 transition count 3169
Deduced a syphon composed of 969 places in 3 ms
Ensure Unique test removed 306 places
Reduce places removed 1275 places and 0 transitions.
Iterating global reduction 2 with 2244 rules applied. Total rules applied 11722 place count 2674 transition count 3169
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 2 with 153 rules applied. Total rules applied 11875 place count 2674 transition count 3016
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 3 with 153 rules applied. Total rules applied 12028 place count 2521 transition count 3016
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 12028 place count 2521 transition count 2965
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 12130 place count 2470 transition count 2965
Discarding 311 places :
Symmetric choice reduction at 4 with 311 rule applications. Total rules 12441 place count 2159 transition count 2404
Iterating global reduction 4 with 311 rules applied. Total rules applied 12752 place count 2159 transition count 2404
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 4 with 52 rules applied. Total rules applied 12804 place count 2159 transition count 2352
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 5 with 52 rules applied. Total rules applied 12856 place count 2107 transition count 2352
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 102 Pre rules applied. Total rules applied 12856 place count 2107 transition count 2250
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 6 with 204 rules applied. Total rules applied 13060 place count 2005 transition count 2250
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 13065 place count 2000 transition count 1995
Iterating global reduction 6 with 5 rules applied. Total rules applied 13070 place count 2000 transition count 1995
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 6 with 459 rules applied. Total rules applied 13529 place count 1898 transition count 1638
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 7 with 153 rules applied. Total rules applied 13682 place count 1745 transition count 1638
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 51 Pre rules applied. Total rules applied 13682 place count 1745 transition count 1587
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 13784 place count 1694 transition count 1587
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 13886 place count 1643 transition count 1536
Applied a total of 13886 rules in 946 ms. Remains 1643 /8953 variables (removed 7310) and now considering 1536/8885 (removed 7349) transitions.
// Phase 1: matrix 1536 rows 1643 cols
[2024-05-26 03:40:31] [INFO ] Computed 362 invariants in 24 ms
[2024-05-26 03:40:32] [INFO ] Implicit Places using invariants in 704 ms returned [51, 58, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 1539, 1591]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 708 ms to find 55 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1588/8953 places, 1536/8885 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 1588 transition count 1428
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 216 place count 1480 transition count 1428
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 216 place count 1480 transition count 1377
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 318 place count 1429 transition count 1377
Applied a total of 318 rules in 80 ms. Remains 1429 /1588 variables (removed 159) and now considering 1377/1536 (removed 159) transitions.
// Phase 1: matrix 1377 rows 1429 cols
[2024-05-26 03:40:32] [INFO ] Computed 307 invariants in 16 ms
[2024-05-26 03:40:33] [INFO ] Implicit Places using invariants in 525 ms returned []
[2024-05-26 03:40:33] [INFO ] Invariant cache hit.
[2024-05-26 03:40:34] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1798 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1429/8953 places, 1377/8885 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3534 ms. Remains : 1429/8953 places, 1377/8885 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-03
Product exploration explored 100000 steps with 476 reset in 2088 ms.
Product exploration explored 100000 steps with 476 reset in 1724 ms.
Computed a total of 1429 stabilizing places and 1377 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1429 transition count 1377
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (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 9 factoid took 30 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-03 finished in 11370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Support contains 357 out of 8953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 8340 transition count 8885
Discarding 514 places :
Symmetric choice reduction at 1 with 514 rule applications. Total rules 1127 place count 7826 transition count 8121
Iterating global reduction 1 with 514 rules applied. Total rules applied 1641 place count 7826 transition count 8121
Discarding 407 places :
Symmetric choice reduction at 1 with 407 rule applications. Total rules 2048 place count 7419 transition count 7714
Iterating global reduction 1 with 407 rules applied. Total rules applied 2455 place count 7419 transition count 7714
Discarding 257 places :
Symmetric choice reduction at 1 with 257 rule applications. Total rules 2712 place count 7162 transition count 7257
Iterating global reduction 1 with 257 rules applied. Total rules applied 2969 place count 7162 transition count 7257
Discarding 406 places :
Symmetric choice reduction at 1 with 406 rule applications. Total rules 3375 place count 6756 transition count 6851
Iterating global reduction 1 with 406 rules applied. Total rules applied 3781 place count 6756 transition count 6851
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 3883 place count 6756 transition count 6749
Discarding 304 places :
Symmetric choice reduction at 2 with 304 rule applications. Total rules 4187 place count 6452 transition count 6445
Iterating global reduction 2 with 304 rules applied. Total rules applied 4491 place count 6452 transition count 6445
Discarding 304 places :
Symmetric choice reduction at 2 with 304 rule applications. Total rules 4795 place count 6148 transition count 6141
Iterating global reduction 2 with 304 rules applied. Total rules applied 5099 place count 6148 transition count 6141
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5354 place count 5893 transition count 5886
Iterating global reduction 2 with 255 rules applied. Total rules applied 5609 place count 5893 transition count 5886
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5864 place count 5638 transition count 5631
Iterating global reduction 2 with 255 rules applied. Total rules applied 6119 place count 5638 transition count 5631
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6374 place count 5383 transition count 5376
Iterating global reduction 2 with 255 rules applied. Total rules applied 6629 place count 5383 transition count 5376
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6884 place count 5128 transition count 5121
Iterating global reduction 2 with 255 rules applied. Total rules applied 7139 place count 5128 transition count 5121
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7394 place count 4873 transition count 4866
Iterating global reduction 2 with 255 rules applied. Total rules applied 7649 place count 4873 transition count 4866
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7904 place count 4618 transition count 4611
Iterating global reduction 2 with 255 rules applied. Total rules applied 8159 place count 4618 transition count 4611
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8414 place count 4363 transition count 4356
Iterating global reduction 2 with 255 rules applied. Total rules applied 8669 place count 4363 transition count 4356
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8924 place count 4108 transition count 4101
Iterating global reduction 2 with 255 rules applied. Total rules applied 9179 place count 4108 transition count 4101
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 2 with 204 rules applied. Total rules applied 9383 place count 4108 transition count 3897
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 9434 place count 4057 transition count 3846
Iterating global reduction 3 with 51 rules applied. Total rules applied 9485 place count 4057 transition count 3846
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 9536 place count 4006 transition count 3795
Iterating global reduction 3 with 51 rules applied. Total rules applied 9587 place count 4006 transition count 3795
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 52 rules applied. Total rules applied 9639 place count 4005 transition count 3744
Applied a total of 9639 rules in 23542 ms. Remains 4005 /8953 variables (removed 4948) and now considering 3744/8885 (removed 5141) transitions.
// Phase 1: matrix 3744 rows 4005 cols
[2024-05-26 03:41:05] [INFO ] Computed 465 invariants in 57 ms
[2024-05-26 03:41:07] [INFO ] Implicit Places using invariants in 1865 ms returned [663, 1338, 1392, 1495, 2217, 2218, 2219, 2220, 2221, 2222, 2223, 2224, 2225, 2226, 2227, 2228, 2229, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2237, 2238, 2239, 2240, 2241, 2242, 2243, 2244, 2245, 2246, 2247, 2248, 2249, 2250, 2251, 2252, 2253, 2254, 2255, 2256, 2257, 2258, 2259, 2260, 2261, 2262, 2263, 2264, 2265, 2266, 2267]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 1870 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3950/8953 places, 3744/8885 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3948 transition count 3742
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3948 transition count 3742
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 3947 transition count 3740
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3947 transition count 3740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 3946 transition count 3739
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 3946 transition count 3739
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 3945 transition count 3738
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 3945 transition count 3738
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 3944 transition count 3737
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 3944 transition count 3737
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3943 transition count 3736
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3943 transition count 3736
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 3942 transition count 3735
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 3942 transition count 3735
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 3941 transition count 3734
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 3941 transition count 3734
Applied a total of 18 rules in 5096 ms. Remains 3941 /3950 variables (removed 9) and now considering 3734/3744 (removed 10) transitions.
// Phase 1: matrix 3734 rows 3941 cols
[2024-05-26 03:41:12] [INFO ] Computed 410 invariants in 36 ms
[2024-05-26 03:41:14] [INFO ] Implicit Places using invariants in 1664 ms returned []
[2024-05-26 03:41:14] [INFO ] Invariant cache hit.
[2024-05-26 03:41:22] [INFO ] Implicit Places using invariants and state equation in 7576 ms returned []
Implicit Place search using SMT with State Equation took 9244 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3941/8953 places, 3734/8885 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39753 ms. Remains : 3941/8953 places, 3734/8885 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-04
Product exploration explored 100000 steps with 34 reset in 2487 ms.
Product exploration explored 100000 steps with 34 reset in 1915 ms.
Computed a total of 3941 stabilizing places and 3734 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3941 transition count 3734
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 156 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 6254 steps (0 resets) in 456 ms. (13 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 449 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
[2024-05-26 03:41:29] [INFO ] Invariant cache hit.
[2024-05-26 03:41:37] [INFO ] [Real]Absence check using 0 positive and 410 generalized place invariants in 642 ms returned sat
[2024-05-26 03:41:44] [INFO ] [Real]Absence check using state equation in 6841 ms returned unknown
Could not prove EG (NOT p0)
Support contains 357 out of 3941 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3941/3941 places, 3734/3734 transitions.
Graph (complete) has 5009 edges and 3941 vertex of which 3012 are kept as prefixes of interest. Removing 929 places using SCC suffix rule.6 ms
Discarding 929 places :
Also discarding 725 output transitions
Drop transitions (Output transitions of discarded places.) removed 725 transitions
Reduce places removed 51 places and 51 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1581 transitions
Trivial Post-agglo rules discarded 1581 transitions
Performed 1581 trivial Post agglomeration. Transition count delta: 1581
Iterating post reduction 0 with 1581 rules applied. Total rules applied 1582 place count 2961 transition count 1377
Reduce places removed 1581 places and 0 transitions.
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Iterating post reduction 1 with 1734 rules applied. Total rules applied 3316 place count 1380 transition count 1224
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 2 with 153 rules applied. Total rules applied 3469 place count 1227 transition count 1224
Performed 408 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 408 Pre rules applied. Total rules applied 3469 place count 1227 transition count 816
Deduced a syphon composed of 408 places in 0 ms
Ensure Unique test removed 153 places
Reduce places removed 561 places and 0 transitions.
Iterating global reduction 3 with 969 rules applied. Total rules applied 4438 place count 666 transition count 816
Applied a total of 4438 rules in 220 ms. Remains 666 /3941 variables (removed 3275) and now considering 816/3734 (removed 2918) transitions.
// Phase 1: matrix 816 rows 666 cols
[2024-05-26 03:41:44] [INFO ] Computed 52 invariants in 10 ms
[2024-05-26 03:41:45] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-26 03:41:45] [INFO ] Invariant cache hit.
[2024-05-26 03:41:45] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
[2024-05-26 03:41:45] [INFO ] Redundant transitions in 50 ms returned []
Running 663 sub problems to find dead transitions.
[2024-05-26 03:41:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (OVERLAPS) 816/1431 variables, 615/667 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1431/1482 variables, and 667 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 52/52 constraints, State Equation: 615/666 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 663 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (OVERLAPS) 816/1431 variables, 615/667 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1431 variables, 663/1330 constraints. Problems are: Problem set: 0 solved, 663 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 1431/1482 variables, and 1330 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 52/52 constraints, State Equation: 615/666 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 0/0 constraints]
After SMT, in 60499ms problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 60511ms
Starting structural reductions in SI_LTL mode, iteration 1 : 666/3941 places, 816/3734 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61801 ms. Remains : 666/3941 places, 816/3734 transitions.
Computed a total of 666 stabilizing places and 816 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 666 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)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 236 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1109 steps (0 resets) in 33 ms. (32 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 569 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
[2024-05-26 03:42:49] [INFO ] Invariant cache hit.
[2024-05-26 03:42:52] [INFO ] [Real]Absence check using 0 positive and 52 generalized place invariants in 70 ms returned sat
[2024-05-26 03:42:53] [INFO ] [Real]Absence check using state equation in 795 ms returned sat
[2024-05-26 03:42:53] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 94 ms.
[2024-05-26 03:42:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 03:42:58] [INFO ] [Nat]Absence check using 0 positive and 52 generalized place invariants in 45 ms returned sat
[2024-05-26 03:42:58] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2024-05-26 03:42:58] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 113 ms.
[2024-05-26 03:43:02] [INFO ] Added : 217 causal constraints over 44 iterations in 3930 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Product exploration explored 100000 steps with 325 reset in 1459 ms.
Product exploration explored 100000 steps with 325 reset in 1486 ms.
Built C files in :
/tmp/ltsmin2545187224347870148
[2024-05-26 03:43:05] [INFO ] Computing symmetric may disable matrix : 816 transitions.
[2024-05-26 03:43:06] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:43:06] [INFO ] Computing symmetric may enable matrix : 816 transitions.
[2024-05-26 03:43:06] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:43:06] [INFO ] Computing Do-Not-Accords matrix : 816 transitions.
[2024-05-26 03:43:06] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:43:06] [INFO ] Built C files in 370ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2545187224347870148
Running compilation step : cd /tmp/ltsmin2545187224347870148;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2545187224347870148;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2545187224347870148;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 357 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 816/816 transitions.
Applied a total of 0 rules in 9 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
[2024-05-26 03:43:09] [INFO ] Invariant cache hit.
[2024-05-26 03:43:09] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-26 03:43:09] [INFO ] Invariant cache hit.
[2024-05-26 03:43:10] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2024-05-26 03:43:10] [INFO ] Redundant transitions in 97 ms returned []
Running 663 sub problems to find dead transitions.
[2024-05-26 03:43:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (OVERLAPS) 816/1431 variables, 615/667 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1431/1482 variables, and 667 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 52/52 constraints, State Equation: 615/666 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 663 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (OVERLAPS) 816/1431 variables, 615/667 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1431 variables, 663/1330 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Error getting values : (error "ParserException while parsing response: ((s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1431/1482 variables, and 1330 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 52/52 constraints, State Equation: 615/666 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 0/0 constraints]
After SMT, in 60514ms problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 60525ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61733 ms. Remains : 666/666 places, 816/816 transitions.
Built C files in :
/tmp/ltsmin4287243221969656920
[2024-05-26 03:44:11] [INFO ] Computing symmetric may disable matrix : 816 transitions.
[2024-05-26 03:44:11] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:44:11] [INFO ] Computing symmetric may enable matrix : 816 transitions.
[2024-05-26 03:44:11] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:44:11] [INFO ] Computing Do-Not-Accords matrix : 816 transitions.
[2024-05-26 03:44:11] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:44:11] [INFO ] Built C files in 282ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4287243221969656920
Running compilation step : cd /tmp/ltsmin4287243221969656920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4287243221969656920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4287243221969656920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-26 03:44:14] [INFO ] Flatten gal took : 26 ms
[2024-05-26 03:44:14] [INFO ] Flatten gal took : 25 ms
[2024-05-26 03:44:14] [INFO ] Time to serialize gal into /tmp/LTL8256816644794966568.gal : 11 ms
[2024-05-26 03:44:14] [INFO ] Time to serialize properties into /tmp/LTL5546460701215268259.prop : 3 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8256816644794966568.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7393456875389732989.hoa' '-atoms' '/tmp/LTL5546460701215268259.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5546460701215268259.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7393456875389732989.hoa
Detected timeout of ITS tools.
[2024-05-26 03:44:30] [INFO ] Flatten gal took : 40 ms
[2024-05-26 03:44:30] [INFO ] Flatten gal took : 35 ms
[2024-05-26 03:44:30] [INFO ] Time to serialize gal into /tmp/LTL3158747405535213586.gal : 7 ms
[2024-05-26 03:44:30] [INFO ] Time to serialize properties into /tmp/LTL16245266410486740467.ltl : 21 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3158747405535213586.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16245266410486740467.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((((((((p6_11_0<1)&&(p6_39_2<1))&&((p6_25_1<1)&&(p6_7_0<1)))&&(((p6_35_2<1)&&(p6_21_1<1))&&((p6_19_0<1)&&(p6_47_2<1))))&&(...7138
Formula 0 simplified : XG(!"((((((((((l20_14>=1)&&(pl1_14_0>=1))||((l20_9>=1)&&(pl1_9_0>=1)))||(((l20_49>=1)&&(pl1_49_2>=1))||((l20_44>=1)&&(pl1_44_2>=1)))...7130
Detected timeout of ITS tools.
[2024-05-26 03:44:45] [INFO ] Flatten gal took : 26 ms
[2024-05-26 03:44:45] [INFO ] Applying decomposition
[2024-05-26 03:44:45] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12668802461103288474.txt' '-o' '/tmp/graph12668802461103288474.bin' '-w' '/tmp/graph12668802461103288474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12668802461103288474.bin' '-l' '-1' '-v' '-w' '/tmp/graph12668802461103288474.weights' '-q' '0' '-e' '0.001'
[2024-05-26 03:44:45] [INFO ] Decomposing Gal with order
[2024-05-26 03:44:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:44:45] [INFO ] Removed a total of 478 redundant transitions.
[2024-05-26 03:44:45] [INFO ] Flatten gal took : 128 ms
[2024-05-26 03:44:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 21 ms.
[2024-05-26 03:44:45] [INFO ] Time to serialize gal into /tmp/LTL11116682352057054655.gal : 19 ms
[2024-05-26 03:44:45] [INFO ] Time to serialize properties into /tmp/LTL15030424274128338167.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11116682352057054655.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15030424274128338167.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((((((((i1.u6.p6_11_0<1)&&(i25.u110.p6_39_2<1))&&((i38.u85.p6_25_1<1)&&(i49.u5.p6_7_0<1)))&&(((i40.u108.p6_35_2<1)&&(i18.u...10920
Formula 0 simplified : XG(!"((((((((((i37.u74.l20_14>=1)&&(i37.u177.pl1_14_0>=1))||((i34.u70.l20_9>=1)&&(i34.u149.pl1_9_0>=1)))||(((i13.u140.l20_49>=1)&&(i...10912
Detected timeout of ITS tools.
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-04 finished in 258650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 663 out of 8953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Discarding 307 places :
Implicit places reduction removed 307 places
Iterating post reduction 0 with 307 rules applied. Total rules applied 307 place count 8646 transition count 8885
Discarding 616 places :
Symmetric choice reduction at 1 with 616 rule applications. Total rules 923 place count 8030 transition count 8019
Iterating global reduction 1 with 616 rules applied. Total rules applied 1539 place count 8030 transition count 8019
Discarding 409 places :
Symmetric choice reduction at 1 with 409 rule applications. Total rules 1948 place count 7621 transition count 7510
Iterating global reduction 1 with 409 rules applied. Total rules applied 2357 place count 7621 transition count 7510
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2408 place count 7570 transition count 7510
Discarding 359 places :
Symmetric choice reduction at 2 with 359 rule applications. Total rules 2767 place count 7211 transition count 6951
Iterating global reduction 2 with 359 rules applied. Total rules applied 3126 place count 7211 transition count 6951
Discarding 508 places :
Symmetric choice reduction at 2 with 508 rule applications. Total rules 3634 place count 6703 transition count 6443
Iterating global reduction 2 with 508 rules applied. Total rules applied 4142 place count 6703 transition count 6443
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 2 with 102 rules applied. Total rules applied 4244 place count 6703 transition count 6341
Discarding 304 places :
Symmetric choice reduction at 3 with 304 rule applications. Total rules 4548 place count 6399 transition count 6037
Iterating global reduction 3 with 304 rules applied. Total rules applied 4852 place count 6399 transition count 6037
Discarding 304 places :
Symmetric choice reduction at 3 with 304 rule applications. Total rules 5156 place count 6095 transition count 5733
Iterating global reduction 3 with 304 rules applied. Total rules applied 5460 place count 6095 transition count 5733
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5715 place count 5840 transition count 5478
Iterating global reduction 3 with 255 rules applied. Total rules applied 5970 place count 5840 transition count 5478
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6225 place count 5585 transition count 5223
Iterating global reduction 3 with 255 rules applied. Total rules applied 6480 place count 5585 transition count 5223
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 6531 place count 5534 transition count 5172
Iterating global reduction 3 with 51 rules applied. Total rules applied 6582 place count 5534 transition count 5172
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 6633 place count 5483 transition count 5121
Iterating global reduction 3 with 51 rules applied. Total rules applied 6684 place count 5483 transition count 5121
Applied a total of 6684 rules in 17992 ms. Remains 5483 /8953 variables (removed 3470) and now considering 5121/8885 (removed 3764) transitions.
// Phase 1: matrix 5121 rows 5483 cols
[2024-05-26 03:45:19] [INFO ] Computed 721 invariants in 84 ms
[2024-05-26 03:45:22] [INFO ] Implicit Places using invariants in 3282 ms returned [357, 1429, 3175, 3229, 3332, 4054, 4055, 4056, 4057, 4058, 4059, 4060, 4061, 4062, 4063, 4064, 4065, 4066, 4067, 4068, 4069, 4070, 4071, 4072, 4073, 4074, 4075, 4076, 4077, 4078, 4079, 4080, 4081, 4082, 4083, 4084, 4085, 4086, 4087, 4088, 4089, 4090, 4091, 4092, 4093, 4094, 4095, 4096, 4097, 4098, 4099, 4100, 4101, 4102, 4103, 4104, 5023]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 3286 ms to find 57 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 5426/8953 places, 5121/8885 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 5424 transition count 5119
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 5424 transition count 5119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 5423 transition count 5117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 5423 transition count 5117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 5422 transition count 5116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 5422 transition count 5116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 5421 transition count 5115
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 5421 transition count 5115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 5420 transition count 5114
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 5420 transition count 5114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 5419 transition count 5113
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 5419 transition count 5113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 5418 transition count 5112
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 5418 transition count 5112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 5417 transition count 5111
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 5417 transition count 5111
Applied a total of 18 rules in 9911 ms. Remains 5417 /5426 variables (removed 9) and now considering 5111/5121 (removed 10) transitions.
// Phase 1: matrix 5111 rows 5417 cols
[2024-05-26 03:45:32] [INFO ] Computed 664 invariants in 100 ms
[2024-05-26 03:45:34] [INFO ] Implicit Places using invariants in 2675 ms returned []
[2024-05-26 03:45:34] [INFO ] Invariant cache hit.
[2024-05-26 03:45:41] [INFO ] Implicit Places using invariants and state equation in 6820 ms returned []
Implicit Place search using SMT with State Equation took 9501 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 5417/8953 places, 5111/8885 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40695 ms. Remains : 5417/8953 places, 5111/8885 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 2863 ms.
Product exploration explored 100000 steps with 50000 reset in 3093 ms.
Computed a total of 5417 stabilizing places and 5111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5417 transition count 5111
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (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 11 factoid took 15 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-05 finished in 49471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 104 out of 8953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 8340 transition count 8885
Discarding 566 places :
Symmetric choice reduction at 1 with 566 rule applications. Total rules 1179 place count 7774 transition count 8119
Iterating global reduction 1 with 566 rules applied. Total rules applied 1745 place count 7774 transition count 8119
Discarding 309 places :
Symmetric choice reduction at 1 with 309 rule applications. Total rules 2054 place count 7465 transition count 7710
Iterating global reduction 1 with 309 rules applied. Total rules applied 2363 place count 7465 transition count 7710
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2414 place count 7414 transition count 7710
Discarding 309 places :
Symmetric choice reduction at 2 with 309 rule applications. Total rules 2723 place count 7105 transition count 7251
Iterating global reduction 2 with 309 rules applied. Total rules applied 3032 place count 7105 transition count 7251
Discarding 459 places :
Symmetric choice reduction at 2 with 459 rule applications. Total rules 3491 place count 6646 transition count 6792
Iterating global reduction 2 with 459 rules applied. Total rules applied 3950 place count 6646 transition count 6792
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 2 with 102 rules applied. Total rules applied 4052 place count 6646 transition count 6690
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4307 place count 6391 transition count 6435
Iterating global reduction 3 with 255 rules applied. Total rules applied 4562 place count 6391 transition count 6435
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4817 place count 6136 transition count 6180
Iterating global reduction 3 with 255 rules applied. Total rules applied 5072 place count 6136 transition count 6180
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5327 place count 5881 transition count 5925
Iterating global reduction 3 with 255 rules applied. Total rules applied 5582 place count 5881 transition count 5925
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5837 place count 5626 transition count 5670
Iterating global reduction 3 with 255 rules applied. Total rules applied 6092 place count 5626 transition count 5670
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6347 place count 5371 transition count 5415
Iterating global reduction 3 with 255 rules applied. Total rules applied 6602 place count 5371 transition count 5415
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6857 place count 5116 transition count 5160
Iterating global reduction 3 with 255 rules applied. Total rules applied 7112 place count 5116 transition count 5160
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7367 place count 4861 transition count 4905
Iterating global reduction 3 with 255 rules applied. Total rules applied 7622 place count 4861 transition count 4905
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7877 place count 4606 transition count 4650
Iterating global reduction 3 with 255 rules applied. Total rules applied 8132 place count 4606 transition count 4650
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8387 place count 4351 transition count 4395
Iterating global reduction 3 with 255 rules applied. Total rules applied 8642 place count 4351 transition count 4395
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8897 place count 4096 transition count 4140
Iterating global reduction 3 with 255 rules applied. Total rules applied 9152 place count 4096 transition count 4140
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 3 with 204 rules applied. Total rules applied 9356 place count 4096 transition count 3936
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 9407 place count 4045 transition count 3885
Iterating global reduction 4 with 51 rules applied. Total rules applied 9458 place count 4045 transition count 3885
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 9509 place count 3994 transition count 3834
Iterating global reduction 4 with 51 rules applied. Total rules applied 9560 place count 3994 transition count 3834
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 52 rules applied. Total rules applied 9612 place count 3993 transition count 3783
Applied a total of 9612 rules in 27904 ms. Remains 3993 /8953 variables (removed 4960) and now considering 3783/8885 (removed 5102) transitions.
// Phase 1: matrix 3783 rows 3993 cols
[2024-05-26 03:46:18] [INFO ] Computed 414 invariants in 56 ms
[2024-05-26 03:46:20] [INFO ] Implicit Places using invariants in 2550 ms returned [663, 1739, 1842, 2564, 2565, 2566, 2567, 2568, 2569, 2570, 2571, 2572, 2573, 2574, 2575, 2576, 2577, 2578, 2579, 2580, 2581, 2582, 2583, 2584, 2585, 2586, 2587, 2588, 2589, 2590, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2599, 2600, 2601, 2602, 2603, 2604, 2605, 2606, 2607, 2608, 2609, 2610, 2611, 2612, 2613, 2614, 3533]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 2555 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3938/8953 places, 3783/8885 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3936 transition count 3781
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3936 transition count 3781
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 3935 transition count 3779
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3935 transition count 3779
Applied a total of 6 rules in 2265 ms. Remains 3935 /3938 variables (removed 3) and now considering 3779/3783 (removed 4) transitions.
// Phase 1: matrix 3779 rows 3935 cols
[2024-05-26 03:46:23] [INFO ] Computed 359 invariants in 39 ms
[2024-05-26 03:46:25] [INFO ] Implicit Places using invariants in 1992 ms returned []
[2024-05-26 03:46:25] [INFO ] Invariant cache hit.
[2024-05-26 03:46:30] [INFO ] Implicit Places using invariants and state equation in 4947 ms returned []
Implicit Place search using SMT with State Equation took 6944 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3935/8953 places, 3779/8885 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39668 ms. Remains : 3935/8953 places, 3779/8885 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-06 finished in 39785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)||p0))))'
Support contains 255 out of 8953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 8340 transition count 8885
Discarding 514 places :
Symmetric choice reduction at 1 with 514 rule applications. Total rules 1127 place count 7826 transition count 8121
Iterating global reduction 1 with 514 rules applied. Total rules applied 1641 place count 7826 transition count 8121
Discarding 409 places :
Symmetric choice reduction at 1 with 409 rule applications. Total rules 2050 place count 7417 transition count 7612
Iterating global reduction 1 with 409 rules applied. Total rules applied 2459 place count 7417 transition count 7612
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2510 place count 7366 transition count 7612
Discarding 257 places :
Symmetric choice reduction at 2 with 257 rule applications. Total rules 2767 place count 7109 transition count 7155
Iterating global reduction 2 with 257 rules applied. Total rules applied 3024 place count 7109 transition count 7155
Discarding 406 places :
Symmetric choice reduction at 2 with 406 rule applications. Total rules 3430 place count 6703 transition count 6749
Iterating global reduction 2 with 406 rules applied. Total rules applied 3836 place count 6703 transition count 6749
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 2 with 102 rules applied. Total rules applied 3938 place count 6703 transition count 6647
Discarding 304 places :
Symmetric choice reduction at 3 with 304 rule applications. Total rules 4242 place count 6399 transition count 6343
Iterating global reduction 3 with 304 rules applied. Total rules applied 4546 place count 6399 transition count 6343
Discarding 304 places :
Symmetric choice reduction at 3 with 304 rule applications. Total rules 4850 place count 6095 transition count 6039
Iterating global reduction 3 with 304 rules applied. Total rules applied 5154 place count 6095 transition count 6039
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5409 place count 5840 transition count 5784
Iterating global reduction 3 with 255 rules applied. Total rules applied 5664 place count 5840 transition count 5784
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5919 place count 5585 transition count 5529
Iterating global reduction 3 with 255 rules applied. Total rules applied 6174 place count 5585 transition count 5529
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6429 place count 5330 transition count 5274
Iterating global reduction 3 with 255 rules applied. Total rules applied 6684 place count 5330 transition count 5274
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6939 place count 5075 transition count 5019
Iterating global reduction 3 with 255 rules applied. Total rules applied 7194 place count 5075 transition count 5019
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7449 place count 4820 transition count 4764
Iterating global reduction 3 with 255 rules applied. Total rules applied 7704 place count 4820 transition count 4764
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7959 place count 4565 transition count 4509
Iterating global reduction 3 with 255 rules applied. Total rules applied 8214 place count 4565 transition count 4509
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8469 place count 4310 transition count 4254
Iterating global reduction 3 with 255 rules applied. Total rules applied 8724 place count 4310 transition count 4254
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8979 place count 4055 transition count 3999
Iterating global reduction 3 with 255 rules applied. Total rules applied 9234 place count 4055 transition count 3999
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 3 with 204 rules applied. Total rules applied 9438 place count 4055 transition count 3795
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 9489 place count 4004 transition count 3744
Iterating global reduction 4 with 51 rules applied. Total rules applied 9540 place count 4004 transition count 3744
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 9591 place count 3953 transition count 3693
Iterating global reduction 4 with 51 rules applied. Total rules applied 9642 place count 3953 transition count 3693
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 52 rules applied. Total rules applied 9694 place count 3952 transition count 3642
Applied a total of 9694 rules in 24251 ms. Remains 3952 /8953 variables (removed 5001) and now considering 3642/8885 (removed 5243) transitions.
// Phase 1: matrix 3642 rows 3952 cols
[2024-05-26 03:46:54] [INFO ] Computed 414 invariants in 50 ms
[2024-05-26 03:46:56] [INFO ] Implicit Places using invariants in 2351 ms returned [663, 1338, 1392, 1495, 3390]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2359 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3947/8953 places, 3642/8885 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3945 transition count 3640
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3945 transition count 3640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 3944 transition count 3638
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3944 transition count 3638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 3943 transition count 3637
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 3943 transition count 3637
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 3942 transition count 3636
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 3942 transition count 3636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 3941 transition count 3635
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 3941 transition count 3635
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3940 transition count 3634
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3940 transition count 3634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 3939 transition count 3633
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 3939 transition count 3633
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 3938 transition count 3632
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 3938 transition count 3632
Applied a total of 18 rules in 6152 ms. Remains 3938 /3947 variables (removed 9) and now considering 3632/3642 (removed 10) transitions.
// Phase 1: matrix 3632 rows 3938 cols
[2024-05-26 03:47:03] [INFO ] Computed 409 invariants in 25 ms
[2024-05-26 03:47:04] [INFO ] Implicit Places using invariants in 1583 ms returned []
[2024-05-26 03:47:04] [INFO ] Invariant cache hit.
[2024-05-26 03:47:09] [INFO ] Implicit Places using invariants and state equation in 4888 ms returned []
Implicit Place search using SMT with State Equation took 6481 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3938/8953 places, 3632/8885 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39244 ms. Remains : 3938/8953 places, 3632/8885 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 1318 ms.
Product exploration explored 100000 steps with 33333 reset in 1002 ms.
Computed a total of 3938 stabilizing places and 3632 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3938 transition count 3632
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 26 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-L00050M0005C002P002G001-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-07 finished in 43426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((p0||G(p1))))))))'
Support contains 3 out of 8953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 8340 transition count 8885
Discarding 613 places :
Symmetric choice reduction at 1 with 613 rule applications. Total rules 1226 place count 7727 transition count 8024
Iterating global reduction 1 with 613 rules applied. Total rules applied 1839 place count 7727 transition count 8024
Discarding 356 places :
Symmetric choice reduction at 1 with 356 rule applications. Total rules 2195 place count 7371 transition count 7568
Iterating global reduction 1 with 356 rules applied. Total rules applied 2551 place count 7371 transition count 7568
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2602 place count 7320 transition count 7568
Discarding 356 places :
Symmetric choice reduction at 2 with 356 rule applications. Total rules 2958 place count 6964 transition count 7112
Iterating global reduction 2 with 356 rules applied. Total rules applied 3314 place count 6964 transition count 7112
Discarding 504 places :
Symmetric choice reduction at 2 with 504 rule applications. Total rules 3818 place count 6460 transition count 6608
Iterating global reduction 2 with 504 rules applied. Total rules applied 4322 place count 6460 transition count 6608
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 2 with 102 rules applied. Total rules applied 4424 place count 6460 transition count 6506
Discarding 252 places :
Symmetric choice reduction at 3 with 252 rule applications. Total rules 4676 place count 6208 transition count 6206
Iterating global reduction 3 with 252 rules applied. Total rules applied 4928 place count 6208 transition count 6206
Discarding 252 places :
Symmetric choice reduction at 3 with 252 rule applications. Total rules 5180 place count 5956 transition count 5954
Iterating global reduction 3 with 252 rules applied. Total rules applied 5432 place count 5956 transition count 5954
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 5636 place count 5752 transition count 5750
Iterating global reduction 3 with 204 rules applied. Total rules applied 5840 place count 5752 transition count 5750
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 6044 place count 5548 transition count 5546
Iterating global reduction 3 with 204 rules applied. Total rules applied 6248 place count 5548 transition count 5546
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 6452 place count 5344 transition count 5342
Iterating global reduction 3 with 204 rules applied. Total rules applied 6656 place count 5344 transition count 5342
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 6860 place count 5140 transition count 5138
Iterating global reduction 3 with 204 rules applied. Total rules applied 7064 place count 5140 transition count 5138
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 7268 place count 4936 transition count 4934
Iterating global reduction 3 with 204 rules applied. Total rules applied 7472 place count 4936 transition count 4934
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 7676 place count 4732 transition count 4730
Iterating global reduction 3 with 204 rules applied. Total rules applied 7880 place count 4732 transition count 4730
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 8084 place count 4528 transition count 4526
Iterating global reduction 3 with 204 rules applied. Total rules applied 8288 place count 4528 transition count 4526
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 8492 place count 4324 transition count 4322
Iterating global reduction 3 with 204 rules applied. Total rules applied 8696 place count 4324 transition count 4322
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 3 with 204 rules applied. Total rules applied 8900 place count 4324 transition count 4118
Applied a total of 8900 rules in 24385 ms. Remains 4324 /8953 variables (removed 4629) and now considering 4118/8885 (removed 4767) transitions.
// Phase 1: matrix 4118 rows 4324 cols
[2024-05-26 03:47:38] [INFO ] Computed 415 invariants in 47 ms
[2024-05-26 03:47:40] [INFO ] Implicit Places using invariants in 2102 ms returned [357, 817, 2016, 2895, 2896, 2897, 2898, 2899, 2900, 2901, 2902, 2903, 2904, 2905, 2906, 2907, 2908, 2909, 2910, 2911, 2912, 2913, 2914, 2915, 2916, 2917, 2918, 2919, 2920, 2921, 2922, 2923, 2924, 2925, 2926, 2927, 2928, 2929, 2930, 2931, 2932, 2933, 2934, 2935, 2936, 2937, 2938, 2939, 2940, 2941, 2942, 2943, 2944, 2945, 3864]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 2105 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4269/8953 places, 4118/8885 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4267 transition count 4116
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4267 transition count 4116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 4266 transition count 4114
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 4266 transition count 4114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 4265 transition count 4112
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 4265 transition count 4112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 4264 transition count 4111
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 4264 transition count 4111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 4263 transition count 4110
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 4263 transition count 4110
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 4261 transition count 4108
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 4261 transition count 4108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 4260 transition count 4106
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 4260 transition count 4106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 4259 transition count 4105
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 4259 transition count 4105
Applied a total of 20 rules in 7464 ms. Remains 4259 /4269 variables (removed 10) and now considering 4105/4118 (removed 13) transitions.
// Phase 1: matrix 4105 rows 4259 cols
[2024-05-26 03:47:47] [INFO ] Computed 360 invariants in 46 ms
[2024-05-26 03:47:49] [INFO ] Implicit Places using invariants in 1985 ms returned []
[2024-05-26 03:47:49] [INFO ] Invariant cache hit.
[2024-05-26 03:47:56] [INFO ] Implicit Places using invariants and state equation in 7275 ms returned []
Implicit Place search using SMT with State Equation took 9264 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4259/8953 places, 4105/8885 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43218 ms. Remains : 4259/8953 places, 4105/8885 transitions.
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08
Entered a terminal (fully accepting) state of product in 31520 steps with 10 reset in 392 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08 finished in 43922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G((F(p1)&&p0))))||G(F(!(!p1 U p2)))))'
Support contains 5 out of 8953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Graph (complete) has 12420 edges and 8953 vertex of which 5159 are kept as prefixes of interest. Removing 3794 places using SCC suffix rule.12 ms
Discarding 3794 places :
Also discarding 3836 output transitions
Drop transitions (Output transitions of discarded places.) removed 3836 transitions
Reduce places removed 50 places and 50 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3961 transitions
Trivial Post-agglo rules discarded 3961 transitions
Performed 3961 trivial Post agglomeration. Transition count delta: 3961
Iterating post reduction 0 with 4574 rules applied. Total rules applied 4575 place count 4496 transition count 1038
Reduce places removed 3961 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 3968 rules applied. Total rules applied 8543 place count 535 transition count 1031
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 8550 place count 528 transition count 1031
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 8550 place count 528 transition count 979
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 8654 place count 476 transition count 979
Discarding 308 places :
Symmetric choice reduction at 3 with 308 rule applications. Total rules 8962 place count 168 transition count 422
Iterating global reduction 3 with 308 rules applied. Total rules applied 9270 place count 168 transition count 422
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 3 with 199 rules applied. Total rules applied 9469 place count 168 transition count 223
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 9521 place count 116 transition count 171
Iterating global reduction 4 with 52 rules applied. Total rules applied 9573 place count 116 transition count 171
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 9576 place count 116 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 9576 place count 116 transition count 167
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 9578 place count 115 transition count 167
Discarding 49 places :
Symmetric choice reduction at 5 with 49 rule applications. Total rules 9627 place count 66 transition count 118
Iterating global reduction 5 with 49 rules applied. Total rules applied 9676 place count 66 transition count 118
Discarding 47 places :
Symmetric choice reduction at 5 with 47 rule applications. Total rules 9723 place count 19 transition count 24
Iterating global reduction 5 with 47 rules applied. Total rules applied 9770 place count 19 transition count 24
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 9772 place count 18 transition count 23
Applied a total of 9772 rules in 129 ms. Remains 18 /8953 variables (removed 8935) and now considering 23/8885 (removed 8862) transitions.
// Phase 1: matrix 23 rows 18 cols
[2024-05-26 03:47:57] [INFO ] Computed 2 invariants in 0 ms
[2024-05-26 03:47:57] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-26 03:47:57] [INFO ] Invariant cache hit.
[2024-05-26 03:47:57] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-26 03:47:57] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-26 03:47:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 23/37 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 4/41 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 20 constraints, problems are : Problem set: 0 solved, 13 unsolved in 175 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 23/37 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 4/41 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 33 constraints, problems are : Problem set: 0 solved, 13 unsolved in 260 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 440ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 441ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/8953 places, 23/8885 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 658 ms. Remains : 18/8953 places, 23/8885 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND p2 (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-09
Product exploration explored 100000 steps with 1462 reset in 224 ms.
Product exploration explored 100000 steps with 1476 reset in 314 ms.
Computed a total of 18 stabilizing places and 23 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 23
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 27 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-09 finished in 1471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 2 out of 8953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Graph (complete) has 12420 edges and 8953 vertex of which 7159 are kept as prefixes of interest. Removing 1794 places using SCC suffix rule.13 ms
Discarding 1794 places :
Also discarding 1840 output transitions
Drop transitions (Output transitions of discarded places.) removed 1840 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4992 transitions
Trivial Post-agglo rules discarded 4992 transitions
Performed 4992 trivial Post agglomeration. Transition count delta: 4992
Iterating post reduction 0 with 5605 rules applied. Total rules applied 5606 place count 6495 transition count 2002
Reduce places removed 4992 places and 0 transitions.
Iterating post reduction 1 with 4992 rules applied. Total rules applied 10598 place count 1503 transition count 2002
Performed 407 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 407 Pre rules applied. Total rules applied 10598 place count 1503 transition count 1595
Deduced a syphon composed of 407 places in 4 ms
Ensure Unique test removed 153 places
Reduce places removed 560 places and 0 transitions.
Iterating global reduction 2 with 967 rules applied. Total rules applied 11565 place count 943 transition count 1595
Drop transitions (Trivial Post-Agglo cleanup.) removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 2 with 152 rules applied. Total rules applied 11717 place count 943 transition count 1443
Reduce places removed 152 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 153 rules applied. Total rules applied 11870 place count 791 transition count 1442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 11871 place count 790 transition count 1442
Discarding 412 places :
Symmetric choice reduction at 5 with 412 rule applications. Total rules 12283 place count 378 transition count 732
Iterating global reduction 5 with 412 rules applied. Total rules applied 12695 place count 378 transition count 732
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 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 5 with 202 rules applied. Total rules applied 12897 place count 378 transition count 530
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 12899 place count 376 transition count 530
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 52 Pre rules applied. Total rules applied 12899 place count 376 transition count 478
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 13003 place count 324 transition count 478
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 13010 place count 317 transition count 419
Iterating global reduction 7 with 7 rules applied. Total rules applied 13017 place count 317 transition count 419
Ensure Unique test removed 155 transitions
Reduce isomorphic transitions removed 155 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 7 with 307 rules applied. Total rules applied 13324 place count 266 transition count 163
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 8 with 101 rules applied. Total rules applied 13425 place count 165 transition count 163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 13425 place count 165 transition count 161
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 13429 place count 163 transition count 161
Discarding 49 places :
Symmetric choice reduction at 9 with 49 rule applications. Total rules 13478 place count 114 transition count 112
Iterating global reduction 9 with 49 rules applied. Total rules applied 13527 place count 114 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 13528 place count 114 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 13528 place count 114 transition count 110
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 13531 place count 112 transition count 110
Discarding 48 places :
Symmetric choice reduction at 10 with 48 rule applications. Total rules 13579 place count 64 transition count 62
Iterating global reduction 10 with 48 rules applied. Total rules applied 13627 place count 64 transition count 62
Discarding 48 places :
Symmetric choice reduction at 10 with 48 rule applications. Total rules 13675 place count 16 transition count 14
Iterating global reduction 10 with 48 rules applied. Total rules applied 13723 place count 16 transition count 14
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 13724 place count 16 transition count 14
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 13727 place count 13 transition count 11
Applied a total of 13727 rules in 224 ms. Remains 13 /8953 variables (removed 8940) and now considering 11/8885 (removed 8874) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-26 03:47:59] [INFO ] Computed 3 invariants in 0 ms
[2024-05-26 03:47:59] [INFO ] Implicit Places using invariants in 32 ms returned [3, 4, 7]
[2024-05-26 03:47:59] [INFO ] Actually due to overlaps returned [3, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/8953 places, 11/8885 transitions.
Graph (complete) has 9 edges and 11 vertex of which 7 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 6 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 5 transition count 6
Applied a total of 3 rules in 1 ms. Remains 5 /11 variables (removed 6) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 5 cols
[2024-05-26 03:47:59] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 03:47:59] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-26 03:47:59] [INFO ] Invariant cache hit.
[2024-05-26 03:47:59] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/8953 places, 6/8885 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 296 ms. Remains : 5/8953 places, 6/8885 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-10
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-10 finished in 395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U (G((p0||F(p1)))||((p0||F(p1))&&(!p2||X(G(!p2)))))))'
Support contains 6 out of 8953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Graph (complete) has 12420 edges and 8953 vertex of which 8688 are kept as prefixes of interest. Removing 265 places using SCC suffix rule.10 ms
Discarding 265 places :
Also discarding 315 output transitions
Drop transitions (Output transitions of discarded places.) removed 315 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5341 transitions
Trivial Post-agglo rules discarded 5341 transitions
Performed 5341 trivial Post agglomeration. Transition count delta: 5341
Iterating post reduction 0 with 5953 rules applied. Total rules applied 5954 place count 8025 transition count 3178
Reduce places removed 5341 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5342 rules applied. Total rules applied 11296 place count 2684 transition count 3177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11297 place count 2683 transition count 3177
Performed 665 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 665 Pre rules applied. Total rules applied 11297 place count 2683 transition count 2512
Deduced a syphon composed of 665 places in 1 ms
Ensure Unique test removed 306 places
Reduce places removed 971 places and 0 transitions.
Iterating global reduction 3 with 1636 rules applied. Total rules applied 12933 place count 1712 transition count 2512
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 3 with 153 rules applied. Total rules applied 13086 place count 1712 transition count 2359
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 4 with 153 rules applied. Total rules applied 13239 place count 1559 transition count 2359
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 13239 place count 1559 transition count 2308
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 13341 place count 1508 transition count 2308
Discarding 613 places :
Symmetric choice reduction at 5 with 613 rule applications. Total rules 13954 place count 895 transition count 1496
Iterating global reduction 5 with 613 rules applied. Total rules applied 14567 place count 895 transition count 1496
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 5 with 200 rules applied. Total rules applied 14767 place count 895 transition count 1296
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 14818 place count 844 transition count 1296
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 101 Pre rules applied. Total rules applied 14818 place count 844 transition count 1195
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 15020 place count 743 transition count 1195
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 15027 place count 736 transition count 1088
Iterating global reduction 7 with 7 rules applied. Total rules applied 15034 place count 736 transition count 1088
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 7 with 207 rules applied. Total rules applied 15241 place count 685 transition count 932
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 8 with 51 rules applied. Total rules applied 15292 place count 634 transition count 932
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 15292 place count 634 transition count 931
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 15294 place count 633 transition count 931
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 15296 place count 631 transition count 829
Iterating global reduction 9 with 2 rules applied. Total rules applied 15298 place count 631 transition count 829
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 9 with 305 rules applied. Total rules applied 15603 place count 529 transition count 626
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 10 with 101 rules applied. Total rules applied 15704 place count 428 transition count 626
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 102 Pre rules applied. Total rules applied 15704 place count 428 transition count 524
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 11 with 204 rules applied. Total rules applied 15908 place count 326 transition count 524
Discarding 49 places :
Symmetric choice reduction at 11 with 49 rule applications. Total rules 15957 place count 277 transition count 475
Iterating global reduction 11 with 49 rules applied. Total rules applied 16006 place count 277 transition count 475
Discarding 49 places :
Symmetric choice reduction at 11 with 49 rule applications. Total rules 16055 place count 228 transition count 426
Iterating global reduction 11 with 49 rules applied. Total rules applied 16104 place count 228 transition count 426
Discarding 49 places :
Symmetric choice reduction at 11 with 49 rule applications. Total rules 16153 place count 179 transition count 377
Iterating global reduction 11 with 49 rules applied. Total rules applied 16202 place count 179 transition count 377
Discarding 47 places :
Symmetric choice reduction at 11 with 47 rule applications. Total rules 16249 place count 132 transition count 236
Iterating global reduction 11 with 47 rules applied. Total rules applied 16296 place count 132 transition count 236
Discarding 47 places :
Symmetric choice reduction at 11 with 47 rule applications. Total rules 16343 place count 85 transition count 189
Iterating global reduction 11 with 47 rules applied. Total rules applied 16390 place count 85 transition count 189
Discarding 45 places :
Symmetric choice reduction at 11 with 45 rule applications. Total rules 16435 place count 40 transition count 54
Iterating global reduction 11 with 45 rules applied. Total rules applied 16480 place count 40 transition count 54
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 16486 place count 37 transition count 51
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 16488 place count 35 transition count 45
Iterating global reduction 11 with 2 rules applied. Total rules applied 16490 place count 35 transition count 45
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 16495 place count 35 transition count 40
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 16497 place count 33 transition count 38
Iterating global reduction 12 with 2 rules applied. Total rules applied 16499 place count 33 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 16500 place count 33 transition count 37
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 16501 place count 32 transition count 35
Iterating global reduction 13 with 1 rules applied. Total rules applied 16502 place count 32 transition count 35
Applied a total of 16502 rules in 388 ms. Remains 32 /8953 variables (removed 8921) and now considering 35/8885 (removed 8850) transitions.
// Phase 1: matrix 35 rows 32 cols
[2024-05-26 03:47:59] [INFO ] Computed 6 invariants in 0 ms
[2024-05-26 03:47:59] [INFO ] Implicit Places using invariants in 39 ms returned [5, 11, 29]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/8953 places, 35/8885 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 29 transition count 31
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 25 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 25 transition count 29
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 22 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 22 transition count 27
Applied a total of 14 rules in 1 ms. Remains 22 /29 variables (removed 7) and now considering 27/35 (removed 8) transitions.
// Phase 1: matrix 27 rows 22 cols
[2024-05-26 03:47:59] [INFO ] Computed 3 invariants in 0 ms
[2024-05-26 03:47:59] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-26 03:47:59] [INFO ] Invariant cache hit.
[2024-05-26 03:47:59] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/8953 places, 27/8885 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 493 ms. Remains : 22/8953 places, 27/8885 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p2)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-11
Stuttering criterion allowed to conclude after 149 steps with 1 reset in 0 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-11 finished in 671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 5 out of 8953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Discarding 611 places :
Implicit places reduction removed 611 places
Iterating post reduction 0 with 611 rules applied. Total rules applied 611 place count 8342 transition count 8885
Discarding 616 places :
Symmetric choice reduction at 1 with 616 rule applications. Total rules 1227 place count 7726 transition count 8019
Iterating global reduction 1 with 616 rules applied. Total rules applied 1843 place count 7726 transition count 8019
Discarding 409 places :
Symmetric choice reduction at 1 with 409 rule applications. Total rules 2252 place count 7317 transition count 7510
Iterating global reduction 1 with 409 rules applied. Total rules applied 2661 place count 7317 transition count 7510
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2712 place count 7266 transition count 7510
Discarding 359 places :
Symmetric choice reduction at 2 with 359 rule applications. Total rules 3071 place count 6907 transition count 6951
Iterating global reduction 2 with 359 rules applied. Total rules applied 3430 place count 6907 transition count 6951
Discarding 508 places :
Symmetric choice reduction at 2 with 508 rule applications. Total rules 3938 place count 6399 transition count 6443
Iterating global reduction 2 with 508 rules applied. Total rules applied 4446 place count 6399 transition count 6443
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 2 with 102 rules applied. Total rules applied 4548 place count 6399 transition count 6341
Discarding 303 places :
Symmetric choice reduction at 3 with 303 rule applications. Total rules 4851 place count 6096 transition count 6038
Iterating global reduction 3 with 303 rules applied. Total rules applied 5154 place count 6096 transition count 6038
Discarding 303 places :
Symmetric choice reduction at 3 with 303 rule applications. Total rules 5457 place count 5793 transition count 5735
Iterating global reduction 3 with 303 rules applied. Total rules applied 5760 place count 5793 transition count 5735
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 6014 place count 5539 transition count 5481
Iterating global reduction 3 with 254 rules applied. Total rules applied 6268 place count 5539 transition count 5481
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 6522 place count 5285 transition count 5227
Iterating global reduction 3 with 254 rules applied. Total rules applied 6776 place count 5285 transition count 5227
Discarding 253 places :
Symmetric choice reduction at 3 with 253 rule applications. Total rules 7029 place count 5032 transition count 4974
Iterating global reduction 3 with 253 rules applied. Total rules applied 7282 place count 5032 transition count 4974
Discarding 253 places :
Symmetric choice reduction at 3 with 253 rule applications. Total rules 7535 place count 4779 transition count 4721
Iterating global reduction 3 with 253 rules applied. Total rules applied 7788 place count 4779 transition count 4721
Discarding 253 places :
Symmetric choice reduction at 3 with 253 rule applications. Total rules 8041 place count 4526 transition count 4468
Iterating global reduction 3 with 253 rules applied. Total rules applied 8294 place count 4526 transition count 4468
Discarding 253 places :
Symmetric choice reduction at 3 with 253 rule applications. Total rules 8547 place count 4273 transition count 4215
Iterating global reduction 3 with 253 rules applied. Total rules applied 8800 place count 4273 transition count 4215
Discarding 253 places :
Symmetric choice reduction at 3 with 253 rule applications. Total rules 9053 place count 4020 transition count 3962
Iterating global reduction 3 with 253 rules applied. Total rules applied 9306 place count 4020 transition count 3962
Discarding 253 places :
Symmetric choice reduction at 3 with 253 rule applications. Total rules 9559 place count 3767 transition count 3709
Iterating global reduction 3 with 253 rules applied. Total rules applied 9812 place count 3767 transition count 3709
Ensure Unique test removed 203 transitions
Reduce isomorphic transitions removed 203 transitions.
Iterating post reduction 3 with 203 rules applied. Total rules applied 10015 place count 3767 transition count 3506
Discarding 50 places :
Symmetric choice reduction at 4 with 50 rule applications. Total rules 10065 place count 3717 transition count 3456
Iterating global reduction 4 with 50 rules applied. Total rules applied 10115 place count 3717 transition count 3456
Discarding 50 places :
Symmetric choice reduction at 4 with 50 rule applications. Total rules 10165 place count 3667 transition count 3406
Iterating global reduction 4 with 50 rules applied. Total rules applied 10215 place count 3667 transition count 3406
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 51 rules applied. Total rules applied 10266 place count 3666 transition count 3356
Applied a total of 10266 rules in 25337 ms. Remains 3666 /8953 variables (removed 5287) and now considering 3356/8885 (removed 5529) transitions.
// Phase 1: matrix 3356 rows 3666 cols
[2024-05-26 03:48:25] [INFO ] Computed 416 invariants in 37 ms
[2024-05-26 03:48:27] [INFO ] Implicit Places using invariants in 2136 ms returned [669, 1357, 1412, 1515, 2237, 2238, 2239, 2240, 2241, 2242, 2243, 2244, 2245, 2246, 2247, 2248, 2249, 2250, 2251, 2252, 2253, 2254, 2255, 2256, 2257, 2258, 2259, 2260, 2261, 2262, 2263, 2264, 2265, 2266, 2267, 2268, 2269, 2270, 2271, 2272, 2273, 2274, 2275, 2276, 2277, 2278, 2279, 2280, 2281, 2282, 2283, 2284, 2285, 2286, 2287, 3206]
Discarding 56 places :
Implicit Place search using SMT only with invariants took 2140 ms to find 56 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3610/8953 places, 3356/8885 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3608 transition count 3354
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3608 transition count 3354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 3607 transition count 3352
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3607 transition count 3352
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 3606 transition count 3351
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 3606 transition count 3351
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 3605 transition count 3350
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 3605 transition count 3350
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 3604 transition count 3349
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 3604 transition count 3349
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3603 transition count 3348
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3603 transition count 3348
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 3602 transition count 3347
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 3602 transition count 3347
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 3601 transition count 3346
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 3601 transition count 3346
Applied a total of 18 rules in 6307 ms. Remains 3601 /3610 variables (removed 9) and now considering 3346/3356 (removed 10) transitions.
// Phase 1: matrix 3346 rows 3601 cols
[2024-05-26 03:48:33] [INFO ] Computed 360 invariants in 39 ms
[2024-05-26 03:48:35] [INFO ] Implicit Places using invariants in 1736 ms returned []
[2024-05-26 03:48:35] [INFO ] Invariant cache hit.
[2024-05-26 03:48:39] [INFO ] Implicit Places using invariants and state equation in 3976 ms returned []
Implicit Place search using SMT with State Equation took 5716 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3601/8953 places, 3346/8885 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39501 ms. Remains : 3601/8953 places, 3346/8885 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 1315 ms.
Product exploration explored 100000 steps with 50000 reset in 1121 ms.
Computed a total of 3601 stabilizing places and 3346 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3601 transition count 3346
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 16 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-12 finished in 43570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 8953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Graph (complete) has 12420 edges and 8953 vertex of which 7159 are kept as prefixes of interest. Removing 1794 places using SCC suffix rule.9 ms
Discarding 1794 places :
Also discarding 1840 output transitions
Drop transitions (Output transitions of discarded places.) removed 1840 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4993 transitions
Trivial Post-agglo rules discarded 4993 transitions
Performed 4993 trivial Post agglomeration. Transition count delta: 4993
Iterating post reduction 0 with 5606 rules applied. Total rules applied 5607 place count 6495 transition count 2001
Reduce places removed 4993 places and 0 transitions.
Iterating post reduction 1 with 4993 rules applied. Total rules applied 10600 place count 1502 transition count 2001
Performed 407 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 407 Pre rules applied. Total rules applied 10600 place count 1502 transition count 1594
Deduced a syphon composed of 407 places in 0 ms
Ensure Unique test removed 153 places
Reduce places removed 560 places and 0 transitions.
Iterating global reduction 2 with 967 rules applied. Total rules applied 11567 place count 942 transition count 1594
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 2 with 153 rules applied. Total rules applied 11720 place count 942 transition count 1441
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 3 with 153 rules applied. Total rules applied 11873 place count 789 transition count 1441
Discarding 412 places :
Symmetric choice reduction at 4 with 412 rule applications. Total rules 12285 place count 377 transition count 731
Iterating global reduction 4 with 412 rules applied. Total rules applied 12697 place count 377 transition count 731
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 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 4 with 202 rules applied. Total rules applied 12899 place count 377 transition count 529
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 12901 place count 375 transition count 529
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 52 Pre rules applied. Total rules applied 12901 place count 375 transition count 477
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 6 with 104 rules applied. Total rules applied 13005 place count 323 transition count 477
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 13012 place count 316 transition count 418
Iterating global reduction 6 with 7 rules applied. Total rules applied 13019 place count 316 transition count 418
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Discarding 52 places :
Implicit places reduction removed 52 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 6 with 310 rules applied. Total rules applied 13329 place count 264 transition count 160
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 7 with 102 rules applied. Total rules applied 13431 place count 162 transition count 160
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 13431 place count 162 transition count 158
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 13435 place count 160 transition count 158
Discarding 50 places :
Symmetric choice reduction at 8 with 50 rule applications. Total rules 13485 place count 110 transition count 108
Iterating global reduction 8 with 50 rules applied. Total rules applied 13535 place count 110 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 13536 place count 110 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 13536 place count 110 transition count 106
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 13539 place count 108 transition count 106
Discarding 49 places :
Symmetric choice reduction at 9 with 49 rule applications. Total rules 13588 place count 59 transition count 57
Iterating global reduction 9 with 49 rules applied. Total rules applied 13637 place count 59 transition count 57
Discarding 49 places :
Symmetric choice reduction at 9 with 49 rule applications. Total rules 13686 place count 10 transition count 8
Iterating global reduction 9 with 49 rules applied. Total rules applied 13735 place count 10 transition count 8
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 13737 place count 8 transition count 6
Applied a total of 13737 rules in 185 ms. Remains 8 /8953 variables (removed 8945) and now considering 6/8885 (removed 8879) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-26 03:48:43] [INFO ] Computed 2 invariants in 0 ms
[2024-05-26 03:48:43] [INFO ] Implicit Places using invariants in 25 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8953 places, 6/8885 transitions.
Graph (complete) has 4 edges and 6 vertex of which 4 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
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 0 ms. Remains 2 /6 variables (removed 4) and now considering 2/6 (removed 4) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-26 03:48:43] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 03:48:43] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-26 03:48:43] [INFO ] Invariant cache hit.
[2024-05-26 03:48:43] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/8953 places, 2/8885 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 253 ms. Remains : 2/8953 places, 2/8885 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Product exploration explored 100000 steps with 50000 reset in 367 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-13 finished in 1013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 8953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 8340 transition count 8885
Discarding 616 places :
Symmetric choice reduction at 1 with 616 rule applications. Total rules 1229 place count 7724 transition count 8019
Iterating global reduction 1 with 616 rules applied. Total rules applied 1845 place count 7724 transition count 8019
Discarding 409 places :
Symmetric choice reduction at 1 with 409 rule applications. Total rules 2254 place count 7315 transition count 7510
Iterating global reduction 1 with 409 rules applied. Total rules applied 2663 place count 7315 transition count 7510
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2714 place count 7264 transition count 7510
Discarding 359 places :
Symmetric choice reduction at 2 with 359 rule applications. Total rules 3073 place count 6905 transition count 6951
Iterating global reduction 2 with 359 rules applied. Total rules applied 3432 place count 6905 transition count 6951
Discarding 508 places :
Symmetric choice reduction at 2 with 508 rule applications. Total rules 3940 place count 6397 transition count 6443
Iterating global reduction 2 with 508 rules applied. Total rules applied 4448 place count 6397 transition count 6443
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 2 with 102 rules applied. Total rules applied 4550 place count 6397 transition count 6341
Discarding 304 places :
Symmetric choice reduction at 3 with 304 rule applications. Total rules 4854 place count 6093 transition count 6037
Iterating global reduction 3 with 304 rules applied. Total rules applied 5158 place count 6093 transition count 6037
Discarding 304 places :
Symmetric choice reduction at 3 with 304 rule applications. Total rules 5462 place count 5789 transition count 5733
Iterating global reduction 3 with 304 rules applied. Total rules applied 5766 place count 5789 transition count 5733
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6021 place count 5534 transition count 5478
Iterating global reduction 3 with 255 rules applied. Total rules applied 6276 place count 5534 transition count 5478
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6531 place count 5279 transition count 5223
Iterating global reduction 3 with 255 rules applied. Total rules applied 6786 place count 5279 transition count 5223
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7041 place count 5024 transition count 4968
Iterating global reduction 3 with 255 rules applied. Total rules applied 7296 place count 5024 transition count 4968
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7551 place count 4769 transition count 4713
Iterating global reduction 3 with 255 rules applied. Total rules applied 7806 place count 4769 transition count 4713
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8061 place count 4514 transition count 4458
Iterating global reduction 3 with 255 rules applied. Total rules applied 8316 place count 4514 transition count 4458
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8571 place count 4259 transition count 4203
Iterating global reduction 3 with 255 rules applied. Total rules applied 8826 place count 4259 transition count 4203
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 9081 place count 4004 transition count 3948
Iterating global reduction 3 with 255 rules applied. Total rules applied 9336 place count 4004 transition count 3948
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 9591 place count 3749 transition count 3693
Iterating global reduction 3 with 255 rules applied. Total rules applied 9846 place count 3749 transition count 3693
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 3 with 204 rules applied. Total rules applied 10050 place count 3749 transition count 3489
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 10101 place count 3698 transition count 3438
Iterating global reduction 4 with 51 rules applied. Total rules applied 10152 place count 3698 transition count 3438
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 10203 place count 3647 transition count 3387
Iterating global reduction 4 with 51 rules applied. Total rules applied 10254 place count 3647 transition count 3387
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 52 rules applied. Total rules applied 10306 place count 3646 transition count 3336
Applied a total of 10306 rules in 26666 ms. Remains 3646 /8953 variables (removed 5307) and now considering 3336/8885 (removed 5549) transitions.
// Phase 1: matrix 3336 rows 3646 cols
[2024-05-26 03:49:11] [INFO ] Computed 414 invariants in 42 ms
[2024-05-26 03:49:13] [INFO ] Implicit Places using invariants in 1949 ms returned [663, 1338, 1392, 1495, 2217, 2218, 2219, 2220, 2221, 2222, 2223, 2224, 2225, 2226, 2227, 2228, 2229, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2237, 2238, 2239, 2240, 2241, 2242, 2243, 2244, 2245, 2246, 2247, 2248, 2249, 2250, 2251, 2252, 2253, 2254, 2255, 2256, 2257, 2258, 2259, 2260, 2261, 2262, 2263, 2264, 2265, 2266, 2267, 3186]
Discarding 56 places :
Implicit Place search using SMT only with invariants took 1957 ms to find 56 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3590/8953 places, 3336/8885 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3588 transition count 3334
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3588 transition count 3334
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 3587 transition count 3332
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3587 transition count 3332
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 3586 transition count 3331
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 3586 transition count 3331
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 3585 transition count 3330
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 3585 transition count 3330
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 3584 transition count 3329
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 3584 transition count 3329
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 3583 transition count 3328
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 3583 transition count 3328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 3582 transition count 3327
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 3582 transition count 3327
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 3581 transition count 3326
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 3581 transition count 3326
Applied a total of 18 rules in 5964 ms. Remains 3581 /3590 variables (removed 9) and now considering 3326/3336 (removed 10) transitions.
// Phase 1: matrix 3326 rows 3581 cols
[2024-05-26 03:49:19] [INFO ] Computed 358 invariants in 40 ms
[2024-05-26 03:49:20] [INFO ] Implicit Places using invariants in 1594 ms returned []
[2024-05-26 03:49:20] [INFO ] Invariant cache hit.
[2024-05-26 03:49:25] [INFO ] Implicit Places using invariants and state equation in 4241 ms returned []
Implicit Place search using SMT with State Equation took 5837 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3581/8953 places, 3326/8885 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40427 ms. Remains : 3581/8953 places, 3326/8885 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-14
Product exploration explored 100000 steps with 39 reset in 796 ms.
Product exploration explored 100000 steps with 38 reset in 755 ms.
Computed a total of 3581 stabilizing places and 3326 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3581 transition count 3326
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 9863 steps (0 resets) in 98 ms. (99 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-26 03:49:28] [INFO ] Invariant cache hit.
[2024-05-26 03:49:33] [INFO ] [Real]Absence check using 0 positive and 358 generalized place invariants in 273 ms returned sat
[2024-05-26 03:49:43] [INFO ] [Real]Absence check using state equation in 10888 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 3581 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3581/3581 places, 3326/3326 transitions.
Applied a total of 0 rules in 729 ms. Remains 3581 /3581 variables (removed 0) and now considering 3326/3326 (removed 0) transitions.
[2024-05-26 03:49:44] [INFO ] Invariant cache hit.
[2024-05-26 03:49:46] [INFO ] Implicit Places using invariants in 1691 ms returned []
[2024-05-26 03:49:46] [INFO ] Invariant cache hit.
[2024-05-26 03:49:51] [INFO ] Implicit Places using invariants and state equation in 4695 ms returned []
Implicit Place search using SMT with State Equation took 6388 ms to find 0 implicit places.
Running 3275 sub problems to find dead transitions.
[2024-05-26 03:49:51] [INFO ] Invariant cache hit.
(s154 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3530 variables, 356/356 constraints. Problems are: Problem set: 0 solved, 3275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3530/6907 variables, and 356 constraints, problems are : Problem set: 0 solved, 3275 unsolved in 30103 ms.
Refiners :[Generalized P Invariants (flows): 356/358 constraints, State Equation: 0/3581 constraints, PredecessorRefiner: 3275/3275 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3530 variables, 356/356 constraints. Problems are: Problem set: 0 solved, 3275 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3530/6907 variables, and 356 constraints, problems are : Problem set: 0 solved, 3275 unsolved in 30102 ms.
Refiners :[Generalized P Invariants (flows): 356/358 constraints, State Equation: 0/3581 constraints, PredecessorRefiner: 0/3275 constraints, Known Traps: 0/0 constraints]
After SMT, in 61839ms problems are : Problem set: 0 solved, 3275 unsolved
Search for dead transitions found 0 dead transitions in 61874ms
Finished structural reductions in LTL mode , in 1 iterations and 68999 ms. Remains : 3581/3581 places, 3326/3326 transitions.
Computed a total of 3581 stabilizing places and 3326 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3581 transition count 3326
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 10066 steps (0 resets) in 117 ms. (85 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-26 03:50:55] [INFO ] Invariant cache hit.
[2024-05-26 03:50:59] [INFO ] [Real]Absence check using 0 positive and 358 generalized place invariants in 277 ms returned sat
[2024-05-26 03:51:10] [INFO ] [Real]Absence check using state equation in 10571 ms returned sat
[2024-05-26 03:51:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 03:51:15] [INFO ] [Nat]Absence check using 0 positive and 358 generalized place invariants in 289 ms returned sat
[2024-05-26 03:51:25] [INFO ] [Nat]Absence check using state equation in 10066 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 39 reset in 889 ms.
Product exploration explored 100000 steps with 40 reset in 976 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 3581 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3581/3581 places, 3326/3326 transitions.
Graph (complete) has 4091 edges and 3581 vertex of which 66 are kept as prefixes of interest. Removing 3515 places using SCC suffix rule.3 ms
Discarding 3515 places :
Also discarding 3264 output transitions
Drop transitions (Output transitions of discarded places.) removed 3264 transitions
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 66 transition count 62
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 26 Pre rules applied. Total rules applied 24 place count 66 transition count 66
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 50 place count 66 transition count 66
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 84 place count 32 transition count 32
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 118 place count 32 transition count 32
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 121 place count 32 transition count 32
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 31 transition count 31
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 31 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 31 transition count 35
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 30 transition count 32
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 30 transition count 32
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 126 rules in 23 ms. Remains 30 /3581 variables (removed 3551) and now considering 32/3326 (removed 3294) transitions.
[2024-05-26 03:51:27] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-05-26 03:51:27] [INFO ] Computed 6 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
At refinement iteration 2 (OVERLAPS) 32/61 variables, 29/35 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/35 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/62 variables, 1/36 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/36 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/62 variables, 0/36 constraints. Problems are: Problem set: 23 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 36 constraints, problems are : Problem set: 23 solved, 6 unsolved in 282 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 23 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/22 variables, 6/6 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 32/54 variables, 22/28 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 6/34 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/34 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/62 variables, 8/42 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/42 constraints. Problems are: Problem set: 23 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/62 variables, 0/42 constraints. Problems are: Problem set: 23 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 42 constraints, problems are : Problem set: 23 solved, 6 unsolved in 140 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 6/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 431ms problems are : Problem set: 23 solved, 6 unsolved
Search for dead transitions found 23 dead transitions in 433ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 30/3581 places, 9/3326 transitions.
Graph (complete) has 35 edges and 30 vertex of which 13 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 7 transition count 9
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 7 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 7 transition count 7
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 7 transition count 7
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 16 rules in 3 ms. Remains 3 /30 variables (removed 27) and now considering 3/9 (removed 6) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/3581 places, 3/3326 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 469 ms. Remains : 3/3581 places, 3/3326 transitions.
Built C files in :
/tmp/ltsmin8583414559822647788
[2024-05-26 03:51:28] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8583414559822647788
Running compilation step : cd /tmp/ltsmin8583414559822647788;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8583414559822647788;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8583414559822647788;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 3581 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3581/3581 places, 3326/3326 transitions.
Applied a total of 0 rules in 697 ms. Remains 3581 /3581 variables (removed 0) and now considering 3326/3326 (removed 0) transitions.
// Phase 1: matrix 3326 rows 3581 cols
[2024-05-26 03:51:32] [INFO ] Computed 358 invariants in 25 ms
[2024-05-26 03:51:33] [INFO ] Implicit Places using invariants in 1654 ms returned []
[2024-05-26 03:51:33] [INFO ] Invariant cache hit.
[2024-05-26 03:51:38] [INFO ] Implicit Places using invariants and state equation in 4365 ms returned []
Implicit Place search using SMT with State Equation took 6020 ms to find 0 implicit places.
Running 3275 sub problems to find dead transitions.
[2024-05-26 03:51:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3530 variables, 356/356 constraints. Problems are: Problem set: 0 solved, 3275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3530/6907 variables, and 356 constraints, problems are : Problem set: 0 solved, 3275 unsolved in 30057 ms.
Refiners :[Generalized P Invariants (flows): 356/358 constraints, State Equation: 0/3581 constraints, PredecessorRefiner: 3275/3275 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3530 variables, 356/356 constraints. Problems are: Problem set: 0 solved, 3275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3530/6907 variables, and 356 constraints, problems are : Problem set: 0 solved, 3275 unsolved in 30079 ms.
Refiners :[Generalized P Invariants (flows): 356/358 constraints, State Equation: 0/3581 constraints, PredecessorRefiner: 0/3275 constraints, Known Traps: 0/0 constraints]
After SMT, in 61249ms problems are : Problem set: 0 solved, 3275 unsolved
Search for dead transitions found 0 dead transitions in 61286ms
Finished structural reductions in LTL mode , in 1 iterations and 68011 ms. Remains : 3581/3581 places, 3326/3326 transitions.
Built C files in :
/tmp/ltsmin8218847914979314181
[2024-05-26 03:52:39] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8218847914979314181
Running compilation step : cd /tmp/ltsmin8218847914979314181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8218847914979314181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8218847914979314181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-26 03:52:42] [INFO ] Flatten gal took : 75 ms
[2024-05-26 03:52:42] [INFO ] Flatten gal took : 78 ms
[2024-05-26 03:52:42] [INFO ] Time to serialize gal into /tmp/LTL7911882303431725218.gal : 13 ms
[2024-05-26 03:52:42] [INFO ] Time to serialize properties into /tmp/LTL3529703903263748987.prop : 0 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7911882303431725218.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10734730751341759130.hoa' '-atoms' '/tmp/LTL3529703903263748987.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3529703903263748987.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10734730751341759130.hoa
Detected timeout of ITS tools.
[2024-05-26 03:52:58] [INFO ] Flatten gal took : 74 ms
[2024-05-26 03:52:58] [INFO ] Flatten gal took : 76 ms
[2024-05-26 03:52:58] [INFO ] Time to serialize gal into /tmp/LTL3336854103363716715.gal : 15 ms
[2024-05-26 03:52:58] [INFO ] Time to serialize properties into /tmp/LTL8200053474310222290.ltl : 0 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3336854103363716715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8200053474310222290.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(l32_13>=1)"))))))
Formula 0 simplified : XXXG!"(l32_13>=1)"
Detected timeout of ITS tools.
[2024-05-26 03:53:13] [INFO ] Flatten gal took : 72 ms
[2024-05-26 03:53:13] [INFO ] Applying decomposition
[2024-05-26 03:53:13] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1328627727416884446.txt' '-o' '/tmp/graph1328627727416884446.bin' '-w' '/tmp/graph1328627727416884446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1328627727416884446.bin' '-l' '-1' '-v' '-w' '/tmp/graph1328627727416884446.weights' '-q' '0' '-e' '0.001'
[2024-05-26 03:53:13] [INFO ] Decomposing Gal with order
[2024-05-26 03:53:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:53:15] [INFO ] Removed a total of 151 redundant transitions.
[2024-05-26 03:53:15] [INFO ] Flatten gal took : 177 ms
[2024-05-26 03:53:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2024-05-26 03:53:15] [INFO ] Time to serialize gal into /tmp/LTL4471611303173496382.gal : 41 ms
[2024-05-26 03:53:15] [INFO ] Time to serialize properties into /tmp/LTL14425204507947574174.ltl : 1 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4471611303173496382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14425204507947574174.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(i60.u325.l32_13>=1)"))))))
Formula 0 simplified : XXXG!"(i60.u325.l32_13>=1)"
Detected timeout of ITS tools.
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-14 finished in 285600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(G(p1))))))'
Support contains 4 out of 8953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 8340 transition count 8885
Discarding 616 places :
Symmetric choice reduction at 1 with 616 rule applications. Total rules 1229 place count 7724 transition count 8019
Iterating global reduction 1 with 616 rules applied. Total rules applied 1845 place count 7724 transition count 8019
Discarding 409 places :
Symmetric choice reduction at 1 with 409 rule applications. Total rules 2254 place count 7315 transition count 7510
Iterating global reduction 1 with 409 rules applied. Total rules applied 2663 place count 7315 transition count 7510
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2714 place count 7264 transition count 7510
Discarding 359 places :
Symmetric choice reduction at 2 with 359 rule applications. Total rules 3073 place count 6905 transition count 6951
Iterating global reduction 2 with 359 rules applied. Total rules applied 3432 place count 6905 transition count 6951
Discarding 507 places :
Symmetric choice reduction at 2 with 507 rule applications. Total rules 3939 place count 6398 transition count 6444
Iterating global reduction 2 with 507 rules applied. Total rules applied 4446 place count 6398 transition count 6444
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 2 with 102 rules applied. Total rules applied 4548 place count 6398 transition count 6342
Discarding 304 places :
Symmetric choice reduction at 3 with 304 rule applications. Total rules 4852 place count 6094 transition count 6038
Iterating global reduction 3 with 304 rules applied. Total rules applied 5156 place count 6094 transition count 6038
Discarding 304 places :
Symmetric choice reduction at 3 with 304 rule applications. Total rules 5460 place count 5790 transition count 5734
Iterating global reduction 3 with 304 rules applied. Total rules applied 5764 place count 5790 transition count 5734
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6019 place count 5535 transition count 5479
Iterating global reduction 3 with 255 rules applied. Total rules applied 6274 place count 5535 transition count 5479
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6529 place count 5280 transition count 5224
Iterating global reduction 3 with 255 rules applied. Total rules applied 6784 place count 5280 transition count 5224
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7039 place count 5025 transition count 4969
Iterating global reduction 3 with 255 rules applied. Total rules applied 7294 place count 5025 transition count 4969
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7549 place count 4770 transition count 4714
Iterating global reduction 3 with 255 rules applied. Total rules applied 7804 place count 4770 transition count 4714
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8059 place count 4515 transition count 4459
Iterating global reduction 3 with 255 rules applied. Total rules applied 8314 place count 4515 transition count 4459
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8569 place count 4260 transition count 4204
Iterating global reduction 3 with 255 rules applied. Total rules applied 8824 place count 4260 transition count 4204
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 9079 place count 4005 transition count 3949
Iterating global reduction 3 with 255 rules applied. Total rules applied 9334 place count 4005 transition count 3949
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 9589 place count 3750 transition count 3694
Iterating global reduction 3 with 255 rules applied. Total rules applied 9844 place count 3750 transition count 3694
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 3 with 204 rules applied. Total rules applied 10048 place count 3750 transition count 3490
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 10099 place count 3699 transition count 3439
Iterating global reduction 4 with 51 rules applied. Total rules applied 10150 place count 3699 transition count 3439
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 10201 place count 3648 transition count 3388
Iterating global reduction 4 with 51 rules applied. Total rules applied 10252 place count 3648 transition count 3388
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 52 rules applied. Total rules applied 10304 place count 3647 transition count 3337
Applied a total of 10304 rules in 19890 ms. Remains 3647 /8953 variables (removed 5306) and now considering 3337/8885 (removed 5548) transitions.
// Phase 1: matrix 3337 rows 3647 cols
[2024-05-26 03:53:50] [INFO ] Computed 414 invariants in 43 ms
[2024-05-26 03:53:52] [INFO ] Implicit Places using invariants in 1946 ms returned [663, 1338, 1495, 2217, 2218, 2219, 2220, 2221, 2222, 2223, 2224, 2225, 2226, 2227, 2228, 2229, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2237, 2238, 2239, 2240, 2241, 2242, 2243, 2244, 2245, 2246, 2247, 2248, 2249, 2250, 2251, 2252, 2253, 2254, 2255, 2256, 2257, 2258, 2259, 2260, 2261, 2262, 2263, 2264, 2265, 2266, 2267, 3187]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 1950 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3592/8953 places, 3337/8885 transitions.
Applied a total of 0 rules in 652 ms. Remains 3592 /3592 variables (removed 0) and now considering 3337/3337 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22492 ms. Remains : 3592/8953 places, 3337/8885 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-15 finished in 22802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Found a Shortening insensitive property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-04
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 357 out of 8953 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Graph (complete) has 12420 edges and 8953 vertex of which 7357 are kept as prefixes of interest. Removing 1596 places using SCC suffix rule.16 ms
Discarding 1596 places :
Also discarding 1692 output transitions
Drop transitions (Output transitions of discarded places.) removed 1692 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4687 transitions
Trivial Post-agglo rules discarded 4687 transitions
Performed 4687 trivial Post agglomeration. Transition count delta: 4687
Iterating post reduction 0 with 5300 rules applied. Total rules applied 5301 place count 6693 transition count 2455
Reduce places removed 4687 places and 0 transitions.
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Iterating post reduction 1 with 4840 rules applied. Total rules applied 10141 place count 2006 transition count 2302
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 2 with 153 rules applied. Total rules applied 10294 place count 1853 transition count 2302
Performed 357 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 357 Pre rules applied. Total rules applied 10294 place count 1853 transition count 1945
Deduced a syphon composed of 357 places in 1 ms
Ensure Unique test removed 153 places
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 3 with 867 rules applied. Total rules applied 11161 place count 1343 transition count 1945
Discarding 361 places :
Symmetric choice reduction at 3 with 361 rule applications. Total rules 11522 place count 982 transition count 1384
Iterating global reduction 3 with 361 rules applied. Total rules applied 11883 place count 982 transition count 1384
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 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 3 with 201 rules applied. Total rules applied 12084 place count 982 transition count 1183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 12085 place count 981 transition count 1183
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 102 Pre rules applied. Total rules applied 12085 place count 981 transition count 1081
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 5 with 204 rules applied. Total rules applied 12289 place count 879 transition count 1081
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 12294 place count 874 transition count 1026
Iterating global reduction 5 with 5 rules applied. Total rules applied 12299 place count 874 transition count 1026
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 5 with 105 rules applied. Total rules applied 12404 place count 874 transition count 921
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 12455 place count 823 transition count 921
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 12456 place count 822 transition count 920
Iterating global reduction 7 with 1 rules applied. Total rules applied 12457 place count 822 transition count 920
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 12458 place count 822 transition count 919
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 12458 place count 822 transition count 918
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 12461 place count 820 transition count 918
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 12563 place count 769 transition count 867
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 8 with 51 rules applied. Total rules applied 12614 place count 718 transition count 816
Applied a total of 12614 rules in 495 ms. Remains 718 /8953 variables (removed 8235) and now considering 816/8885 (removed 8069) transitions.
// Phase 1: matrix 816 rows 718 cols
[2024-05-26 03:53:53] [INFO ] Computed 104 invariants in 9 ms
[2024-05-26 03:53:54] [INFO ] Implicit Places using invariants in 534 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 536 ms to find 52 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 666/8953 places, 816/8885 transitions.
Applied a total of 0 rules in 8 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1040 ms. Remains : 666/8953 places, 816/8885 transitions.
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-04
Product exploration explored 100000 steps with 325 reset in 1631 ms.
Product exploration explored 100000 steps with 325 reset in 1462 ms.
Computed a total of 666 stabilizing places and 816 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 666 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)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 210 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1119 steps (0 resets) in 28 ms. (38 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 566 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
// Phase 1: matrix 816 rows 666 cols
[2024-05-26 03:53:59] [INFO ] Computed 52 invariants in 10 ms
[2024-05-26 03:54:03] [INFO ] [Real]Absence check using 0 positive and 52 generalized place invariants in 61 ms returned sat
[2024-05-26 03:54:04] [INFO ] [Real]Absence check using state equation in 756 ms returned sat
[2024-05-26 03:54:04] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 73 ms.
[2024-05-26 03:54:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 03:54:10] [INFO ] [Nat]Absence check using 0 positive and 52 generalized place invariants in 51 ms returned sat
[2024-05-26 03:54:11] [INFO ] [Nat]Absence check using state equation in 999 ms returned sat
[2024-05-26 03:54:11] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 85 ms.
[2024-05-26 03:54:14] [INFO ] Added : 179 causal constraints over 36 iterations in 3526 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 357 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 816/816 transitions.
Applied a total of 0 rules in 13 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
[2024-05-26 03:54:14] [INFO ] Invariant cache hit.
[2024-05-26 03:54:14] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-26 03:54:14] [INFO ] Invariant cache hit.
[2024-05-26 03:54:15] [INFO ] Implicit Places using invariants and state equation in 791 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
[2024-05-26 03:54:15] [INFO ] Redundant transitions in 6 ms returned []
Running 663 sub problems to find dead transitions.
[2024-05-26 03:54:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (OVERLAPS) 816/1431 variables, 615/667 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1431/1482 variables, and 667 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 52/52 constraints, State Equation: 615/666 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 663 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (OVERLAPS) 816/1431 variables, 615/667 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1431 variables, 663/1330 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1431/1482 variables, and 1330 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 52/52 constraints, State Equation: 615/666 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 0/0 constraints]
After SMT, in 60426ms problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 60433ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61553 ms. Remains : 666/666 places, 816/816 transitions.
Computed a total of 666 stabilizing places and 816 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 666 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)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 292 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1148 steps (0 resets) in 30 ms. (37 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 601 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
[2024-05-26 03:55:19] [INFO ] Invariant cache hit.
[2024-05-26 03:55:22] [INFO ] [Real]Absence check using 0 positive and 52 generalized place invariants in 66 ms returned sat
[2024-05-26 03:55:23] [INFO ] [Real]Absence check using state equation in 752 ms returned sat
[2024-05-26 03:55:23] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 64 ms.
[2024-05-26 03:55:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 03:55:28] [INFO ] [Nat]Absence check using 0 positive and 52 generalized place invariants in 41 ms returned sat
[2024-05-26 03:55:29] [INFO ] [Nat]Absence check using state equation in 771 ms returned sat
[2024-05-26 03:55:29] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 60 ms.
[2024-05-26 03:55:31] [INFO ] Added : 182 causal constraints over 37 iterations in 2674 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Product exploration explored 100000 steps with 325 reset in 1666 ms.
Product exploration explored 100000 steps with 325 reset in 1466 ms.
Built C files in :
/tmp/ltsmin15442172895613938382
[2024-05-26 03:55:35] [INFO ] Computing symmetric may disable matrix : 816 transitions.
[2024-05-26 03:55:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:55:35] [INFO ] Computing symmetric may enable matrix : 816 transitions.
[2024-05-26 03:55:35] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:55:35] [INFO ] Computing Do-Not-Accords matrix : 816 transitions.
[2024-05-26 03:55:35] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:55:35] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15442172895613938382
Running compilation step : cd /tmp/ltsmin15442172895613938382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15442172895613938382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15442172895613938382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 357 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 816/816 transitions.
Applied a total of 0 rules in 8 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
[2024-05-26 03:55:38] [INFO ] Invariant cache hit.
[2024-05-26 03:55:38] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-26 03:55:38] [INFO ] Invariant cache hit.
[2024-05-26 03:55:39] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
[2024-05-26 03:55:39] [INFO ] Redundant transitions in 11 ms returned []
Running 663 sub problems to find dead transitions.
[2024-05-26 03:55:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (OVERLAPS) 816/1431 variables, 615/667 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1431/1482 variables, and 667 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 52/52 constraints, State Equation: 615/666 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 663 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (OVERLAPS) 816/1431 variables, 615/667 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1431 variables, 663/1330 constraints. Problems are: Problem set: 0 solved, 663 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 1431/1482 variables, and 1330 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 52/52 constraints, State Equation: 615/666 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 0/0 constraints]
After SMT, in 60544ms problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 60555ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61824 ms. Remains : 666/666 places, 816/816 transitions.
Built C files in :
/tmp/ltsmin15347726270519963838
[2024-05-26 03:56:40] [INFO ] Computing symmetric may disable matrix : 816 transitions.
[2024-05-26 03:56:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:56:40] [INFO ] Computing symmetric may enable matrix : 816 transitions.
[2024-05-26 03:56:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:56:40] [INFO ] Computing Do-Not-Accords matrix : 816 transitions.
[2024-05-26 03:56:40] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 03:56:40] [INFO ] Built C files in 136ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15347726270519963838
Running compilation step : cd /tmp/ltsmin15347726270519963838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15347726270519963838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15347726270519963838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-26 03:56:43] [INFO ] Flatten gal took : 17 ms
[2024-05-26 03:56:43] [INFO ] Flatten gal took : 17 ms
[2024-05-26 03:56:43] [INFO ] Time to serialize gal into /tmp/LTL890656939594603075.gal : 4 ms
[2024-05-26 03:56:43] [INFO ] Time to serialize properties into /tmp/LTL12215876353949229160.prop : 1 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL890656939594603075.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10941538316768867040.hoa' '-atoms' '/tmp/LTL12215876353949229160.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12215876353949229160.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10941538316768867040.hoa
Detected timeout of ITS tools.
[2024-05-26 03:56:58] [INFO ] Flatten gal took : 18 ms
[2024-05-26 03:56:58] [INFO ] Flatten gal took : 18 ms
[2024-05-26 03:56:58] [INFO ] Time to serialize gal into /tmp/LTL2985886634584608872.gal : 4 ms
[2024-05-26 03:56:58] [INFO ] Time to serialize properties into /tmp/LTL14408117282310291759.ltl : 12 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2985886634584608872.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14408117282310291759.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((((((((p6_11_0<1)&&(p6_39_2<1))&&((p6_25_1<1)&&(p6_7_0<1)))&&(((p6_35_2<1)&&(p6_21_1<1))&&((p6_19_0<1)&&(p6_47_2<1))))&&(...7138
Formula 0 simplified : XG(!"((((((((((l20_14>=1)&&(pl1_14_0>=1))||((l20_9>=1)&&(pl1_9_0>=1)))||(((l20_49>=1)&&(pl1_49_2>=1))||((l20_44>=1)&&(pl1_44_2>=1)))...7130
Detected timeout of ITS tools.
[2024-05-26 03:57:13] [INFO ] Flatten gal took : 18 ms
[2024-05-26 03:57:13] [INFO ] Applying decomposition
[2024-05-26 03:57:13] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16806600993206574354.txt' '-o' '/tmp/graph16806600993206574354.bin' '-w' '/tmp/graph16806600993206574354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16806600993206574354.bin' '-l' '-1' '-v' '-w' '/tmp/graph16806600993206574354.weights' '-q' '0' '-e' '0.001'
[2024-05-26 03:57:13] [INFO ] Decomposing Gal with order
[2024-05-26 03:57:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:57:13] [INFO ] Removed a total of 513 redundant transitions.
[2024-05-26 03:57:13] [INFO ] Flatten gal took : 43 ms
[2024-05-26 03:57:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 11 ms.
[2024-05-26 03:57:14] [INFO ] Time to serialize gal into /tmp/LTL5011298980128241406.gal : 8 ms
[2024-05-26 03:57:14] [INFO ] Time to serialize properties into /tmp/LTL10695434975248907704.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5011298980128241406.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10695434975248907704.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((((((((i19.u4.p6_11_0<1)&&(i25.u129.p6_39_2<1))&&((i41.u99.p6_25_1<1)&&(i48.u72.p6_7_0<1)))&&(((i12.u59.p6_35_2<1)&&(i7.u...10994
Formula 0 simplified : XG(!"((((((((((i20.u134.l20_14>=1)&&(i20.u182.pl1_14_0>=1))||((i1.u2.l20_9>=1)&&(i1.u177.pl1_9_0>=1)))||(((i39.u171.l20_49>=1)&&(i39...10986
Detected timeout of ITS tools.
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-04 finished in 215935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-14
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 8953 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 8953/8953 places, 8885/8885 transitions.
Graph (complete) has 12420 edges and 8953 vertex of which 7173 are kept as prefixes of interest. Removing 1780 places using SCC suffix rule.9 ms
Discarding 1780 places :
Also discarding 1827 output transitions
Drop transitions (Output transitions of discarded places.) removed 1827 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4997 transitions
Trivial Post-agglo rules discarded 4997 transitions
Performed 4997 trivial Post agglomeration. Transition count delta: 4997
Iterating post reduction 0 with 5610 rules applied. Total rules applied 5611 place count 6509 transition count 2010
Reduce places removed 4997 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions 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 1 with 5000 rules applied. Total rules applied 10611 place count 1512 transition count 2007
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10612 place count 1511 transition count 2007
Performed 412 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 412 Pre rules applied. Total rules applied 10612 place count 1511 transition count 1595
Deduced a syphon composed of 412 places in 0 ms
Ensure Unique test removed 156 places
Reduce places removed 568 places and 0 transitions.
Iterating global reduction 3 with 980 rules applied. Total rules applied 11592 place count 943 transition count 1595
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 3 with 153 rules applied. Total rules applied 11745 place count 943 transition count 1442
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 4 with 153 rules applied. Total rules applied 11898 place count 790 transition count 1442
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 11898 place count 790 transition count 1441
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 11900 place count 789 transition count 1441
Discarding 412 places :
Symmetric choice reduction at 5 with 412 rule applications. Total rules 12312 place count 377 transition count 731
Iterating global reduction 5 with 412 rules applied. Total rules applied 12724 place count 377 transition count 731
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 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 5 with 202 rules applied. Total rules applied 12926 place count 377 transition count 529
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 12928 place count 375 transition count 529
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 52 Pre rules applied. Total rules applied 12928 place count 375 transition count 477
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 13032 place count 323 transition count 477
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 13039 place count 316 transition count 418
Iterating global reduction 7 with 7 rules applied. Total rules applied 13046 place count 316 transition count 418
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Discarding 52 places :
Implicit places reduction removed 52 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 7 with 310 rules applied. Total rules applied 13356 place count 264 transition count 160
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 8 with 102 rules applied. Total rules applied 13458 place count 162 transition count 160
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 13458 place count 162 transition count 158
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 13462 place count 160 transition count 158
Discarding 50 places :
Symmetric choice reduction at 9 with 50 rule applications. Total rules 13512 place count 110 transition count 108
Iterating global reduction 9 with 50 rules applied. Total rules applied 13562 place count 110 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 13563 place count 110 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 13563 place count 110 transition count 106
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 13566 place count 108 transition count 106
Discarding 49 places :
Symmetric choice reduction at 10 with 49 rule applications. Total rules 13615 place count 59 transition count 57
Iterating global reduction 10 with 49 rules applied. Total rules applied 13664 place count 59 transition count 57
Discarding 49 places :
Symmetric choice reduction at 10 with 49 rule applications. Total rules 13713 place count 10 transition count 8
Iterating global reduction 10 with 49 rules applied. Total rules applied 13762 place count 10 transition count 8
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 13764 place count 8 transition count 6
Applied a total of 13764 rules in 209 ms. Remains 8 /8953 variables (removed 8945) and now considering 6/8885 (removed 8879) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-26 03:57:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-26 03:57:29] [INFO ] Implicit Places using invariants in 26 ms returned [3, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 6/8953 places, 6/8885 transitions.
Graph (complete) has 4 edges and 6 vertex of which 4 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
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 1 ms. Remains 2 /6 variables (removed 4) and now considering 2/6 (removed 4) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-26 03:57:29] [INFO ] Computed 0 invariants in 1 ms
[2024-05-26 03:57:29] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-26 03:57:29] [INFO ] Invariant cache hit.
[2024-05-26 03:57:29] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 2/8953 places, 2/8885 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 287 ms. Remains : 2/8953 places, 2/8885 transitions.
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-14 finished in 571 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-26 03:57:29] [INFO ] Flatten gal took : 219 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10080741792227417744
[2024-05-26 03:57:29] [INFO ] Too many transitions (8885) to apply POR reductions. Disabling POR matrices.
[2024-05-26 03:57:30] [INFO ] Applying decomposition
[2024-05-26 03:57:30] [INFO ] Built C files in 167ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10080741792227417744
Running compilation step : cd /tmp/ltsmin10080741792227417744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-26 03:57:30] [INFO ] Flatten gal took : 215 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9445179554573939309.txt' '-o' '/tmp/graph9445179554573939309.bin' '-w' '/tmp/graph9445179554573939309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9445179554573939309.bin' '-l' '-1' '-v' '-w' '/tmp/graph9445179554573939309.weights' '-q' '0' '-e' '0.001'
[2024-05-26 03:57:30] [INFO ] Decomposing Gal with order
[2024-05-26 03:57:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:57:38] [INFO ] Removed a total of 2701 redundant transitions.
[2024-05-26 03:57:38] [INFO ] Flatten gal took : 390 ms
[2024-05-26 03:57:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 313 labels/synchronizations in 175 ms.
[2024-05-26 03:57:38] [INFO ] Time to serialize gal into /tmp/LTLFireability17245899313796838735.gal : 77 ms
[2024-05-26 03:57:38] [INFO ] Time to serialize properties into /tmp/LTLFireability9119130212899989045.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17245899313796838735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9119130212899989045.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(F(("((((((((((i54.u2777.l20_14>=1)&&(i54.u2806.pl1_14_0>=1))||((i67.u2851.l20_9>=1)&&(i67.u2802.pl1_9_0>=1)))||(((i64.u2872.l20_4...12757
Formula 0 simplified : XG(!"((((((((((i54.u2777.l20_14>=1)&&(i54.u2806.pl1_14_0>=1))||((i67.u2851.l20_9>=1)&&(i67.u2802.pl1_9_0>=1)))||(((i64.u2872.l20_49>...12749
Compilation finished in 118028 ms.
Running link step : cd /tmp/ltsmin10080741792227417744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 135 ms.
Running LTSmin : cd /tmp/ltsmin10080741792227417744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&[]((LTLAPp1==true)))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-26 04:10:43] [INFO ] Flatten gal took : 451 ms
[2024-05-26 04:10:43] [INFO ] Time to serialize gal into /tmp/LTLFireability11138355555447767644.gal : 78 ms
[2024-05-26 04:10:43] [INFO ] Time to serialize properties into /tmp/LTLFireability3114979424546817095.ltl : 12 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11138355555447767644.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3114979424546817095.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((X(F(("((((((((((l20_14>=1)&&(pl1_14_0>=1))||((l20_9>=1)&&(pl1_9_0>=1)))||(((l20_49>=1)&&(pl1_49_2>=1))||((l20_44>=1)&&(pl1_44_2>=1)...7138
Formula 0 simplified : XG(!"((((((((((l20_14>=1)&&(pl1_14_0>=1))||((l20_9>=1)&&(pl1_9_0>=1)))||(((l20_49>=1)&&(pl1_49_2>=1))||((l20_44>=1)&&(pl1_44_2>=1)))...7130
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10080741792227417744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10080741792227417744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10080741792227417744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp2==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin10080741792227417744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-26 04:37:22] [INFO ] Flatten gal took : 527 ms
[2024-05-26 04:37:22] [INFO ] Input system was already deterministic with 8885 transitions.
[2024-05-26 04:37:23] [INFO ] Transformed 8953 places.
[2024-05-26 04:37:23] [INFO ] Transformed 8885 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-L00050M0005C002P002G001"
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-5568"
echo " Executing tool itstools"
echo " Input is FamilyReunion-PT-L00050M0005C002P002G001, 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 r158-smll-171636267000500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;