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.r169-tall-167838855700315.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 ltsminxred
Input is FamilyReunion-COL-L00050M0005C002P002G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855700315
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.2K Feb 26 12:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 12:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 12:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 3.9K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 137K 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-COL-L00050M0005C002P002G001-LTLCardinality-00
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-01
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-02
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-03
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-04
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-05
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-06
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-07
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-08
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-09
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-10
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-11
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-12
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-13
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-14
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678507419990

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00050M0005C002P002G001
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 04:03:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 04:03:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 04:03:41] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-11 04:03:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 04:03:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 720 ms
[2023-03-11 04:03:42] [INFO ] Detected 5 constant HL places corresponding to 17 PT places.
[2023-03-11 04:03:42] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 12245 PT places and 10611.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 194 ms.
Working with output stream class java.io.PrintStream
[2023-03-11 04:03:42] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 5 ms.
[2023-03-11 04:03:42] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 2986 steps, including 0 resets, run visited all 22 properties in 37 ms. (steps per millisecond=80 )
[2023-03-11 04:03:42] [INFO ] Flatten gal took : 27 ms
[2023-03-11 04:03:42] [INFO ] Flatten gal took : 8 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 3
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
[2023-03-11 04:03:42] [INFO ] Unfolded HLPN to a Petri net with 11467 places and 9336 transitions 26832 arcs in 92 ms.
[2023-03-11 04:03:42] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Deduced a syphon composed of 51 places in 55 ms
Reduce places removed 64 places and 0 transitions.
Support contains 3170 out of 11403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11403/11403 places, 9336/9336 transitions.
Reduce places removed 116 places and 0 transitions.
Discarding 1989 places :
Implicit places reduction removed 1989 places
Iterating post reduction 0 with 2105 rules applied. Total rules applied 2105 place count 9298 transition count 9336
Discarding 407 places :
Symmetric choice reduction at 1 with 407 rule applications. Total rules 2512 place count 8891 transition count 8929
Iterating global reduction 1 with 407 rules applied. Total rules applied 2919 place count 8891 transition count 8929
Applied a total of 2919 rules in 1911 ms. Remains 8891 /11403 variables (removed 2512) and now considering 8929/9336 (removed 407) transitions.
// Phase 1: matrix 8929 rows 8891 cols
[2023-03-11 04:03:45] [INFO ] Computed 720 place invariants in 314 ms
[2023-03-11 04:03:46] [INFO ] Implicit Places using invariants in 1491 ms returned []
[2023-03-11 04:03:46] [INFO ] Invariant cache hit.
[2023-03-11 04:03:47] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 2371 ms to find 0 implicit places.
[2023-03-11 04:03:47] [INFO ] Invariant cache hit.
[2023-03-11 04:03:48] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8891/11403 places, 8929/9336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5082 ms. Remains : 8891/11403 places, 8929/9336 transitions.
Support contains 3170 out of 8891 places after structural reductions.
[2023-03-11 04:03:48] [INFO ] Flatten gal took : 379 ms
[2023-03-11 04:03:49] [INFO ] Flatten gal took : 249 ms
[2023-03-11 04:03:49] [INFO ] Input system was already deterministic with 8929 transitions.
Finished random walk after 2553 steps, including 0 resets, run visited all 21 properties in 267 ms. (steps per millisecond=9 )
Computed a total of 8891 stabilizing places and 8929 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8891 transition count 8929
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 8891 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8891/8891 places, 8929/8929 transitions.
Graph (complete) has 11883 edges and 8891 vertex of which 7044 are kept as prefixes of interest. Removing 1847 places using SCC suffix rule.38 ms
Discarding 1847 places :
Also discarding 1585 output transitions
Drop transitions removed 1585 transitions
Reduce places removed 51 places and 51 transitions.
Drop transitions removed 4386 transitions
Trivial Post-agglo rules discarded 4386 transitions
Performed 4386 trivial Post agglomeration. Transition count delta: 4386
Iterating post reduction 0 with 4386 rules applied. Total rules applied 4387 place count 6993 transition count 2907
Reduce places removed 4386 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 1 with 4437 rules applied. Total rules applied 8824 place count 2607 transition count 2856
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 8875 place count 2556 transition count 2856
Performed 510 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 510 Pre rules applied. Total rules applied 8875 place count 2556 transition count 2346
Deduced a syphon composed of 510 places in 1 ms
Ensure Unique test removed 153 places
Reduce places removed 663 places and 0 transitions.
Iterating global reduction 3 with 1173 rules applied. Total rules applied 10048 place count 1893 transition count 2346
Discarding 357 places :
Symmetric choice reduction at 3 with 357 rule applications. Total rules 10405 place count 1536 transition count 1989
Iterating global reduction 3 with 357 rules applied. Total rules applied 10762 place count 1536 transition count 1989
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 3 with 102 rules applied. Total rules applied 10864 place count 1536 transition count 1887
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 102 Pre rules applied. Total rules applied 10864 place count 1536 transition count 1785
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 4 with 255 rules applied. Total rules applied 11119 place count 1383 transition count 1785
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 11124 place count 1378 transition count 1530
Iterating global reduction 4 with 5 rules applied. Total rules applied 11129 place count 1378 transition count 1530
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 4 with 51 rules applied. Total rules applied 11180 place count 1327 transition count 1530
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 11180 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 5 with 102 rules applied. Total rules applied 11282 place count 1276 transition count 1479
Applied a total of 11282 rules in 698 ms. Remains 1276 /8891 variables (removed 7615) and now considering 1479/8929 (removed 7450) transitions.
// Phase 1: matrix 1479 rows 1276 cols
[2023-03-11 04:03:51] [INFO ] Computed 52 place invariants in 9 ms
[2023-03-11 04:03:51] [INFO ] Implicit Places using invariants in 441 ms returned [357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 1071]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 445 ms to find 52 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1224/8891 places, 1479/8929 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 48 ms. Remains 867 /1224 variables (removed 357) and now considering 1122/1479 (removed 357) transitions.
// Phase 1: matrix 1122 rows 867 cols
[2023-03-11 04:03:51] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-11 04:03:51] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-11 04:03:51] [INFO ] Invariant cache hit.
[2023-03-11 04:03:52] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 867/8891 places, 1122/8929 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1653 ms. Remains : 867/8891 places, 1122/8929 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-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 298 reset in 862 ms.
Product exploration explored 100000 steps with 303 reset in 876 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 108 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-COL-L00050M0005C002P002G001-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-00 finished in 4582 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 8891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8891/8891 places, 8929/8929 transitions.
Reduce places removed 52 places and 0 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 8788 transition count 8929
Discarding 463 places :
Symmetric choice reduction at 1 with 463 rule applications. Total rules 566 place count 8325 transition count 8366
Iterating global reduction 1 with 463 rules applied. Total rules applied 1029 place count 8325 transition count 8366
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 1080 place count 8274 transition count 8366
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 1437 place count 7917 transition count 8009
Iterating global reduction 2 with 357 rules applied. Total rules applied 1794 place count 7917 transition count 8009
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 2151 place count 7560 transition count 7652
Iterating global reduction 2 with 357 rules applied. Total rules applied 2508 place count 7560 transition count 7652
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2513 place count 7555 transition count 7397
Iterating global reduction 2 with 5 rules applied. Total rules applied 2518 place count 7555 transition count 7397
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 2569 place count 7504 transition count 7397
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 2824 place count 7249 transition count 7142
Iterating global reduction 3 with 255 rules applied. Total rules applied 3079 place count 7249 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3334 place count 6994 transition count 6887
Iterating global reduction 3 with 255 rules applied. Total rules applied 3589 place count 6994 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3844 place count 6739 transition count 6632
Iterating global reduction 3 with 255 rules applied. Total rules applied 4099 place count 6739 transition count 6632
Applied a total of 4099 rules in 10421 ms. Remains 6739 /8891 variables (removed 2152) and now considering 6632/8929 (removed 2297) transitions.
// Phase 1: matrix 6632 rows 6739 cols
[2023-03-11 04:04:05] [INFO ] Computed 515 place invariants in 141 ms
[2023-03-11 04:04:06] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:04:07] [INFO ] Implicit Places using invariants in 1860 ms returned [898]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1865 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6738/8891 places, 6632/8929 transitions.
Applied a total of 0 rules in 919 ms. Remains 6738 /6738 variables (removed 0) and now considering 6632/6632 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13209 ms. Remains : 6738/8891 places, 6632/8929 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-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 s3520 s3521 s3522 s3523 s3524 s3525 s3526 s3527 s3528 s3529 s3530 s3531 s3532 s3533 s3534 s3535 s3536 s3537 s3538 s3539 s3540 s3541 s3542 s354...], 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 20792 reset in 2935 ms.
Product exploration explored 100000 steps with 20801 reset in 2951 ms.
Computed a total of 6738 stabilizing places and 6632 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6738 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 (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 206 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 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 268 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT 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 234 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 122 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (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))]
// Phase 1: matrix 6632 rows 6738 cols
[2023-03-11 04:04:17] [INFO ] Computed 514 place invariants in 98 ms
[2023-03-11 04:04:28] [INFO ] [Real]Absence check using 0 positive and 514 generalized place invariants in 1085 ms returned sat
[2023-03-11 04:04:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:04:32] [INFO ] [Real]Absence check using state equation in 4143 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 408 out of 6738 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6738/6738 places, 6632/6632 transitions.
Applied a total of 0 rules in 902 ms. Remains 6738 /6738 variables (removed 0) and now considering 6632/6632 (removed 0) transitions.
[2023-03-11 04:04:33] [INFO ] Invariant cache hit.
[2023-03-11 04:04:33] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:04:34] [INFO ] Implicit Places using invariants in 1728 ms returned []
[2023-03-11 04:04:34] [INFO ] Invariant cache hit.
[2023-03-11 04:04:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:04:36] [INFO ] Implicit Places using invariants and state equation in 1673 ms returned []
Implicit Place search using SMT with State Equation took 3405 ms to find 0 implicit places.
[2023-03-11 04:04:36] [INFO ] Invariant cache hit.
[2023-03-11 04:04:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:04:41] [INFO ] Dead Transitions using invariants and state equation in 4565 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8875 ms. Remains : 6738/6738 places, 6632/6632 transitions.
Computed a total of 6738 stabilizing places and 6632 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6738 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 (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 194 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 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 357 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT 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 232 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 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-11 04:04:43] [INFO ] Invariant cache hit.
[2023-03-11 04:04:55] [INFO ] [Real]Absence check using 0 positive and 514 generalized place invariants in 1149 ms returned sat
[2023-03-11 04:04:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:04:58] [INFO ] [Real]Absence check using state equation in 3352 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 20721 reset in 3023 ms.
Product exploration explored 100000 steps with 20736 reset in 3051 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 408 out of 6738 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6738/6738 places, 6632/6632 transitions.
Graph (complete) has 8460 edges and 6738 vertex of which 5254 are kept as prefixes of interest. Removing 1484 places using SCC suffix rule.9 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 5254 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 5254 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 5254 transition count 5508
Discarding 1797 places :
Symmetric choice reduction at 1 with 1797 rule applications. Total rules 5272 place count 3457 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 3457 transition count 3711
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1830 places in 2 ms
Iterating global reduction 1 with 153 rules applied. Total rules applied 7222 place count 3457 transition count 3711
Discarding 204 places :
Symmetric choice reduction at 1 with 204 rule applications. Total rules 7426 place count 3253 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 3253 transition count 3507
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -306
Deduced a syphon composed of 1677 places in 2 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 7681 place count 3253 transition count 3813
Deduced a syphon composed of 1677 places in 1 ms
Applied a total of 7681 rules in 2087 ms. Remains 3253 /6738 variables (removed 3485) and now considering 3813/6632 (removed 2819) transitions.
[2023-03-11 04:05:07] [INFO ] Redundant transitions in 288 ms returned []
// Phase 1: matrix 3813 rows 3253 cols
[2023-03-11 04:05:07] [INFO ] Computed 256 place invariants in 45 ms
[2023-03-11 04:05:09] [INFO ] Dead Transitions using invariants and state equation in 2042 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3253/6738 places, 3813/6632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4430 ms. Remains : 3253/6738 places, 3813/6632 transitions.
Support contains 408 out of 6738 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6738/6738 places, 6632/6632 transitions.
Applied a total of 0 rules in 938 ms. Remains 6738 /6738 variables (removed 0) and now considering 6632/6632 (removed 0) transitions.
// Phase 1: matrix 6632 rows 6738 cols
[2023-03-11 04:05:10] [INFO ] Computed 514 place invariants in 80 ms
[2023-03-11 04:05:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:05:12] [INFO ] Implicit Places using invariants in 1757 ms returned [5138]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1768 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6737/6738 places, 6632/6632 transitions.
Applied a total of 0 rules in 998 ms. Remains 6737 /6737 variables (removed 0) and now considering 6632/6632 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3711 ms. Remains : 6737/6738 places, 6632/6632 transitions.
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-01 finished in 79107 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 8891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8891/8891 places, 8929/8929 transitions.
Reduce places removed 52 places and 0 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 8788 transition count 8929
Discarding 460 places :
Symmetric choice reduction at 1 with 460 rule applications. Total rules 563 place count 8328 transition count 8369
Iterating global reduction 1 with 460 rules applied. Total rules applied 1023 place count 8328 transition count 8369
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 1074 place count 8277 transition count 8369
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 1431 place count 7920 transition count 8012
Iterating global reduction 2 with 357 rules applied. Total rules applied 1788 place count 7920 transition count 8012
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 2043 place count 7665 transition count 7757
Iterating global reduction 2 with 255 rules applied. Total rules applied 2298 place count 7665 transition count 7757
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2303 place count 7660 transition count 7502
Iterating global reduction 2 with 5 rules applied. Total rules applied 2308 place count 7660 transition count 7502
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 2359 place count 7609 transition count 7502
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 2614 place count 7354 transition count 7247
Iterating global reduction 3 with 255 rules applied. Total rules applied 2869 place count 7354 transition count 7247
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3124 place count 7099 transition count 6992
Iterating global reduction 3 with 255 rules applied. Total rules applied 3379 place count 7099 transition count 6992
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3634 place count 6844 transition count 6737
Iterating global reduction 3 with 255 rules applied. Total rules applied 3889 place count 6844 transition count 6737
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4144 place count 6589 transition count 6482
Iterating global reduction 3 with 255 rules applied. Total rules applied 4399 place count 6589 transition count 6482
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4654 place count 6334 transition count 6227
Iterating global reduction 3 with 255 rules applied. Total rules applied 4909 place count 6334 transition count 6227
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5164 place count 6079 transition count 5972
Iterating global reduction 3 with 255 rules applied. Total rules applied 5419 place count 6079 transition count 5972
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5674 place count 5824 transition count 5717
Iterating global reduction 3 with 255 rules applied. Total rules applied 5929 place count 5824 transition count 5717
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6184 place count 5569 transition count 5462
Iterating global reduction 3 with 255 rules applied. Total rules applied 6439 place count 5569 transition count 5462
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6694 place count 5314 transition count 5207
Iterating global reduction 3 with 255 rules applied. Total rules applied 6949 place count 5314 transition count 5207
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7204 place count 5059 transition count 4952
Iterating global reduction 3 with 255 rules applied. Total rules applied 7459 place count 5059 transition count 4952
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7714 place count 4804 transition count 4697
Iterating global reduction 3 with 255 rules applied. Total rules applied 7969 place count 4804 transition count 4697
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8224 place count 4549 transition count 4442
Iterating global reduction 3 with 255 rules applied. Total rules applied 8479 place count 4549 transition count 4442
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8734 place count 4294 transition count 4187
Iterating global reduction 3 with 255 rules applied. Total rules applied 8989 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 9295 place count 4243 transition count 3932
Applied a total of 9295 rules in 17656 ms. Remains 4243 /8891 variables (removed 4648) and now considering 3932/8929 (removed 4997) transitions.
// Phase 1: matrix 3932 rows 4243 cols
[2023-03-11 04:05:31] [INFO ] Computed 464 place invariants in 45 ms
[2023-03-11 04:05:32] [INFO ] Implicit Places using invariants in 1022 ms returned [1711, 1717, 1723, 2553]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1024 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4239/8891 places, 3932/8929 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4234 transition count 3927
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4234 transition count 3927
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 4232 transition count 3923
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 4232 transition count 3923
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 4230 transition count 3921
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 4230 transition count 3921
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 4228 transition count 3919
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 4228 transition count 3919
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 4226 transition count 3917
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 4226 transition count 3917
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 4224 transition count 3915
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 4224 transition count 3915
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 4222 transition count 3913
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 4222 transition count 3913
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 4220 transition count 3911
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 4220 transition count 3911
Applied a total of 38 rules in 3674 ms. Remains 4220 /4239 variables (removed 19) and now considering 3911/3932 (removed 21) transitions.
// Phase 1: matrix 3911 rows 4220 cols
[2023-03-11 04:05:36] [INFO ] Computed 460 place invariants in 38 ms
[2023-03-11 04:05:37] [INFO ] Implicit Places using invariants in 948 ms returned [2515, 2516]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 954 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4218/8891 places, 3911/8929 transitions.
Applied a total of 0 rules in 407 ms. Remains 4218 /4218 variables (removed 0) and now considering 3911/3911 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 23715 ms. Remains : 4218/8891 places, 3911/8929 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-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 s3861 s3862 s3863 s3864 s3865 s3866 s3867 s3868 s3869 s3870 s3871 s3872 s3873 s3874 s3875 s3876 s3877 s3878 s3879 s3880 s3881 s3882 s3883 s388...], 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 568 ms.
Product exploration explored 100000 steps with 69 reset in 588 ms.
Computed a total of 4218 stabilizing places and 3911 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4218 transition count 3911
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 p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 261 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 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1384 steps, including 0 resets, run visited all 2 properties in 25 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 7 factoid took 284 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 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 3911 rows 4218 cols
[2023-03-11 04:05:41] [INFO ] Computed 458 place invariants in 37 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (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 178 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-COL-L00050M0005C002P002G001-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-03 finished in 30817 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 8891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8891/8891 places, 8929/8929 transitions.
Reduce places removed 52 places and 0 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 8788 transition count 8929
Discarding 208 places :
Symmetric choice reduction at 1 with 208 rule applications. Total rules 311 place count 8580 transition count 8621
Iterating global reduction 1 with 208 rules applied. Total rules applied 519 place count 8580 transition count 8621
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 570 place count 8529 transition count 8621
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 672 place count 8427 transition count 8519
Iterating global reduction 2 with 102 rules applied. Total rules applied 774 place count 8427 transition count 8519
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 876 place count 8325 transition count 8417
Iterating global reduction 2 with 102 rules applied. Total rules applied 978 place count 8325 transition count 8417
Applied a total of 978 rules in 6685 ms. Remains 8325 /8891 variables (removed 566) and now considering 8417/8929 (removed 512) transitions.
// Phase 1: matrix 8417 rows 8325 cols
[2023-03-11 04:05:51] [INFO ] Computed 566 place invariants in 124 ms
[2023-03-11 04:05:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:05:52] [INFO ] Implicit Places using invariants in 935 ms returned []
[2023-03-11 04:05:52] [INFO ] Invariant cache hit.
[2023-03-11 04:05:53] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:05:53] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1766 ms to find 0 implicit places.
[2023-03-11 04:05:53] [INFO ] Invariant cache hit.
[2023-03-11 04:05:54] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:05:54] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8325/8891 places, 8417/8929 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9266 ms. Remains : 8325/8891 places, 8417/8929 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-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 s5978 s5979 s5980 s5981 s5982 s5983 s5984 s5985 s5986 s5987 s5988 s5989 s5990 s5991 s5992 s5993 s5994 s5995 s5996 s5997 s5998 s5999 s6000 s600...], 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-COL-L00050M0005C002P002G001-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-04 finished in 9396 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 8891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8891/8891 places, 8929/8929 transitions.
Reduce places removed 52 places and 0 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 8788 transition count 8929
Discarding 463 places :
Symmetric choice reduction at 1 with 463 rule applications. Total rules 566 place count 8325 transition count 8366
Iterating global reduction 1 with 463 rules applied. Total rules applied 1029 place count 8325 transition count 8366
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 1080 place count 8274 transition count 8366
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 1437 place count 7917 transition count 8009
Iterating global reduction 2 with 357 rules applied. Total rules applied 1794 place count 7917 transition count 8009
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 2151 place count 7560 transition count 7652
Iterating global reduction 2 with 357 rules applied. Total rules applied 2508 place count 7560 transition count 7652
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2513 place count 7555 transition count 7397
Iterating global reduction 2 with 5 rules applied. Total rules applied 2518 place count 7555 transition count 7397
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 2569 place count 7504 transition count 7397
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 2824 place count 7249 transition count 7142
Iterating global reduction 3 with 255 rules applied. Total rules applied 3079 place count 7249 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3334 place count 6994 transition count 6887
Iterating global reduction 3 with 255 rules applied. Total rules applied 3589 place count 6994 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3844 place count 6739 transition count 6632
Iterating global reduction 3 with 255 rules applied. Total rules applied 4099 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4354 place count 6484 transition count 6377
Iterating global reduction 3 with 255 rules applied. Total rules applied 4609 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4864 place count 6229 transition count 6122
Iterating global reduction 3 with 255 rules applied. Total rules applied 5119 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5374 place count 5974 transition count 5867
Iterating global reduction 3 with 255 rules applied. Total rules applied 5629 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5884 place count 5719 transition count 5612
Iterating global reduction 3 with 255 rules applied. Total rules applied 6139 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6394 place count 5464 transition count 5357
Iterating global reduction 3 with 255 rules applied. Total rules applied 6649 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6904 place count 5209 transition count 5102
Iterating global reduction 3 with 255 rules applied. Total rules applied 7159 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7414 place count 4954 transition count 4847
Iterating global reduction 3 with 255 rules applied. Total rules applied 7669 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7924 place count 4699 transition count 4592
Iterating global reduction 3 with 255 rules applied. Total rules applied 8179 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8434 place count 4444 transition count 4337
Iterating global reduction 3 with 255 rules applied. Total rules applied 8689 place count 4444 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8944 place count 4189 transition count 4082
Iterating global reduction 3 with 255 rules applied. Total rules applied 9199 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 9505 place count 4138 transition count 3827
Applied a total of 9505 rules in 17868 ms. Remains 4138 /8891 variables (removed 4753) and now considering 3827/8929 (removed 5102) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2023-03-11 04:06:12] [INFO ] Computed 464 place invariants in 46 ms
[2023-03-11 04:06:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:06:13] [INFO ] Implicit Places using invariants in 1079 ms returned [1711, 1717, 1723, 2536]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1082 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4134/8891 places, 3827/8929 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4129 transition count 3822
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4129 transition count 3822
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 4127 transition count 3818
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 4127 transition count 3818
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 4125 transition count 3816
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 4125 transition count 3816
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 4123 transition count 3814
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 4123 transition count 3814
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 4121 transition count 3812
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 4121 transition count 3812
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 4119 transition count 3810
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 4119 transition count 3810
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 4117 transition count 3808
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 4117 transition count 3808
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 4115 transition count 3806
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 4115 transition count 3806
Applied a total of 38 rules in 3735 ms. Remains 4115 /4134 variables (removed 19) and now considering 3806/3827 (removed 21) transitions.
// Phase 1: matrix 3806 rows 4115 cols
[2023-03-11 04:06:17] [INFO ] Computed 460 place invariants in 49 ms
[2023-03-11 04:06:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:06:18] [INFO ] Implicit Places using invariants in 1053 ms returned [2490, 2520]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1056 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4113/8891 places, 3806/8929 transitions.
Applied a total of 0 rules in 399 ms. Remains 4113 /4113 variables (removed 0) and now considering 3806/3806 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 24144 ms. Remains : 4113/8891 places, 3806/8929 transitions.
Stuttering acceptance computed with spot in 303 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-COL-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 s3909 s3910 s3911 s3912 s3913 s3914 s3915 s3916 s3917 s3918 s3919 s3920 s3921 s3922 s3923 s3924 s3925 s3926 s3927 s3928 s3929 s3930 s3931 s393...], 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 0 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-05 finished in 24472 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 5 out of 8891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8891/8891 places, 8929/8929 transitions.
Reduce places removed 51 places and 0 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 8789 transition count 8929
Discarding 461 places :
Symmetric choice reduction at 1 with 461 rule applications. Total rules 563 place count 8328 transition count 8468
Iterating global reduction 1 with 461 rules applied. Total rules applied 1024 place count 8328 transition count 8468
Discarding 255 places :
Symmetric choice reduction at 1 with 255 rule applications. Total rules 1279 place count 8073 transition count 8213
Iterating global reduction 1 with 255 rules applied. Total rules applied 1534 place count 8073 transition count 8213
Discarding 255 places :
Symmetric choice reduction at 1 with 255 rule applications. Total rules 1789 place count 7818 transition count 7958
Iterating global reduction 1 with 255 rules applied. Total rules applied 2044 place count 7818 transition count 7958
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 2049 place count 7813 transition count 7703
Iterating global reduction 1 with 5 rules applied. Total rules applied 2054 place count 7813 transition count 7703
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2105 place count 7762 transition count 7703
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 2360 place count 7507 transition count 7448
Iterating global reduction 2 with 255 rules applied. Total rules applied 2615 place count 7507 transition count 7448
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 2870 place count 7252 transition count 7193
Iterating global reduction 2 with 255 rules applied. Total rules applied 3125 place count 7252 transition count 7193
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3380 place count 6997 transition count 6938
Iterating global reduction 2 with 255 rules applied. Total rules applied 3635 place count 6997 transition count 6938
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3890 place count 6742 transition count 6683
Iterating global reduction 2 with 255 rules applied. Total rules applied 4145 place count 6742 transition count 6683
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4400 place count 6487 transition count 6428
Iterating global reduction 2 with 255 rules applied. Total rules applied 4655 place count 6487 transition count 6428
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4910 place count 6232 transition count 6173
Iterating global reduction 2 with 255 rules applied. Total rules applied 5165 place count 6232 transition count 6173
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5420 place count 5977 transition count 5918
Iterating global reduction 2 with 255 rules applied. Total rules applied 5675 place count 5977 transition count 5918
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5930 place count 5722 transition count 5663
Iterating global reduction 2 with 255 rules applied. Total rules applied 6185 place count 5722 transition count 5663
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6440 place count 5467 transition count 5408
Iterating global reduction 2 with 255 rules applied. Total rules applied 6695 place count 5467 transition count 5408
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6950 place count 5212 transition count 5153
Iterating global reduction 2 with 255 rules applied. Total rules applied 7205 place count 5212 transition count 5153
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7460 place count 4957 transition count 4898
Iterating global reduction 2 with 255 rules applied. Total rules applied 7715 place count 4957 transition count 4898
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7970 place count 4702 transition count 4643
Iterating global reduction 2 with 255 rules applied. Total rules applied 8225 place count 4702 transition count 4643
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8480 place count 4447 transition count 4388
Iterating global reduction 2 with 255 rules applied. Total rules applied 8735 place count 4447 transition count 4388
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 9041 place count 4396 transition count 4133
Applied a total of 9041 rules in 20005 ms. Remains 4396 /8891 variables (removed 4495) and now considering 4133/8929 (removed 4796) transitions.
// Phase 1: matrix 4133 rows 4396 cols
[2023-03-11 04:06:38] [INFO ] Computed 516 place invariants in 58 ms
[2023-03-11 04:06:39] [INFO ] Implicit Places using invariants in 1139 ms returned []
[2023-03-11 04:06:39] [INFO ] Invariant cache hit.
[2023-03-11 04:06:40] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 2219 ms to find 0 implicit places.
[2023-03-11 04:06:40] [INFO ] Invariant cache hit.
[2023-03-11 04:06:43] [INFO ] Dead Transitions using invariants and state equation in 2503 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4396/8891 places, 4133/8929 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24728 ms. Remains : 4396/8891 places, 4133/8929 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-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 s1788 s1583), p0:(AND (GT s1788 s1583) (GT 3 (ADD s3730 s3731 s3732)))], 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-COL-L00050M0005C002P002G001-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-06 finished in 24890 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)))'
Support contains 102 out of 8891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8891/8891 places, 8929/8929 transitions.
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 8839 transition count 8929
Discarding 463 places :
Symmetric choice reduction at 1 with 463 rule applications. Total rules 515 place count 8376 transition count 8366
Iterating global reduction 1 with 463 rules applied. Total rules applied 978 place count 8376 transition count 8366
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 1029 place count 8325 transition count 8366
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 1386 place count 7968 transition count 8009
Iterating global reduction 2 with 357 rules applied. Total rules applied 1743 place count 7968 transition count 8009
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 2100 place count 7611 transition count 7652
Iterating global reduction 2 with 357 rules applied. Total rules applied 2457 place count 7611 transition count 7652
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2462 place count 7606 transition count 7397
Iterating global reduction 2 with 5 rules applied. Total rules applied 2467 place count 7606 transition count 7397
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 2518 place count 7555 transition count 7397
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 2773 place count 7300 transition count 7142
Iterating global reduction 3 with 255 rules applied. Total rules applied 3028 place count 7300 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3283 place count 7045 transition count 6887
Iterating global reduction 3 with 255 rules applied. Total rules applied 3538 place count 7045 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3793 place count 6790 transition count 6632
Iterating global reduction 3 with 255 rules applied. Total rules applied 4048 place count 6790 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4303 place count 6535 transition count 6377
Iterating global reduction 3 with 255 rules applied. Total rules applied 4558 place count 6535 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4813 place count 6280 transition count 6122
Iterating global reduction 3 with 255 rules applied. Total rules applied 5068 place count 6280 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5323 place count 6025 transition count 5867
Iterating global reduction 3 with 255 rules applied. Total rules applied 5578 place count 6025 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5833 place count 5770 transition count 5612
Iterating global reduction 3 with 255 rules applied. Total rules applied 6088 place count 5770 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6343 place count 5515 transition count 5357
Iterating global reduction 3 with 255 rules applied. Total rules applied 6598 place count 5515 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6853 place count 5260 transition count 5102
Iterating global reduction 3 with 255 rules applied. Total rules applied 7108 place count 5260 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7363 place count 5005 transition count 4847
Iterating global reduction 3 with 255 rules applied. Total rules applied 7618 place count 5005 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7873 place count 4750 transition count 4592
Iterating global reduction 3 with 255 rules applied. Total rules applied 8128 place count 4750 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8383 place count 4495 transition count 4337
Iterating global reduction 3 with 255 rules applied. Total rules applied 8638 place count 4495 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8893 place count 4240 transition count 4082
Iterating global reduction 3 with 255 rules applied. Total rules applied 9148 place count 4240 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 9454 place count 4189 transition count 3827
Applied a total of 9454 rules in 18733 ms. Remains 4189 /8891 variables (removed 4702) and now considering 3827/8929 (removed 5102) transitions.
// Phase 1: matrix 3827 rows 4189 cols
[2023-03-11 04:07:02] [INFO ] Computed 515 place invariants in 41 ms
[2023-03-11 04:07:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:07:03] [INFO ] Implicit Places using invariants in 1155 ms returned [1743, 1749, 2562, 2595]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1165 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4185/8891 places, 3827/8929 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 4182 transition count 3824
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 4182 transition count 3824
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 4181 transition count 3822
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 4181 transition count 3822
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 4180 transition count 3821
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 4180 transition count 3821
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 4179 transition count 3820
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 4179 transition count 3820
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 4178 transition count 3819
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 4178 transition count 3819
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 4177 transition count 3818
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 4177 transition count 3818
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 4176 transition count 3817
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 4176 transition count 3817
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 4175 transition count 3816
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 4175 transition count 3816
Applied a total of 20 rules in 3777 ms. Remains 4175 /4185 variables (removed 10) and now considering 3816/3827 (removed 11) transitions.
// Phase 1: matrix 3816 rows 4175 cols
[2023-03-11 04:07:07] [INFO ] Computed 511 place invariants in 43 ms
[2023-03-11 04:07:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:07:08] [INFO ] Implicit Places using invariants in 1136 ms returned []
[2023-03-11 04:07:08] [INFO ] Invariant cache hit.
[2023-03-11 04:07:08] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:07:10] [INFO ] Implicit Places using invariants and state equation in 1659 ms returned []
Implicit Place search using SMT with State Equation took 2800 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4175/8891 places, 3816/8929 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26475 ms. Remains : 4175/8891 places, 3816/8929 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s2187 s2188 s2189 s2190 s2191 s2192 s2193 s2194 s2195 s2196 s2197 s2198 s2199 s2200 s2201 s2202 s2203 s2204 s2205 s2206 s2207 s2208 s2209 s221...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 150 reset in 692 ms.
Product exploration explored 100000 steps with 154 reset in 753 ms.
Computed a total of 4175 stabilizing places and 3816 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4175 transition count 3816
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 569 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=94 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-11 04:07:13] [INFO ] Invariant cache hit.
[2023-03-11 04:07:19] [INFO ] [Real]Absence check using 0 positive and 511 generalized place invariants in 863 ms returned sat
[2023-03-11 04:07:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:07:28] [INFO ] [Real]Absence check using state equation in 9058 ms returned unknown
Could not prove EG (NOT p0)
Support contains 102 out of 4175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4175/4175 places, 3816/3816 transitions.
Graph (complete) has 5383 edges and 4175 vertex of which 3417 are kept as prefixes of interest. Removing 758 places using SCC suffix rule.4 ms
Discarding 758 places :
Also discarding 705 output transitions
Drop transitions removed 705 transitions
Reduce places removed 51 places and 51 transitions.
Drop transitions removed 1581 transitions
Trivial Post-agglo rules discarded 1581 transitions
Performed 1581 trivial Post agglomeration. Transition count delta: 1581
Iterating post reduction 0 with 1581 rules applied. Total rules applied 1582 place count 3366 transition count 1479
Reduce places removed 1581 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 1 with 1632 rules applied. Total rules applied 3214 place count 1785 transition count 1428
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 3265 place count 1734 transition count 1428
Performed 765 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 765 Pre rules applied. Total rules applied 3265 place count 1734 transition count 663
Deduced a syphon composed of 765 places in 0 ms
Ensure Unique test removed 357 places
Reduce places removed 1122 places and 0 transitions.
Iterating global reduction 3 with 1887 rules applied. Total rules applied 5152 place count 612 transition count 663
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 3 with 153 rules applied. Total rules applied 5305 place count 612 transition count 510
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 257 rules applied. Total rules applied 5562 place count 459 transition count 406
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 5564 place count 457 transition count 406
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 49 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 6 with 147 rules applied. Total rules applied 5711 place count 359 transition count 357
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 6 with 51 rules applied. Total rules applied 5762 place count 308 transition count 306
Applied a total of 5762 rules in 208 ms. Remains 308 /4175 variables (removed 3867) and now considering 306/3816 (removed 3510) transitions.
// Phase 1: matrix 306 rows 308 cols
[2023-03-11 04:07:28] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 04:07:28] [INFO ] Implicit Places using invariants in 130 ms returned [102, 256]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 132 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 306/4175 places, 306/3816 transitions.
Reduce places removed 51 places and 51 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 255 transition count 204
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 204 transition count 204
Applied a total of 102 rules in 4 ms. Remains 204 /306 variables (removed 102) and now considering 204/306 (removed 102) transitions.
// Phase 1: matrix 204 rows 204 cols
[2023-03-11 04:07:28] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 04:07:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-11 04:07:28] [INFO ] Invariant cache hit.
[2023-03-11 04:07:28] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 204/4175 places, 204/3816 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 460 ms. Remains : 204/4175 places, 204/3816 transitions.
Computed a total of 204 stabilizing places and 204 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 204 transition count 204
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-08 finished in 45112 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)))'
Support contains 357 out of 8891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8891/8891 places, 8929/8929 transitions.
Reduce places removed 1 places and 0 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 8839 transition count 8929
Discarding 362 places :
Symmetric choice reduction at 1 with 362 rule applications. Total rules 414 place count 8477 transition count 8467
Iterating global reduction 1 with 362 rules applied. Total rules applied 776 place count 8477 transition count 8467
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 827 place count 8426 transition count 8467
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 1184 place count 8069 transition count 8110
Iterating global reduction 2 with 357 rules applied. Total rules applied 1541 place count 8069 transition count 8110
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 1898 place count 7712 transition count 7753
Iterating global reduction 2 with 357 rules applied. Total rules applied 2255 place count 7712 transition count 7753
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2260 place count 7707 transition count 7498
Iterating global reduction 2 with 5 rules applied. Total rules applied 2265 place count 7707 transition count 7498
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 2316 place count 7656 transition count 7498
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 2571 place count 7401 transition count 7243
Iterating global reduction 3 with 255 rules applied. Total rules applied 2826 place count 7401 transition count 7243
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3081 place count 7146 transition count 6988
Iterating global reduction 3 with 255 rules applied. Total rules applied 3336 place count 7146 transition count 6988
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3591 place count 6891 transition count 6733
Iterating global reduction 3 with 255 rules applied. Total rules applied 3846 place count 6891 transition count 6733
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4101 place count 6636 transition count 6478
Iterating global reduction 3 with 255 rules applied. Total rules applied 4356 place count 6636 transition count 6478
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4611 place count 6381 transition count 6223
Iterating global reduction 3 with 255 rules applied. Total rules applied 4866 place count 6381 transition count 6223
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5121 place count 6126 transition count 5968
Iterating global reduction 3 with 255 rules applied. Total rules applied 5376 place count 6126 transition count 5968
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5631 place count 5871 transition count 5713
Iterating global reduction 3 with 255 rules applied. Total rules applied 5886 place count 5871 transition count 5713
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6141 place count 5616 transition count 5458
Iterating global reduction 3 with 255 rules applied. Total rules applied 6396 place count 5616 transition count 5458
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6651 place count 5361 transition count 5203
Iterating global reduction 3 with 255 rules applied. Total rules applied 6906 place count 5361 transition count 5203
Applied a total of 6906 rules in 16048 ms. Remains 5361 /8891 variables (removed 3530) and now considering 5203/8929 (removed 3726) transitions.
// Phase 1: matrix 5203 rows 5361 cols
[2023-03-11 04:07:44] [INFO ] Computed 566 place invariants in 42 ms
[2023-03-11 04:07:46] [INFO ] Implicit Places using invariants in 1480 ms returned [916]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1484 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 5360/8891 places, 5203/8929 transitions.
Applied a total of 0 rules in 606 ms. Remains 5360 /5360 variables (removed 0) and now considering 5203/5203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18139 ms. Remains : 5360/8891 places, 5203/8929 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s3217 s3218 s3219 s3220 s3221 s3222 s3223 s3224 s3225 s3226 s3227 s3228 s3229 s3230 s3231 s3232 s3233 s3234 s3235 s3236 s3237 s3238 s3239 s32...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 4262 ms.
Product exploration explored 100000 steps with 50000 reset in 4305 ms.
Computed a total of 5360 stabilizing places and 5203 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5360 transition count 5203
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-10 finished in 28283 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)))'
Support contains 102 out of 8891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8891/8891 places, 8929/8929 transitions.
Reduce places removed 52 places and 0 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 8788 transition count 8929
Discarding 463 places :
Symmetric choice reduction at 1 with 463 rule applications. Total rules 566 place count 8325 transition count 8366
Iterating global reduction 1 with 463 rules applied. Total rules applied 1029 place count 8325 transition count 8366
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 1080 place count 8274 transition count 8366
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 1437 place count 7917 transition count 8009
Iterating global reduction 2 with 357 rules applied. Total rules applied 1794 place count 7917 transition count 8009
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 2151 place count 7560 transition count 7652
Iterating global reduction 2 with 357 rules applied. Total rules applied 2508 place count 7560 transition count 7652
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2513 place count 7555 transition count 7397
Iterating global reduction 2 with 5 rules applied. Total rules applied 2518 place count 7555 transition count 7397
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 2569 place count 7504 transition count 7397
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 2824 place count 7249 transition count 7142
Iterating global reduction 3 with 255 rules applied. Total rules applied 3079 place count 7249 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3334 place count 6994 transition count 6887
Iterating global reduction 3 with 255 rules applied. Total rules applied 3589 place count 6994 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3844 place count 6739 transition count 6632
Iterating global reduction 3 with 255 rules applied. Total rules applied 4099 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4354 place count 6484 transition count 6377
Iterating global reduction 3 with 255 rules applied. Total rules applied 4609 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4864 place count 6229 transition count 6122
Iterating global reduction 3 with 255 rules applied. Total rules applied 5119 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5374 place count 5974 transition count 5867
Iterating global reduction 3 with 255 rules applied. Total rules applied 5629 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5884 place count 5719 transition count 5612
Iterating global reduction 3 with 255 rules applied. Total rules applied 6139 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6394 place count 5464 transition count 5357
Iterating global reduction 3 with 255 rules applied. Total rules applied 6649 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6904 place count 5209 transition count 5102
Iterating global reduction 3 with 255 rules applied. Total rules applied 7159 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7414 place count 4954 transition count 4847
Iterating global reduction 3 with 255 rules applied. Total rules applied 7669 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7924 place count 4699 transition count 4592
Iterating global reduction 3 with 255 rules applied. Total rules applied 8179 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8434 place count 4444 transition count 4337
Iterating global reduction 3 with 255 rules applied. Total rules applied 8689 place count 4444 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8944 place count 4189 transition count 4082
Iterating global reduction 3 with 255 rules applied. Total rules applied 9199 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 9505 place count 4138 transition count 3827
Applied a total of 9505 rules in 18597 ms. Remains 4138 /8891 variables (removed 4753) and now considering 3827/8929 (removed 5102) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2023-03-11 04:08:15] [INFO ] Computed 464 place invariants in 51 ms
[2023-03-11 04:08:16] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:08:16] [INFO ] Implicit Places using invariants in 1096 ms returned [1711, 1717, 1723, 2536]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1098 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4134/8891 places, 3827/8929 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4129 transition count 3822
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4129 transition count 3822
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 4127 transition count 3818
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 4127 transition count 3818
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 4125 transition count 3816
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 4125 transition count 3816
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 4123 transition count 3814
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 4123 transition count 3814
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 4121 transition count 3812
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 4121 transition count 3812
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 4119 transition count 3810
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 4119 transition count 3810
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 4117 transition count 3808
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 4117 transition count 3808
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 4115 transition count 3806
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 4115 transition count 3806
Applied a total of 38 rules in 3691 ms. Remains 4115 /4134 variables (removed 19) and now considering 3806/3827 (removed 21) transitions.
// Phase 1: matrix 3806 rows 4115 cols
[2023-03-11 04:08:20] [INFO ] Computed 460 place invariants in 47 ms
[2023-03-11 04:08:20] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:08:21] [INFO ] Implicit Places using invariants in 1097 ms returned [2490, 2520]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1100 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4113/8891 places, 3806/8929 transitions.
Applied a total of 0 rules in 399 ms. Remains 4113 /4113 variables (removed 0) and now considering 3806/3806 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 24885 ms. Remains : 4113/8891 places, 3806/8929 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (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, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 328 reset in 703 ms.
Product exploration explored 100000 steps with 323 reset in 725 ms.
Computed a total of 4113 stabilizing places and 3806 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4113 transition count 3806
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 (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-11 finished in 27505 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)||G(F(p1)))))'
Support contains 459 out of 8891 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8891/8891 places, 8929/8929 transitions.
Graph (complete) has 11883 edges and 8891 vertex of which 7044 are kept as prefixes of interest. Removing 1847 places using SCC suffix rule.8 ms
Discarding 1847 places :
Also discarding 1585 output transitions
Drop transitions removed 1585 transitions
Reduce places removed 51 places and 51 transitions.
Drop transitions removed 4131 transitions
Trivial Post-agglo rules discarded 4131 transitions
Performed 4131 trivial Post agglomeration. Transition count delta: 4131
Iterating post reduction 0 with 4131 rules applied. Total rules applied 4132 place count 6993 transition count 3162
Reduce places removed 4131 places and 0 transitions.
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: 306
Iterating post reduction 1 with 4437 rules applied. Total rules applied 8569 place count 2862 transition count 2856
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 2 with 306 rules applied. Total rules applied 8875 place count 2556 transition count 2856
Performed 459 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 459 Pre rules applied. Total rules applied 8875 place count 2556 transition count 2397
Deduced a syphon composed of 459 places in 1 ms
Ensure Unique test removed 153 places
Reduce places removed 612 places and 0 transitions.
Iterating global reduction 3 with 1071 rules applied. Total rules applied 9946 place count 1944 transition count 2397
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 10201 place count 1689 transition count 2142
Iterating global reduction 3 with 255 rules applied. Total rules applied 10456 place count 1689 transition count 2142
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 3 with 51 rules applied. Total rules applied 10507 place count 1689 transition count 2091
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 10558 place count 1638 transition count 2091
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 10563 place count 1633 transition count 1836
Iterating global reduction 5 with 5 rules applied. Total rules applied 10568 place count 1633 transition count 1836
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 5 with 102 rules applied. Total rules applied 10670 place count 1582 transition count 1785
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 10721 place count 1531 transition count 1785
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 10721 place count 1531 transition count 1734
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 10823 place count 1480 transition count 1734
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 10925 place count 1429 transition count 1683
Applied a total of 10925 rules in 341 ms. Remains 1429 /8891 variables (removed 7462) and now considering 1683/8929 (removed 7246) transitions.
// Phase 1: matrix 1683 rows 1429 cols
[2023-03-11 04:08:24] [INFO ] Computed 103 place invariants in 9 ms
[2023-03-11 04:08:25] [INFO ] Implicit Places using invariants in 525 ms returned [357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 1071, 1072, 1073, 1074, 1075, 1076, 1077, 1078, 1079, 1080, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1120, 1121, 1122]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 527 ms to find 103 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1326/8891 places, 1683/8929 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 1326 transition count 1377
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 1 with 306 rules applied. Total rules applied 612 place count 1020 transition count 1377
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -459
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 714 place count 969 transition count 1836
Applied a total of 714 rules in 46 ms. Remains 969 /1326 variables (removed 357) and now considering 1836/1683 (removed -153) transitions.
// Phase 1: matrix 1836 rows 969 cols
[2023-03-11 04:08:25] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-11 04:08:25] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-11 04:08:25] [INFO ] Invariant cache hit.
[2023-03-11 04:08:26] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 969/8891 places, 1836/8929 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1484 ms. Remains : 969/8891 places, 1836/8929 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s357 s358 s359 s360 s361 s362 s363 s364 s365 s366 s367 s368 s369 s370 s371 s372 s373 s374 s375 s376 s377 s378 s379 s380 s381 s382 s383 s384...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1092 reset in 2150 ms.
Product exploration explored 100000 steps with 1098 reset in 2181 ms.
Computed a total of 969 stabilizing places and 1836 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 969 transition count 1836
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 248 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 44 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 296 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-11 04:08:32] [INFO ] Invariant cache hit.
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 7 factoid took 171 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-12 finished in 11044 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 714 out of 8891 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8891/8891 places, 8929/8929 transitions.
Graph (complete) has 11883 edges and 8891 vertex of which 7353 are kept as prefixes of interest. Removing 1538 places using SCC suffix rule.8 ms
Discarding 1538 places :
Also discarding 1228 output transitions
Drop transitions removed 1228 transitions
Reduce places removed 51 places and 51 transitions.
Drop transitions removed 3519 transitions
Trivial Post-agglo rules discarded 3519 transitions
Performed 3519 trivial Post agglomeration. Transition count delta: 3519
Iterating post reduction 0 with 3519 rules applied. Total rules applied 3520 place count 7302 transition count 4131
Reduce places removed 3519 places and 0 transitions.
Performed 663 Post agglomeration using F-continuation condition.Transition count delta: 663
Iterating post reduction 1 with 4182 rules applied. Total rules applied 7702 place count 3783 transition count 3468
Reduce places removed 663 places and 0 transitions.
Iterating post reduction 2 with 663 rules applied. Total rules applied 8365 place count 3120 transition count 3468
Performed 408 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 408 Pre rules applied. Total rules applied 8365 place count 3120 transition count 3060
Deduced a syphon composed of 408 places in 1 ms
Ensure Unique test removed 153 places
Reduce places removed 561 places and 0 transitions.
Iterating global reduction 3 with 969 rules applied. Total rules applied 9334 place count 2559 transition count 3060
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 3 with 153 rules applied. Total rules applied 9487 place count 2559 transition count 2907
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 4 with 153 rules applied. Total rules applied 9640 place count 2406 transition count 2907
Discarding 359 places :
Symmetric choice reduction at 5 with 359 rule applications. Total rules 9999 place count 2047 transition count 2448
Iterating global reduction 5 with 359 rules applied. Total rules applied 10358 place count 2047 transition count 2448
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 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 5 with 255 rules applied. Total rules applied 10613 place count 1945 transition count 2295
Reduce places removed 51 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 6 with 102 rules applied. Total rules applied 10715 place count 1894 transition count 2244
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 7 with 51 rules applied. Total rules applied 10766 place count 1843 transition count 2244
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 102 Pre rules applied. Total rules applied 10766 place count 1843 transition count 2142
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 8 with 204 rules applied. Total rules applied 10970 place count 1741 transition count 2142
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 11072 place count 1690 transition count 2091
Applied a total of 11072 rules in 416 ms. Remains 1690 /8891 variables (removed 7201) and now considering 2091/8929 (removed 6838) transitions.
// Phase 1: matrix 2091 rows 1690 cols
[2023-03-11 04:08:36] [INFO ] Computed 104 place invariants in 18 ms
[2023-03-11 04:08:36] [INFO ] Implicit Places using invariants in 535 ms returned [357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 1434, 1435, 1436, 1437, 1438, 1439, 1440, 1441, 1442, 1443, 1444, 1445, 1446, 1447, 1448, 1449, 1450, 1451, 1452, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1467, 1468, 1469, 1470, 1471, 1472, 1473, 1474, 1475, 1476, 1477, 1478, 1479, 1480, 1481, 1482, 1483, 1484, 1587]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 538 ms to find 103 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1587/8891 places, 2091/8929 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 1587 transition count 1785
Reduce places removed 306 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 1 with 357 rules applied. Total rules applied 663 place count 1281 transition count 1734
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 714 place count 1230 transition count 1734
Applied a total of 714 rules in 40 ms. Remains 1230 /1587 variables (removed 357) and now considering 1734/2091 (removed 357) transitions.
// Phase 1: matrix 1734 rows 1230 cols
[2023-03-11 04:08:36] [INFO ] Computed 1 place invariants in 20 ms
[2023-03-11 04:08:36] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-11 04:08:36] [INFO ] Invariant cache hit.
[2023-03-11 04:08:37] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1230/8891 places, 1734/8929 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1915 ms. Remains : 1230/8891 places, 1734/8929 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT (ADD s1179 s1180 s1181 s1182 s1183 s1184 s1185 s1186 s1187 s1188 s1189 s1190 s1191 s1192 s1193 s1194 s1195 s1196 s1197 s1198 s1199 s1200 s1201 s120...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1318 steps with 3 reset in 23 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-13 finished in 2185 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((F(G(p0))&&(F(p1) U p0))))'
Support contains 102 out of 8891 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 8891/8891 places, 8929/8929 transitions.
Graph (complete) has 11883 edges and 8891 vertex of which 7863 are kept as prefixes of interest. Removing 1028 places using SCC suffix rule.10 ms
Discarding 1028 places :
Also discarding 871 output transitions
Drop transitions removed 871 transitions
Drop transitions removed 4998 transitions
Trivial Post-agglo rules discarded 4998 transitions
Performed 4998 trivial Post agglomeration. Transition count delta: 4998
Iterating post reduction 0 with 4998 rules applied. Total rules applied 4999 place count 7863 transition count 3060
Reduce places removed 4998 places and 0 transitions.
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: 306
Iterating post reduction 1 with 5304 rules applied. Total rules applied 10303 place count 2865 transition count 2754
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 2 with 306 rules applied. Total rules applied 10609 place count 2559 transition count 2754
Performed 561 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 561 Pre rules applied. Total rules applied 10609 place count 2559 transition count 2193
Deduced a syphon composed of 561 places in 1 ms
Ensure Unique test removed 306 places
Reduce places removed 867 places and 0 transitions.
Iterating global reduction 3 with 1428 rules applied. Total rules applied 12037 place count 1692 transition count 2193
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 3 with 153 rules applied. Total rules applied 12190 place count 1692 transition count 2040
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 4 with 153 rules applied. Total rules applied 12343 place count 1539 transition count 2040
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 12343 place count 1539 transition count 1989
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 12445 place count 1488 transition count 1989
Discarding 359 places :
Symmetric choice reduction at 5 with 359 rule applications. Total rules 12804 place count 1129 transition count 1530
Iterating global reduction 5 with 359 rules applied. Total rules applied 13163 place count 1129 transition count 1530
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 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 5 with 306 rules applied. Total rules applied 13469 place count 1027 transition count 1326
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 6 with 102 rules applied. Total rules applied 13571 place count 925 transition count 1326
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 13576 place count 920 transition count 1071
Iterating global reduction 7 with 5 rules applied. Total rules applied 13581 place count 920 transition count 1071
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 7 with 102 rules applied. Total rules applied 13683 place count 869 transition count 1020
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 8 with 51 rules applied. Total rules applied 13734 place count 818 transition count 1020
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 51 Pre rules applied. Total rules applied 13734 place count 818 transition count 969
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 9 with 102 rules applied. Total rules applied 13836 place count 767 transition count 969
Discarding 255 places :
Symmetric choice reduction at 9 with 255 rule applications. Total rules 14091 place count 512 transition count 714
Iterating global reduction 9 with 255 rules applied. Total rules applied 14346 place count 512 transition count 714
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 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 9 with 357 rules applied. Total rules applied 14703 place count 461 transition count 408
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 10 with 51 rules applied. Total rules applied 14754 place count 410 transition count 408
Applied a total of 14754 rules in 246 ms. Remains 410 /8891 variables (removed 8481) and now considering 408/8929 (removed 8521) transitions.
// Phase 1: matrix 408 rows 410 cols
[2023-03-11 04:08:38] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 04:08:38] [INFO ] Implicit Places using invariants in 122 ms returned [204, 256]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 124 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 408/8891 places, 408/8929 transitions.
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 408 transition count 306
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 204 place count 306 transition count 306
Applied a total of 204 rules in 6 ms. Remains 306 /408 variables (removed 102) and now considering 306/408 (removed 102) transitions.
// Phase 1: matrix 306 rows 306 cols
[2023-03-11 04:08:38] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 04:08:38] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-11 04:08:38] [INFO ] Invariant cache hit.
[2023-03-11 04:08:38] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 306/8891 places, 306/8929 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 530 ms. Remains : 306/8891 places, 306/8929 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 325 reset in 654 ms.
Product exploration explored 100000 steps with 325 reset in 690 ms.
Computed a total of 306 stabilizing places and 306 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 306 transition count 306
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 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-14 finished in 2099 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(p0))||G(p1))))'
Support contains 408 out of 8891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8891/8891 places, 8929/8929 transitions.
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 8839 transition count 8929
Discarding 208 places :
Symmetric choice reduction at 1 with 208 rule applications. Total rules 260 place count 8631 transition count 8621
Iterating global reduction 1 with 208 rules applied. Total rules applied 468 place count 8631 transition count 8621
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 519 place count 8580 transition count 8621
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 621 place count 8478 transition count 8519
Iterating global reduction 2 with 102 rules applied. Total rules applied 723 place count 8478 transition count 8519
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 825 place count 8376 transition count 8417
Iterating global reduction 2 with 102 rules applied. Total rules applied 927 place count 8376 transition count 8417
Applied a total of 927 rules in 6957 ms. Remains 8376 /8891 variables (removed 515) and now considering 8417/8929 (removed 512) transitions.
// Phase 1: matrix 8417 rows 8376 cols
[2023-03-11 04:08:46] [INFO ] Computed 617 place invariants in 146 ms
[2023-03-11 04:08:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:08:47] [INFO ] Implicit Places using invariants in 954 ms returned []
[2023-03-11 04:08:47] [INFO ] Invariant cache hit.
[2023-03-11 04:08:48] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:08:48] [INFO ] Implicit Places using invariants and state equation in 817 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
[2023-03-11 04:08:48] [INFO ] Invariant cache hit.
[2023-03-11 04:08:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:08:49] [INFO ] Dead Transitions using invariants and state equation in 794 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8376/8891 places, 8417/8929 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9528 ms. Remains : 8376/8891 places, 8417/8929 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(GT (ADD s6029 s6030 s6031 s6032 s6033 s6034 s6035 s6036 s6037 s6038 s6039 s6040 s6041 s6042 s6043 s6044 s6045 s6046 s6047 s6048 s6049 s6050 s6051 s605...], 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 2924 steps with 0 reset in 30 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-15 finished in 9735 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-COL-L00050M0005C002P002G001-LTLCardinality-01
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 408 out of 8891 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 8891/8891 places, 8929/8929 transitions.
Graph (complete) has 11883 edges and 8891 vertex of which 7149 are kept as prefixes of interest. Removing 1742 places using SCC suffix rule.13 ms
Discarding 1742 places :
Also discarding 1381 output transitions
Drop transitions removed 1381 transitions
Drop transitions removed 3978 transitions
Trivial Post-agglo rules discarded 3978 transitions
Performed 3978 trivial Post agglomeration. Transition count delta: 3978
Iterating post reduction 0 with 3978 rules applied. Total rules applied 3979 place count 7149 transition count 3570
Reduce places removed 3978 places and 0 transitions.
Performed 612 Post agglomeration using F-continuation condition.Transition count delta: 612
Iterating post reduction 1 with 4590 rules applied. Total rules applied 8569 place count 3171 transition count 2958
Reduce places removed 612 places and 0 transitions.
Iterating post reduction 2 with 612 rules applied. Total rules applied 9181 place count 2559 transition count 2958
Performed 306 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 306 Pre rules applied. Total rules applied 9181 place count 2559 transition count 2652
Deduced a syphon composed of 306 places in 1 ms
Ensure Unique test removed 153 places
Reduce places removed 459 places and 0 transitions.
Iterating global reduction 3 with 765 rules applied. Total rules applied 9946 place count 2100 transition count 2652
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 3 with 153 rules applied. Total rules applied 10099 place count 2100 transition count 2499
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 4 with 153 rules applied. Total rules applied 10252 place count 1947 transition count 2499
Discarding 359 places :
Symmetric choice reduction at 5 with 359 rule applications. Total rules 10611 place count 1588 transition count 2040
Iterating global reduction 5 with 359 rules applied. Total rules applied 10970 place count 1588 transition count 2040
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 5 with 255 rules applied. Total rules applied 11225 place count 1537 transition count 1836
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 6 with 102 rules applied. Total rules applied 11327 place count 1435 transition count 1836
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 11327 place count 1435 transition count 1785
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 11429 place count 1384 transition count 1785
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 11434 place count 1379 transition count 1530
Iterating global reduction 7 with 5 rules applied. Total rules applied 11439 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 7 with 102 rules applied. Total rules applied 11541 place count 1328 transition count 1479
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 8 with 51 rules applied. Total rules applied 11592 place count 1277 transition count 1479
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 51 Pre rules applied. Total rules applied 11592 place count 1277 transition count 1428
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 9 with 102 rules applied. Total rules applied 11694 place count 1226 transition count 1428
Applied a total of 11694 rules in 347 ms. Remains 1226 /8891 variables (removed 7665) and now considering 1428/8929 (removed 7501) transitions.
// Phase 1: matrix 1428 rows 1226 cols
[2023-03-11 04:08:50] [INFO ] Computed 53 place invariants in 13 ms
[2023-03-11 04:08:50] [INFO ] Implicit Places using invariants in 387 ms returned [408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 1122, 1174]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 389 ms to find 53 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1173/8891 places, 1428/8929 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 39 ms. Remains 816 /1173 variables (removed 357) and now considering 1071/1428 (removed 357) transitions.
// Phase 1: matrix 1071 rows 816 cols
[2023-03-11 04:08:50] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-11 04:08:50] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 04:08:50] [INFO ] Invariant cache hit.
[2023-03-11 04:08:50] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 816/8891 places, 1071/8929 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1195 ms. Remains : 816/8891 places, 1071/8929 transitions.
Running random walk in product with property : FamilyReunion-COL-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 20739 reset in 1202 ms.
Product exploration explored 100000 steps with 20741 reset in 1249 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 (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 219 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 24 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT 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 240 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 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-11 04:08:54] [INFO ] Invariant cache hit.
[2023-03-11 04:08:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:08:57] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2023-03-11 04:08:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:08:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:08:59] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2023-03-11 04:08:59] [INFO ] Computed and/alt/rep : 1020/1275/1020 causal constraints (skipped 0 transitions) in 105 ms.
[2023-03-11 04:09:00] [INFO ] Added : 51 causal constraints over 11 iterations in 819 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 6 ms. Remains 816 /816 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
[2023-03-11 04:09:00] [INFO ] Invariant cache hit.
[2023-03-11 04:09:00] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-11 04:09:00] [INFO ] Invariant cache hit.
[2023-03-11 04:09:00] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2023-03-11 04:09:00] [INFO ] Invariant cache hit.
[2023-03-11 04:09:01] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 809 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 (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 218 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 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 58 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT 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 226 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 117 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-11 04:09:02] [INFO ] Invariant cache hit.
[2023-03-11 04:09:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:09:04] [INFO ] [Real]Absence check using state equation in 731 ms returned sat
[2023-03-11 04:09:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:09:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:09:07] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2023-03-11 04:09:07] [INFO ] Computed and/alt/rep : 1020/1275/1020 causal constraints (skipped 0 transitions) in 50 ms.
[2023-03-11 04:09:08] [INFO ] Added : 51 causal constraints over 11 iterations in 669 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 20804 reset in 1212 ms.
Product exploration explored 100000 steps with 20676 reset in 1242 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 105 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 14 ms. Remains 816 /816 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
[2023-03-11 04:09:10] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-11 04:09:10] [INFO ] Invariant cache hit.
[2023-03-11 04:09:11] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 453 ms. Remains : 816/816 places, 1071/1071 transitions.
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 6 ms. Remains 816 /816 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
[2023-03-11 04:09:11] [INFO ] Invariant cache hit.
[2023-03-11 04:09:11] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-11 04:09:11] [INFO ] Invariant cache hit.
[2023-03-11 04:09:11] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2023-03-11 04:09:11] [INFO ] Invariant cache hit.
[2023-03-11 04:09:11] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 787 ms. Remains : 816/816 places, 1071/1071 transitions.
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLCardinality-01 finished in 22618 ms.
[2023-03-11 04:09:12] [INFO ] Flatten gal took : 203 ms
[2023-03-11 04:09:12] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-11 04:09:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8891 places, 8929 transitions and 21322 arcs took 49 ms.
Total runtime 331024 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1564/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15672480 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16061756 kB

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-COL-L00050M0005C002P002G001"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FamilyReunion-COL-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 r169-tall-167838855700315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00050M0005C002P002G001.tgz
mv FamilyReunion-COL-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 ;