Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636280200247.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FamilyReunion-COL-L00020M0002C001P001G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636280200247
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.6K Apr 11 20:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 11 20:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 11 20:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 20:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 20:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 20:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 20:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 11 20:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 135K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716587197863

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00020M0002C001P001G001
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-24 21:46:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 21:46:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 21:46:41] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 21:46:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 21:46:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1214 ms
[2024-05-24 21:46:42] [INFO ] Detected 5 constant HL places corresponding to 11 PT places.
[2024-05-24 21:46:42] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 3292 PT places and 2774.0 transition bindings in 54 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 21:46:42] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 13 ms.
[2024-05-24 21:46:42] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10001 steps, including 7 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 99 cols
[2024-05-24 21:46:43] [INFO ] Computed 33 invariants in 25 ms
[2024-05-24 21:46:43] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2024-05-24 21:46:43] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 33 ms returned sat
[2024-05-24 21:46:43] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-24 21:46:43] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-24 21:46:43] [INFO ] Flatten gal took : 93 ms
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 21:46:43] [INFO ] Flatten gal took : 40 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 2
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
[2024-05-24 21:46:43] [INFO ] Unfolded HLPN to a Petri net with 3095 places and 2438 transitions 6997 arcs in 114 ms.
[2024-05-24 21:46:43] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Deduced a syphon composed of 21 places in 34 ms
Reduce places removed 30 places and 0 transitions.
Support contains 952 out of 3065 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3065/3065 places, 2438/2438 transitions.
Reduce places removed 48 places and 0 transitions.
Discarding 420 places :
Implicit places reduction removed 420 places
Iterating post reduction 0 with 468 rules applied. Total rules applied 468 place count 2597 transition count 2438
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 511 place count 2554 transition count 2395
Iterating global reduction 1 with 43 rules applied. Total rules applied 554 place count 2554 transition count 2395
Applied a total of 554 rules in 1028 ms. Remains 2554 /3065 variables (removed 511) and now considering 2395/2438 (removed 43) transitions.
// Phase 1: matrix 2395 rows 2554 cols
[2024-05-24 21:46:45] [INFO ] Computed 302 invariants in 115 ms
[2024-05-24 21:46:46] [INFO ] Implicit Places using invariants in 1576 ms returned [462, 1242, 1710, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1726, 1727, 1728, 1729, 1730]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 1585 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2531/3065 places, 2395/2438 transitions.
Applied a total of 0 rules in 144 ms. Remains 2531 /2531 variables (removed 0) and now considering 2395/2395 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2763 ms. Remains : 2531/3065 places, 2395/2438 transitions.
Support contains 952 out of 2531 places after structural reductions.
[2024-05-24 21:46:47] [INFO ] Flatten gal took : 307 ms
[2024-05-24 21:46:47] [INFO ] Flatten gal took : 193 ms
[2024-05-24 21:46:47] [INFO ] Input system was already deterministic with 2395 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2395 rows 2531 cols
[2024-05-24 21:46:48] [INFO ] Computed 279 invariants in 45 ms
[2024-05-24 21:46:48] [INFO ] [Real]Absence check using 41 positive place invariants in 85 ms returned sat
[2024-05-24 21:46:48] [INFO ] [Real]Absence check using 41 positive and 238 generalized place invariants in 99 ms returned sat
[2024-05-24 21:46:48] [INFO ] After 680ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 2531 stabilizing places and 2395 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2531 transition count 2395
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||X(G(p2)))))'
Support contains 211 out of 2531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2531/2531 places, 2395/2395 transitions.
Reduce places removed 24 places and 0 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 2486 transition count 2395
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 149 place count 2382 transition count 2291
Iterating global reduction 1 with 104 rules applied. Total rules applied 253 place count 2382 transition count 2291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 254 place count 2381 transition count 2270
Iterating global reduction 1 with 1 rules applied. Total rules applied 255 place count 2381 transition count 2270
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 276 place count 2360 transition count 2270
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 297 place count 2339 transition count 2249
Iterating global reduction 2 with 21 rules applied. Total rules applied 318 place count 2339 transition count 2249
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 339 place count 2318 transition count 2228
Iterating global reduction 2 with 21 rules applied. Total rules applied 360 place count 2318 transition count 2228
Applied a total of 360 rules in 1546 ms. Remains 2318 /2531 variables (removed 213) and now considering 2228/2395 (removed 167) transitions.
// Phase 1: matrix 2228 rows 2318 cols
[2024-05-24 21:46:51] [INFO ] Computed 214 invariants in 42 ms
[2024-05-24 21:46:52] [INFO ] Implicit Places using invariants in 1094 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1302, 1303, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 2065]
Discarding 64 places :
Implicit Place search using SMT only with invariants took 1102 ms to find 64 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2254/2531 places, 2228/2395 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2213 transition count 2187
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2213 transition count 2187
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 2193 transition count 2147
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 2193 transition count 2147
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 2173 transition count 2127
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 2173 transition count 2127
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 2153 transition count 2107
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 2153 transition count 2107
Applied a total of 202 rules in 924 ms. Remains 2153 /2254 variables (removed 101) and now considering 2107/2228 (removed 121) transitions.
// Phase 1: matrix 2107 rows 2153 cols
[2024-05-24 21:46:53] [INFO ] Computed 150 invariants in 36 ms
[2024-05-24 21:46:53] [INFO ] Implicit Places using invariants in 721 ms returned []
[2024-05-24 21:46:53] [INFO ] Invariant cache hit.
[2024-05-24 21:46:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 21:46:54] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1611 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2153/2531 places, 2107/2395 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5186 ms. Remains : 2153/2531 places, 2107/2395 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 482 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(LEQ (ADD s756 s757 s758 s759 s760 s761 s762 s763 s764 s765 s766 s767 s768 s769 s770 s771 s772 s773 s774 s775 s776) (ADD s1397 s1398 s1399 s1400 s1401 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2991 ms.
Product exploration explored 100000 steps with 50000 reset in 2317 ms.
Computed a total of 2153 stabilizing places and 2107 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2153 transition count 2107
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 32 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-00 finished in 11986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 24 out of 2531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2531/2531 places, 2395/2395 transitions.
Graph (complete) has 3341 edges and 2531 vertex of which 1389 are kept as prefixes of interest. Removing 1142 places using SCC suffix rule.21 ms
Discarding 1142 places :
Also discarding 967 output transitions
Drop transitions removed 967 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 945 transitions
Trivial Post-agglo rules discarded 945 transitions
Performed 945 trivial Post agglomeration. Transition count delta: 945
Iterating post reduction 0 with 966 rules applied. Total rules applied 967 place count 1347 transition count 462
Reduce places removed 945 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 1 with 1008 rules applied. Total rules applied 1975 place count 402 transition count 399
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 2038 place count 339 transition count 399
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 2038 place count 339 transition count 357
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 2122 place count 297 transition count 357
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 2164 place count 255 transition count 315
Iterating global reduction 3 with 42 rules applied. Total rules applied 2206 place count 255 transition count 315
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 2206 place count 255 transition count 294
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 2248 place count 234 transition count 294
Applied a total of 2248 rules in 165 ms. Remains 234 /2531 variables (removed 2297) and now considering 294/2395 (removed 2101) transitions.
// Phase 1: matrix 294 rows 234 cols
[2024-05-24 21:47:01] [INFO ] Computed 22 invariants in 2 ms
[2024-05-24 21:47:01] [INFO ] Implicit Places using invariants in 248 ms returned [84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 252 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 213/2531 places, 294/2395 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 213 transition count 231
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 150 transition count 231
Applied a total of 126 rules in 17 ms. Remains 150 /213 variables (removed 63) and now considering 231/294 (removed 63) transitions.
// Phase 1: matrix 231 rows 150 cols
[2024-05-24 21:47:01] [INFO ] Computed 1 invariants in 2 ms
[2024-05-24 21:47:01] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-24 21:47:01] [INFO ] Invariant cache hit.
[2024-05-24 21:47:02] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 150/2531 places, 231/2395 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 704 ms. Remains : 150/2531 places, 231/2395 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149) (ADD s105 s106 s107))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-01 finished in 778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(p0 U p1)))))'
Support contains 105 out of 2531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2531/2531 places, 2395/2395 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 2485 transition count 2395
Discarding 146 places :
Symmetric choice reduction at 1 with 146 rule applications. Total rules 192 place count 2339 transition count 2249
Iterating global reduction 1 with 146 rules applied. Total rules applied 338 place count 2339 transition count 2249
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 381 place count 2296 transition count 2186
Iterating global reduction 1 with 43 rules applied. Total rules applied 424 place count 2296 transition count 2186
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 445 place count 2275 transition count 2186
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 508 place count 2212 transition count 2123
Iterating global reduction 2 with 63 rules applied. Total rules applied 571 place count 2212 transition count 2123
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 594 place count 2189 transition count 2060
Iterating global reduction 2 with 23 rules applied. Total rules applied 617 place count 2189 transition count 2060
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 659 place count 2147 transition count 2018
Iterating global reduction 2 with 42 rules applied. Total rules applied 701 place count 2147 transition count 2018
Applied a total of 701 rules in 1052 ms. Remains 2147 /2531 variables (removed 384) and now considering 2018/2395 (removed 377) transitions.
// Phase 1: matrix 2018 rows 2147 cols
[2024-05-24 21:47:03] [INFO ] Computed 213 invariants in 19 ms
[2024-05-24 21:47:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 21:47:04] [INFO ] Implicit Places using invariants in 1188 ms returned [1584, 1585, 1595]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1191 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2144/2531 places, 2018/2395 transitions.
Applied a total of 0 rules in 176 ms. Remains 2144 /2144 variables (removed 0) and now considering 2018/2018 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2426 ms. Remains : 2144/2531 places, 2018/2395 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s1051 s1052 s1053 s1054 s1055 s1056 s1057 s1058 s1059 s1060 s1061 s1062 s1063 s1064 s1065 s1066 s1067 s1068 s1069 s1070 s1071 s1072 s1073 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2493 ms.
Product exploration explored 100000 steps with 50000 reset in 2250 ms.
Computed a total of 2144 stabilizing places and 2018 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2144 transition count 2018
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 34 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-02 finished in 8157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 42 out of 2531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2531/2531 places, 2395/2395 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 2464 transition count 2395
Discarding 146 places :
Symmetric choice reduction at 1 with 146 rule applications. Total rules 213 place count 2318 transition count 2249
Iterating global reduction 1 with 146 rules applied. Total rules applied 359 place count 2318 transition count 2249
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 402 place count 2275 transition count 2186
Iterating global reduction 1 with 43 rules applied. Total rules applied 445 place count 2275 transition count 2186
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 466 place count 2254 transition count 2186
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 529 place count 2191 transition count 2123
Iterating global reduction 2 with 63 rules applied. Total rules applied 592 place count 2191 transition count 2123
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 615 place count 2168 transition count 2060
Iterating global reduction 2 with 23 rules applied. Total rules applied 638 place count 2168 transition count 2060
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 680 place count 2126 transition count 2018
Iterating global reduction 2 with 42 rules applied. Total rules applied 722 place count 2126 transition count 2018
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 764 place count 2084 transition count 1976
Iterating global reduction 2 with 42 rules applied. Total rules applied 806 place count 2084 transition count 1976
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 848 place count 2042 transition count 1934
Iterating global reduction 2 with 42 rules applied. Total rules applied 890 place count 2042 transition count 1934
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 932 place count 2000 transition count 1892
Iterating global reduction 2 with 42 rules applied. Total rules applied 974 place count 2000 transition count 1892
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1016 place count 1958 transition count 1850
Iterating global reduction 2 with 42 rules applied. Total rules applied 1058 place count 1958 transition count 1850
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1100 place count 1916 transition count 1808
Iterating global reduction 2 with 42 rules applied. Total rules applied 1142 place count 1916 transition count 1808
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1184 place count 1874 transition count 1766
Iterating global reduction 2 with 42 rules applied. Total rules applied 1226 place count 1874 transition count 1766
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1268 place count 1832 transition count 1724
Iterating global reduction 2 with 42 rules applied. Total rules applied 1310 place count 1832 transition count 1724
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1352 place count 1790 transition count 1682
Iterating global reduction 2 with 42 rules applied. Total rules applied 1394 place count 1790 transition count 1682
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1436 place count 1748 transition count 1640
Iterating global reduction 2 with 42 rules applied. Total rules applied 1478 place count 1748 transition count 1640
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1520 place count 1706 transition count 1598
Iterating global reduction 2 with 42 rules applied. Total rules applied 1562 place count 1706 transition count 1598
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1604 place count 1664 transition count 1556
Iterating global reduction 2 with 42 rules applied. Total rules applied 1646 place count 1664 transition count 1556
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1688 place count 1622 transition count 1514
Iterating global reduction 2 with 42 rules applied. Total rules applied 1730 place count 1622 transition count 1514
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 63 rules applied. Total rules applied 1793 place count 1601 transition count 1472
Applied a total of 1793 rules in 2696 ms. Remains 1601 /2531 variables (removed 930) and now considering 1472/2395 (removed 923) transitions.
// Phase 1: matrix 1472 rows 1601 cols
[2024-05-24 21:47:13] [INFO ] Computed 171 invariants in 12 ms
[2024-05-24 21:47:13] [INFO ] Implicit Places using invariants in 841 ms returned [822, 1033, 1034, 1035, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1348]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 844 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1578/2531 places, 1472/2395 transitions.
Applied a total of 0 rules in 101 ms. Remains 1578 /1578 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3642 ms. Remains : 1578/2531 places, 1472/2395 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GT (ADD s568 s569 s570 s571 s572 s573 s574 s575 s576 s577 s578 s579 s580 s581 s582 s583 s584 s585 s586 s587 s588) 2) (AND (LEQ (ADD s568 s569 s570...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4710 steps with 3 reset in 44 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-03 finished in 3841 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||(p1 U (p2||G(p1)))))))'
Support contains 147 out of 2531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2531/2531 places, 2395/2395 transitions.
Graph (complete) has 3341 edges and 2531 vertex of which 2400 are kept as prefixes of interest. Removing 131 places using SCC suffix rule.15 ms
Discarding 131 places :
Also discarding 85 output transitions
Drop transitions removed 85 transitions
Reduce places removed 21 places and 21 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Drop transitions removed 1218 transitions
Trivial Post-agglo rules discarded 1218 transitions
Performed 1218 trivial Post agglomeration. Transition count delta: 1218
Iterating post reduction 0 with 1281 rules applied. Total rules applied 1282 place count 2337 transition count 1050
Reduce places removed 1218 places and 0 transitions.
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Iterating post reduction 1 with 1344 rules applied. Total rules applied 2626 place count 1119 transition count 924
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 2752 place count 993 transition count 924
Performed 273 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 273 Pre rules applied. Total rules applied 2752 place count 993 transition count 651
Deduced a syphon composed of 273 places in 0 ms
Ensure Unique test removed 105 places
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 3 with 651 rules applied. Total rules applied 3403 place count 615 transition count 651
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 63 rules applied. Total rules applied 3466 place count 594 transition count 609
Reduce places removed 42 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 4 with 63 rules applied. Total rules applied 3529 place count 552 transition count 588
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 3550 place count 531 transition count 588
Discarding 65 places :
Symmetric choice reduction at 6 with 65 rule applications. Total rules 3615 place count 466 transition count 483
Iterating global reduction 6 with 65 rules applied. Total rules applied 3680 place count 466 transition count 483
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 6 with 21 rules applied. Total rules applied 3701 place count 466 transition count 462
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 3722 place count 445 transition count 462
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3723 place count 444 transition count 441
Iterating global reduction 8 with 1 rules applied. Total rules applied 3724 place count 444 transition count 441
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 8 with 63 rules applied. Total rules applied 3787 place count 423 transition count 399
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 3808 place count 402 transition count 399
Applied a total of 3808 rules in 294 ms. Remains 402 /2531 variables (removed 2129) and now considering 399/2395 (removed 1996) transitions.
// Phase 1: matrix 399 rows 402 cols
[2024-05-24 21:47:14] [INFO ] Computed 45 invariants in 3 ms
[2024-05-24 21:47:14] [INFO ] Implicit Places using invariants in 278 ms returned [147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 274, 296]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 285 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/2531 places, 399/2395 transitions.
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 21 Pre rules applied. Total rules applied 0 place count 379 transition count 378
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 63 rules applied. Total rules applied 63 place count 337 transition count 378
Applied a total of 63 rules in 25 ms. Remains 337 /379 variables (removed 42) and now considering 378/399 (removed 21) transitions.
// Phase 1: matrix 378 rows 337 cols
[2024-05-24 21:47:14] [INFO ] Computed 1 invariants in 2 ms
[2024-05-24 21:47:14] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-24 21:47:14] [INFO ] Invariant cache hit.
[2024-05-24 21:47:15] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 337/2531 places, 378/2395 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 961 ms. Remains : 337/2531 places, 378/2395 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 513 reset in 694 ms.
Product exploration explored 100000 steps with 513 reset in 681 ms.
Computed a total of 337 stabilizing places and 378 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 337 transition count 378
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 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-04 finished in 2597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 21 out of 2531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2531/2531 places, 2395/2395 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 2464 transition count 2395
Discarding 146 places :
Symmetric choice reduction at 1 with 146 rule applications. Total rules 213 place count 2318 transition count 2249
Iterating global reduction 1 with 146 rules applied. Total rules applied 359 place count 2318 transition count 2249
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 402 place count 2275 transition count 2186
Iterating global reduction 1 with 43 rules applied. Total rules applied 445 place count 2275 transition count 2186
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 466 place count 2254 transition count 2186
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 529 place count 2191 transition count 2123
Iterating global reduction 2 with 63 rules applied. Total rules applied 592 place count 2191 transition count 2123
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 615 place count 2168 transition count 2060
Iterating global reduction 2 with 23 rules applied. Total rules applied 638 place count 2168 transition count 2060
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 680 place count 2126 transition count 2018
Iterating global reduction 2 with 42 rules applied. Total rules applied 722 place count 2126 transition count 2018
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 764 place count 2084 transition count 1976
Iterating global reduction 2 with 42 rules applied. Total rules applied 806 place count 2084 transition count 1976
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 848 place count 2042 transition count 1934
Iterating global reduction 2 with 42 rules applied. Total rules applied 890 place count 2042 transition count 1934
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 932 place count 2000 transition count 1892
Iterating global reduction 2 with 42 rules applied. Total rules applied 974 place count 2000 transition count 1892
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1016 place count 1958 transition count 1850
Iterating global reduction 2 with 42 rules applied. Total rules applied 1058 place count 1958 transition count 1850
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1100 place count 1916 transition count 1808
Iterating global reduction 2 with 42 rules applied. Total rules applied 1142 place count 1916 transition count 1808
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1184 place count 1874 transition count 1766
Iterating global reduction 2 with 42 rules applied. Total rules applied 1226 place count 1874 transition count 1766
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1268 place count 1832 transition count 1724
Iterating global reduction 2 with 42 rules applied. Total rules applied 1310 place count 1832 transition count 1724
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1352 place count 1790 transition count 1682
Iterating global reduction 2 with 42 rules applied. Total rules applied 1394 place count 1790 transition count 1682
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1436 place count 1748 transition count 1640
Iterating global reduction 2 with 42 rules applied. Total rules applied 1478 place count 1748 transition count 1640
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1520 place count 1706 transition count 1598
Iterating global reduction 2 with 42 rules applied. Total rules applied 1562 place count 1706 transition count 1598
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1604 place count 1664 transition count 1556
Iterating global reduction 2 with 42 rules applied. Total rules applied 1646 place count 1664 transition count 1556
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1688 place count 1622 transition count 1514
Iterating global reduction 2 with 42 rules applied. Total rules applied 1730 place count 1622 transition count 1514
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 63 rules applied. Total rules applied 1793 place count 1601 transition count 1472
Applied a total of 1793 rules in 1991 ms. Remains 1601 /2531 variables (removed 930) and now considering 1472/2395 (removed 923) transitions.
// Phase 1: matrix 1472 rows 1601 cols
[2024-05-24 21:47:18] [INFO ] Computed 171 invariants in 12 ms
[2024-05-24 21:47:19] [INFO ] Implicit Places using invariants in 844 ms returned [694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 822, 1033, 1034, 1035, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1348]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 846 ms to find 44 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1557/2531 places, 1472/2395 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1516 transition count 1431
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1516 transition count 1431
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1496 transition count 1391
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1496 transition count 1391
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1476 transition count 1371
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1476 transition count 1371
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1456 transition count 1351
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1456 transition count 1351
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1436 transition count 1331
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1436 transition count 1331
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 1416 transition count 1311
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 1416 transition count 1311
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1396 transition count 1291
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1396 transition count 1291
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1376 transition count 1271
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1376 transition count 1271
Applied a total of 362 rules in 740 ms. Remains 1376 /1557 variables (removed 181) and now considering 1271/1472 (removed 201) transitions.
// Phase 1: matrix 1271 rows 1376 cols
[2024-05-24 21:47:20] [INFO ] Computed 127 invariants in 10 ms
[2024-05-24 21:47:21] [INFO ] Implicit Places using invariants in 635 ms returned []
[2024-05-24 21:47:21] [INFO ] Invariant cache hit.
[2024-05-24 21:47:22] [INFO ] Implicit Places using invariants and state equation in 1758 ms returned []
Implicit Place search using SMT with State Equation took 2402 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1376/2531 places, 1271/2395 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5979 ms. Remains : 1376/2531 places, 1271/2395 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s746 s747 s748 s749 s750 s751 s752 s753 s754 s755 s756 s757 s758 s759 s760 s761 s762 s763 s764 s765 s766))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 204 reset in 496 ms.
Stuttering criterion allowed to conclude after 54085 steps with 107 reset in 269 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-05 finished in 6917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 21 out of 2531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2531/2531 places, 2395/2395 transitions.
Graph (complete) has 3341 edges and 2531 vertex of which 1347 are kept as prefixes of interest. Removing 1184 places using SCC suffix rule.7 ms
Discarding 1184 places :
Also discarding 1009 output transitions
Drop transitions removed 1009 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 1008 transitions
Trivial Post-agglo rules discarded 1008 transitions
Performed 1008 trivial Post agglomeration. Transition count delta: 1008
Iterating post reduction 0 with 1008 rules applied. Total rules applied 1009 place count 1326 transition count 357
Reduce places removed 1008 places and 0 transitions.
Iterating post reduction 1 with 1008 rules applied. Total rules applied 2017 place count 318 transition count 357
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 2017 place count 318 transition count 294
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 147 rules applied. Total rules applied 2164 place count 234 transition count 294
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 2208 place count 190 transition count 210
Iterating global reduction 2 with 44 rules applied. Total rules applied 2252 place count 190 transition count 210
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 2252 place count 190 transition count 189
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 2294 place count 169 transition count 189
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 2336 place count 127 transition count 147
Iterating global reduction 2 with 42 rules applied. Total rules applied 2378 place count 127 transition count 147
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 2420 place count 127 transition count 105
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 2420 place count 127 transition count 84
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 2483 place count 85 transition count 84
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 2504 place count 64 transition count 63
Applied a total of 2504 rules in 69 ms. Remains 64 /2531 variables (removed 2467) and now considering 63/2395 (removed 2332) transitions.
// Phase 1: matrix 63 rows 64 cols
[2024-05-24 21:47:23] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 21:47:23] [INFO ] Implicit Places using invariants in 75 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/2531 places, 63/2395 transitions.
Reduce places removed 21 places and 21 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /63 variables (removed 21) and now considering 42/63 (removed 21) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 149 ms. Remains : 42/2531 places, 42/2395 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-07 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:(GT 2 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2636 reset in 346 ms.
Product exploration explored 100000 steps with 2658 reset in 374 ms.
Computed a total of 42 stabilizing places and 42 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 42 transition count 42
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 (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-07 finished in 1076 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 84 out of 2531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2531/2531 places, 2395/2395 transitions.
Graph (complete) has 3341 edges and 2531 vertex of which 2526 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Drop transitions removed 1260 transitions
Trivial Post-agglo rules discarded 1260 transitions
Performed 1260 trivial Post agglomeration. Transition count delta: 1260
Iterating post reduction 0 with 1302 rules applied. Total rules applied 1303 place count 2463 transition count 1113
Reduce places removed 1260 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 1 with 1323 rules applied. Total rules applied 2626 place count 1203 transition count 1050
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 2689 place count 1140 transition count 1050
Performed 273 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 273 Pre rules applied. Total rules applied 2689 place count 1140 transition count 777
Deduced a syphon composed of 273 places in 1 ms
Ensure Unique test removed 126 places
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 672 rules applied. Total rules applied 3361 place count 741 transition count 777
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 3 with 63 rules applied. Total rules applied 3424 place count 741 transition count 714
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 3487 place count 678 transition count 714
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 3487 place count 678 transition count 693
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 3529 place count 657 transition count 693
Discarding 86 places :
Symmetric choice reduction at 5 with 86 rule applications. Total rules 3615 place count 571 transition count 567
Iterating global reduction 5 with 86 rules applied. Total rules applied 3701 place count 571 transition count 567
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 5 with 21 rules applied. Total rules applied 3722 place count 571 transition count 546
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 3743 place count 550 transition count 546
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 42 Pre rules applied. Total rules applied 3743 place count 550 transition count 504
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 84 rules applied. Total rules applied 3827 place count 508 transition count 504
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 3849 place count 486 transition count 462
Iterating global reduction 7 with 22 rules applied. Total rules applied 3871 place count 486 transition count 462
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 7 with 147 rules applied. Total rules applied 4018 place count 444 transition count 357
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 8 with 63 rules applied. Total rules applied 4081 place count 381 transition count 357
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 42 rules applied. Total rules applied 4123 place count 360 transition count 336
Applied a total of 4123 rules in 254 ms. Remains 360 /2531 variables (removed 2171) and now considering 336/2395 (removed 2059) transitions.
// Phase 1: matrix 336 rows 360 cols
[2024-05-24 21:47:25] [INFO ] Computed 66 invariants in 3 ms
[2024-05-24 21:47:25] [INFO ] Implicit Places using invariants in 472 ms returned [84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 274, 296, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 484 ms to find 44 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 316/2531 places, 336/2395 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 316 transition count 252
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 232 transition count 252
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 168 place count 232 transition count 231
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 210 place count 211 transition count 231
Applied a total of 210 rules in 14 ms. Remains 211 /316 variables (removed 105) and now considering 231/336 (removed 105) transitions.
// Phase 1: matrix 231 rows 211 cols
[2024-05-24 21:47:25] [INFO ] Computed 22 invariants in 1 ms
[2024-05-24 21:47:25] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-24 21:47:25] [INFO ] Invariant cache hit.
[2024-05-24 21:47:25] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 211/2531 places, 231/2395 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1075 ms. Remains : 211/2531 places, 231/2395 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-09 finished in 1151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 105 out of 2531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2531/2531 places, 2395/2395 transitions.
Graph (complete) has 3341 edges and 2531 vertex of which 1242 are kept as prefixes of interest. Removing 1289 places using SCC suffix rule.4 ms
Discarding 1289 places :
Also discarding 1093 output transitions
Drop transitions removed 1093 transitions
Drop transitions removed 840 transitions
Trivial Post-agglo rules discarded 840 transitions
Performed 840 trivial Post agglomeration. Transition count delta: 840
Iterating post reduction 0 with 840 rules applied. Total rules applied 841 place count 1242 transition count 462
Reduce places removed 840 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 1 with 903 rules applied. Total rules applied 1744 place count 402 transition count 399
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 1807 place count 339 transition count 399
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 1807 place count 339 transition count 378
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 1849 place count 318 transition count 378
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1851 place count 316 transition count 336
Iterating global reduction 3 with 2 rules applied. Total rules applied 1853 place count 316 transition count 336
Applied a total of 1853 rules in 46 ms. Remains 316 /2531 variables (removed 2215) and now considering 336/2395 (removed 2059) transitions.
// Phase 1: matrix 336 rows 316 cols
[2024-05-24 21:47:26] [INFO ] Computed 22 invariants in 2 ms
[2024-05-24 21:47:26] [INFO ] Implicit Places using invariants in 228 ms returned [126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 294]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 230 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 294/2531 places, 336/2395 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 294 transition count 273
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 231 transition count 273
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 126 place count 231 transition count 252
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 168 place count 210 transition count 252
Applied a total of 168 rules in 13 ms. Remains 210 /294 variables (removed 84) and now considering 252/336 (removed 84) transitions.
// Phase 1: matrix 252 rows 210 cols
[2024-05-24 21:47:26] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 21:47:26] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-24 21:47:26] [INFO ] Invariant cache hit.
[2024-05-24 21:47:26] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 210/2531 places, 252/2395 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 562 ms. Remains : 210/2531 places, 252/2395 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)) (LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 787 reset in 681 ms.
Product exploration explored 100000 steps with 787 reset in 482 ms.
Computed a total of 210 stabilizing places and 252 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 210 transition count 252
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-10 finished in 1893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 22 out of 2531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2531/2531 places, 2395/2395 transitions.
Reduce places removed 24 places and 0 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 2465 transition count 2395
Discarding 146 places :
Symmetric choice reduction at 1 with 146 rule applications. Total rules 212 place count 2319 transition count 2249
Iterating global reduction 1 with 146 rules applied. Total rules applied 358 place count 2319 transition count 2249
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 401 place count 2276 transition count 2186
Iterating global reduction 1 with 43 rules applied. Total rules applied 444 place count 2276 transition count 2186
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 465 place count 2255 transition count 2186
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 528 place count 2192 transition count 2123
Iterating global reduction 2 with 63 rules applied. Total rules applied 591 place count 2192 transition count 2123
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 614 place count 2169 transition count 2060
Iterating global reduction 2 with 23 rules applied. Total rules applied 637 place count 2169 transition count 2060
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 679 place count 2127 transition count 2018
Iterating global reduction 2 with 42 rules applied. Total rules applied 721 place count 2127 transition count 2018
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 763 place count 2085 transition count 1976
Iterating global reduction 2 with 42 rules applied. Total rules applied 805 place count 2085 transition count 1976
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 847 place count 2043 transition count 1934
Iterating global reduction 2 with 42 rules applied. Total rules applied 889 place count 2043 transition count 1934
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 931 place count 2001 transition count 1892
Iterating global reduction 2 with 42 rules applied. Total rules applied 973 place count 2001 transition count 1892
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1015 place count 1959 transition count 1850
Iterating global reduction 2 with 42 rules applied. Total rules applied 1057 place count 1959 transition count 1850
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1099 place count 1917 transition count 1808
Iterating global reduction 2 with 42 rules applied. Total rules applied 1141 place count 1917 transition count 1808
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1183 place count 1875 transition count 1766
Iterating global reduction 2 with 42 rules applied. Total rules applied 1225 place count 1875 transition count 1766
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1267 place count 1833 transition count 1724
Iterating global reduction 2 with 42 rules applied. Total rules applied 1309 place count 1833 transition count 1724
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1351 place count 1791 transition count 1682
Iterating global reduction 2 with 42 rules applied. Total rules applied 1393 place count 1791 transition count 1682
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1435 place count 1749 transition count 1640
Iterating global reduction 2 with 42 rules applied. Total rules applied 1477 place count 1749 transition count 1640
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1519 place count 1707 transition count 1598
Iterating global reduction 2 with 42 rules applied. Total rules applied 1561 place count 1707 transition count 1598
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1603 place count 1665 transition count 1556
Iterating global reduction 2 with 42 rules applied. Total rules applied 1645 place count 1665 transition count 1556
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1687 place count 1623 transition count 1514
Iterating global reduction 2 with 42 rules applied. Total rules applied 1729 place count 1623 transition count 1514
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 63 rules applied. Total rules applied 1792 place count 1602 transition count 1472
Applied a total of 1792 rules in 2137 ms. Remains 1602 /2531 variables (removed 929) and now considering 1472/2395 (removed 923) transitions.
// Phase 1: matrix 1472 rows 1602 cols
[2024-05-24 21:47:29] [INFO ] Computed 172 invariants in 11 ms
[2024-05-24 21:47:30] [INFO ] Implicit Places using invariants in 865 ms returned []
[2024-05-24 21:47:30] [INFO ] Invariant cache hit.
[2024-05-24 21:47:31] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1777 ms to find 0 implicit places.
[2024-05-24 21:47:31] [INFO ] Invariant cache hit.
[2024-05-24 21:47:33] [INFO ] Dead Transitions using invariants and state equation in 1888 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1602/2531 places, 1472/2395 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5804 ms. Remains : 1602/2531 places, 1472/2395 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 (ADD s992 s993 s994 s995 s996 s997 s998 s999 s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012)), p1:(LEQ 1 s736)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-13 finished in 6009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(X(p1) U (X(G(p1))||(!p2&&X(p1))))))))'
Support contains 63 out of 2531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2531/2531 places, 2395/2395 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 2464 transition count 2395
Discarding 146 places :
Symmetric choice reduction at 1 with 146 rule applications. Total rules 213 place count 2318 transition count 2249
Iterating global reduction 1 with 146 rules applied. Total rules applied 359 place count 2318 transition count 2249
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 402 place count 2275 transition count 2186
Iterating global reduction 1 with 43 rules applied. Total rules applied 445 place count 2275 transition count 2186
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 466 place count 2254 transition count 2186
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 529 place count 2191 transition count 2123
Iterating global reduction 2 with 63 rules applied. Total rules applied 592 place count 2191 transition count 2123
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 615 place count 2168 transition count 2060
Iterating global reduction 2 with 23 rules applied. Total rules applied 638 place count 2168 transition count 2060
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 680 place count 2126 transition count 2018
Iterating global reduction 2 with 42 rules applied. Total rules applied 722 place count 2126 transition count 2018
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 764 place count 2084 transition count 1976
Iterating global reduction 2 with 42 rules applied. Total rules applied 806 place count 2084 transition count 1976
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 848 place count 2042 transition count 1934
Iterating global reduction 2 with 42 rules applied. Total rules applied 890 place count 2042 transition count 1934
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 932 place count 2000 transition count 1892
Iterating global reduction 2 with 42 rules applied. Total rules applied 974 place count 2000 transition count 1892
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1016 place count 1958 transition count 1850
Iterating global reduction 2 with 42 rules applied. Total rules applied 1058 place count 1958 transition count 1850
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1100 place count 1916 transition count 1808
Iterating global reduction 2 with 42 rules applied. Total rules applied 1142 place count 1916 transition count 1808
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1184 place count 1874 transition count 1766
Iterating global reduction 2 with 42 rules applied. Total rules applied 1226 place count 1874 transition count 1766
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1268 place count 1832 transition count 1724
Iterating global reduction 2 with 42 rules applied. Total rules applied 1310 place count 1832 transition count 1724
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1352 place count 1790 transition count 1682
Iterating global reduction 2 with 42 rules applied. Total rules applied 1394 place count 1790 transition count 1682
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1436 place count 1748 transition count 1640
Iterating global reduction 2 with 42 rules applied. Total rules applied 1478 place count 1748 transition count 1640
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1520 place count 1706 transition count 1598
Iterating global reduction 2 with 42 rules applied. Total rules applied 1562 place count 1706 transition count 1598
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1604 place count 1664 transition count 1556
Iterating global reduction 2 with 42 rules applied. Total rules applied 1646 place count 1664 transition count 1556
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1688 place count 1622 transition count 1514
Iterating global reduction 2 with 42 rules applied. Total rules applied 1730 place count 1622 transition count 1514
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 63 rules applied. Total rules applied 1793 place count 1601 transition count 1472
Applied a total of 1793 rules in 1956 ms. Remains 1601 /2531 variables (removed 930) and now considering 1472/2395 (removed 923) transitions.
// Phase 1: matrix 1472 rows 1601 cols
[2024-05-24 21:47:35] [INFO ] Computed 171 invariants in 12 ms
[2024-05-24 21:47:36] [INFO ] Implicit Places using invariants in 790 ms returned [694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 822, 1033, 1034, 1035, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1348]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 792 ms to find 44 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1557/2531 places, 1472/2395 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1516 transition count 1431
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1516 transition count 1431
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1496 transition count 1391
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1496 transition count 1391
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1476 transition count 1371
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1476 transition count 1371
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1456 transition count 1351
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1456 transition count 1351
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1436 transition count 1331
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1436 transition count 1331
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 1416 transition count 1311
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 1416 transition count 1311
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1396 transition count 1291
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1396 transition count 1291
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1376 transition count 1271
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1376 transition count 1271
Applied a total of 362 rules in 891 ms. Remains 1376 /1557 variables (removed 181) and now considering 1271/1472 (removed 201) transitions.
// Phase 1: matrix 1271 rows 1376 cols
[2024-05-24 21:47:37] [INFO ] Computed 127 invariants in 9 ms
[2024-05-24 21:47:38] [INFO ] Implicit Places using invariants in 687 ms returned []
[2024-05-24 21:47:38] [INFO ] Invariant cache hit.
[2024-05-24 21:47:39] [INFO ] Implicit Places using invariants and state equation in 1762 ms returned []
Implicit Place search using SMT with State Equation took 2454 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1376/2531 places, 1271/2395 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6094 ms. Remains : 1376/2531 places, 1271/2395 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT (ADD s725 s726 s727 s728 s729 s730 s731 s732 s733 s734 s735 s736 s737 s738 s739 s740 s741 s742 s743 s744 s745) (ADD s147 s148 s149 s150 s151 s152 s...], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-14 finished in 6252 ms.
All properties solved by simple procedures.
Total runtime 58933 ms.

BK_STOP 1716587261474

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-COL-L00020M0002C001P001G001"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is FamilyReunion-COL-L00020M0002C001P001G001, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-smll-171636280200247"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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