Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.6M
-rw-r--r-- 1 mcc users 113K Feb 26 12:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 682K Feb 26 12:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 26 12:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 726K Feb 26 12:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 32K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 81K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 238K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 197K Feb 26 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Feb 26 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 297K Feb 26 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 994K Feb 26 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.7M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679487416832

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00050M0005C002P002G001
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-22 12:16:58] [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]
[2023-03-22 12:16:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 12:16:58] [INFO ] Load time of PNML (sax parser for PT used): 275 ms
[2023-03-22 12:16:58] [INFO ] Transformed 12194 places.
[2023-03-22 12:16:58] [INFO ] Transformed 10560 transitions.
[2023-03-22 12:16:58] [INFO ] Parsed PT model containing 12194 places and 10560 transitions and 32238 arcs in 383 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 132 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 17 places and 0 transitions.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1347 out of 12177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Reduce places removed 170 places and 0 transitions.
Discarding 1833 places :
Implicit places reduction removed 1833 places
Iterating post reduction 0 with 2003 rules applied. Total rules applied 2003 place count 10174 transition count 10560
Discarding 914 places :
Symmetric choice reduction at 1 with 914 rule applications. Total rules 2917 place count 9260 transition count 9646
Iterating global reduction 1 with 914 rules applied. Total rules applied 3831 place count 9260 transition count 9646
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 3882 place count 9209 transition count 9646
Discarding 203 places :
Symmetric choice reduction at 2 with 203 rule applications. Total rules 4085 place count 9006 transition count 9443
Iterating global reduction 2 with 203 rules applied. Total rules applied 4288 place count 9006 transition count 9443
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 4339 place count 9006 transition count 9392
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 4341 place count 9004 transition count 9290
Iterating global reduction 3 with 2 rules applied. Total rules applied 4343 place count 9004 transition count 9290
Discarding 102 places :
Symmetric choice reduction at 3 with 102 rule applications. Total rules 4445 place count 8902 transition count 9188
Iterating global reduction 3 with 102 rules applied. Total rules applied 4547 place count 8902 transition count 9188
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 153 rules applied. Total rules applied 4700 place count 8851 transition count 9086
Applied a total of 4700 rules in 7958 ms. Remains 8851 /12177 variables (removed 3326) and now considering 9086/10560 (removed 1474) transitions.
// Phase 1: matrix 9086 rows 8851 cols
[2023-03-22 12:17:07] [INFO ] Computed 724 place invariants in 305 ms
[2023-03-22 12:17:08] [INFO ] Implicit Places using invariants in 1206 ms returned []
[2023-03-22 12:17:08] [INFO ] Invariant cache hit.
[2023-03-22 12:17:09] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1966 ms to find 0 implicit places.
[2023-03-22 12:17:09] [INFO ] Invariant cache hit.
[2023-03-22 12:17:09] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8851/12177 places, 9086/10560 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10694 ms. Remains : 8851/12177 places, 9086/10560 transitions.
Support contains 1347 out of 8851 places after structural reductions.
[2023-03-22 12:17:10] [INFO ] Flatten gal took : 373 ms
[2023-03-22 12:17:10] [INFO ] Flatten gal took : 250 ms
[2023-03-22 12:17:11] [INFO ] Input system was already deterministic with 9086 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 19) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 12:17:11] [INFO ] Invariant cache hit.
[2023-03-22 12:17:13] [INFO ] After 1621ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 12:17:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-22 12:17:15] [INFO ] [Nat]Absence check using 1 positive and 723 generalized place invariants in 324 ms returned sat
[2023-03-22 12:17:27] [INFO ] After 11667ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :2
[2023-03-22 12:17:28] [INFO ] After 12774ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :2
Attempting to minimize the solution found.
Minimization took 603 ms.
[2023-03-22 12:17:29] [INFO ] After 15956ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :2
Fused 7 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1019 steps, including 0 resets, run visited all 2 properties in 31 ms. (steps per millisecond=32 )
Parikh walk visited 2 properties in 42 ms.
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8851 stabilizing places and 9086 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8851 transition count 9086
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 408 out of 8851 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8851/8851 places, 9086/9086 transitions.
Graph (complete) has 12352 edges and 8851 vertex of which 7050 are kept as prefixes of interest. Removing 1801 places using SCC suffix rule.37 ms
Discarding 1801 places :
Also discarding 1739 output transitions
Drop transitions removed 1739 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 4333 transitions
Trivial Post-agglo rules discarded 4333 transitions
Performed 4333 trivial Post agglomeration. Transition count delta: 4333
Iterating post reduction 0 with 4336 rules applied. Total rules applied 4337 place count 6996 transition count 2963
Reduce places removed 4333 places and 0 transitions.
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Iterating post reduction 1 with 4435 rules applied. Total rules applied 8772 place count 2663 transition count 2861
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 2 with 255 rules applied. Total rules applied 9027 place count 2510 transition count 2759
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 9078 place count 2459 transition count 2759
Performed 411 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 411 Pre rules applied. Total rules applied 9078 place count 2459 transition count 2348
Deduced a syphon composed of 411 places in 2 ms
Ensure Unique test removed 153 places
Reduce places removed 564 places and 0 transitions.
Iterating global reduction 4 with 975 rules applied. Total rules applied 10053 place count 1895 transition count 2348
Discarding 359 places :
Symmetric choice reduction at 4 with 359 rule applications. Total rules 10412 place count 1536 transition count 1989
Iterating global reduction 4 with 359 rules applied. Total rules applied 10771 place count 1536 transition count 1989
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 4 with 102 rules applied. Total rules applied 10873 place count 1536 transition count 1887
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 102 Pre rules applied. Total rules applied 10873 place count 1536 transition count 1785
Deduced a syphon composed of 102 places in 2 ms
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 5 with 255 rules applied. Total rules applied 11128 place count 1383 transition count 1785
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 11133 place count 1378 transition count 1530
Iterating global reduction 5 with 5 rules applied. Total rules applied 11138 place count 1378 transition count 1530
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 5 with 51 rules applied. Total rules applied 11189 place count 1327 transition count 1530
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 51 Pre rules applied. Total rules applied 11189 place count 1327 transition count 1479
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 11291 place count 1276 transition count 1479
Applied a total of 11291 rules in 525 ms. Remains 1276 /8851 variables (removed 7575) and now considering 1479/9086 (removed 7607) transitions.
// Phase 1: matrix 1479 rows 1276 cols
[2023-03-22 12:17:30] [INFO ] Computed 52 place invariants in 9 ms
[2023-03-22 12:17:30] [INFO ] Implicit Places using invariants in 404 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 1071]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 408 ms to find 52 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1224/8851 places, 1479/9086 transitions.
Drop transitions removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 1224 transition count 1173
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 1 with 306 rules applied. Total rules applied 612 place count 918 transition count 1173
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 612 place count 918 transition count 1122
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 714 place count 867 transition count 1122
Applied a total of 714 rules in 55 ms. Remains 867 /1224 variables (removed 357) and now considering 1122/1479 (removed 357) transitions.
// Phase 1: matrix 1122 rows 867 cols
[2023-03-22 12:17:30] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-22 12:17:30] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-22 12:17:30] [INFO ] Invariant cache hit.
[2023-03-22 12:17:31] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 867/8851 places, 1122/9086 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1409 ms. Remains : 867/8851 places, 1122/9086 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 1 (ADD s816 s817 s818 s819 s820 s821 s822 s823 s824 s825 s826 s827 s828 s829 s830 s831 s832 s833 s834 s835 s836 s837 s838 s839 s840 s841 s842 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 307 reset in 840 ms.
Product exploration explored 100000 steps with 299 reset in 787 ms.
Computed a total of 867 stabilizing places and 1122 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 867 transition count 1122
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-00 finished in 4240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 408 out of 8851 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8851/8851 places, 9086/9086 transitions.
Reduce places removed 3 places and 0 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 8845 transition count 9086
Discarding 365 places :
Symmetric choice reduction at 1 with 365 rule applications. Total rules 371 place count 8480 transition count 8570
Iterating global reduction 1 with 365 rules applied. Total rules applied 736 place count 8480 transition count 8570
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 153 rules applied. Total rules applied 889 place count 8378 transition count 8519
Discarding 358 places :
Symmetric choice reduction at 2 with 358 rule applications. Total rules 1247 place count 8020 transition count 8111
Iterating global reduction 2 with 358 rules applied. Total rules applied 1605 place count 8020 transition count 8111
Discarding 408 places :
Symmetric choice reduction at 2 with 408 rule applications. Total rules 2013 place count 7612 transition count 7703
Iterating global reduction 2 with 408 rules applied. Total rules applied 2421 place count 7612 transition count 7703
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2427 place count 7606 transition count 7397
Iterating global reduction 2 with 6 rules applied. Total rules applied 2433 place count 7606 transition count 7397
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 2 with 102 rules applied. Total rules applied 2535 place count 7504 transition count 7397
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 2790 place count 7249 transition count 7142
Iterating global reduction 3 with 255 rules applied. Total rules applied 3045 place count 7249 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3300 place count 6994 transition count 6887
Iterating global reduction 3 with 255 rules applied. Total rules applied 3555 place count 6994 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3810 place count 6739 transition count 6632
Iterating global reduction 3 with 255 rules applied. Total rules applied 4065 place count 6739 transition count 6632
Applied a total of 4065 rules in 11854 ms. Remains 6739 /8851 variables (removed 2112) and now considering 6632/9086 (removed 2454) transitions.
// Phase 1: matrix 6632 rows 6739 cols
[2023-03-22 12:17:46] [INFO ] Computed 515 place invariants in 152 ms
[2023-03-22 12:17:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 12:17:47] [INFO ] Implicit Places using invariants in 1738 ms returned [359, 5314, 5343]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1743 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6736/8851 places, 6632/9086 transitions.
Applied a total of 0 rules in 1201 ms. Remains 6736 /6736 variables (removed 0) and now considering 6632/6632 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14801 ms. Remains : 6736/8851 places, 6632/9086 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(GT (ADD s3774 s3775 s3776 s3777 s3778 s3779 s3780 s3781 s3782 s3783 s3784 s3785 s3786 s3787 s3788 s3789 s3790 s3791 s3792 s3793 s3794 s3795 s3796 s379...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 20836 reset in 2357 ms.
Product exploration explored 100000 steps with 20726 reset in 2345 ms.
Computed a total of 6736 stabilizing places and 6632 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6736 transition count 6632
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 258 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 286 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 6632 rows 6736 cols
[2023-03-22 12:17:56] [INFO ] Computed 512 place invariants in 130 ms
[2023-03-22 12:18:07] [INFO ] [Real]Absence check using 0 positive and 512 generalized place invariants in 762 ms returned sat
[2023-03-22 12:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:11] [INFO ] [Real]Absence check using state equation in 4235 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 408 out of 6736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6736/6736 places, 6632/6632 transitions.
Applied a total of 0 rules in 1116 ms. Remains 6736 /6736 variables (removed 0) and now considering 6632/6632 (removed 0) transitions.
[2023-03-22 12:18:12] [INFO ] Invariant cache hit.
[2023-03-22 12:18:13] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 12:18:14] [INFO ] Implicit Places using invariants in 1620 ms returned []
[2023-03-22 12:18:14] [INFO ] Invariant cache hit.
[2023-03-22 12:18:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 12:18:16] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 3234 ms to find 0 implicit places.
[2023-03-22 12:18:16] [INFO ] Invariant cache hit.
[2023-03-22 12:18:16] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 12:18:20] [INFO ] Dead Transitions using invariants and state equation in 4400 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8754 ms. Remains : 6736/6736 places, 6632/6632 transitions.
Computed a total of 6736 stabilizing places and 6632 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6736 transition count 6632
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 293 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 282 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-22 12:18:23] [INFO ] Invariant cache hit.
[2023-03-22 12:18:33] [INFO ] [Real]Absence check using 0 positive and 512 generalized place invariants in 739 ms returned sat
[2023-03-22 12:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:18:38] [INFO ] [Real]Absence check using state equation in 4269 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 20693 reset in 2324 ms.
Product exploration explored 100000 steps with 20739 reset in 2367 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 408 out of 6736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6736/6736 places, 6632/6632 transitions.
Graph (complete) has 8456 edges and 6736 vertex of which 5252 are kept as prefixes of interest. Removing 1484 places using SCC suffix rule.8 ms
Discarding 1484 places :
Also discarding 1277 output transitions
Drop transitions removed 1277 transitions
Performed 1836 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1836 rules applied. Total rules applied 1837 place count 5252 transition count 5355
Performed 1638 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1638 Pre rules applied. Total rules applied 1837 place count 5252 transition count 5508
Deduced a syphon composed of 3474 places in 2 ms
Iterating global reduction 1 with 1638 rules applied. Total rules applied 3475 place count 5252 transition count 5508
Discarding 1797 places :
Symmetric choice reduction at 1 with 1797 rule applications. Total rules 5272 place count 3455 transition count 3711
Deduced a syphon composed of 1677 places in 2 ms
Iterating global reduction 1 with 1797 rules applied. Total rules applied 7069 place count 3455 transition count 3711
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1830 places in 1 ms
Iterating global reduction 1 with 153 rules applied. Total rules applied 7222 place count 3455 transition count 3711
Discarding 204 places :
Symmetric choice reduction at 1 with 204 rule applications. Total rules 7426 place count 3251 transition count 3507
Deduced a syphon composed of 1626 places in 1 ms
Iterating global reduction 1 with 204 rules applied. Total rules applied 7630 place count 3251 transition count 3507
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -306
Deduced a syphon composed of 1677 places in 1 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 7681 place count 3251 transition count 3813
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7683 place count 3249 transition count 3807
Deduced a syphon composed of 1675 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7685 place count 3249 transition count 3807
Deduced a syphon composed of 1675 places in 1 ms
Applied a total of 7685 rules in 1625 ms. Remains 3249 /6736 variables (removed 3487) and now considering 3807/6632 (removed 2825) transitions.
[2023-03-22 12:18:45] [INFO ] Redundant transitions in 298 ms returned []
// Phase 1: matrix 3807 rows 3249 cols
[2023-03-22 12:18:45] [INFO ] Computed 254 place invariants in 56 ms
[2023-03-22 12:18:47] [INFO ] Dead Transitions using invariants and state equation in 1827 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3249/6736 places, 3807/6632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3767 ms. Remains : 3249/6736 places, 3807/6632 transitions.
Built C files in :
/tmp/ltsmin15347000012779072364
[2023-03-22 12:18:47] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15347000012779072364
Running compilation step : cd /tmp/ltsmin15347000012779072364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15347000012779072364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15347000012779072364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 408 out of 6736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6736/6736 places, 6632/6632 transitions.
Applied a total of 0 rules in 1125 ms. Remains 6736 /6736 variables (removed 0) and now considering 6632/6632 (removed 0) transitions.
// Phase 1: matrix 6632 rows 6736 cols
[2023-03-22 12:18:51] [INFO ] Computed 512 place invariants in 105 ms
[2023-03-22 12:18:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 12:18:53] [INFO ] Implicit Places using invariants in 1718 ms returned [403, 5336]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1723 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6734/6736 places, 6632/6632 transitions.
Applied a total of 0 rules in 1136 ms. Remains 6734 /6734 variables (removed 0) and now considering 6632/6632 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3984 ms. Remains : 6734/6736 places, 6632/6632 transitions.
Built C files in :
/tmp/ltsmin8506418311909278130
[2023-03-22 12:18:54] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8506418311909278130
Running compilation step : cd /tmp/ltsmin8506418311909278130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8506418311909278130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8506418311909278130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-22 12:18:57] [INFO ] Flatten gal took : 146 ms
[2023-03-22 12:18:57] [INFO ] Flatten gal took : 148 ms
[2023-03-22 12:18:58] [INFO ] Time to serialize gal into /tmp/LTL6350596780510873454.gal : 37 ms
[2023-03-22 12:18:58] [INFO ] Time to serialize properties into /tmp/LTL3589570672649466609.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6350596780510873454.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6176828560482315066.hoa' '-atoms' '/tmp/LTL3589570672649466609.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3589570672649466609.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6176828560482315066.hoa
Detected timeout of ITS tools.
[2023-03-22 12:19:13] [INFO ] Flatten gal took : 143 ms
[2023-03-22 12:19:13] [INFO ] Flatten gal took : 141 ms
[2023-03-22 12:19:13] [INFO ] Time to serialize gal into /tmp/LTL6472938628522635240.gal : 23 ms
[2023-03-22 12:19:13] [INFO ] Time to serialize properties into /tmp/LTL8816249963143589264.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6472938628522635240.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8816249963143589264.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(((((((lm0_0+lm0_1)+(lm0_2+lm0_3))+((lm0_4+lm0_5)+(lm0_6+lm0_7)))+(((lm0_8+lm0_9)+(lm0_10+lm0_11))+((lm0_12+lm0_13)+(lm0_14...4251
Formula 0 simplified : XXG(!"(((((((lm0_0+lm0_1)+(lm0_2+lm0_3))+((lm0_4+lm0_5)+(lm0_6+lm0_7)))+(((lm0_8+lm0_9)+(lm0_10+lm0_11))+((lm0_12+lm0_13)+(lm0_14+lm...4241
Detected timeout of ITS tools.
[2023-03-22 12:19:28] [INFO ] Flatten gal took : 124 ms
[2023-03-22 12:19:28] [INFO ] Applying decomposition
[2023-03-22 12:19:29] [INFO ] Flatten gal took : 130 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12419729544429248989.txt' '-o' '/tmp/graph12419729544429248989.bin' '-w' '/tmp/graph12419729544429248989.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12419729544429248989.bin' '-l' '-1' '-v' '-w' '/tmp/graph12419729544429248989.weights' '-q' '0' '-e' '0.001'
[2023-03-22 12:19:29] [INFO ] Decomposing Gal with order
[2023-03-22 12:19:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 12:19:32] [INFO ] Removed a total of 1349 redundant transitions.
[2023-03-22 12:19:32] [INFO ] Flatten gal took : 839 ms
[2023-03-22 12:19:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 327 labels/synchronizations in 80 ms.
[2023-03-22 12:19:34] [INFO ] Time to serialize gal into /tmp/LTL8420590583989865153.gal : 58 ms
[2023-03-22 12:19:34] [INFO ] Time to serialize properties into /tmp/LTL4737927873168901976.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8420590583989865153.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4737927873168901976.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(((((((gi0.gi1.gi8.gi49.gi0.gu157.lm0_0+gi0.gi1.gi8.gi49.gi0.gu157.lm0_1)+(gi0.gi1.gi8.gi49.gi0.gu157.lm0_2+gi0.gi1.gi8.gi4...8127
Formula 0 simplified : XXG(!"(((((((gi0.gi1.gi8.gi49.gi0.gu157.lm0_0+gi0.gi1.gi8.gi49.gi0.gu157.lm0_1)+(gi0.gi1.gi8.gi49.gi0.gu157.lm0_2+gi0.gi1.gi8.gi49.g...8117
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11358567299478238196
[2023-03-22 12:19:49] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11358567299478238196
Running compilation step : cd /tmp/ltsmin11358567299478238196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11358567299478238196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11358567299478238196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-01 finished in 138601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))||(p1&&F(p0))))))'
Support contains 105 out of 8851 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8851/8851 places, 9086/9086 transitions.
Reduce places removed 3 places and 0 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 8845 transition count 9086
Discarding 362 places :
Symmetric choice reduction at 1 with 362 rule applications. Total rules 368 place count 8483 transition count 8573
Iterating global reduction 1 with 362 rules applied. Total rules applied 730 place count 8483 transition count 8573
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 153 rules applied. Total rules applied 883 place count 8381 transition count 8522
Discarding 358 places :
Symmetric choice reduction at 2 with 358 rule applications. Total rules 1241 place count 8023 transition count 8114
Iterating global reduction 2 with 358 rules applied. Total rules applied 1599 place count 8023 transition count 8114
Discarding 306 places :
Symmetric choice reduction at 2 with 306 rule applications. Total rules 1905 place count 7717 transition count 7808
Iterating global reduction 2 with 306 rules applied. Total rules applied 2211 place count 7717 transition count 7808
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2217 place count 7711 transition count 7502
Iterating global reduction 2 with 6 rules applied. Total rules applied 2223 place count 7711 transition count 7502
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 2 with 102 rules applied. Total rules applied 2325 place count 7609 transition count 7502
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 2580 place count 7354 transition count 7247
Iterating global reduction 3 with 255 rules applied. Total rules applied 2835 place count 7354 transition count 7247
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3090 place count 7099 transition count 6992
Iterating global reduction 3 with 255 rules applied. Total rules applied 3345 place count 7099 transition count 6992
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3600 place count 6844 transition count 6737
Iterating global reduction 3 with 255 rules applied. Total rules applied 3855 place count 6844 transition count 6737
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4110 place count 6589 transition count 6482
Iterating global reduction 3 with 255 rules applied. Total rules applied 4365 place count 6589 transition count 6482
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4620 place count 6334 transition count 6227
Iterating global reduction 3 with 255 rules applied. Total rules applied 4875 place count 6334 transition count 6227
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5130 place count 6079 transition count 5972
Iterating global reduction 3 with 255 rules applied. Total rules applied 5385 place count 6079 transition count 5972
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5640 place count 5824 transition count 5717
Iterating global reduction 3 with 255 rules applied. Total rules applied 5895 place count 5824 transition count 5717
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6150 place count 5569 transition count 5462
Iterating global reduction 3 with 255 rules applied. Total rules applied 6405 place count 5569 transition count 5462
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6660 place count 5314 transition count 5207
Iterating global reduction 3 with 255 rules applied. Total rules applied 6915 place count 5314 transition count 5207
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7170 place count 5059 transition count 4952
Iterating global reduction 3 with 255 rules applied. Total rules applied 7425 place count 5059 transition count 4952
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7680 place count 4804 transition count 4697
Iterating global reduction 3 with 255 rules applied. Total rules applied 7935 place count 4804 transition count 4697
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8190 place count 4549 transition count 4442
Iterating global reduction 3 with 255 rules applied. Total rules applied 8445 place count 4549 transition count 4442
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8700 place count 4294 transition count 4187
Iterating global reduction 3 with 255 rules applied. Total rules applied 8955 place count 4294 transition count 4187
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 306 rules applied. Total rules applied 9261 place count 4243 transition count 3932
Applied a total of 9261 rules in 20579 ms. Remains 4243 /8851 variables (removed 4608) and now considering 3932/9086 (removed 5154) transitions.
// Phase 1: matrix 3932 rows 4243 cols
[2023-03-22 12:20:13] [INFO ] Computed 464 place invariants in 48 ms
[2023-03-22 12:20:14] [INFO ] Implicit Places using invariants in 1046 ms returned [1723]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1049 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4242/8851 places, 3932/9086 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4241 transition count 3931
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4241 transition count 3931
Applied a total of 2 rules in 917 ms. Remains 4241 /4242 variables (removed 1) and now considering 3931/3932 (removed 1) transitions.
// Phase 1: matrix 3931 rows 4241 cols
[2023-03-22 12:20:15] [INFO ] Computed 463 place invariants in 45 ms
[2023-03-22 12:20:16] [INFO ] Implicit Places using invariants in 996 ms returned [2749]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 998 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4240/8851 places, 3931/9086 transitions.
Applied a total of 0 rules in 456 ms. Remains 4240 /4240 variables (removed 0) and now considering 3931/3931 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 24001 ms. Remains : 4240/8851 places, 3931/9086 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT (ADD s4087 s4088 s4089 s4090 s4091 s4092 s4093 s4094 s4095 s4096 s4097 s4098 s4099 s4100 s4101 s4102 s4103 s4104 s4105 s4106 s4107 s4108 s4109 s411...], 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 69 reset in 542 ms.
Product exploration explored 100000 steps with 69 reset in 624 ms.
Computed a total of 4240 stabilizing places and 3931 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4240 transition count 3931
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 242 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1612 steps, including 0 resets, run visited all 2 properties in 25 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 7 factoid took 335 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 3931 rows 4240 cols
[2023-03-22 12:20:20] [INFO ] Computed 462 place invariants in 40 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-03 finished in 30923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 357 out of 8851 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8851/8851 places, 9086/9086 transitions.
Reduce places removed 3 places and 0 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 8845 transition count 9086
Discarding 110 places :
Symmetric choice reduction at 1 with 110 rule applications. Total rules 116 place count 8735 transition count 8825
Iterating global reduction 1 with 110 rules applied. Total rules applied 226 place count 8735 transition count 8825
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 153 rules applied. Total rules applied 379 place count 8633 transition count 8774
Discarding 103 places :
Symmetric choice reduction at 2 with 103 rule applications. Total rules 482 place count 8530 transition count 8621
Iterating global reduction 2 with 103 rules applied. Total rules applied 585 place count 8530 transition count 8621
Discarding 153 places :
Symmetric choice reduction at 2 with 153 rule applications. Total rules 738 place count 8377 transition count 8468
Iterating global reduction 2 with 153 rules applied. Total rules applied 891 place count 8377 transition count 8468
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 892 place count 8376 transition count 8417
Iterating global reduction 2 with 1 rules applied. Total rules applied 893 place count 8376 transition count 8417
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 944 place count 8325 transition count 8417
Applied a total of 944 rules in 9495 ms. Remains 8325 /8851 variables (removed 526) and now considering 8417/9086 (removed 669) transitions.
// Phase 1: matrix 8417 rows 8325 cols
[2023-03-22 12:20:33] [INFO ] Computed 566 place invariants in 126 ms
[2023-03-22 12:20:33] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 12:20:33] [INFO ] Implicit Places using invariants in 896 ms returned []
[2023-03-22 12:20:34] [INFO ] Invariant cache hit.
[2023-03-22 12:20:34] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 12:20:35] [INFO ] Implicit Places using invariants and state equation in 1968 ms returned [384, 4801, 4814, 4827]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 2871 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8321/8851 places, 8417/9086 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 8316 transition count 8412
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 8316 transition count 8412
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 8314 transition count 8408
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 8314 transition count 8408
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 8312 transition count 8406
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 8312 transition count 8406
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 8310 transition count 8404
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 8310 transition count 8404
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 8308 transition count 8402
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 8308 transition count 8402
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 8306 transition count 8400
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 8306 transition count 8400
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 8304 transition count 8398
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 8304 transition count 8398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 8302 transition count 8396
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 8302 transition count 8396
Applied a total of 38 rules in 18387 ms. Remains 8302 /8321 variables (removed 19) and now considering 8396/8417 (removed 21) transitions.
// Phase 1: matrix 8396 rows 8302 cols
[2023-03-22 12:20:54] [INFO ] Computed 562 place invariants in 130 ms
[2023-03-22 12:20:55] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 12:20:56] [INFO ] Implicit Places using invariants in 2045 ms returned [377, 5509]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2051 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 8300/8851 places, 8396/9086 transitions.
Applied a total of 0 rules in 2035 ms. Remains 8300 /8300 variables (removed 0) and now considering 8396/8396 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 34842 ms. Remains : 8300/8851 places, 8396/9086 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s6259 s6260 s6261 s6262 s6263 s6264 s6265 s6266 s6267 s6268 s6269 s6270 s6271 s6272 s6273 s6274 s6275 s6276 s6277 s6278 s6279 s6280 s6281 s628...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-04 finished in 34966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(X(X(X(G(p1))))))))))'
Support contains 153 out of 8851 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8851/8851 places, 9086/9086 transitions.
Reduce places removed 3 places and 0 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 8845 transition count 9086
Discarding 365 places :
Symmetric choice reduction at 1 with 365 rule applications. Total rules 371 place count 8480 transition count 8570
Iterating global reduction 1 with 365 rules applied. Total rules applied 736 place count 8480 transition count 8570
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 153 rules applied. Total rules applied 889 place count 8378 transition count 8519
Discarding 358 places :
Symmetric choice reduction at 2 with 358 rule applications. Total rules 1247 place count 8020 transition count 8111
Iterating global reduction 2 with 358 rules applied. Total rules applied 1605 place count 8020 transition count 8111
Discarding 408 places :
Symmetric choice reduction at 2 with 408 rule applications. Total rules 2013 place count 7612 transition count 7703
Iterating global reduction 2 with 408 rules applied. Total rules applied 2421 place count 7612 transition count 7703
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2427 place count 7606 transition count 7397
Iterating global reduction 2 with 6 rules applied. Total rules applied 2433 place count 7606 transition count 7397
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 2 with 102 rules applied. Total rules applied 2535 place count 7504 transition count 7397
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 2790 place count 7249 transition count 7142
Iterating global reduction 3 with 255 rules applied. Total rules applied 3045 place count 7249 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3300 place count 6994 transition count 6887
Iterating global reduction 3 with 255 rules applied. Total rules applied 3555 place count 6994 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3810 place count 6739 transition count 6632
Iterating global reduction 3 with 255 rules applied. Total rules applied 4065 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4320 place count 6484 transition count 6377
Iterating global reduction 3 with 255 rules applied. Total rules applied 4575 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4830 place count 6229 transition count 6122
Iterating global reduction 3 with 255 rules applied. Total rules applied 5085 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5340 place count 5974 transition count 5867
Iterating global reduction 3 with 255 rules applied. Total rules applied 5595 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5850 place count 5719 transition count 5612
Iterating global reduction 3 with 255 rules applied. Total rules applied 6105 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6360 place count 5464 transition count 5357
Iterating global reduction 3 with 255 rules applied. Total rules applied 6615 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6870 place count 5209 transition count 5102
Iterating global reduction 3 with 255 rules applied. Total rules applied 7125 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7380 place count 4954 transition count 4847
Iterating global reduction 3 with 255 rules applied. Total rules applied 7635 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7890 place count 4699 transition count 4592
Iterating global reduction 3 with 255 rules applied. Total rules applied 8145 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8400 place count 4444 transition count 4337
Iterating global reduction 3 with 255 rules applied. Total rules applied 8655 place count 4444 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8910 place count 4189 transition count 4082
Iterating global reduction 3 with 255 rules applied. Total rules applied 9165 place count 4189 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 306 rules applied. Total rules applied 9471 place count 4138 transition count 3827
Applied a total of 9471 rules in 19949 ms. Remains 4138 /8851 variables (removed 4713) and now considering 3827/9086 (removed 5259) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2023-03-22 12:21:18] [INFO ] Computed 464 place invariants in 46 ms
[2023-03-22 12:21:19] [INFO ] Implicit Places using invariants in 954 ms returned [1723, 2751]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 959 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4136/8851 places, 3827/9086 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4135 transition count 3826
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4135 transition count 3826
Applied a total of 2 rules in 855 ms. Remains 4135 /4136 variables (removed 1) and now considering 3826/3827 (removed 1) transitions.
// Phase 1: matrix 3826 rows 4135 cols
[2023-03-22 12:21:20] [INFO ] Computed 462 place invariants in 47 ms
[2023-03-22 12:21:21] [INFO ] Implicit Places using invariants in 936 ms returned [2744, 2751]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 938 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4133/8851 places, 3826/9086 transitions.
Applied a total of 0 rules in 411 ms. Remains 4133 /4133 variables (removed 0) and now considering 3826/3826 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 23114 ms. Remains : 4133/8851 places, 3826/9086 transitions.
Stuttering acceptance computed with spot in 309 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 5}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 6}]], initial=2, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-05 finished in 23458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 7 out of 8851 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8851/8851 places, 9086/9086 transitions.
Reduce places removed 1 places and 0 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 8847 transition count 9086
Discarding 312 places :
Symmetric choice reduction at 1 with 312 rule applications. Total rules 316 place count 8535 transition count 8774
Iterating global reduction 1 with 312 rules applied. Total rules applied 628 place count 8535 transition count 8774
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 102 rules applied. Total rules applied 730 place count 8484 transition count 8723
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 985 place count 8229 transition count 8468
Iterating global reduction 2 with 255 rules applied. Total rules applied 1240 place count 8229 transition count 8468
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 1495 place count 7974 transition count 8213
Iterating global reduction 2 with 255 rules applied. Total rules applied 1750 place count 7974 transition count 8213
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1755 place count 7969 transition count 7958
Iterating global reduction 2 with 5 rules applied. Total rules applied 1760 place count 7969 transition count 7958
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 1811 place count 7918 transition count 7958
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 2066 place count 7663 transition count 7703
Iterating global reduction 3 with 255 rules applied. Total rules applied 2321 place count 7663 transition count 7703
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 2576 place count 7408 transition count 7448
Iterating global reduction 3 with 255 rules applied. Total rules applied 2831 place count 7408 transition count 7448
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3086 place count 7153 transition count 7193
Iterating global reduction 3 with 255 rules applied. Total rules applied 3341 place count 7153 transition count 7193
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3596 place count 6898 transition count 6938
Iterating global reduction 3 with 255 rules applied. Total rules applied 3851 place count 6898 transition count 6938
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4106 place count 6643 transition count 6683
Iterating global reduction 3 with 255 rules applied. Total rules applied 4361 place count 6643 transition count 6683
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4616 place count 6388 transition count 6428
Iterating global reduction 3 with 255 rules applied. Total rules applied 4871 place count 6388 transition count 6428
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5126 place count 6133 transition count 6173
Iterating global reduction 3 with 255 rules applied. Total rules applied 5381 place count 6133 transition count 6173
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5636 place count 5878 transition count 5918
Iterating global reduction 3 with 255 rules applied. Total rules applied 5891 place count 5878 transition count 5918
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6146 place count 5623 transition count 5663
Iterating global reduction 3 with 255 rules applied. Total rules applied 6401 place count 5623 transition count 5663
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6656 place count 5368 transition count 5408
Iterating global reduction 3 with 255 rules applied. Total rules applied 6911 place count 5368 transition count 5408
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7166 place count 5113 transition count 5153
Iterating global reduction 3 with 255 rules applied. Total rules applied 7421 place count 5113 transition count 5153
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7676 place count 4858 transition count 4898
Iterating global reduction 3 with 255 rules applied. Total rules applied 7931 place count 4858 transition count 4898
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8186 place count 4603 transition count 4643
Iterating global reduction 3 with 255 rules applied. Total rules applied 8441 place count 4603 transition count 4643
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 306 rules applied. Total rules applied 8747 place count 4552 transition count 4388
Applied a total of 8747 rules in 22450 ms. Remains 4552 /8851 variables (removed 4299) and now considering 4388/9086 (removed 4698) transitions.
// Phase 1: matrix 4388 rows 4552 cols
[2023-03-22 12:21:44] [INFO ] Computed 568 place invariants in 61 ms
[2023-03-22 12:21:45] [INFO ] Implicit Places using invariants in 1140 ms returned []
[2023-03-22 12:21:45] [INFO ] Invariant cache hit.
[2023-03-22 12:21:46] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 2239 ms to find 0 implicit places.
[2023-03-22 12:21:46] [INFO ] Invariant cache hit.
[2023-03-22 12:21:49] [INFO ] Dead Transitions using invariants and state equation in 2446 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4552/8851 places, 4388/9086 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27137 ms. Remains : 4552/8851 places, 4388/9086 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GT (ADD s2097 s2098) (ADD s1686 s1687)), p0:(AND (GT (ADD s2097 s2098) (ADD s1686 s1687)) (GT 3 (ADD s4039 s4040 s4041)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-06 finished in 27285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 8851 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8851/8851 places, 9086/9086 transitions.
Graph (complete) has 12352 edges and 8851 vertex of which 4400 are kept as prefixes of interest. Removing 4451 places using SCC suffix rule.7 ms
Discarding 4451 places :
Also discarding 4239 output transitions
Drop transitions removed 4239 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 3798 transitions
Trivial Post-agglo rules discarded 3798 transitions
Performed 3798 trivial Post agglomeration. Transition count delta: 3798
Iterating post reduction 0 with 3801 rules applied. Total rules applied 3802 place count 4346 transition count 998
Reduce places removed 3798 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 3802 rules applied. Total rules applied 7604 place count 547 transition count 995
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7606 place count 545 transition count 995
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 7606 place count 545 transition count 937
Deduced a syphon composed of 58 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 119 rules applied. Total rules applied 7725 place count 484 transition count 937
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 7781 place count 428 transition count 641
Iterating global reduction 3 with 56 rules applied. Total rules applied 7837 place count 428 transition count 641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 7839 place count 428 transition count 639
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7840 place count 427 transition count 639
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 7846 place count 421 transition count 623
Iterating global reduction 5 with 6 rules applied. Total rules applied 7852 place count 421 transition count 623
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 7854 place count 420 transition count 622
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7855 place count 419 transition count 622
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 7855 place count 419 transition count 620
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 7859 place count 417 transition count 620
Discarding 256 places :
Symmetric choice reduction at 7 with 256 rule applications. Total rules 8115 place count 161 transition count 364
Iterating global reduction 7 with 256 rules applied. Total rules applied 8371 place count 161 transition count 364
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 7 with 255 rules applied. Total rules applied 8626 place count 161 transition count 109
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 51 Pre rules applied. Total rules applied 8626 place count 161 transition count 58
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 8 with 153 rules applied. Total rules applied 8779 place count 59 transition count 58
Discarding 49 places :
Symmetric choice reduction at 8 with 49 rule applications. Total rules 8828 place count 10 transition count 9
Iterating global reduction 8 with 49 rules applied. Total rules applied 8877 place count 10 transition count 9
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 8 with 2 rules applied. Total rules applied 8879 place count 9 transition count 8
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 8881 place count 7 transition count 6
Applied a total of 8881 rules in 99 ms. Remains 7 /8851 variables (removed 8844) and now considering 6/9086 (removed 9080) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-22 12:21:49] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 12:21:49] [INFO ] Implicit Places using invariants in 22 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/8851 places, 6/9086 transitions.
Graph (complete) has 3 edges and 5 vertex of which 3 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 1 ms. Remains 3 /5 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 3 cols
[2023-03-22 12:21:49] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-22 12:21:49] [INFO ] Implicit Places using invariants in 12 ms returned []
[2023-03-22 12:21:49] [INFO ] Invariant cache hit.
[2023-03-22 12:21:49] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/8851 places, 4/9086 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 155 ms. Remains : 3/8851 places, 4/9086 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 2 reset in 0 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-11 finished in 207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 8851 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8851/8851 places, 9086/9086 transitions.
Graph (complete) has 12352 edges and 8851 vertex of which 7156 are kept as prefixes of interest. Removing 1695 places using SCC suffix rule.9 ms
Discarding 1695 places :
Also discarding 1535 output transitions
Drop transitions removed 1535 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5147 transitions
Trivial Post-agglo rules discarded 5147 transitions
Performed 5147 trivial Post agglomeration. Transition count delta: 5147
Iterating post reduction 0 with 5150 rules applied. Total rules applied 5151 place count 7102 transition count 2353
Reduce places removed 5147 places and 0 transitions.
Iterating post reduction 1 with 5147 rules applied. Total rules applied 10298 place count 1955 transition count 2353
Performed 359 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 359 Pre rules applied. Total rules applied 10298 place count 1955 transition count 1994
Deduced a syphon composed of 359 places in 1 ms
Ensure Unique test removed 153 places
Reduce places removed 512 places and 0 transitions.
Iterating global reduction 2 with 871 rules applied. Total rules applied 11169 place count 1443 transition count 1994
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 2 with 153 rules applied. Total rules applied 11322 place count 1443 transition count 1841
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 3 with 153 rules applied. Total rules applied 11475 place count 1290 transition count 1841
Discarding 260 places :
Symmetric choice reduction at 4 with 260 rule applications. Total rules 11735 place count 1030 transition count 1481
Iterating global reduction 4 with 260 rules applied. Total rules applied 11995 place count 1030 transition count 1481
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 4 with 157 rules applied. Total rules applied 12152 place count 1028 transition count 1326
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 5 with 53 rules applied. Total rules applied 12205 place count 975 transition count 1326
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 12205 place count 975 transition count 1325
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 12207 place count 974 transition count 1325
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 12212 place count 969 transition count 1070
Iterating global reduction 6 with 5 rules applied. Total rules applied 12217 place count 969 transition count 1070
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 6 with 102 rules applied. Total rules applied 12319 place count 918 transition count 1019
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 7 with 51 rules applied. Total rules applied 12370 place count 867 transition count 1019
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 51 Pre rules applied. Total rules applied 12370 place count 867 transition count 968
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 12472 place count 816 transition count 968
Discarding 255 places :
Symmetric choice reduction at 8 with 255 rule applications. Total rules 12727 place count 561 transition count 713
Iterating global reduction 8 with 255 rules applied. Total rules applied 12982 place count 561 transition count 713
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 8 with 255 rules applied. Total rules applied 13237 place count 561 transition count 458
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 51 Pre rules applied. Total rules applied 13237 place count 561 transition count 407
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 9 with 153 rules applied. Total rules applied 13390 place count 459 transition count 407
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 49 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 9 with 249 rules applied. Total rules applied 13639 place count 310 transition count 307
Discarding 49 places :
Symmetric choice reduction at 9 with 49 rule applications. Total rules 13688 place count 261 transition count 258
Iterating global reduction 9 with 49 rules applied. Total rules applied 13737 place count 261 transition count 258
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 9 with 51 rules applied. Total rules applied 13788 place count 210 transition count 207
Applied a total of 13788 rules in 238 ms. Remains 210 /8851 variables (removed 8641) and now considering 207/9086 (removed 8879) transitions.
// Phase 1: matrix 207 rows 210 cols
[2023-03-22 12:21:49] [INFO ] Computed 53 place invariants in 1 ms
[2023-03-22 12:21:49] [INFO ] Implicit Places using invariants in 110 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 206]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 112 ms to find 53 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/8851 places, 207/9086 transitions.
Graph (complete) has 256 edges and 157 vertex of which 106 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.0 ms
Discarding 51 places :
Also discarding 51 output transitions
Drop transitions removed 51 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 106 transition count 155
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 155
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 52 place count 56 transition count 106
Iterating global reduction 0 with 49 rules applied. Total rules applied 101 place count 56 transition count 106
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 150 place count 7 transition count 8
Iterating global reduction 0 with 49 rules applied. Total rules applied 199 place count 7 transition count 8
Applied a total of 199 rules in 3 ms. Remains 7 /157 variables (removed 150) and now considering 8/207 (removed 199) transitions.
// Phase 1: matrix 8 rows 7 cols
[2023-03-22 12:21:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-22 12:21:49] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 12:21:49] [INFO ] Invariant cache hit.
[2023-03-22 12:21:49] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/8851 places, 8/9086 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 389 ms. Remains : 7/8851 places, 8/9086 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-12 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 (GT 1 s4) (GT 2 s6))], 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 77 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-12 finished in 435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(!p0))))))'
Support contains 2 out of 8851 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8851/8851 places, 9086/9086 transitions.
Reduce places removed 3 places and 0 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 8845 transition count 9086
Discarding 365 places :
Symmetric choice reduction at 1 with 365 rule applications. Total rules 371 place count 8480 transition count 8570
Iterating global reduction 1 with 365 rules applied. Total rules applied 736 place count 8480 transition count 8570
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 153 rules applied. Total rules applied 889 place count 8378 transition count 8519
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 1246 place count 8021 transition count 8112
Iterating global reduction 2 with 357 rules applied. Total rules applied 1603 place count 8021 transition count 8112
Discarding 407 places :
Symmetric choice reduction at 2 with 407 rule applications. Total rules 2010 place count 7614 transition count 7705
Iterating global reduction 2 with 407 rules applied. Total rules applied 2417 place count 7614 transition count 7705
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2422 place count 7609 transition count 7450
Iterating global reduction 2 with 5 rules applied. Total rules applied 2427 place count 7609 transition count 7450
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 2478 place count 7558 transition count 7450
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 2682 place count 7354 transition count 7246
Iterating global reduction 3 with 204 rules applied. Total rules applied 2886 place count 7354 transition count 7246
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 3090 place count 7150 transition count 7042
Iterating global reduction 3 with 204 rules applied. Total rules applied 3294 place count 7150 transition count 7042
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 3498 place count 6946 transition count 6838
Iterating global reduction 3 with 204 rules applied. Total rules applied 3702 place count 6946 transition count 6838
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 3906 place count 6742 transition count 6634
Iterating global reduction 3 with 204 rules applied. Total rules applied 4110 place count 6742 transition count 6634
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 4314 place count 6538 transition count 6430
Iterating global reduction 3 with 204 rules applied. Total rules applied 4518 place count 6538 transition count 6430
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 4722 place count 6334 transition count 6226
Iterating global reduction 3 with 204 rules applied. Total rules applied 4926 place count 6334 transition count 6226
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 5130 place count 6130 transition count 6022
Iterating global reduction 3 with 204 rules applied. Total rules applied 5334 place count 6130 transition count 6022
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 5538 place count 5926 transition count 5818
Iterating global reduction 3 with 204 rules applied. Total rules applied 5742 place count 5926 transition count 5818
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 5946 place count 5722 transition count 5614
Iterating global reduction 3 with 204 rules applied. Total rules applied 6150 place count 5722 transition count 5614
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 6354 place count 5518 transition count 5410
Iterating global reduction 3 with 204 rules applied. Total rules applied 6558 place count 5518 transition count 5410
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 6762 place count 5314 transition count 5206
Iterating global reduction 3 with 204 rules applied. Total rules applied 6966 place count 5314 transition count 5206
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 7170 place count 5110 transition count 5002
Iterating global reduction 3 with 204 rules applied. Total rules applied 7374 place count 5110 transition count 5002
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 7578 place count 4906 transition count 4798
Iterating global reduction 3 with 204 rules applied. Total rules applied 7782 place count 4906 transition count 4798
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 3 with 204 rules applied. Total rules applied 7986 place count 4906 transition count 4594
Applied a total of 7986 rules in 23301 ms. Remains 4906 /8851 variables (removed 3945) and now considering 4594/9086 (removed 4492) transitions.
// Phase 1: matrix 4594 rows 4906 cols
[2023-03-22 12:22:13] [INFO ] Computed 566 place invariants in 65 ms
[2023-03-22 12:22:13] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 12:22:14] [INFO ] Implicit Places using invariants in 1319 ms returned [360, 3526]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1324 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4904/8851 places, 4594/9086 transitions.
Applied a total of 0 rules in 633 ms. Remains 4904 /4904 variables (removed 0) and now considering 4594/4594 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25259 ms. Remains : 4904/8851 places, 4594/9086 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, true, p0]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s3089 s4709)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2925 steps with 0 reset in 20 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-13 finished in 25407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Found a Shortening insensitive property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-01
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 408 out of 8851 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 8851/8851 places, 9086/9086 transitions.
Graph (complete) has 12352 edges and 8851 vertex of which 7155 are kept as prefixes of interest. Removing 1696 places using SCC suffix rule.21 ms
Discarding 1696 places :
Also discarding 1535 output transitions
Drop transitions removed 1535 transitions
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 3925 transitions
Trivial Post-agglo rules discarded 3925 transitions
Performed 3925 trivial Post agglomeration. Transition count delta: 3925
Iterating post reduction 0 with 3928 rules applied. Total rules applied 3929 place count 7152 transition count 3626
Reduce places removed 3925 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 1 with 4129 rules applied. Total rules applied 8058 place count 3176 transition count 3473
Reduce places removed 102 places and 0 transitions.
Performed 612 Post agglomeration using F-continuation condition.Transition count delta: 612
Iterating post reduction 2 with 714 rules applied. Total rules applied 8772 place count 3074 transition count 2861
Reduce places removed 612 places and 0 transitions.
Iterating post reduction 3 with 612 rules applied. Total rules applied 9384 place count 2462 transition count 2861
Performed 358 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 358 Pre rules applied. Total rules applied 9384 place count 2462 transition count 2503
Deduced a syphon composed of 358 places in 1 ms
Ensure Unique test removed 153 places
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 4 with 869 rules applied. Total rules applied 10253 place count 1951 transition count 2503
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 4 with 153 rules applied. Total rules applied 10406 place count 1951 transition count 2350
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 5 with 153 rules applied. Total rules applied 10559 place count 1798 transition count 2350
Discarding 260 places :
Symmetric choice reduction at 6 with 260 rule applications. Total rules 10819 place count 1538 transition count 1990
Iterating global reduction 6 with 260 rules applied. Total rules applied 11079 place count 1538 transition count 1990
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 6 with 255 rules applied. Total rules applied 11334 place count 1487 transition count 1786
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 7 with 102 rules applied. Total rules applied 11436 place count 1385 transition count 1786
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 11436 place count 1385 transition count 1785
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 11438 place count 1384 transition count 1785
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 11443 place count 1379 transition count 1530
Iterating global reduction 8 with 5 rules applied. Total rules applied 11448 place count 1379 transition count 1530
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 8 with 102 rules applied. Total rules applied 11550 place count 1328 transition count 1479
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 9 with 51 rules applied. Total rules applied 11601 place count 1277 transition count 1479
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 51 Pre rules applied. Total rules applied 11601 place count 1277 transition count 1428
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 10 with 102 rules applied. Total rules applied 11703 place count 1226 transition count 1428
Applied a total of 11703 rules in 361 ms. Remains 1226 /8851 variables (removed 7625) and now considering 1428/9086 (removed 7658) transitions.
// Phase 1: matrix 1428 rows 1226 cols
[2023-03-22 12:22:15] [INFO ] Computed 53 place invariants in 12 ms
[2023-03-22 12:22:16] [INFO ] Implicit Places using invariants in 365 ms returned [102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 1122, 1123]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 368 ms to find 53 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1173/8851 places, 1428/9086 transitions.
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 1173 transition count 1122
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 1 with 306 rules applied. Total rules applied 612 place count 867 transition count 1122
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 612 place count 867 transition count 1071
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 714 place count 816 transition count 1071
Applied a total of 714 rules in 40 ms. Remains 816 /1173 variables (removed 357) and now considering 1071/1428 (removed 357) transitions.
// Phase 1: matrix 1071 rows 816 cols
[2023-03-22 12:22:16] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-22 12:22:16] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-22 12:22:16] [INFO ] Invariant cache hit.
[2023-03-22 12:22:16] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 816/8851 places, 1071/9086 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1158 ms. Remains : 816/8851 places, 1071/9086 transitions.
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(GT (ADD s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s430 s431 s432 s433 s434 s435 s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 20708 reset in 1056 ms.
Product exploration explored 100000 steps with 20743 reset in 1058 ms.
Computed a total of 816 stabilizing places and 1071 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 816 transition count 1071
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 163 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 38 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 247 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-22 12:22:19] [INFO ] Invariant cache hit.
[2023-03-22 12:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:22:22] [INFO ] [Real]Absence check using state equation in 639 ms returned sat
[2023-03-22 12:22:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:22:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:22:24] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2023-03-22 12:22:24] [INFO ] Computed and/alt/rep : 1020/1275/1020 causal constraints (skipped 0 transitions) in 52 ms.
[2023-03-22 12:22:25] [INFO ] Added : 51 causal constraints over 11 iterations in 638 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 408 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 1071/1071 transitions.
Applied a total of 0 rules in 7 ms. Remains 816 /816 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
[2023-03-22 12:22:25] [INFO ] Invariant cache hit.
[2023-03-22 12:22:25] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-22 12:22:25] [INFO ] Invariant cache hit.
[2023-03-22 12:22:25] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-22 12:22:25] [INFO ] Invariant cache hit.
[2023-03-22 12:22:25] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 737 ms. Remains : 816/816 places, 1071/1071 transitions.
Computed a total of 816 stabilizing places and 1071 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 816 transition count 1071
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 246 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 82 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 278 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-22 12:22:26] [INFO ] Invariant cache hit.
[2023-03-22 12:22:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 12:22:29] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2023-03-22 12:22:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 12:22:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 12:22:31] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2023-03-22 12:22:31] [INFO ] Computed and/alt/rep : 1020/1275/1020 causal constraints (skipped 0 transitions) in 49 ms.
[2023-03-22 12:22:32] [INFO ] Added : 51 causal constraints over 11 iterations in 608 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 20652 reset in 1039 ms.
Product exploration explored 100000 steps with 20687 reset in 1054 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 408 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 1071/1071 transitions.
Applied a total of 0 rules in 17 ms. Remains 816 /816 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
[2023-03-22 12:22:34] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-22 12:22:34] [INFO ] Invariant cache hit.
[2023-03-22 12:22:34] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 366 ms. Remains : 816/816 places, 1071/1071 transitions.
Built C files in :
/tmp/ltsmin12189738628092408459
[2023-03-22 12:22:34] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12189738628092408459
Running compilation step : cd /tmp/ltsmin12189738628092408459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1531 ms.
Running link step : cd /tmp/ltsmin12189738628092408459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin12189738628092408459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2943858786259017882.hoa' '--buchi-type=spotba'
LTSmin run took 862 ms.
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-01 finished in 22028 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-22 12:22:37] [INFO ] Flatten gal took : 247 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5199494812836152845
[2023-03-22 12:22:37] [INFO ] Too many transitions (9086) to apply POR reductions. Disabling POR matrices.
[2023-03-22 12:22:37] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5199494812836152845
Running compilation step : cd /tmp/ltsmin5199494812836152845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-22 12:22:37] [INFO ] Applying decomposition
[2023-03-22 12:22:38] [INFO ] Flatten gal took : 181 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17354180478104217275.txt' '-o' '/tmp/graph17354180478104217275.bin' '-w' '/tmp/graph17354180478104217275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17354180478104217275.bin' '-l' '-1' '-v' '-w' '/tmp/graph17354180478104217275.weights' '-q' '0' '-e' '0.001'
[2023-03-22 12:22:38] [INFO ] Decomposing Gal with order
[2023-03-22 12:22:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 12:22:43] [INFO ] Removed a total of 3230 redundant transitions.
[2023-03-22 12:22:43] [INFO ] Flatten gal took : 669 ms
[2023-03-22 12:22:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 212 labels/synchronizations in 76 ms.
[2023-03-22 12:22:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality17519786738637042627.gal : 135 ms
[2023-03-22 12:22:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality10231195521182519481.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17519786738637042627.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10231195521182519481.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(((((((gi0.gu139.lm0_0+gi0.gu139.lm0_1)+(gi0.gu139.lm0_2+gi0.gu139.lm0_3))+((gi0.gu139.lm0_4+gi0.gu139.lm0_5)+(gi0.gu139.lm...7260
Formula 0 simplified : XXG(!"(((((((gi0.gu139.lm0_0+gi0.gu139.lm0_1)+(gi0.gu139.lm0_2+gi0.gu139.lm0_3))+((gi0.gu139.lm0_4+gi0.gu139.lm0_5)+(gi0.gu139.lm0_6...7250
Compilation finished in 52031 ms.
Running link step : cd /tmp/ltsmin5199494812836152845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin5199494812836152845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((LTLAPp0==true)||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
LTSmin run took 97881 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 489664 ms.

BK_STOP 1679487912359

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-L00050M0005C002P002G001"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is FamilyReunion-PT-L00050M0005C002P002G001, 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 r165-tall-167838850400411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00050M0005C002P002G001.tgz
mv FamilyReunion-PT-L00050M0005C002P002G001 execution
cd execution
if [ "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 ;