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.r167-tall-167838853100420.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 lolaxred
Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853100420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 42M
-rw-r--r-- 1 mcc users 290K Feb 26 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Feb 26 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Feb 26 12:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Feb 26 12:48 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 170K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 700K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 327K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 869K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 15:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.3M Feb 26 15:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.8M Feb 26 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678476265194

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00100M0010C005P005G002
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 19:24:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 19:24:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 19:24:27] [INFO ] Load time of PNML (sax parser for PT used): 686 ms
[2023-03-10 19:24:27] [INFO ] Transformed 40605 places.
[2023-03-10 19:24:27] [INFO ] Transformed 36871 transitions.
[2023-03-10 19:24:27] [INFO ] Parsed PT model containing 40605 places and 36871 transitions and 112728 arcs in 998 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 72 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 31 places and 0 transitions.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9014 out of 40574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Reduce places removed 341 places and 0 transitions.
Discarding 4444 places :
Implicit places reduction removed 4444 places
Iterating post reduction 0 with 4785 rules applied. Total rules applied 4785 place count 35789 transition count 36871
Applied a total of 4785 rules in 982 ms. Remains 35789 /40574 variables (removed 4785) and now considering 36871/36871 (removed 0) transitions.
// Phase 1: matrix 36871 rows 35789 cols
[2023-03-10 19:24:32] [INFO ] Computed 4146 place invariants in 2708 ms
[2023-03-10 19:24:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:24:35] [INFO ] Implicit Places using invariants in 6053 ms returned []
Implicit Place search using SMT only with invariants took 6078 ms to find 0 implicit places.
[2023-03-10 19:24:35] [INFO ] Invariant cache hit.
[2023-03-10 19:24:38] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:24:38] [INFO ] Dead Transitions using invariants and state equation in 3047 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 35789/40574 places, 36871/36871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10120 ms. Remains : 35789/40574 places, 36871/36871 transitions.
Support contains 9014 out of 35789 places after structural reductions.
[2023-03-10 19:24:40] [INFO ] Flatten gal took : 1273 ms
[2023-03-10 19:24:41] [INFO ] Flatten gal took : 925 ms
[2023-03-10 19:24:43] [INFO ] Input system was already deterministic with 36871 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1040 ms. (steps per millisecond=9 ) properties (out of 25) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-10 19:24:45] [INFO ] Invariant cache hit.
[2023-03-10 19:25:01] [INFO ] [Real]Absence check using 0 positive and 4146 generalized place invariants in 4650 ms returned sat
[2023-03-10 19:25:11] [INFO ] After 8019ms SMT Verify possible using state equation in real domain returned unsat :0 sat :0 real:12
[2023-03-10 19:25:11] [INFO ] After 8066ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-10 19:25:11] [INFO ] After 25069ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-10 19:25:25] [INFO ] [Nat]Absence check using 0 positive and 4146 generalized place invariants in 4625 ms returned sat
[2023-03-10 19:25:36] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 521 out of 35789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35789/35789 places, 36871/36871 transitions.
Graph (complete) has 52722 edges and 35789 vertex of which 35177 are kept as prefixes of interest. Removing 612 places using SCC suffix rule.64 ms
Discarding 612 places :
Also discarding 511 output transitions
Drop transitions removed 511 transitions
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Discarding 2222 places :
Implicit places reduction removed 2222 places
Drop transitions removed 19276 transitions
Trivial Post-agglo rules discarded 19276 transitions
Performed 19276 trivial Post agglomeration. Transition count delta: 19276
Iterating post reduction 0 with 21801 rules applied. Total rules applied 21802 place count 32955 transition count 16781
Reduce places removed 19276 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 19280 rules applied. Total rules applied 41082 place count 13679 transition count 16777
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41086 place count 13675 transition count 16777
Performed 1717 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1717 Pre rules applied. Total rules applied 41086 place count 13675 transition count 15060
Deduced a syphon composed of 1717 places in 9 ms
Ensure Unique test removed 909 places
Reduce places removed 2626 places and 0 transitions.
Iterating global reduction 3 with 4343 rules applied. Total rules applied 45429 place count 11049 transition count 15060
Drop transitions removed 704 transitions
Trivial Post-agglo rules discarded 704 transitions
Performed 704 trivial Post agglomeration. Transition count delta: 704
Iterating post reduction 3 with 704 rules applied. Total rules applied 46133 place count 11049 transition count 14356
Reduce places removed 704 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 705 rules applied. Total rules applied 46838 place count 10345 transition count 14355
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 46839 place count 10344 transition count 14355
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 46839 place count 10344 transition count 14354
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 46841 place count 10343 transition count 14354
Discarding 4746 places :
Symmetric choice reduction at 6 with 4746 rule applications. Total rules 51587 place count 5597 transition count 9608
Iterating global reduction 6 with 4746 rules applied. Total rules applied 56333 place count 5597 transition count 9608
Ensure Unique test removed 503 transitions
Reduce isomorphic transitions removed 503 transitions.
Discarding 199 places :
Implicit places reduction removed 199 places
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 6 with 1402 rules applied. Total rules applied 57735 place count 5398 transition count 8405
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 7 with 700 rules applied. Total rules applied 58435 place count 4698 transition count 8405
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 203 Pre rules applied. Total rules applied 58435 place count 4698 transition count 8202
Deduced a syphon composed of 203 places in 9 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 8 with 406 rules applied. Total rules applied 58841 place count 4495 transition count 8202
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 58856 place count 4480 transition count 6687
Iterating global reduction 8 with 15 rules applied. Total rules applied 58871 place count 4480 transition count 6687
Ensure Unique test removed 503 transitions
Reduce isomorphic transitions removed 503 transitions.
Discarding 301 places :
Implicit places reduction removed 301 places
Drop transitions removed 300 transitions
Trivial Post-agglo rules discarded 300 transitions
Performed 300 trivial Post agglomeration. Transition count delta: 300
Iterating post reduction 8 with 1104 rules applied. Total rules applied 59975 place count 4179 transition count 5884
Reduce places removed 300 places and 0 transitions.
Iterating post reduction 9 with 300 rules applied. Total rules applied 60275 place count 3879 transition count 5884
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 202 Pre rules applied. Total rules applied 60275 place count 3879 transition count 5682
Deduced a syphon composed of 202 places in 2 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 10 with 404 rules applied. Total rules applied 60679 place count 3677 transition count 5682
Discarding 1007 places :
Symmetric choice reduction at 10 with 1007 rule applications. Total rules 61686 place count 2670 transition count 4675
Iterating global reduction 10 with 1007 rules applied. Total rules applied 62693 place count 2670 transition count 4675
Ensure Unique test removed 1007 transitions
Reduce isomorphic transitions removed 1007 transitions.
Discarding 98 places :
Implicit places reduction removed 98 places
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 10 with 1301 rules applied. Total rules applied 63994 place count 2572 transition count 3472
Reduce places removed 196 places and 0 transitions.
Iterating post reduction 11 with 196 rules applied. Total rules applied 64190 place count 2376 transition count 3472
Performed 206 Post agglomeration using F-continuation condition.Transition count delta: 206
Deduced a syphon composed of 206 places in 3 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 12 with 412 rules applied. Total rules applied 64602 place count 2170 transition count 3266
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 64604 place count 2170 transition count 3264
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 2 rules applied. Total rules applied 64606 place count 2169 transition count 3263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 64607 place count 2168 transition count 3263
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 64612 place count 2168 transition count 3258
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 64617 place count 2163 transition count 3258
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 64622 place count 2163 transition count 3253
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 64627 place count 2158 transition count 3253
Reduce places removed 98 places and 98 transitions.
Iterating global reduction 16 with 98 rules applied. Total rules applied 64725 place count 2060 transition count 3155
Applied a total of 64725 rules in 4455 ms. Remains 2060 /35789 variables (removed 33729) and now considering 3155/36871 (removed 33716) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4456 ms. Remains : 2060/35789 places, 3155/36871 transitions.
Finished random walk after 7767 steps, including 14 resets, run visited all 13 properties in 183 ms. (steps per millisecond=42 )
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 35789 stabilizing places and 36871 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35789 transition count 36871
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(p0)||F(G(p1))))'
Support contains 1717 out of 35789 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35789/35789 places, 36871/36871 transitions.
Graph (complete) has 52722 edges and 35789 vertex of which 31529 are kept as prefixes of interest. Removing 4260 places using SCC suffix rule.47 ms
Discarding 4260 places :
Also discarding 5056 output transitions
Drop transitions removed 5056 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 2222 places :
Implicit places reduction removed 2222 places
Drop transitions removed 16160 transitions
Trivial Post-agglo rules discarded 16160 transitions
Performed 16160 trivial Post agglomeration. Transition count delta: 16160
Iterating post reduction 0 with 18382 rules applied. Total rules applied 18383 place count 29206 transition count 15554
Reduce places removed 16160 places and 0 transitions.
Performed 1111 Post agglomeration using F-continuation condition.Transition count delta: 1111
Iterating post reduction 1 with 17271 rules applied. Total rules applied 35654 place count 13046 transition count 14443
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 2 with 1111 rules applied. Total rules applied 36765 place count 11935 transition count 14443
Performed 1818 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1818 Pre rules applied. Total rules applied 36765 place count 11935 transition count 12625
Deduced a syphon composed of 1818 places in 5 ms
Ensure Unique test removed 909 places
Reduce places removed 2727 places and 0 transitions.
Iterating global reduction 3 with 4545 rules applied. Total rules applied 41310 place count 9208 transition count 12625
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 3 with 606 rules applied. Total rules applied 41916 place count 9208 transition count 12019
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 4 with 606 rules applied. Total rules applied 42522 place count 8602 transition count 12019
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 42522 place count 8602 transition count 11918
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 42724 place count 8501 transition count 11918
Discarding 3535 places :
Symmetric choice reduction at 5 with 3535 rule applications. Total rules 46259 place count 4966 transition count 8383
Iterating global reduction 5 with 3535 rules applied. Total rules applied 49794 place count 4966 transition count 8383
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 5 with 1313 rules applied. Total rules applied 51107 place count 4764 transition count 7272
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 6 with 606 rules applied. Total rules applied 51713 place count 4158 transition count 7272
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 101 Pre rules applied. Total rules applied 51713 place count 4158 transition count 7171
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 51915 place count 4057 transition count 7171
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 51930 place count 4042 transition count 5656
Iterating global reduction 7 with 15 rules applied. Total rules applied 51945 place count 4042 transition count 5656
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 7 with 909 rules applied. Total rules applied 52854 place count 3840 transition count 4949
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 8 with 202 rules applied. Total rules applied 53056 place count 3638 transition count 4949
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 53056 place count 3638 transition count 4848
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 53258 place count 3537 transition count 4848
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 53460 place count 3436 transition count 4747
Applied a total of 53460 rules in 2626 ms. Remains 3436 /35789 variables (removed 32353) and now considering 4747/36871 (removed 32124) transitions.
// Phase 1: matrix 4747 rows 3436 cols
[2023-03-10 19:25:44] [INFO ] Computed 204 place invariants in 50 ms
[2023-03-10 19:25:46] [INFO ] Implicit Places using invariants in 2087 ms returned [101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 3131, 3132, 3133, 3134, 3135, 3136, 3137, 3138, 3139, 3140, 3141, 3142, 3143, 3144, 3145, 3146, 3147, 3148, 3149, 3150, 3151, 3152, 3153, 3154, 3155, 3156, 3157, 3158, 3159, 3160, 3161, 3162, 3163, 3164, 3165, 3166, 3167, 3168, 3169, 3170, 3171, 3172, 3173, 3174, 3175, 3176, 3177, 3178, 3179, 3180, 3181, 3182, 3183, 3184, 3185, 3186, 3187, 3188, 3189, 3190, 3191, 3192, 3193, 3194, 3195, 3196, 3197, 3198, 3199, 3200, 3201, 3202, 3203, 3204, 3205, 3206, 3207, 3208, 3209, 3210, 3211, 3212, 3213, 3214, 3215, 3216, 3217, 3218, 3219, 3220, 3221, 3222, 3223, 3224, 3225, 3226, 3227, 3228, 3229, 3230, 3231, 3232, 3233]
Discarding 204 places :
Implicit Place search using SMT only with invariants took 2100 ms to find 204 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3232/35789 places, 4747/36871 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 3232 transition count 4646
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 3131 transition count 4646
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 3131 transition count 4545
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 3030 transition count 4545
Applied a total of 404 rules in 100 ms. Remains 3030 /3232 variables (removed 202) and now considering 4545/4747 (removed 202) transitions.
// Phase 1: matrix 4545 rows 3030 cols
[2023-03-10 19:25:46] [INFO ] Computed 0 place invariants in 10 ms
[2023-03-10 19:25:46] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-10 19:25:46] [INFO ] Invariant cache hit.
[2023-03-10 19:25:47] [INFO ] Implicit Places using invariants and state equation in 723 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3030/35789 places, 4545/36871 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5828 ms. Remains : 3030/35789 places, 4545/36871 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s1338 1) (GEQ s1273 1) (GEQ s1403 1) (GEQ s1793 1) (GEQ s1728 1) (GEQ s1533 1) (GEQ s1663 1) (GEQ s1468 1) (GEQ s1598 1) (GEQ s1419 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 505 steps with 0 reset in 58 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-01 finished in 6165 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)))'
Support contains 6 out of 35789 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35789/35789 places, 36871/36871 transitions.
Graph (complete) has 52722 edges and 35789 vertex of which 27590 are kept as prefixes of interest. Removing 8199 places using SCC suffix rule.36 ms
Discarding 8199 places :
Also discarding 9494 output transitions
Drop transitions removed 9494 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 2222 places :
Implicit places reduction removed 2222 places
Drop transitions removed 17069 transitions
Trivial Post-agglo rules discarded 17069 transitions
Performed 17069 trivial Post agglomeration. Transition count delta: 17069
Iterating post reduction 0 with 19291 rules applied. Total rules applied 19292 place count 25267 transition count 10207
Reduce places removed 17069 places and 0 transitions.
Iterating post reduction 1 with 17069 rules applied. Total rules applied 36361 place count 8198 transition count 10207
Performed 2020 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2020 Pre rules applied. Total rules applied 36361 place count 8198 transition count 8187
Deduced a syphon composed of 2020 places in 2 ms
Ensure Unique test removed 606 places
Reduce places removed 2626 places and 0 transitions.
Iterating global reduction 2 with 4646 rules applied. Total rules applied 41007 place count 5572 transition count 8187
Discarding 3125 places :
Symmetric choice reduction at 2 with 3125 rule applications. Total rules 44132 place count 2447 transition count 5062
Iterating global reduction 2 with 3125 rules applied. Total rules applied 47257 place count 2447 transition count 5062
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 2 with 909 rules applied. Total rules applied 48166 place count 2346 transition count 4254
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 3 with 303 rules applied. Total rules applied 48469 place count 2043 transition count 4254
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 48469 place count 2043 transition count 4153
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 4 with 303 rules applied. Total rules applied 48772 place count 1841 transition count 4153
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 48772 place count 1841 transition count 4052
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 48974 place count 1740 transition count 4052
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 48984 place count 1730 transition count 3042
Iterating global reduction 4 with 10 rules applied. Total rules applied 48994 place count 1730 transition count 3042
Discarding 1010 places :
Symmetric choice reduction at 4 with 1010 rule applications. Total rules 50004 place count 720 transition count 2032
Iterating global reduction 4 with 1010 rules applied. Total rules applied 51014 place count 720 transition count 2032
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 4 with 1010 rules applied. Total rules applied 52024 place count 720 transition count 1022
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 52024 place count 720 transition count 921
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 5 with 303 rules applied. Total rules applied 52327 place count 518 transition count 921
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 52529 place count 417 transition count 820
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 5 with 101 rules applied. Total rules applied 52630 place count 316 transition count 719
Applied a total of 52630 rules in 1823 ms. Remains 316 /35789 variables (removed 35473) and now considering 719/36871 (removed 36152) transitions.
// Phase 1: matrix 719 rows 316 cols
[2023-03-10 19:25:49] [INFO ] Computed 102 place invariants in 4 ms
[2023-03-10 19:25:49] [INFO ] Implicit Places using invariants in 341 ms returned [0, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202]
Discarding 102 places :
Implicit Place search using SMT only with invariants took 344 ms to find 102 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 214/35789 places, 719/36871 transitions.
Reduce places removed 101 places and 101 transitions.
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 100 place count 13 transition count 18
Iterating global reduction 0 with 100 rules applied. Total rules applied 200 place count 13 transition count 18
Applied a total of 200 rules in 3 ms. Remains 13 /214 variables (removed 201) and now considering 18/719 (removed 701) transitions.
// Phase 1: matrix 18 rows 13 cols
[2023-03-10 19:25:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 19:25:49] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-10 19:25:49] [INFO ] Invariant cache hit.
[2023-03-10 19:25:49] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/35789 places, 18/36871 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2214 ms. Remains : 13/35789 places, 18/36871 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-02 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 (GEQ s12 1) (GEQ s9 1) (GEQ s8 1) (GEQ s11 1) (GEQ s10 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 504 steps with 27 reset in 6 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-02 finished in 2318 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((X(G(p0))&&G((p1&&X(G(p2)))))))'
Support contains 1313 out of 35789 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35789/35789 places, 36871/36871 transitions.
Graph (complete) has 52722 edges and 35789 vertex of which 34770 are kept as prefixes of interest. Removing 1019 places using SCC suffix rule.32 ms
Discarding 1019 places :
Also discarding 1420 output transitions
Drop transitions removed 1420 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 2222 places :
Implicit places reduction removed 2222 places
Drop transitions removed 16463 transitions
Trivial Post-agglo rules discarded 16463 transitions
Performed 16463 trivial Post agglomeration. Transition count delta: 16463
Iterating post reduction 0 with 18685 rules applied. Total rules applied 18686 place count 32447 transition count 18887
Reduce places removed 16463 places and 0 transitions.
Performed 1111 Post agglomeration using F-continuation condition.Transition count delta: 1111
Iterating post reduction 1 with 17574 rules applied. Total rules applied 36260 place count 15984 transition count 17776
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 2 with 1111 rules applied. Total rules applied 37371 place count 14873 transition count 17776
Performed 1717 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1717 Pre rules applied. Total rules applied 37371 place count 14873 transition count 16059
Deduced a syphon composed of 1717 places in 9 ms
Ensure Unique test removed 909 places
Reduce places removed 2626 places and 0 transitions.
Iterating global reduction 3 with 4343 rules applied. Total rules applied 41714 place count 12247 transition count 16059
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 3 with 707 rules applied. Total rules applied 42421 place count 12247 transition count 15352
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 4 with 707 rules applied. Total rules applied 43128 place count 11540 transition count 15352
Discarding 4747 places :
Symmetric choice reduction at 5 with 4747 rule applications. Total rules 47875 place count 6793 transition count 10605
Iterating global reduction 5 with 4747 rules applied. Total rules applied 52622 place count 6793 transition count 10605
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 5 with 1313 rules applied. Total rules applied 53935 place count 6591 transition count 9494
Reduce places removed 606 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 6 with 707 rules applied. Total rules applied 54642 place count 5985 transition count 9393
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 7 with 101 rules applied. Total rules applied 54743 place count 5884 transition count 9393
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 202 Pre rules applied. Total rules applied 54743 place count 5884 transition count 9191
Deduced a syphon composed of 202 places in 3 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 404 rules applied. Total rules applied 55147 place count 5682 transition count 9191
Discarding 22 places :
Symmetric choice reduction at 8 with 22 rule applications. Total rules 55169 place count 5660 transition count 6969
Iterating global reduction 8 with 22 rules applied. Total rules applied 55191 place count 5660 transition count 6969
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 505 places :
Implicit places reduction removed 505 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 8 with 1717 rules applied. Total rules applied 56908 place count 5155 transition count 5757
Reduce places removed 202 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 9 with 303 rules applied. Total rules applied 57211 place count 4953 transition count 5656
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 10 with 101 rules applied. Total rules applied 57312 place count 4852 transition count 5656
Performed 303 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 303 Pre rules applied. Total rules applied 57312 place count 4852 transition count 5353
Deduced a syphon composed of 303 places in 1 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 11 with 606 rules applied. Total rules applied 57918 place count 4549 transition count 5353
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 11 with 202 rules applied. Total rules applied 58120 place count 4448 transition count 5252
Applied a total of 58120 rules in 3777 ms. Remains 4448 /35789 variables (removed 31341) and now considering 5252/36871 (removed 31619) transitions.
// Phase 1: matrix 5252 rows 4448 cols
[2023-03-10 19:25:53] [INFO ] Computed 206 place invariants in 80 ms
[2023-03-10 19:25:55] [INFO ] Implicit Places using invariants in 1439 ms returned [115, 149, 199, 1456, 1477]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1445 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4443/35789 places, 5252/36871 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 4443 transition count 5219
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 4410 transition count 5219
Applied a total of 66 rules in 315 ms. Remains 4410 /4443 variables (removed 33) and now considering 5219/5252 (removed 33) transitions.
// Phase 1: matrix 5219 rows 4410 cols
[2023-03-10 19:25:55] [INFO ] Computed 201 place invariants in 91 ms
[2023-03-10 19:25:56] [INFO ] Implicit Places using invariants in 1345 ms returned [123, 140, 1433, 1448, 1469]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1349 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4405/35789 places, 5219/36871 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 4405 transition count 5197
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 4383 transition count 5197
Applied a total of 44 rules in 258 ms. Remains 4383 /4405 variables (removed 22) and now considering 5197/5219 (removed 22) transitions.
// Phase 1: matrix 5197 rows 4383 cols
[2023-03-10 19:25:57] [INFO ] Computed 196 place invariants in 79 ms
[2023-03-10 19:25:58] [INFO ] Implicit Places using invariants in 1326 ms returned [125, 1365, 1386, 1414, 1442]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1330 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4378/35789 places, 5197/36871 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 4378 transition count 5186
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 4367 transition count 5186
Applied a total of 22 rules in 260 ms. Remains 4367 /4378 variables (removed 11) and now considering 5186/5197 (removed 11) transitions.
// Phase 1: matrix 5186 rows 4367 cols
[2023-03-10 19:25:58] [INFO ] Computed 191 place invariants in 80 ms
[2023-03-10 19:25:59] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:25:59] [INFO ] Implicit Places using invariants in 1368 ms returned [102, 166, 183, 1369, 1411]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1371 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 4362/35789 places, 5186/36871 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 4362 transition count 5153
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 4329 transition count 5153
Applied a total of 66 rules in 245 ms. Remains 4329 /4362 variables (removed 33) and now considering 5153/5186 (removed 33) transitions.
// Phase 1: matrix 5153 rows 4329 cols
[2023-03-10 19:26:00] [INFO ] Computed 186 place invariants in 79 ms
[2023-03-10 19:26:01] [INFO ] Implicit Places using invariants in 1301 ms returned [110, 116, 1340, 1353, 1391]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1307 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 4324/35789 places, 5153/36871 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 4324 transition count 5131
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 4302 transition count 5131
Applied a total of 44 rules in 287 ms. Remains 4302 /4324 variables (removed 22) and now considering 5131/5153 (removed 22) transitions.
// Phase 1: matrix 5131 rows 4302 cols
[2023-03-10 19:26:01] [INFO ] Computed 181 place invariants in 78 ms
[2023-03-10 19:26:03] [INFO ] Implicit Places using invariants in 1305 ms returned [148, 172, 1284, 1295, 1364]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1309 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 6 : 4297/35789 places, 5131/36871 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 4297 transition count 5109
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 4275 transition count 5109
Applied a total of 44 rules in 245 ms. Remains 4275 /4297 variables (removed 22) and now considering 5109/5131 (removed 22) transitions.
// Phase 1: matrix 5109 rows 4275 cols
[2023-03-10 19:26:03] [INFO ] Computed 176 place invariants in 79 ms
[2023-03-10 19:26:04] [INFO ] Implicit Places using invariants in 1257 ms returned [132, 138, 144, 1272, 1330]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1261 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 7 : 4270/35789 places, 5109/36871 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 4270 transition count 5076
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 4237 transition count 5076
Applied a total of 66 rules in 241 ms. Remains 4237 /4270 variables (removed 33) and now considering 5076/5109 (removed 33) transitions.
// Phase 1: matrix 5076 rows 4237 cols
[2023-03-10 19:26:04] [INFO ] Computed 171 place invariants in 75 ms
[2023-03-10 19:26:06] [INFO ] Implicit Places using invariants in 1240 ms returned [154, 1272, 1279, 1281, 1288]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1243 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 8 : 4232/35789 places, 5076/36871 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 4232 transition count 5065
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 4221 transition count 5065
Applied a total of 22 rules in 230 ms. Remains 4221 /4232 variables (removed 11) and now considering 5065/5076 (removed 11) transitions.
// Phase 1: matrix 5065 rows 4221 cols
[2023-03-10 19:26:06] [INFO ] Computed 166 place invariants in 77 ms
[2023-03-10 19:26:07] [INFO ] Implicit Places using invariants in 1157 ms returned [109, 123, 1218, 1234, 1262]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1170 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 9 : 4216/35789 places, 5065/36871 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 4216 transition count 5043
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 4194 transition count 5043
Applied a total of 44 rules in 274 ms. Remains 4194 /4216 variables (removed 22) and now considering 5043/5065 (removed 22) transitions.
// Phase 1: matrix 5043 rows 4194 cols
[2023-03-10 19:26:07] [INFO ] Computed 161 place invariants in 76 ms
[2023-03-10 19:26:08] [INFO ] Implicit Places using invariants in 1220 ms returned [119, 139, 176, 182, 1245]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1224 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 10 : 4189/35789 places, 5043/36871 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 4189 transition count 4999
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 4145 transition count 4999
Applied a total of 88 rules in 220 ms. Remains 4145 /4189 variables (removed 44) and now considering 4999/5043 (removed 44) transitions.
// Phase 1: matrix 4999 rows 4145 cols
[2023-03-10 19:26:09] [INFO ] Computed 156 place invariants in 80 ms
[2023-03-10 19:26:10] [INFO ] Implicit Places using invariants in 1134 ms returned [1144, 1160, 1181, 1192, 1206]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1140 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 11 : 4140/35789 places, 4999/36871 transitions.
Applied a total of 0 rules in 207 ms. Remains 4140 /4140 variables (removed 0) and now considering 4999/4999 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 12 iterations and 20720 ms. Remains : 4140/35789 places, 4999/36871 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p1) p2)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0, 1, 2} source=0 dest: 0}, { cond=p1, acceptance={0, 1, 2} source=0 dest: 1}, { cond=p1, acceptance={0, 1, 2} source=0 dest: 2}, { cond=p1, acceptance={1, 2} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=p0, acceptance={0, 2} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=p2, acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1, 2} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={1, 2} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s3643 1) (GEQ s3708 1) (GEQ s3639 1) (GEQ s3712 1) (GEQ s3651 1) (GEQ s3700 1) (GEQ s3647 1) (GEQ s3704 1) (GEQ s3692 1) (GEQ s3696 1) (GEQ s3...], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 895 steps with 0 reset in 39 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-03 finished in 21019 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((p0&&G(p1)&&X(F(p2)))))'
Support contains 4854 out of 35789 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35789/35789 places, 36871/36871 transitions.
Applied a total of 0 rules in 182 ms. Remains 35789 /35789 variables (removed 0) and now considering 36871/36871 (removed 0) transitions.
// Phase 1: matrix 36871 rows 35789 cols
[2023-03-10 19:26:13] [INFO ] Computed 4146 place invariants in 2340 ms
[2023-03-10 19:26:15] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:26:15] [INFO ] Implicit Places using invariants in 4975 ms returned []
Implicit Place search using SMT only with invariants took 4983 ms to find 0 implicit places.
[2023-03-10 19:26:16] [INFO ] Invariant cache hit.
[2023-03-10 19:26:18] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:26:18] [INFO ] Dead Transitions using invariants and state equation in 2632 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7799 ms. Remains : 35789/35789 places, 36871/36871 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (AND (GEQ s19994 1) (GEQ s22418 1)) (AND (GEQ s20024 1) (GEQ s22448 1)) (AND (GEQ s19422 1) (GEQ s21846 1)) (AND (GEQ s19432 1) (GEQ s21856 1)) (AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-04 finished in 8137 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((G(p1)||p0))))'
Support contains 404 out of 35789 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35789/35789 places, 36871/36871 transitions.
Graph (complete) has 52722 edges and 35789 vertex of which 35177 are kept as prefixes of interest. Removing 612 places using SCC suffix rule.32 ms
Discarding 612 places :
Also discarding 511 output transitions
Drop transitions removed 511 transitions
Reduce places removed 101 places and 101 transitions.
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Discarding 2222 places :
Implicit places reduction removed 2222 places
Drop transitions removed 19897 transitions
Trivial Post-agglo rules discarded 19897 transitions
Performed 19897 trivial Post agglomeration. Transition count delta: 19897
Iterating post reduction 0 with 22422 rules applied. Total rules applied 22423 place count 32854 transition count 16059
Reduce places removed 19897 places and 0 transitions.
Iterating post reduction 1 with 19897 rules applied. Total rules applied 42320 place count 12957 transition count 16059
Performed 1717 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1717 Pre rules applied. Total rules applied 42320 place count 12957 transition count 14342
Deduced a syphon composed of 1717 places in 8 ms
Ensure Unique test removed 909 places
Reduce places removed 2626 places and 0 transitions.
Iterating global reduction 2 with 4343 rules applied. Total rules applied 46663 place count 10331 transition count 14342
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 2 with 707 rules applied. Total rules applied 47370 place count 10331 transition count 13635
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 3 with 707 rules applied. Total rules applied 48077 place count 9624 transition count 13635
Discarding 4747 places :
Symmetric choice reduction at 4 with 4747 rule applications. Total rules 52824 place count 4877 transition count 8888
Iterating global reduction 4 with 4747 rules applied. Total rules applied 57571 place count 4877 transition count 8888
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 808 transitions
Trivial Post-agglo rules discarded 808 transitions
Performed 808 trivial Post agglomeration. Transition count delta: 808
Iterating post reduction 4 with 1515 rules applied. Total rules applied 59086 place count 4675 transition count 7575
Reduce places removed 808 places and 0 transitions.
Iterating post reduction 5 with 808 rules applied. Total rules applied 59894 place count 3867 transition count 7575
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 101 Pre rules applied. Total rules applied 59894 place count 3867 transition count 7474
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 60096 place count 3766 transition count 7474
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 60116 place count 3746 transition count 5454
Iterating global reduction 6 with 20 rules applied. Total rules applied 60136 place count 3746 transition count 5454
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 404 places :
Implicit places reduction removed 404 places
Drop transitions removed 404 transitions
Trivial Post-agglo rules discarded 404 transitions
Performed 404 trivial Post agglomeration. Transition count delta: 404
Iterating post reduction 6 with 1818 rules applied. Total rules applied 61954 place count 3342 transition count 4040
Reduce places removed 404 places and 0 transitions.
Iterating post reduction 7 with 404 rules applied. Total rules applied 62358 place count 2938 transition count 4040
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 202 Pre rules applied. Total rules applied 62358 place count 2938 transition count 3838
Deduced a syphon composed of 202 places in 1 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 404 rules applied. Total rules applied 62762 place count 2736 transition count 3838
Discarding 1010 places :
Symmetric choice reduction at 8 with 1010 rule applications. Total rules 63772 place count 1726 transition count 2828
Iterating global reduction 8 with 1010 rules applied. Total rules applied 64782 place count 1726 transition count 2828
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 8 with 1010 rules applied. Total rules applied 65792 place count 1726 transition count 1818
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 65792 place count 1726 transition count 1717
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 303 rules applied. Total rules applied 66095 place count 1524 transition count 1717
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Deduced a syphon composed of 202 places in 0 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 404 rules applied. Total rules applied 66499 place count 1322 transition count 1515
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 9 with 101 rules applied. Total rules applied 66600 place count 1221 transition count 1414
Applied a total of 66600 rules in 2344 ms. Remains 1221 /35789 variables (removed 34568) and now considering 1414/36871 (removed 35457) transitions.
// Phase 1: matrix 1414 rows 1221 cols
[2023-03-10 19:26:21] [INFO ] Computed 207 place invariants in 16 ms
[2023-03-10 19:26:21] [INFO ] Implicit Places using invariants in 682 ms returned [0, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 815, 1119]
Discarding 205 places :
Implicit Place search using SMT only with invariants took 685 ms to find 205 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1016/35789 places, 1414/36871 transitions.
Reduce places removed 101 places and 101 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 915 transition count 1212
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 814 transition count 1212
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 814 transition count 1111
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 713 transition count 1111
Applied a total of 404 rules in 22 ms. Remains 713 /1016 variables (removed 303) and now considering 1111/1414 (removed 303) transitions.
// Phase 1: matrix 1111 rows 713 cols
[2023-03-10 19:26:22] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-10 19:26:22] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-10 19:26:22] [INFO ] Invariant cache hit.
[2023-03-10 19:26:22] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 713/35789 places, 1111/36871 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3915 ms. Remains : 713/35789 places, 1111/36871 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s362 1) (GEQ s587 1) (GEQ s406 1) (GEQ s391 1) (GEQ s602 1) (GEQ s464 1) (GEQ s377 1) (GEQ s449 1) (GEQ s478 1) (GEQ s529 1) (GEQ s515 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 19 steps with 1 reset in 0 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-05 finished in 4032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1111 out of 35789 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35789/35789 places, 36871/36871 transitions.
Graph (complete) has 52722 edges and 35789 vertex of which 19504 are kept as prefixes of interest. Removing 16285 places using SCC suffix rule.26 ms
Discarding 16285 places :
Also discarding 17681 output transitions
Drop transitions removed 17681 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 2222 places :
Implicit places reduction removed 2222 places
Drop transitions removed 13433 transitions
Trivial Post-agglo rules discarded 13433 transitions
Performed 13433 trivial Post agglomeration. Transition count delta: 13433
Iterating post reduction 0 with 15655 rules applied. Total rules applied 15656 place count 17181 transition count 5656
Reduce places removed 13433 places and 0 transitions.
Iterating post reduction 1 with 13433 rules applied. Total rules applied 29089 place count 3748 transition count 5656
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 29089 place count 3748 transition count 5555
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 29291 place count 3647 transition count 5555
Discarding 1010 places :
Symmetric choice reduction at 2 with 1010 rule applications. Total rules 30301 place count 2637 transition count 4545
Iterating global reduction 2 with 1010 rules applied. Total rules applied 31311 place count 2637 transition count 4545
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 31311 place count 2637 transition count 4444
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 31513 place count 2536 transition count 4444
Applied a total of 31513 rules in 900 ms. Remains 2536 /35789 variables (removed 33253) and now considering 4444/36871 (removed 32427) transitions.
// Phase 1: matrix 4444 rows 2536 cols
[2023-03-10 19:26:23] [INFO ] Computed 102 place invariants in 27 ms
[2023-03-10 19:26:25] [INFO ] Implicit Places using invariants in 1163 ms returned [101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 1171 ms to find 101 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2435/35789 places, 4444/36871 transitions.
Drop transitions removed 1111 transitions
Trivial Post-agglo rules discarded 1111 transitions
Performed 1111 trivial Post agglomeration. Transition count delta: 1111
Iterating post reduction 0 with 1111 rules applied. Total rules applied 1111 place count 2435 transition count 3333
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 1 with 1111 rules applied. Total rules applied 2222 place count 1324 transition count 3333
Applied a total of 2222 rules in 51 ms. Remains 1324 /2435 variables (removed 1111) and now considering 3333/4444 (removed 1111) transitions.
// Phase 1: matrix 3333 rows 1324 cols
[2023-03-10 19:26:25] [INFO ] Computed 1 place invariants in 28 ms
[2023-03-10 19:26:25] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-10 19:26:25] [INFO ] Invariant cache hit.
[2023-03-10 19:26:26] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1324/35789 places, 3333/36871 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3265 ms. Remains : 1324/35789 places, 3333/36871 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s554 1) (LT s1074 1) (LT s863 1) (LT s993 1) (LT s733 1) (LT s603 1) (LT s424 1) (LT s1204 1) (LT s294 1) (LT s505 1) (LT s1123 1) (LT s1253 1...], 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 328 reset in 4291 ms.
Product exploration explored 100000 steps with 328 reset in 4208 ms.
Computed a total of 1324 stabilizing places and 3333 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1324 transition count 3333
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), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-07 finished in 14406 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))))'
Support contains 1 out of 35789 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35789/35789 places, 36871/36871 transitions.
Discarding 2222 places :
Implicit places reduction removed 2222 places
Iterating post reduction 0 with 2222 rules applied. Total rules applied 2222 place count 33567 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 2424 place count 33365 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 2626 place count 33365 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2628 place count 33363 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 2630 place count 33363 transition count 36265
Applied a total of 2630 rules in 697 ms. Remains 33363 /35789 variables (removed 2426) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2023-03-10 19:26:39] [INFO ] Computed 1924 place invariants in 1278 ms
[2023-03-10 19:26:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:26:41] [INFO ] Implicit Places using invariants in 3776 ms returned []
Implicit Place search using SMT only with invariants took 3784 ms to find 0 implicit places.
[2023-03-10 19:26:41] [INFO ] Invariant cache hit.
[2023-03-10 19:26:44] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:26:44] [INFO ] Dead Transitions using invariants and state equation in 2441 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/35789 places, 36265/36871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6925 ms. Remains : 33363/35789 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s16538 1)], 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 938 steps with 0 reset in 21 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-08 finished in 7150 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)||X((p1||F(p2))))))'
Support contains 3 out of 35789 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35789/35789 places, 36871/36871 transitions.
Discarding 2222 places :
Implicit places reduction removed 2222 places
Iterating post reduction 0 with 2222 rules applied. Total rules applied 2222 place count 33567 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 2424 place count 33365 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 2626 place count 33365 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2628 place count 33363 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 2630 place count 33363 transition count 36265
Applied a total of 2630 rules in 692 ms. Remains 33363 /35789 variables (removed 2426) and now considering 36265/36871 (removed 606) transitions.
[2023-03-10 19:26:45] [INFO ] Invariant cache hit.
[2023-03-10 19:26:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:26:47] [INFO ] Implicit Places using invariants in 2467 ms returned []
Implicit Place search using SMT only with invariants took 2469 ms to find 0 implicit places.
[2023-03-10 19:26:47] [INFO ] Invariant cache hit.
[2023-03-10 19:26:50] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:26:50] [INFO ] Dead Transitions using invariants and state equation in 2490 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/35789 places, 36265/36871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5655 ms. Remains : 33363/35789 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(GEQ s30710 1), p1:(LT s27522 1), p0:(GEQ s427 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 89850 steps with 29950 reset in 10001 ms.
Product exploration timeout after 91260 steps with 30420 reset in 10002 ms.
Computed a total of 33363 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33363 transition count 36265
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p0 (NOT p1) (NOT p2)))))
Knowledge based reduction with 8 factoid took 163 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-09 finished in 58125 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((!p0 U G((p1 U p2)))))'
Support contains 4 out of 35789 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35789/35789 places, 36871/36871 transitions.
Discarding 2222 places :
Implicit places reduction removed 2222 places
Iterating post reduction 0 with 2222 rules applied. Total rules applied 2222 place count 33567 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 2424 place count 33365 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 2626 place count 33365 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2628 place count 33363 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 2630 place count 33363 transition count 36265
Applied a total of 2630 rules in 692 ms. Remains 33363 /35789 variables (removed 2426) and now considering 36265/36871 (removed 606) transitions.
[2023-03-10 19:27:43] [INFO ] Invariant cache hit.
[2023-03-10 19:27:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:27:45] [INFO ] Implicit Places using invariants in 2437 ms returned []
Implicit Place search using SMT only with invariants took 2439 ms to find 0 implicit places.
[2023-03-10 19:27:45] [INFO ] Invariant cache hit.
[2023-03-10 19:27:48] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:27:48] [INFO ] Dead Transitions using invariants and state equation in 2422 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/35789 places, 36265/36871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5557 ms. Remains : 33363/35789 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(OR p2 p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s10906 1), p0:(AND (GEQ s20518 1) (GEQ s21058 1)), p1:(GEQ s3675 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5783 steps with 0 reset in 136 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-11 finished in 5994 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((p0||X(F(p1)))))'
Support contains 2 out of 35789 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35789/35789 places, 36871/36871 transitions.
Discarding 2222 places :
Implicit places reduction removed 2222 places
Iterating post reduction 0 with 2222 rules applied. Total rules applied 2222 place count 33567 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 2424 place count 33365 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 2626 place count 33365 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2628 place count 33363 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 2630 place count 33363 transition count 36265
Applied a total of 2630 rules in 693 ms. Remains 33363 /35789 variables (removed 2426) and now considering 36265/36871 (removed 606) transitions.
[2023-03-10 19:27:49] [INFO ] Invariant cache hit.
[2023-03-10 19:27:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:27:51] [INFO ] Implicit Places using invariants in 2455 ms returned []
Implicit Place search using SMT only with invariants took 2456 ms to find 0 implicit places.
[2023-03-10 19:27:51] [INFO ] Invariant cache hit.
[2023-03-10 19:27:54] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:27:54] [INFO ] Dead Transitions using invariants and state equation in 2451 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/35789 places, 36265/36871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5604 ms. Remains : 33363/35789 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s27068 1), p1:(LT s25708 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 90240 steps with 30080 reset in 10002 ms.
Product exploration timeout after 91410 steps with 30470 reset in 10001 ms.
Computed a total of 33363 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33363 transition count 36265
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-13 finished in 56775 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)||G(p1))))'
Support contains 3 out of 35789 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35789/35789 places, 36871/36871 transitions.
Discarding 2221 places :
Implicit places reduction removed 2221 places
Iterating post reduction 0 with 2221 rules applied. Total rules applied 2221 place count 33568 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 2423 place count 33366 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 2625 place count 33366 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2627 place count 33364 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 2629 place count 33364 transition count 36265
Applied a total of 2629 rules in 703 ms. Remains 33364 /35789 variables (removed 2425) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 33364 cols
[2023-03-10 19:28:47] [INFO ] Computed 1925 place invariants in 1277 ms
[2023-03-10 19:28:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:28:49] [INFO ] Implicit Places using invariants in 3768 ms returned []
Implicit Place search using SMT only with invariants took 3770 ms to find 0 implicit places.
[2023-03-10 19:28:49] [INFO ] Invariant cache hit.
[2023-03-10 19:28:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:28:52] [INFO ] Dead Transitions using invariants and state equation in 2497 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33364/35789 places, 36265/36871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6975 ms. Remains : 33364/35789 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s12631 1) (GEQ s15142 1)), p1:(GEQ s1173 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 5781 steps with 0 reset in 128 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-14 finished in 7305 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 1 out of 35789 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35789/35789 places, 36871/36871 transitions.
Discarding 2222 places :
Implicit places reduction removed 2222 places
Iterating post reduction 0 with 2222 rules applied. Total rules applied 2222 place count 33567 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 2424 place count 33365 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 2626 place count 33365 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2628 place count 33363 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 2630 place count 33363 transition count 36265
Applied a total of 2630 rules in 721 ms. Remains 33363 /35789 variables (removed 2426) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2023-03-10 19:28:54] [INFO ] Computed 1924 place invariants in 1292 ms
[2023-03-10 19:28:57] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:28:57] [INFO ] Implicit Places using invariants in 3758 ms returned []
Implicit Place search using SMT only with invariants took 3759 ms to find 0 implicit places.
[2023-03-10 19:28:57] [INFO ] Invariant cache hit.
[2023-03-10 19:28:59] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:28:59] [INFO ] Dead Transitions using invariants and state equation in 2425 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/35789 places, 36265/36871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6907 ms. Remains : 33363/35789 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s7771 1)], 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 timeout after 64770 steps with 32385 reset in 10001 ms.
Product exploration timeout after 64090 steps with 32045 reset in 10001 ms.
Computed a total of 33363 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33363 transition count 36265
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 :(X p0)
Knowledge based reduction with 4 factoid took 79 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-PT-L00100M0010C005P005G002-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-15 finished in 64779 ms.
All properties solved by simple procedures.
Total runtime 330878 ms.
ITS solved all properties within timeout

BK_STOP 1678476598917

--------------------
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 LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

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

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