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.r175-smll-171636280400302.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 gold2023
Input is FamilyReunion-PT-L00010M0001C001P001G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636280400302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 20K Apr 11 20:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 20:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 11 20:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 115K Apr 11 20:15 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 11K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 20:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 440K Apr 11 20:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 11 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 11 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K 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 552K 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-L00010M0001C001P001G001-LTLCardinality-00
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-01
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-02
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-03
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-05
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-06
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-07
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-08
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-09
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-10
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-11
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-12
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-13
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-14
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716650078616

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00010M0001C001P001G001
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:14:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:14:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:14:43] [INFO ] Load time of PNML (sax parser for PT used): 266 ms
[2024-05-25 15:14:43] [INFO ] Transformed 1475 places.
[2024-05-25 15:14:43] [INFO ] Transformed 1234 transitions.
[2024-05-25 15:14:43] [INFO ] Parsed PT model containing 1475 places and 1234 transitions and 3799 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 363 out of 1465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1465/1465 places, 1234/1234 transitions.
Reduce places removed 21 places and 0 transitions.
Discarding 88 places :
Implicit places reduction removed 88 places
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 1356 transition count 1234
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 174 place count 1291 transition count 1169
Iterating global reduction 1 with 65 rules applied. Total rules applied 239 place count 1291 transition count 1169
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 249 place count 1281 transition count 1169
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 260 place count 1270 transition count 1158
Iterating global reduction 2 with 11 rules applied. Total rules applied 271 place count 1270 transition count 1158
Applied a total of 271 rules in 581 ms. Remains 1270 /1465 variables (removed 195) and now considering 1158/1234 (removed 76) transitions.
// Phase 1: matrix 1158 rows 1270 cols
[2024-05-25 15:14:44] [INFO ] Computed 216 invariants in 105 ms
[2024-05-25 15:14:45] [INFO ] Implicit Places using invariants in 1513 ms returned [79, 80, 81, 83, 87, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 768, 902, 903, 904, 905, 906, 907, 908, 909, 910, 911, 912, 969, 970, 971, 973, 974, 975, 976, 977, 978, 979, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1180]
Discarding 70 places :
Implicit Place search using SMT only with invariants took 1583 ms to find 70 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1200/1465 places, 1158/1234 transitions.
Applied a total of 0 rules in 60 ms. Remains 1200 /1200 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2226 ms. Remains : 1200/1465 places, 1158/1234 transitions.
Support contains 363 out of 1200 places after structural reductions.
[2024-05-25 15:14:46] [INFO ] Flatten gal took : 241 ms
[2024-05-25 15:14:46] [INFO ] Flatten gal took : 173 ms
[2024-05-25 15:14:46] [INFO ] Input system was already deterministic with 1158 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 964 ms. (steps per millisecond=10 ) properties (out of 30) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1158 rows 1200 cols
[2024-05-25 15:14:48] [INFO ] Computed 146 invariants in 23 ms
[2024-05-25 15:14:48] [INFO ] [Real]Absence check using 36 positive place invariants in 81 ms returned sat
[2024-05-25 15:14:48] [INFO ] [Real]Absence check using 36 positive and 110 generalized place invariants in 73 ms returned sat
[2024-05-25 15:14:48] [INFO ] After 660ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2024-05-25 15:14:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 78 ms returned sat
[2024-05-25 15:14:49] [INFO ] [Nat]Absence check using 36 positive and 110 generalized place invariants in 41 ms returned sat
[2024-05-25 15:14:50] [INFO ] After 836ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2024-05-25 15:14:50] [INFO ] After 1059ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2024-05-25 15:14:50] [INFO ] After 1792ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 418 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=59 )
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 1200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1200/1200 places, 1158/1158 transitions.
Graph (complete) has 1663 edges and 1200 vertex of which 1113 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.7 ms
Discarding 87 places :
Also discarding 74 output transitions
Drop transitions removed 74 transitions
Drop transitions removed 11 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions removed 592 transitions
Trivial Post-agglo rules discarded 592 transitions
Performed 592 trivial Post agglomeration. Transition count delta: 592
Iterating post reduction 0 with 657 rules applied. Total rules applied 658 place count 1069 transition count 471
Reduce places removed 592 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 625 rules applied. Total rules applied 1283 place count 477 transition count 438
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1305 place count 455 transition count 438
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 1305 place count 455 transition count 282
Deduced a syphon composed of 156 places in 1 ms
Ensure Unique test removed 54 places
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 1671 place count 245 transition count 282
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 22 rules applied. Total rules applied 1693 place count 245 transition count 260
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1715 place count 223 transition count 260
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 1715 place count 223 transition count 250
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1735 place count 213 transition count 250
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1759 place count 189 transition count 206
Iterating global reduction 5 with 24 rules applied. Total rules applied 1783 place count 189 transition count 206
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 19 rules applied. Total rules applied 1802 place count 188 transition count 188
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 1805 place count 186 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1806 place count 185 transition count 187
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 1806 place count 185 transition count 175
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1830 place count 173 transition count 175
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1837 place count 166 transition count 158
Iterating global reduction 8 with 7 rules applied. Total rules applied 1844 place count 166 transition count 158
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 8 with 56 rules applied. Total rules applied 1900 place count 159 transition count 109
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 9 with 32 rules applied. Total rules applied 1932 place count 127 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1932 place count 127 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1934 place count 126 transition count 108
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 10 with 47 rules applied. Total rules applied 1981 place count 102 transition count 85
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 10 with 14 rules applied. Total rules applied 1995 place count 102 transition count 71
Ensure Unique test removed 11 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 10 with 25 rules applied. Total rules applied 2020 place count 77 transition count 71
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2021 place count 77 transition count 71
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 11 with 11 rules applied. Total rules applied 2032 place count 66 transition count 60
Applied a total of 2032 rules in 213 ms. Remains 66 /1200 variables (removed 1134) and now considering 60/1158 (removed 1098) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 66/1200 places, 60/1158 transitions.
Finished random walk after 478 steps, including 17 resets, run visited all 1 properties in 7 ms. (steps per millisecond=68 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1200 stabilizing places and 1158 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1200 transition count 1158
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||((G(!p0)||(!p0&&F(p1)))&&X(p2)))))'
Support contains 57 out of 1200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1200/1200 places, 1158/1158 transitions.
Reduce places removed 13 places and 0 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 1143 transition count 1158
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 124 place count 1076 transition count 1080
Iterating global reduction 1 with 67 rules applied. Total rules applied 191 place count 1076 transition count 1080
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 201 place count 1076 transition count 1070
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 215 place count 1062 transition count 1036
Iterating global reduction 2 with 14 rules applied. Total rules applied 229 place count 1062 transition count 1036
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 231 place count 1061 transition count 1035
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 254 place count 1038 transition count 1002
Iterating global reduction 3 with 23 rules applied. Total rules applied 277 place count 1038 transition count 1002
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 300 place count 1015 transition count 969
Iterating global reduction 3 with 23 rules applied. Total rules applied 323 place count 1015 transition count 969
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 334 place count 1004 transition count 969
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 345 place count 993 transition count 958
Iterating global reduction 4 with 11 rules applied. Total rules applied 356 place count 993 transition count 958
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 367 place count 982 transition count 947
Iterating global reduction 4 with 11 rules applied. Total rules applied 378 place count 982 transition count 947
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 389 place count 971 transition count 936
Iterating global reduction 4 with 11 rules applied. Total rules applied 400 place count 971 transition count 936
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 411 place count 960 transition count 925
Iterating global reduction 4 with 11 rules applied. Total rules applied 422 place count 960 transition count 925
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 433 place count 949 transition count 914
Iterating global reduction 4 with 11 rules applied. Total rules applied 444 place count 949 transition count 914
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 455 place count 938 transition count 903
Iterating global reduction 4 with 11 rules applied. Total rules applied 466 place count 938 transition count 903
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 477 place count 927 transition count 892
Iterating global reduction 4 with 11 rules applied. Total rules applied 488 place count 927 transition count 892
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 499 place count 916 transition count 881
Iterating global reduction 4 with 11 rules applied. Total rules applied 510 place count 916 transition count 881
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 521 place count 905 transition count 870
Iterating global reduction 4 with 11 rules applied. Total rules applied 532 place count 905 transition count 870
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 543 place count 894 transition count 859
Iterating global reduction 4 with 11 rules applied. Total rules applied 554 place count 894 transition count 859
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 565 place count 883 transition count 848
Iterating global reduction 4 with 11 rules applied. Total rules applied 576 place count 883 transition count 848
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 587 place count 872 transition count 837
Iterating global reduction 4 with 11 rules applied. Total rules applied 598 place count 872 transition count 837
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 4 with 17 rules applied. Total rules applied 615 place count 866 transition count 826
Applied a total of 615 rules in 1176 ms. Remains 866 /1200 variables (removed 334) and now considering 826/1158 (removed 332) transitions.
// Phase 1: matrix 826 rows 866 cols
[2024-05-25 15:14:52] [INFO ] Computed 83 invariants in 10 ms
[2024-05-25 15:14:53] [INFO ] Implicit Places using invariants in 431 ms returned [355, 400, 622, 766]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 440 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 862/1200 places, 826/1158 transitions.
Applied a total of 0 rules in 48 ms. Remains 862 /862 variables (removed 0) and now considering 826/826 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1666 ms. Remains : 862/1200 places, 826/1158 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 434 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ (ADD s521 s522 s523 s524 s525 s526 s527 s528 s529 s530 s531) (ADD s154 s155)) (LEQ 3 (ADD s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43))), p1:...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1930 ms.
Product exploration explored 100000 steps with 50000 reset in 1505 ms.
Computed a total of 862 stabilizing places and 826 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 862 transition count 826
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 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 1546 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-00 finished in 7640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(p1&&X(p2)))))'
Support contains 79 out of 1200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1200/1200 places, 1158/1158 transitions.
Reduce places removed 13 places and 0 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 1143 transition count 1158
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 114 place count 1086 transition count 1080
Iterating global reduction 1 with 57 rules applied. Total rules applied 171 place count 1086 transition count 1080
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 181 place count 1086 transition count 1070
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 206 place count 1061 transition count 1025
Iterating global reduction 2 with 25 rules applied. Total rules applied 231 place count 1061 transition count 1025
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 244 place count 1060 transition count 1013
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 266 place count 1038 transition count 991
Iterating global reduction 3 with 22 rules applied. Total rules applied 288 place count 1038 transition count 991
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 300 place count 1026 transition count 969
Iterating global reduction 3 with 12 rules applied. Total rules applied 312 place count 1026 transition count 969
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 323 place count 1015 transition count 969
Applied a total of 323 rules in 387 ms. Remains 1015 /1200 variables (removed 185) and now considering 969/1158 (removed 189) transitions.
// Phase 1: matrix 969 rows 1015 cols
[2024-05-25 15:14:59] [INFO ] Computed 78 invariants in 12 ms
[2024-05-25 15:14:59] [INFO ] Implicit Places using invariants in 564 ms returned [77, 78, 79, 80, 81, 82, 182, 470, 770, 915]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 570 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1005/1200 places, 969/1158 transitions.
Applied a total of 0 rules in 67 ms. Remains 1005 /1005 variables (removed 0) and now considering 969/969 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1024 ms. Remains : 1005/1200 places, 969/1158 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 3 (ADD s396 s397 s398 s399 s400 s401 s402 s403 s404 s405 s406)), p1:(LEQ (ADD s652 s653 s654 s655 s656 s657 s658 s659 s660 s661 s662 s663 s664 s665...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 587 steps with 0 reset in 3 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-01 finished in 1210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(p1&&F(p2))))))'
Support contains 88 out of 1200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1200/1200 places, 1158/1158 transitions.
Reduce places removed 24 places and 0 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 1154 transition count 1158
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 93 place count 1107 transition count 1090
Iterating global reduction 1 with 47 rules applied. Total rules applied 140 place count 1107 transition count 1090
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 184 place count 1063 transition count 1036
Iterating global reduction 1 with 44 rules applied. Total rules applied 228 place count 1063 transition count 1036
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 239 place count 1063 transition count 1025
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 261 place count 1041 transition count 993
Iterating global reduction 2 with 22 rules applied. Total rules applied 283 place count 1041 transition count 993
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 294 place count 1030 transition count 962
Iterating global reduction 2 with 11 rules applied. Total rules applied 305 place count 1030 transition count 962
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 316 place count 1019 transition count 962
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 326 place count 1009 transition count 952
Iterating global reduction 3 with 10 rules applied. Total rules applied 336 place count 1009 transition count 952
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 346 place count 999 transition count 942
Iterating global reduction 3 with 10 rules applied. Total rules applied 356 place count 999 transition count 942
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 366 place count 989 transition count 932
Iterating global reduction 3 with 10 rules applied. Total rules applied 376 place count 989 transition count 932
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 386 place count 979 transition count 922
Iterating global reduction 3 with 10 rules applied. Total rules applied 396 place count 979 transition count 922
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 397 place count 978 transition count 922
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 407 place count 968 transition count 912
Iterating global reduction 4 with 10 rules applied. Total rules applied 417 place count 968 transition count 912
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 427 place count 958 transition count 902
Iterating global reduction 4 with 10 rules applied. Total rules applied 437 place count 958 transition count 902
Applied a total of 437 rules in 669 ms. Remains 958 /1200 variables (removed 242) and now considering 902/1158 (removed 256) transitions.
// Phase 1: matrix 902 rows 958 cols
[2024-05-25 15:15:00] [INFO ] Computed 100 invariants in 6 ms
[2024-05-25 15:15:01] [INFO ] Implicit Places using invariants in 380 ms returned [77, 78, 79, 80, 81, 82, 182, 509, 679, 869]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 382 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 948/1200 places, 902/1158 transitions.
Applied a total of 0 rules in 33 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1084 ms. Remains : 948/1200 places, 902/1158 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76) (ADD s616 s617 s618 s619 s620 s621 s622 s623 s624 s625 s626 s627 s628 s629 s630 s631 s632 s633 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 155 reset in 740 ms.
Product exploration explored 100000 steps with 155 reset in 447 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
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 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR p0 p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR p0 p1))), (X (X p2)), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 520 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 417983 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 417983 steps, saw 84020 distinct states, run finished after 3004 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 902 rows 948 cols
[2024-05-25 15:15:06] [INFO ] Computed 90 invariants in 15 ms
[2024-05-25 15:15:07] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR p0 p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR p0 p1))), (X (X p2)), (F (G p0)), (F (G p1)), (F (G p2)), (G (NOT (AND (NOT p0) (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-02 finished in 6975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p0&&F(!p0))))))'
Support contains 33 out of 1200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1200/1200 places, 1158/1158 transitions.
Reduce places removed 24 places and 0 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 1154 transition count 1158
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 125 place count 1075 transition count 1058
Iterating global reduction 1 with 79 rules applied. Total rules applied 204 place count 1075 transition count 1058
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 214 place count 1075 transition count 1048
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 260 place count 1029 transition count 982
Iterating global reduction 2 with 46 rules applied. Total rules applied 306 place count 1029 transition count 982
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 319 place count 1028 transition count 970
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 352 place count 995 transition count 927
Iterating global reduction 3 with 33 rules applied. Total rules applied 385 place count 995 transition count 927
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 418 place count 962 transition count 874
Iterating global reduction 3 with 33 rules applied. Total rules applied 451 place count 962 transition count 874
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 462 place count 951 transition count 874
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 483 place count 930 transition count 853
Iterating global reduction 4 with 21 rules applied. Total rules applied 504 place count 930 transition count 853
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 525 place count 909 transition count 832
Iterating global reduction 4 with 21 rules applied. Total rules applied 546 place count 909 transition count 832
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 567 place count 888 transition count 811
Iterating global reduction 4 with 21 rules applied. Total rules applied 588 place count 888 transition count 811
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 609 place count 867 transition count 790
Iterating global reduction 4 with 21 rules applied. Total rules applied 630 place count 867 transition count 790
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 631 place count 866 transition count 790
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 641 place count 856 transition count 780
Iterating global reduction 5 with 10 rules applied. Total rules applied 651 place count 856 transition count 780
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 661 place count 846 transition count 770
Iterating global reduction 5 with 10 rules applied. Total rules applied 671 place count 846 transition count 770
Applied a total of 671 rules in 676 ms. Remains 846 /1200 variables (removed 354) and now considering 770/1158 (removed 388) transitions.
// Phase 1: matrix 770 rows 846 cols
[2024-05-25 15:15:07] [INFO ] Computed 99 invariants in 7 ms
[2024-05-25 15:15:08] [INFO ] Implicit Places using invariants in 394 ms returned [77, 78, 79, 80, 81, 82, 182, 443, 602, 746]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 396 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 836/1200 places, 770/1158 transitions.
Applied a total of 0 rules in 32 ms. Remains 836 /836 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1105 ms. Remains : 836/1200 places, 770/1158 transitions.
Stuttering acceptance computed with spot in 138 ms :[p0, true, true]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}]], initial=1, aps=[p0:(LEQ (ADD s825 s826 s827 s828 s829 s830 s831 s832 s833 s834 s835) (ADD s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s301 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 279 reset in 231 ms.
Product exploration explored 100000 steps with 279 reset in 420 ms.
Computed a total of 836 stabilizing places and 770 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 836 transition count 770
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[p0]
Finished random walk after 356 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=118 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
Stuttering acceptance computed with spot in 45 ms :[p0]
// Phase 1: matrix 770 rows 836 cols
[2024-05-25 15:15:09] [INFO ] Computed 89 invariants in 7 ms
[2024-05-25 15:15:10] [INFO ] [Real]Absence check using 0 positive and 89 generalized place invariants in 80 ms returned sat
[2024-05-25 15:15:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:12] [INFO ] [Real]Absence check using state equation in 1409 ms returned sat
[2024-05-25 15:15:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:15:13] [INFO ] [Nat]Absence check using 0 positive and 89 generalized place invariants in 69 ms returned sat
[2024-05-25 15:15:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:14] [INFO ] [Nat]Absence check using state equation in 1051 ms returned sat
[2024-05-25 15:15:14] [INFO ] Computed and/alt/rep : 757/868/757 causal constraints (skipped 2 transitions) in 55 ms.
[2024-05-25 15:15:24] [INFO ] Added : 450 causal constraints over 90 iterations in 10345 ms. Result :sat
Could not prove EG p0
Support contains 33 out of 836 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 836/836 places, 770/770 transitions.
Graph (complete) has 957 edges and 836 vertex of which 649 are kept as prefixes of interest. Removing 187 places using SCC suffix rule.8 ms
Discarding 187 places :
Also discarding 143 output transitions
Drop transitions removed 143 transitions
Reduce places removed 11 places and 11 transitions.
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 0 with 396 rules applied. Total rules applied 397 place count 638 transition count 220
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 793 place count 242 transition count 220
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 793 place count 242 transition count 121
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 44 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 1035 place count 99 transition count 121
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1046 place count 88 transition count 110
Iterating global reduction 2 with 11 rules applied. Total rules applied 1057 place count 88 transition count 110
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1068 place count 88 transition count 99
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 1068 place count 88 transition count 88
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 1090 place count 77 transition count 88
Applied a total of 1090 rules in 54 ms. Remains 77 /836 variables (removed 759) and now considering 88/770 (removed 682) transitions.
// Phase 1: matrix 88 rows 77 cols
[2024-05-25 15:15:24] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 15:15:24] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-25 15:15:24] [INFO ] Invariant cache hit.
[2024-05-25 15:15:24] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-25 15:15:24] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-25 15:15:24] [INFO ] Invariant cache hit.
[2024-05-25 15:15:25] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/836 places, 88/770 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309 ms. Remains : 77/836 places, 88/770 transitions.
Computed a total of 77 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[p0]
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[p0]
Stuttering acceptance computed with spot in 49 ms :[p0]
[2024-05-25 15:15:25] [INFO ] Invariant cache hit.
[2024-05-25 15:15:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:25] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-25 15:15:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:15:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:25] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-25 15:15:25] [INFO ] Computed and/alt/rep : 66/77/66 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-25 15:15:25] [INFO ] Added : 22 causal constraints over 5 iterations in 76 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 50 ms :[p0]
Product exploration explored 100000 steps with 2983 reset in 429 ms.
Product exploration explored 100000 steps with 2994 reset in 385 ms.
Built C files in :
/tmp/ltsmin5959822690080336329
[2024-05-25 15:15:26] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-25 15:15:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:15:26] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-25 15:15:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:15:26] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-25 15:15:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:15:26] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5959822690080336329
Running compilation step : cd /tmp/ltsmin5959822690080336329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 627 ms.
Running link step : cd /tmp/ltsmin5959822690080336329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin5959822690080336329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9937324324005617086.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 33 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-25 15:15:42] [INFO ] Invariant cache hit.
[2024-05-25 15:15:42] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-25 15:15:42] [INFO ] Invariant cache hit.
[2024-05-25 15:15:42] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-25 15:15:42] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-25 15:15:42] [INFO ] Invariant cache hit.
[2024-05-25 15:15:42] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 77/77 places, 88/88 transitions.
Built C files in :
/tmp/ltsmin11531738593352621657
[2024-05-25 15:15:42] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-25 15:15:42] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:15:42] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-25 15:15:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:15:42] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-25 15:15:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:15:42] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11531738593352621657
Running compilation step : cd /tmp/ltsmin11531738593352621657;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 354 ms.
Running link step : cd /tmp/ltsmin11531738593352621657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin11531738593352621657;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12178563652217647783.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:15:57] [INFO ] Flatten gal took : 5 ms
[2024-05-25 15:15:57] [INFO ] Flatten gal took : 4 ms
[2024-05-25 15:15:57] [INFO ] Time to serialize gal into /tmp/LTL9853184414900207569.gal : 3 ms
[2024-05-25 15:15:57] [INFO ] Time to serialize properties into /tmp/LTL17361385296902592161.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9853184414900207569.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7403841169884119404.hoa' '-atoms' '/tmp/LTL17361385296902592161.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17361385296902592161.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7403841169884119404.hoa
Reverse transition relation is NOT exact ! Due to transitions t1147, t1148, t1149, t1150, t1151, t1152, t1153, t1154, t1155, t1156, t1157, Intersection wi...237
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2024-05-25 15:16:12] [INFO ] Flatten gal took : 4 ms
[2024-05-25 15:16:12] [INFO ] Flatten gal took : 4 ms
[2024-05-25 15:16:12] [INFO ] Time to serialize gal into /tmp/LTL14624663136978733247.gal : 2 ms
[2024-05-25 15:16:12] [INFO ] Time to serialize properties into /tmp/LTL36199836425447277.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14624663136978733247.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL36199836425447277.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F(("(((((l23_0+l23_1)+(l23_2+l23_3))+((l23_4+l23_5)+(l23_6+l23_7)))+((l23_8+l23_9)+l23_10))<=(((((m4_0_0+m4_1_0)+(m4_2_0+m4_3_0))+(...913
Formula 0 simplified : G(!"(((((l23_0+l23_1)+(l23_2+l23_3))+((l23_4+l23_5)+(l23_6+l23_7)))+((l23_8+l23_9)+l23_10))<=(((((m4_0_0+m4_1_0)+(m4_2_0+m4_3_0))+((...905
Reverse transition relation is NOT exact ! Due to transitions t1147, t1148, t1149, t1150, t1151, t1152, t1153, t1154, t1155, t1156, t1157, Intersection wi...237
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2024-05-25 15:16:27] [INFO ] Flatten gal took : 4 ms
[2024-05-25 15:16:27] [INFO ] Applying decomposition
[2024-05-25 15:16:27] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15919269523422482691.txt' '-o' '/tmp/graph15919269523422482691.bin' '-w' '/tmp/graph15919269523422482691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15919269523422482691.bin' '-l' '-1' '-v' '-w' '/tmp/graph15919269523422482691.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:16:27] [INFO ] Decomposing Gal with order
[2024-05-25 15:16:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:16:27] [INFO ] Removed a total of 8 redundant transitions.
[2024-05-25 15:16:27] [INFO ] Flatten gal took : 97 ms
[2024-05-25 15:16:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2024-05-25 15:16:27] [INFO ] Time to serialize gal into /tmp/LTL17778338603533194552.gal : 3 ms
[2024-05-25 15:16:27] [INFO ] Time to serialize properties into /tmp/LTL8340931978988632832.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17778338603533194552.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8340931978988632832.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("(((((gu15.l23_0+gu15.l23_1)+(gu15.l23_2+gu15.l23_3))+((gu15.l23_4+gu15.l23_5)+(gu15.l23_6+gu15.l23_7)))+((gu15.l23_8+gu15.l23_9...1408
Formula 0 simplified : G(!"(((((gu15.l23_0+gu15.l23_1)+(gu15.l23_2+gu15.l23_3))+((gu15.l23_4+gu15.l23_5)+(gu15.l23_6+gu15.l23_7)))+((gu15.l23_8+gu15.l23_9)...1400
Reverse transition relation is NOT exact ! Due to transitions gu15.t1147, gu15.t1148, gu15.t1149, gu15.t1150, gu15.t1151, gu15.t1152, gu15.t1153, gu15.t115...292
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1515647618418362067
[2024-05-25 15:16:42] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1515647618418362067
Running compilation step : cd /tmp/ltsmin1515647618418362067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 205 ms.
Running link step : cd /tmp/ltsmin1515647618418362067;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1515647618418362067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&X(((LTLAPp0==true)&&<>(!(LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04 finished in 110905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(((X(F(p1))&&G(!p0))||G(F(p1)))))))'
Support contains 33 out of 1200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1200/1200 places, 1158/1158 transitions.
Reduce places removed 24 places and 0 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 1132 transition count 1158
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 147 place count 1053 transition count 1058
Iterating global reduction 1 with 79 rules applied. Total rules applied 226 place count 1053 transition count 1058
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 236 place count 1053 transition count 1048
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 282 place count 1007 transition count 982
Iterating global reduction 2 with 46 rules applied. Total rules applied 328 place count 1007 transition count 982
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 341 place count 1006 transition count 970
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 374 place count 973 transition count 927
Iterating global reduction 3 with 33 rules applied. Total rules applied 407 place count 973 transition count 927
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 440 place count 940 transition count 874
Iterating global reduction 3 with 33 rules applied. Total rules applied 473 place count 940 transition count 874
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 484 place count 929 transition count 874
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 505 place count 908 transition count 853
Iterating global reduction 4 with 21 rules applied. Total rules applied 526 place count 908 transition count 853
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 547 place count 887 transition count 832
Iterating global reduction 4 with 21 rules applied. Total rules applied 568 place count 887 transition count 832
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 589 place count 866 transition count 811
Iterating global reduction 4 with 21 rules applied. Total rules applied 610 place count 866 transition count 811
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 631 place count 845 transition count 790
Iterating global reduction 4 with 21 rules applied. Total rules applied 652 place count 845 transition count 790
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 653 place count 844 transition count 790
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 674 place count 823 transition count 769
Iterating global reduction 5 with 21 rules applied. Total rules applied 695 place count 823 transition count 769
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 716 place count 802 transition count 748
Iterating global reduction 5 with 21 rules applied. Total rules applied 737 place count 802 transition count 748
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 748 place count 791 transition count 737
Iterating global reduction 5 with 11 rules applied. Total rules applied 759 place count 791 transition count 737
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 770 place count 780 transition count 726
Iterating global reduction 5 with 11 rules applied. Total rules applied 781 place count 780 transition count 726
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 792 place count 769 transition count 715
Iterating global reduction 5 with 11 rules applied. Total rules applied 803 place count 769 transition count 715
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 814 place count 758 transition count 704
Iterating global reduction 5 with 11 rules applied. Total rules applied 825 place count 758 transition count 704
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 836 place count 747 transition count 693
Iterating global reduction 5 with 11 rules applied. Total rules applied 847 place count 747 transition count 693
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 858 place count 736 transition count 682
Iterating global reduction 5 with 11 rules applied. Total rules applied 869 place count 736 transition count 682
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 5 with 17 rules applied. Total rules applied 886 place count 730 transition count 671
Applied a total of 886 rules in 532 ms. Remains 730 /1200 variables (removed 470) and now considering 671/1158 (removed 487) transitions.
// Phase 1: matrix 671 rows 730 cols
[2024-05-25 15:16:58] [INFO ] Computed 71 invariants in 6 ms
[2024-05-25 15:16:59] [INFO ] Implicit Places using invariants in 495 ms returned [143, 327, 486, 630]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 496 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 726/1200 places, 671/1158 transitions.
Applied a total of 0 rules in 25 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1053 ms. Remains : 726/1200 places, 671/1158 transitions.
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 (ADD s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527 s528 s529 s530 s531 s532 s533 s534 s535 s536 s537 s538)), p1:(GT 1 (ADD s55 s56 s57 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 322 reset in 394 ms.
Product exploration explored 100000 steps with 333 reset in 483 ms.
Computed a total of 726 stabilizing places and 671 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 726 transition count 671
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT 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 7 factoid took 138 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-05 finished in 2612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U (p1 U p2))))'
Support contains 66 out of 1200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1200/1200 places, 1158/1158 transitions.
Graph (complete) has 1663 edges and 1200 vertex of which 1074 are kept as prefixes of interest. Removing 126 places using SCC suffix rule.6 ms
Discarding 126 places :
Also discarding 133 output transitions
Drop transitions removed 133 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions removed 471 transitions
Trivial Post-agglo rules discarded 471 transitions
Performed 471 trivial Post agglomeration. Transition count delta: 471
Iterating post reduction 0 with 515 rules applied. Total rules applied 516 place count 1019 transition count 543
Reduce places removed 471 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 503 rules applied. Total rules applied 1019 place count 548 transition count 511
Reduce places removed 21 places and 0 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Iterating post reduction 2 with 76 rules applied. Total rules applied 1095 place count 527 transition count 456
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 3 with 55 rules applied. Total rules applied 1150 place count 472 transition count 456
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 131 Pre rules applied. Total rules applied 1150 place count 472 transition count 325
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 44 places
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 4 with 306 rules applied. Total rules applied 1456 place count 297 transition count 325
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 4 with 11 rules applied. Total rules applied 1467 place count 286 transition count 325
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1467 place count 286 transition count 314
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1489 place count 275 transition count 314
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1505 place count 259 transition count 268
Iterating global reduction 5 with 16 rules applied. Total rules applied 1521 place count 259 transition count 268
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 5 with 27 rules applied. Total rules applied 1548 place count 259 transition count 241
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1559 place count 248 transition count 241
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1559 place count 248 transition count 239
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1563 place count 246 transition count 239
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1570 place count 239 transition count 222
Iterating global reduction 7 with 7 rules applied. Total rules applied 1577 place count 239 transition count 222
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 7 rules applied. Total rules applied 1584 place count 238 transition count 216
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 7 Pre rules applied. Total rules applied 1584 place count 238 transition count 209
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1604 place count 225 transition count 209
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 1648 place count 203 transition count 187
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 8 with 11 rules applied. Total rules applied 1659 place count 192 transition count 176
Applied a total of 1659 rules in 78 ms. Remains 192 /1200 variables (removed 1008) and now considering 176/1158 (removed 982) transitions.
// Phase 1: matrix 176 rows 192 cols
[2024-05-25 15:17:00] [INFO ] Computed 27 invariants in 1 ms
[2024-05-25 15:17:00] [INFO ] Implicit Places using invariants in 192 ms returned [11, 90, 124, 169]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 194 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 188/1200 places, 176/1158 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 188 transition count 154
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 166 transition count 154
Applied a total of 44 rules in 9 ms. Remains 166 /188 variables (removed 22) and now considering 154/176 (removed 22) transitions.
// Phase 1: matrix 154 rows 166 cols
[2024-05-25 15:17:00] [INFO ] Computed 23 invariants in 1 ms
[2024-05-25 15:17:01] [INFO ] Implicit Places using invariants in 104 ms returned [11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 107 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 155/1200 places, 154/1158 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 395 ms. Remains : 155/1200 places, 154/1158 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (NOT p0), (NOT p2)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ (ADD s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143) 2), p1:(LEQ (ADD s22 s23 s24 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1546 reset in 584 ms.
Product exploration explored 100000 steps with 1560 reset in 244 ms.
Computed a total of 155 stabilizing places and 154 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 155 transition count 154
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p0)), (F (G p2)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 614 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-06 finished in 2098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1200/1200 places, 1158/1158 transitions.
Graph (complete) has 1663 edges and 1200 vertex of which 1113 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.4 ms
Discarding 87 places :
Also discarding 74 output transitions
Drop transitions removed 74 transitions
Reduce places removed 11 places and 11 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions removed 591 transitions
Trivial Post-agglo rules discarded 591 transitions
Performed 591 trivial Post agglomeration. Transition count delta: 591
Iterating post reduction 0 with 645 rules applied. Total rules applied 646 place count 1058 transition count 472
Reduce places removed 591 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 624 rules applied. Total rules applied 1270 place count 467 transition count 439
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1292 place count 445 transition count 439
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 1292 place count 445 transition count 288
Deduced a syphon composed of 151 places in 0 ms
Ensure Unique test removed 54 places
Reduce places removed 205 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 1648 place count 240 transition count 288
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 22 rules applied. Total rules applied 1670 place count 240 transition count 266
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1692 place count 218 transition count 266
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 1692 place count 218 transition count 256
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1712 place count 208 transition count 256
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1736 place count 184 transition count 212
Iterating global reduction 5 with 24 rules applied. Total rules applied 1760 place count 184 transition count 212
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 19 rules applied. Total rules applied 1779 place count 183 transition count 194
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 1782 place count 181 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1783 place count 180 transition count 193
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 1783 place count 180 transition count 181
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1807 place count 168 transition count 181
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1814 place count 161 transition count 164
Iterating global reduction 8 with 7 rules applied. Total rules applied 1821 place count 161 transition count 164
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 8 with 38 rules applied. Total rules applied 1859 place count 160 transition count 127
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 1879 place count 140 transition count 127
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 7 Pre rules applied. Total rules applied 1879 place count 140 transition count 120
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 1899 place count 127 transition count 120
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 10 with 49 rules applied. Total rules applied 1948 place count 102 transition count 96
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 10 with 11 rules applied. Total rules applied 1959 place count 91 transition count 85
Applied a total of 1959 rules in 81 ms. Remains 91 /1200 variables (removed 1109) and now considering 85/1158 (removed 1073) transitions.
// Phase 1: matrix 85 rows 91 cols
[2024-05-25 15:17:02] [INFO ] Computed 28 invariants in 1 ms
[2024-05-25 15:17:03] [INFO ] Implicit Places using invariants in 190 ms returned [0, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 71, 77]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 192 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/1200 places, 85/1158 transitions.
Reduce places removed 11 places and 11 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 55 transition count 64
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 45 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 44 transition count 63
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 22 place count 44 transition count 52
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 44 place count 33 transition count 52
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 53 place count 24 transition count 34
Iterating global reduction 3 with 9 rules applied. Total rules applied 62 place count 24 transition count 34
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 70 place count 16 transition count 18
Iterating global reduction 3 with 8 rules applied. Total rules applied 78 place count 16 transition count 18
Applied a total of 78 rules in 8 ms. Remains 16 /66 variables (removed 50) and now considering 18/85 (removed 67) transitions.
// Phase 1: matrix 18 rows 16 cols
[2024-05-25 15:17:03] [INFO ] Computed 3 invariants in 0 ms
[2024-05-25 15:17:03] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-25 15:17:03] [INFO ] Invariant cache hit.
[2024-05-25 15:17:03] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 89 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/1200 places, 18/1158 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 372 ms. Remains : 15/1200 places, 18/1158 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ s11 s9) (GT 3 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11463 reset in 178 ms.
Product exploration explored 100000 steps with 11429 reset in 200 ms.
Computed a total of 15 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 15 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-09 finished in 878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1200/1200 places, 1158/1158 transitions.
Graph (complete) has 1663 edges and 1200 vertex of which 1035 are kept as prefixes of interest. Removing 165 places using SCC suffix rule.4 ms
Discarding 165 places :
Also discarding 162 output transitions
Drop transitions removed 162 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 600 rules applied. Total rules applied 601 place count 980 transition count 429
Reduce places removed 556 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 589 rules applied. Total rules applied 1190 place count 424 transition count 396
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 24 rules applied. Total rules applied 1214 place count 402 transition count 394
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1216 place count 400 transition count 394
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 150 Pre rules applied. Total rules applied 1216 place count 400 transition count 244
Deduced a syphon composed of 150 places in 0 ms
Ensure Unique test removed 54 places
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 4 with 354 rules applied. Total rules applied 1570 place count 196 transition count 244
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 22 rules applied. Total rules applied 1592 place count 195 transition count 223
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1613 place count 174 transition count 223
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1613 place count 174 transition count 212
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1635 place count 163 transition count 212
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1651 place count 147 transition count 166
Iterating global reduction 6 with 16 rules applied. Total rules applied 1667 place count 147 transition count 166
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 19 rules applied. Total rules applied 1686 place count 146 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1688 place count 144 transition count 148
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 13 Pre rules applied. Total rules applied 1688 place count 144 transition count 135
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1714 place count 131 transition count 135
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1720 place count 125 transition count 119
Iterating global reduction 8 with 6 rules applied. Total rules applied 1726 place count 125 transition count 119
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 8 with 36 rules applied. Total rules applied 1762 place count 124 transition count 84
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 1782 place count 104 transition count 84
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 6 Pre rules applied. Total rules applied 1782 place count 104 transition count 78
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 17 rules applied. Total rules applied 1799 place count 93 transition count 78
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 10 with 27 rules applied. Total rules applied 1826 place count 79 transition count 65
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1836 place count 69 transition count 55
Applied a total of 1836 rules in 61 ms. Remains 69 /1200 variables (removed 1131) and now considering 55/1158 (removed 1103) transitions.
// Phase 1: matrix 55 rows 69 cols
[2024-05-25 15:17:03] [INFO ] Computed 16 invariants in 1 ms
[2024-05-25 15:17:03] [INFO ] Implicit Places using invariants in 119 ms returned [1, 4, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 54, 57]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 122 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/1200 places, 55/1158 transitions.
Reduce places removed 9 places and 9 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 45 transition count 32
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 31 transition count 32
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 28 place count 31 transition count 21
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 50 place count 20 transition count 21
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 59 place count 11 transition count 12
Iterating global reduction 2 with 9 rules applied. Total rules applied 68 place count 11 transition count 12
Applied a total of 68 rules in 4 ms. Remains 11 /54 variables (removed 43) and now considering 12/55 (removed 43) transitions.
// Phase 1: matrix 12 rows 11 cols
[2024-05-25 15:17:03] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 15:17:03] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-25 15:17:03] [INFO ] Invariant cache hit.
[2024-05-25 15:17:03] [INFO ] Implicit Places using invariants and state equation in 35 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/1200 places, 12/1158 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 256 ms. Remains : 10/1200 places, 12/1158 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ s4 s8) (LEQ 1 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-10 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 1200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1200/1200 places, 1158/1158 transitions.
Graph (complete) has 1663 edges and 1200 vertex of which 432 are kept as prefixes of interest. Removing 768 places using SCC suffix rule.4 ms
Discarding 768 places :
Also discarding 754 output transitions
Drop transitions removed 754 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions removed 293 transitions
Trivial Post-agglo rules discarded 293 transitions
Performed 293 trivial Post agglomeration. Transition count delta: 293
Iterating post reduction 0 with 337 rules applied. Total rules applied 338 place count 377 transition count 100
Reduce places removed 293 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 296 rules applied. Total rules applied 634 place count 84 transition count 97
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 637 place count 82 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 638 place count 81 transition count 96
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 638 place count 81 transition count 83
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 664 place count 68 transition count 83
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 684 place count 48 transition count 53
Iterating global reduction 4 with 20 rules applied. Total rules applied 704 place count 48 transition count 53
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 709 place count 48 transition count 48
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 709 place count 48 transition count 46
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 713 place count 46 transition count 46
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 726 place count 33 transition count 33
Iterating global reduction 5 with 13 rules applied. Total rules applied 739 place count 33 transition count 33
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 744 place count 33 transition count 28
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 744 place count 33 transition count 23
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 759 place count 23 transition count 23
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 766 place count 16 transition count 16
Iterating global reduction 6 with 7 rules applied. Total rules applied 773 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 775 place count 15 transition count 15
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 778 place count 12 transition count 12
Applied a total of 778 rules in 38 ms. Remains 12 /1200 variables (removed 1188) and now considering 12/1158 (removed 1146) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-05-25 15:17:04] [INFO ] Computed 2 invariants in 0 ms
[2024-05-25 15:17:04] [INFO ] Implicit Places using invariants in 38 ms returned [1, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/1200 places, 12/1158 transitions.
Graph (complete) has 8 edges and 10 vertex of which 8 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 removed 2 transitions
Applied a total of 1 rules in 2 ms. Remains 8 /10 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 8 cols
[2024-05-25 15:17:04] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 15:17:04] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-25 15:17:04] [INFO ] Invariant cache hit.
[2024-05-25 15:17:04] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/1200 places, 10/1158 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 135 ms. Remains : 8/1200 places, 10/1158 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 1 s2), p0:(LEQ s5 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14720 reset in 139 ms.
Product exploration explored 100000 steps with 14703 reset in 158 ms.
Computed a total of 8 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 10
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 23 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-11 finished in 625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p1||X((G(p2) U (p1&&G(p2)))))))))'
Support contains 6 out of 1200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1200/1200 places, 1158/1158 transitions.
Reduce places removed 23 places and 0 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 1133 transition count 1158
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 134 place count 1066 transition count 1070
Iterating global reduction 1 with 67 rules applied. Total rules applied 201 place count 1066 transition count 1070
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 211 place count 1066 transition count 1060
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 245 place count 1032 transition count 1006
Iterating global reduction 2 with 34 rules applied. Total rules applied 279 place count 1032 transition count 1006
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 12 rules applied. Total rules applied 291 place count 1031 transition count 995
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 323 place count 999 transition count 963
Iterating global reduction 3 with 32 rules applied. Total rules applied 355 place count 999 transition count 963
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 377 place count 977 transition count 921
Iterating global reduction 3 with 22 rules applied. Total rules applied 399 place count 977 transition count 921
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 410 place count 966 transition count 921
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 420 place count 956 transition count 911
Iterating global reduction 4 with 10 rules applied. Total rules applied 430 place count 956 transition count 911
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 440 place count 946 transition count 901
Iterating global reduction 4 with 10 rules applied. Total rules applied 450 place count 946 transition count 901
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 460 place count 936 transition count 891
Iterating global reduction 4 with 10 rules applied. Total rules applied 470 place count 936 transition count 891
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 480 place count 926 transition count 881
Iterating global reduction 4 with 10 rules applied. Total rules applied 490 place count 926 transition count 881
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 491 place count 925 transition count 881
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 501 place count 915 transition count 871
Iterating global reduction 5 with 10 rules applied. Total rules applied 511 place count 915 transition count 871
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 521 place count 905 transition count 861
Iterating global reduction 5 with 10 rules applied. Total rules applied 531 place count 905 transition count 861
Applied a total of 531 rules in 582 ms. Remains 905 /1200 variables (removed 295) and now considering 861/1158 (removed 297) transitions.
// Phase 1: matrix 861 rows 905 cols
[2024-05-25 15:17:05] [INFO ] Computed 77 invariants in 10 ms
[2024-05-25 15:17:05] [INFO ] Implicit Places using invariants in 592 ms returned [77, 78, 79, 80, 81, 82, 182, 661, 805]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 594 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 896/1200 places, 861/1158 transitions.
Applied a total of 0 rules in 44 ms. Remains 896 /896 variables (removed 0) and now considering 861/861 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1223 ms. Remains : 896/1200 places, 861/1158 transitions.
Stuttering acceptance computed with spot in 320 ms :[(NOT p2), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=5 dest: 0}, { cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p2:(LEQ s643 s56), p1:(LEQ s871 s629), p0:(LEQ s429 s585)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 896 ms.
Product exploration explored 100000 steps with 33333 reset in 918 ms.
Computed a total of 896 stabilizing places and 861 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 896 transition count 861
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p1)), true, (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 22 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-12 finished in 3841 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X(X(G(!p1))) U (p0&&X(X(G(!p1)))))))))'
Support contains 4 out of 1200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1200/1200 places, 1158/1158 transitions.
Reduce places removed 23 places and 0 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 1133 transition count 1158
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 145 place count 1055 transition count 1059
Iterating global reduction 1 with 78 rules applied. Total rules applied 223 place count 1055 transition count 1059
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 233 place count 1055 transition count 1049
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 277 place count 1011 transition count 985
Iterating global reduction 2 with 44 rules applied. Total rules applied 321 place count 1011 transition count 985
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 334 place count 1010 transition count 973
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 366 place count 978 transition count 931
Iterating global reduction 3 with 32 rules applied. Total rules applied 398 place count 978 transition count 931
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 430 place count 946 transition count 880
Iterating global reduction 3 with 32 rules applied. Total rules applied 462 place count 946 transition count 880
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 473 place count 935 transition count 880
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 493 place count 915 transition count 860
Iterating global reduction 4 with 20 rules applied. Total rules applied 513 place count 915 transition count 860
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 533 place count 895 transition count 840
Iterating global reduction 4 with 20 rules applied. Total rules applied 553 place count 895 transition count 840
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 573 place count 875 transition count 820
Iterating global reduction 4 with 20 rules applied. Total rules applied 593 place count 875 transition count 820
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 613 place count 855 transition count 800
Iterating global reduction 4 with 20 rules applied. Total rules applied 633 place count 855 transition count 800
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 652 place count 836 transition count 781
Iterating global reduction 4 with 19 rules applied. Total rules applied 671 place count 836 transition count 781
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 690 place count 817 transition count 762
Iterating global reduction 4 with 19 rules applied. Total rules applied 709 place count 817 transition count 762
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 720 place count 806 transition count 751
Iterating global reduction 4 with 11 rules applied. Total rules applied 731 place count 806 transition count 751
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 742 place count 795 transition count 740
Iterating global reduction 4 with 11 rules applied. Total rules applied 753 place count 795 transition count 740
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 763 place count 785 transition count 730
Iterating global reduction 4 with 10 rules applied. Total rules applied 773 place count 785 transition count 730
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 783 place count 775 transition count 720
Iterating global reduction 4 with 10 rules applied. Total rules applied 793 place count 775 transition count 720
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 803 place count 765 transition count 710
Iterating global reduction 4 with 10 rules applied. Total rules applied 813 place count 765 transition count 710
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 823 place count 755 transition count 700
Iterating global reduction 4 with 10 rules applied. Total rules applied 833 place count 755 transition count 700
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 4 with 15 rules applied. Total rules applied 848 place count 750 transition count 690
Applied a total of 848 rules in 749 ms. Remains 750 /1200 variables (removed 450) and now considering 690/1158 (removed 468) transitions.
// Phase 1: matrix 690 rows 750 cols
[2024-05-25 15:17:09] [INFO ] Computed 74 invariants in 7 ms
[2024-05-25 15:17:09] [INFO ] Implicit Places using invariants in 494 ms returned [77, 147, 305, 341, 650]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 495 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 745/1200 places, 690/1158 transitions.
Applied a total of 0 rules in 32 ms. Remains 745 /745 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1279 ms. Remains : 745/1200 places, 690/1158 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (NOT p0), (OR (NOT p0) p1), p1, p1, true]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s413 s502), p1:(LEQ s277 s168)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1152 ms.
Product exploration explored 100000 steps with 50000 reset in 867 ms.
Computed a total of 745 stabilizing places and 690 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 745 transition count 690
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 p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 21 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-14 finished in 3937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1)||!(p2 U p0)))'
Support contains 5 out of 1200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1200/1200 places, 1158/1158 transitions.
Graph (complete) has 1663 edges and 1200 vertex of which 772 are kept as prefixes of interest. Removing 428 places using SCC suffix rule.3 ms
Discarding 428 places :
Also discarding 408 output transitions
Drop transitions removed 408 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions removed 473 transitions
Trivial Post-agglo rules discarded 473 transitions
Performed 473 trivial Post agglomeration. Transition count delta: 473
Iterating post reduction 0 with 517 rules applied. Total rules applied 518 place count 717 transition count 266
Reduce places removed 473 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 506 rules applied. Total rules applied 1024 place count 244 transition count 233
Reduce places removed 22 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 25 rules applied. Total rules applied 1049 place count 222 transition count 230
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1052 place count 219 transition count 230
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 76 Pre rules applied. Total rules applied 1052 place count 219 transition count 154
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 1226 place count 121 transition count 154
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 21 rules applied. Total rules applied 1247 place count 121 transition count 133
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1268 place count 100 transition count 133
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 1290 place count 78 transition count 91
Iterating global reduction 6 with 22 rules applied. Total rules applied 1312 place count 78 transition count 91
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 26 rules applied. Total rules applied 1338 place count 77 transition count 66
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1349 place count 66 transition count 66
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 1349 place count 66 transition count 56
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1369 place count 56 transition count 56
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1379 place count 46 transition count 46
Iterating global reduction 8 with 10 rules applied. Total rules applied 1389 place count 46 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1393 place count 46 transition count 42
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 1393 place count 46 transition count 38
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 1405 place count 38 transition count 38
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1409 place count 34 transition count 34
Iterating global reduction 9 with 4 rules applied. Total rules applied 1413 place count 34 transition count 34
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 9 with 6 rules applied. Total rules applied 1419 place count 31 transition count 31
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1420 place count 30 transition count 30
Iterating global reduction 9 with 1 rules applied. Total rules applied 1421 place count 30 transition count 30
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1422 place count 29 transition count 29
Iterating global reduction 9 with 1 rules applied. Total rules applied 1423 place count 29 transition count 29
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1426 place count 26 transition count 26
Applied a total of 1426 rules in 50 ms. Remains 26 /1200 variables (removed 1174) and now considering 26/1158 (removed 1132) transitions.
// Phase 1: matrix 26 rows 26 cols
[2024-05-25 15:17:12] [INFO ] Computed 4 invariants in 0 ms
[2024-05-25 15:17:12] [INFO ] Implicit Places using invariants in 46 ms returned [3, 4, 18, 22]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 47 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/1200 places, 26/1158 transitions.
Graph (complete) has 24 edges and 22 vertex of which 17 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 16 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 14 transition count 18
Applied a total of 5 rules in 2 ms. Remains 14 /22 variables (removed 8) and now considering 18/26 (removed 8) transitions.
// Phase 1: matrix 18 rows 14 cols
[2024-05-25 15:17:12] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 15:17:12] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 15:17:12] [INFO ] Invariant cache hit.
[2024-05-25 15:17:12] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/1200 places, 18/1158 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 164 ms. Remains : 14/1200 places, 18/1158 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (AND p0 p1), p1, p0]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s6 s4), p1:(LEQ 1 s13), p2:(LEQ s8 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-15 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p0&&F(!p0))))))'
Found a Shortening insensitive property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04
Stuttering acceptance computed with spot in 152 ms :[p0, true, true]
Support contains 33 out of 1200 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1200/1200 places, 1158/1158 transitions.
Graph (complete) has 1663 edges and 1200 vertex of which 817 are kept as prefixes of interest. Removing 383 places using SCC suffix rule.4 ms
Discarding 383 places :
Also discarding 364 output transitions
Drop transitions removed 364 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 415 transitions
Trivial Post-agglo rules discarded 415 transitions
Performed 415 trivial Post agglomeration. Transition count delta: 415
Iterating post reduction 0 with 437 rules applied. Total rules applied 438 place count 784 transition count 368
Reduce places removed 415 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 448 rules applied. Total rules applied 886 place count 369 transition count 335
Reduce places removed 22 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 2 with 44 rules applied. Total rules applied 930 place count 347 transition count 313
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 952 place count 325 transition count 313
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 97 Pre rules applied. Total rules applied 952 place count 325 transition count 216
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 44 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 4 with 238 rules applied. Total rules applied 1190 place count 184 transition count 216
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 22 rules applied. Total rules applied 1212 place count 184 transition count 194
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1234 place count 162 transition count 194
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1248 place count 148 transition count 170
Iterating global reduction 6 with 14 rules applied. Total rules applied 1262 place count 148 transition count 170
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1263 place count 148 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1264 place count 147 transition count 169
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 13 Pre rules applied. Total rules applied 1264 place count 147 transition count 156
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1290 place count 134 transition count 156
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1291 place count 133 transition count 145
Iterating global reduction 8 with 1 rules applied. Total rules applied 1292 place count 133 transition count 145
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 8 with 22 rules applied. Total rules applied 1314 place count 132 transition count 124
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1324 place count 122 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1324 place count 122 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1326 place count 121 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 1329 place count 119 transition count 122
Applied a total of 1329 rules in 62 ms. Remains 119 /1200 variables (removed 1081) and now considering 122/1158 (removed 1036) transitions.
// Phase 1: matrix 122 rows 119 cols
[2024-05-25 15:17:13] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 15:17:13] [INFO ] Implicit Places using invariants in 135 ms returned [11, 12, 13, 14, 15, 16, 84, 85]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 136 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 111/1200 places, 122/1158 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 111 transition count 99
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 88 transition count 99
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 46 place count 88 transition count 88
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 68 place count 77 transition count 88
Applied a total of 68 rules in 4 ms. Remains 77 /111 variables (removed 34) and now considering 88/122 (removed 34) transitions.
// Phase 1: matrix 88 rows 77 cols
[2024-05-25 15:17:13] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 15:17:13] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-25 15:17:13] [INFO ] Invariant cache hit.
[2024-05-25 15:17:13] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 77/1200 places, 88/1158 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 331 ms. Remains : 77/1200 places, 88/1158 transitions.
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}]], initial=1, aps=[p0:(LEQ (ADD s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76) (ADD s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2997 reset in 351 ms.
Product exploration explored 100000 steps with 3010 reset in 377 ms.
Computed a total of 77 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[p0]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[p0]
Stuttering acceptance computed with spot in 49 ms :[p0]
[2024-05-25 15:17:14] [INFO ] Invariant cache hit.
[2024-05-25 15:17:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:17:14] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-25 15:17:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:17:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:17:15] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-25 15:17:15] [INFO ] Computed and/alt/rep : 66/77/66 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-25 15:17:15] [INFO ] Added : 22 causal constraints over 5 iterations in 122 ms. Result :sat
Could not prove EG p0
Support contains 33 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-25 15:17:15] [INFO ] Invariant cache hit.
[2024-05-25 15:17:15] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-25 15:17:15] [INFO ] Invariant cache hit.
[2024-05-25 15:17:15] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-05-25 15:17:15] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 15:17:15] [INFO ] Invariant cache hit.
[2024-05-25 15:17:15] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 287 ms. Remains : 77/77 places, 88/88 transitions.
Computed a total of 77 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 236 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[p0]
Finished random walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[p0]
Stuttering acceptance computed with spot in 52 ms :[p0]
[2024-05-25 15:17:16] [INFO ] Invariant cache hit.
[2024-05-25 15:17:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:17:16] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-25 15:17:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:17:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:17:16] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-25 15:17:16] [INFO ] Computed and/alt/rep : 66/77/66 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-25 15:17:16] [INFO ] Added : 22 causal constraints over 5 iterations in 76 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 49 ms :[p0]
Product exploration explored 100000 steps with 2993 reset in 342 ms.
Product exploration explored 100000 steps with 3001 reset in 346 ms.
Built C files in :
/tmp/ltsmin2601645808496428086
[2024-05-25 15:17:17] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-25 15:17:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:17:17] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-25 15:17:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:17:17] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-25 15:17:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:17:17] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2601645808496428086
Running compilation step : cd /tmp/ltsmin2601645808496428086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 385 ms.
Running link step : cd /tmp/ltsmin2601645808496428086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin2601645808496428086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17840213122990584917.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 33 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-25 15:17:32] [INFO ] Invariant cache hit.
[2024-05-25 15:17:32] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 15:17:32] [INFO ] Invariant cache hit.
[2024-05-25 15:17:32] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-25 15:17:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 15:17:32] [INFO ] Invariant cache hit.
[2024-05-25 15:17:32] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 77/77 places, 88/88 transitions.
Built C files in :
/tmp/ltsmin8753688703776233768
[2024-05-25 15:17:32] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-25 15:17:32] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:17:32] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-25 15:17:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:17:32] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-25 15:17:32] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:17:32] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8753688703776233768
Running compilation step : cd /tmp/ltsmin8753688703776233768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 365 ms.
Running link step : cd /tmp/ltsmin8753688703776233768;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin8753688703776233768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased303927878930301260.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:17:47] [INFO ] Flatten gal took : 4 ms
[2024-05-25 15:17:47] [INFO ] Flatten gal took : 3 ms
[2024-05-25 15:17:47] [INFO ] Time to serialize gal into /tmp/LTL12985634669335003797.gal : 1 ms
[2024-05-25 15:17:47] [INFO ] Time to serialize properties into /tmp/LTL4486402488551594121.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12985634669335003797.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8190588255546512846.hoa' '-atoms' '/tmp/LTL4486402488551594121.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4486402488551594121.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8190588255546512846.hoa
Reverse transition relation is NOT exact ! Due to transitions t1147, t1148, t1149, t1150, t1151, t1152, t1153, t1154, t1155, t1156, t1157, Intersection wi...237
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2024-05-25 15:18:03] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:18:03] [INFO ] Flatten gal took : 5 ms
[2024-05-25 15:18:03] [INFO ] Time to serialize gal into /tmp/LTL10233376351929799556.gal : 2 ms
[2024-05-25 15:18:03] [INFO ] Time to serialize properties into /tmp/LTL3279190416649558786.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10233376351929799556.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3279190416649558786.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("(((((l23_0+l23_1)+(l23_2+l23_3))+((l23_4+l23_5)+(l23_6+l23_7)))+((l23_8+l23_9)+l23_10))<=(((((m4_0_0+m4_1_0)+(m4_2_0+m4_3_0))+(...913
Formula 0 simplified : G(!"(((((l23_0+l23_1)+(l23_2+l23_3))+((l23_4+l23_5)+(l23_6+l23_7)))+((l23_8+l23_9)+l23_10))<=(((((m4_0_0+m4_1_0)+(m4_2_0+m4_3_0))+((...905
Reverse transition relation is NOT exact ! Due to transitions t1147, t1148, t1149, t1150, t1151, t1152, t1153, t1154, t1155, t1156, t1157, Intersection wi...237
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2024-05-25 15:18:18] [INFO ] Flatten gal took : 4 ms
[2024-05-25 15:18:18] [INFO ] Applying decomposition
[2024-05-25 15:18:18] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16260186698910176754.txt' '-o' '/tmp/graph16260186698910176754.bin' '-w' '/tmp/graph16260186698910176754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16260186698910176754.bin' '-l' '-1' '-v' '-w' '/tmp/graph16260186698910176754.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:18:18] [INFO ] Decomposing Gal with order
[2024-05-25 15:18:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:18:18] [INFO ] Removed a total of 7 redundant transitions.
[2024-05-25 15:18:18] [INFO ] Flatten gal took : 15 ms
[2024-05-25 15:18:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2024-05-25 15:18:18] [INFO ] Time to serialize gal into /tmp/LTL15053296943592351199.gal : 1 ms
[2024-05-25 15:18:18] [INFO ] Time to serialize properties into /tmp/LTL12926377144389262332.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15053296943592351199.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12926377144389262332.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("(((((gu12.l23_0+gu12.l23_1)+(gu12.l23_2+gu12.l23_3))+((gu12.l23_4+gu12.l23_5)+(gu12.l23_6+gu12.l23_7)))+((gu12.l23_8+gu12.l23_9...1408
Formula 0 simplified : G(!"(((((gu12.l23_0+gu12.l23_1)+(gu12.l23_2+gu12.l23_3))+((gu12.l23_4+gu12.l23_5)+(gu12.l23_6+gu12.l23_7)))+((gu12.l23_8+gu12.l23_9)...1400
Reverse transition relation is NOT exact ! Due to transitions gu12.t1147, gu12.t1148, gu12.t1149, gu12.t1150, gu12.t1151, gu12.t1152, gu12.t1153, gu12.t115...292
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6748229225529738433
[2024-05-25 15:18:33] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6748229225529738433
Running compilation step : cd /tmp/ltsmin6748229225529738433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 292 ms.
Running link step : cd /tmp/ltsmin6748229225529738433;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6748229225529738433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&X(((LTLAPp0==true)&&<>(!(LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04 finished in 95565 ms.
[2024-05-25 15:18:48] [INFO ] Flatten gal took : 114 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2840680373583819440
[2024-05-25 15:18:48] [INFO ] Computing symmetric may disable matrix : 1158 transitions.
[2024-05-25 15:18:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:18:48] [INFO ] Computing symmetric may enable matrix : 1158 transitions.
[2024-05-25 15:18:48] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:18:48] [INFO ] Applying decomposition
[2024-05-25 15:18:48] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16798530262439634556.txt' '-o' '/tmp/graph16798530262439634556.bin' '-w' '/tmp/graph16798530262439634556.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16798530262439634556.bin' '-l' '-1' '-v' '-w' '/tmp/graph16798530262439634556.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:18:48] [INFO ] Decomposing Gal with order
[2024-05-25 15:18:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:18:48] [INFO ] Computing Do-Not-Accords matrix : 1158 transitions.
[2024-05-25 15:18:48] [INFO ] Computation of Completed DNA matrix. took 70 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:18:48] [INFO ] Built C files in 454ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2840680373583819440
Running compilation step : cd /tmp/ltsmin2840680373583819440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 15:18:49] [INFO ] Removed a total of 308 redundant transitions.
[2024-05-25 15:18:49] [INFO ] Flatten gal took : 217 ms
[2024-05-25 15:18:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 43 ms.
[2024-05-25 15:18:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality2092988276227881725.gal : 30 ms
[2024-05-25 15:18:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality11809493094708894671.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2092988276227881725.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11809493094708894671.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(("(((((gu113.l23_0+gu113.l23_1)+(gu113.l23_2+gu113.l23_3))+((gu113.l23_4+gu113.l23_5)+(gu113.l23_6+gu113.l23_7)))+((gu113.l23_8+g...1507
Formula 0 simplified : G(!"(((((gu113.l23_0+gu113.l23_1)+(gu113.l23_2+gu113.l23_3))+((gu113.l23_4+gu113.l23_5)+(gu113.l23_6+gu113.l23_7)))+((gu113.l23_8+gu...1499
Compilation finished in 5650 ms.
Running link step : cd /tmp/ltsmin2840680373583819440;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin2840680373583819440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&X(((LTLAPp0==true)&&<>(!(LTLAPp0==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.234: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.234: LTL layer: formula: <>(((LTLAPp0==true)&&X(((LTLAPp0==true)&&<>(!(LTLAPp0==true))))))
pins2lts-mc-linux64( 6/ 8), 0.234: "<>(((LTLAPp0==true)&&X(((LTLAPp0==true)&&<>(!(LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.234: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.267: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.274: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.285: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.309: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.337: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.358: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.390: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.393: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.088: DFS-FIFO for weak LTL, using special progress label 1160
pins2lts-mc-linux64( 0/ 8), 1.089: There are 1161 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.089: State length is 1201, there are 1163 groups
pins2lts-mc-linux64( 0/ 8), 1.089: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.089: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.089: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.089: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 1.496: ~120 levels ~960 states ~11104 transitions
pins2lts-mc-linux64( 3/ 8), 1.764: ~240 levels ~1920 states ~22064 transitions
pins2lts-mc-linux64( 3/ 8), 2.216: ~442 levels ~3840 states ~41832 transitions
pins2lts-mc-linux64( 1/ 8), 2.536: ~464 levels ~7680 states ~46760 transitions
pins2lts-mc-linux64( 1/ 8), 3.117: ~464 levels ~15360 states ~56264 transitions
pins2lts-mc-linux64( 1/ 8), 4.352: ~464 levels ~30720 states ~75272 transitions
pins2lts-mc-linux64( 3/ 8), 6.753: ~464 levels ~61440 states ~113256 transitions
pins2lts-mc-linux64( 3/ 8), 11.484: ~464 levels ~122880 states ~196320 transitions
pins2lts-mc-linux64( 0/ 8), 20.655: ~463 levels ~245760 states ~368624 transitions
pins2lts-mc-linux64( 0/ 8), 38.526: ~463 levels ~491520 states ~730296 transitions
pins2lts-mc-linux64( 0/ 8), 72.465: ~463 levels ~983040 states ~1443592 transitions
pins2lts-mc-linux64( 0/ 8), 140.524: ~463 levels ~1966080 states ~2962856 transitions
pins2lts-mc-linux64( 0/ 8), 275.591: ~463 levels ~3932160 states ~6177816 transitions
pins2lts-mc-linux64( 0/ 8), 547.803: ~463 levels ~7864320 states ~12825872 transitions
pins2lts-mc-linux64( 7/ 8), 1096.779: ~464 levels ~15728640 states ~25951544 transitions
pins2lts-mc-linux64( 1/ 8), 1137.524: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1137.857:
pins2lts-mc-linux64( 0/ 8), 1137.857: mean standard work distribution: 0.7% (states) 2.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 1137.857:
pins2lts-mc-linux64( 0/ 8), 1137.857: Explored 16072034 states 26822365 transitions, fanout: 1.669
pins2lts-mc-linux64( 0/ 8), 1137.857: Total exploration time 1136.760 sec (1136.570 sec minimum, 1136.665 sec on average)
pins2lts-mc-linux64( 0/ 8), 1137.857: States per second: 14138, Transitions per second: 23595
pins2lts-mc-linux64( 0/ 8), 1137.857:
pins2lts-mc-linux64( 0/ 8), 1137.857: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 1137.857: Redundant explorations: -0.2355
pins2lts-mc-linux64( 0/ 8), 1137.857:
pins2lts-mc-linux64( 0/ 8), 1137.857: Queue width: 8B, total height: 3717, memory: 0.03MB
pins2lts-mc-linux64( 0/ 8), 1137.857: Tree memory: 378.9MB, 24.7 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 1137.857: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1137.857: Stored 1185 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1137.857: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1137.857: Est. total memory use: 378.9MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2840680373583819440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&X(((LTLAPp0==true)&&<>(!(LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2840680373583819440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&X(((LTLAPp0==true)&&<>(!(LTLAPp0==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-25 15:40:11] [INFO ] Flatten gal took : 69 ms
[2024-05-25 15:40:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality1194097337190619201.gal : 12 ms
[2024-05-25 15:40:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality13294569494703046747.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1194097337190619201.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13294569494703046747.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(("(((((l23_0+l23_1)+(l23_2+l23_3))+((l23_4+l23_5)+(l23_6+l23_7)))+((l23_8+l23_9)+l23_10))<=(((((m4_0_0+m4_1_0)+(m4_2_0+m4_3_0))+(...913
Formula 0 simplified : G(!"(((((l23_0+l23_1)+(l23_2+l23_3))+((l23_4+l23_5)+(l23_6+l23_7)))+((l23_8+l23_9)+l23_10))<=(((((m4_0_0+m4_1_0)+(m4_2_0+m4_3_0))+((...905
Detected timeout of ITS tools.
[2024-05-25 16:01:38] [INFO ] Flatten gal took : 1004 ms
[2024-05-25 16:01:41] [INFO ] Input system was already deterministic with 1158 transitions.
[2024-05-25 16:01:42] [INFO ] Transformed 1200 places.
[2024-05-25 16:01:42] [INFO ] Transformed 1158 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 16:02:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality9024128362988178710.gal : 8 ms
[2024-05-25 16:02:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality5189483216430841585.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9024128362988178710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5189483216430841585.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("(((((l23_0+l23_1)+(l23_2+l23_3))+((l23_4+l23_5)+(l23_6+l23_7)))+((l23_8+l23_9)+l23_10))<=(((((m4_0_0+m4_1_0)+(m4_2_0+m4_3_0))+(...913
Formula 0 simplified : G(!"(((((l23_0+l23_1)+(l23_2+l23_3))+((l23_4+l23_5)+(l23_6+l23_7)))+((l23_8+l23_9)+l23_10))<=(((((m4_0_0+m4_1_0)+(m4_2_0+m4_3_0))+((...905
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 2134436 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15848720 kB

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-PT-L00010M0001C001P001G001"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is FamilyReunion-PT-L00010M0001C001P001G001, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-smll-171636280400302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00010M0001C001P001G001.tgz
mv FamilyReunion-PT-L00010M0001C001P001G001 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;