About the Execution of ITS-Tools for FamilyReunion-COL-L00020M0002C001P001G001
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1030.855 | 38449.00 | 53544.00 | 2025.10 | FTTTFTFFTFTFTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r165-tall-167838850200307.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is FamilyReunion-COL-L00020M0002C001P001G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850200307
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.4K Feb 26 11:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 11:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 11:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 11:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 11:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 11:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 135K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-COL-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 1679457691617
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00020M0002C001P001G001
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-22 04:01:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 04:01:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:01:33] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 04:01:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 04:01:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 514 ms
[2023-03-22 04:01:33] [INFO ] Detected 5 constant HL places corresponding to 11 PT places.
[2023-03-22 04:01:33] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 3292 PT places and 2774.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 312 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 04:01:34] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 8 ms.
[2023-03-22 04:01:34] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-15 TRUE 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 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 10012 steps, including 7 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 66 rows 99 cols
[2023-03-22 04:01:34] [INFO ] Computed 33 place invariants in 14 ms
[2023-03-22 04:01:34] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-22 04:01:34] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-22 04:01:34] [INFO ] After 42ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2023-03-22 04:01:34] [INFO ] After 59ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 04:01:34] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 363 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=121 )
Parikh walk visited 1 properties in 3 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2023-03-22 04:01:34] [INFO ] Flatten gal took : 44 ms
[2023-03-22 04:01:34] [INFO ] Flatten gal took : 22 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
[2023-03-22 04:01:34] [INFO ] Unfolded HLPN to a Petri net with 3095 places and 2438 transitions 6997 arcs in 34 ms.
[2023-03-22 04:01:34] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 21 places in 16 ms
Reduce places removed 30 places and 0 transitions.
Support contains 614 out of 3065 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3065/3065 places, 2438/2438 transitions.
Reduce places removed 69 places and 0 transitions.
Discarding 462 places :
Implicit places reduction removed 462 places
Iterating post reduction 0 with 531 rules applied. Total rules applied 531 place count 2534 transition count 2438
Discarding 169 places :
Symmetric choice reduction at 1 with 169 rule applications. Total rules 700 place count 2365 transition count 2269
Iterating global reduction 1 with 169 rules applied. Total rules applied 869 place count 2365 transition count 2269
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 890 place count 2344 transition count 2228
Iterating global reduction 1 with 21 rules applied. Total rules applied 911 place count 2344 transition count 2228
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 932 place count 2323 transition count 2228
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 953 place count 2302 transition count 2207
Iterating global reduction 2 with 21 rules applied. Total rules applied 974 place count 2302 transition count 2207
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 995 place count 2281 transition count 2186
Iterating global reduction 2 with 21 rules applied. Total rules applied 1016 place count 2281 transition count 2186
Applied a total of 1016 rules in 965 ms. Remains 2281 /3065 variables (removed 784) and now considering 2186/2438 (removed 252) transitions.
// Phase 1: matrix 2186 rows 2281 cols
[2023-03-22 04:01:35] [INFO ] Computed 217 place invariants in 71 ms
[2023-03-22 04:01:36] [INFO ] Implicit Places using invariants in 766 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 462, 1220, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1282, 1283, 1542, 1543, 1544, 1545, 1546, 1547, 1548, 1549, 1550, 1551, 1552, 1553, 1554, 1555, 1556, 1557, 1558, 1559, 1560, 1561, 1562, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 2028]
Discarding 87 places :
Implicit Place search using SMT only with invariants took 772 ms to find 87 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2194/3065 places, 2186/2438 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2153 transition count 2145
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2153 transition count 2145
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 2133 transition count 2105
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 2133 transition count 2105
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 2113 transition count 2085
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 2113 transition count 2085
Applied a total of 162 rules in 238 ms. Remains 2113 /2194 variables (removed 81) and now considering 2085/2186 (removed 101) transitions.
// Phase 1: matrix 2085 rows 2113 cols
[2023-03-22 04:01:36] [INFO ] Computed 130 place invariants in 36 ms
[2023-03-22 04:01:37] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-22 04:01:37] [INFO ] Invariant cache hit.
[2023-03-22 04:01:38] [INFO ] Implicit Places using invariants and state equation in 1502 ms returned []
Implicit Place search using SMT with State Equation took 1934 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2113/3065 places, 2085/2438 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3912 ms. Remains : 2113/3065 places, 2085/2438 transitions.
Support contains 614 out of 2113 places after structural reductions.
[2023-03-22 04:01:38] [INFO ] Flatten gal took : 105 ms
[2023-03-22 04:01:38] [INFO ] Flatten gal took : 76 ms
[2023-03-22 04:01:39] [INFO ] Input system was already deterministic with 2085 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:01:39] [INFO ] Invariant cache hit.
[2023-03-22 04:01:39] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2023-03-22 04:01:39] [INFO ] [Real]Absence check using 3 positive and 127 generalized place invariants in 23 ms returned sat
[2023-03-22 04:01:39] [INFO ] After 288ms 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.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 2113 stabilizing places and 2085 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2113 transition count 2085
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 22 out of 2113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2113/2113 places, 2085/2085 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2110 transition count 2085
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 65 place count 2048 transition count 2023
Iterating global reduction 1 with 62 rules applied. Total rules applied 127 place count 2048 transition count 2023
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 189 place count 1986 transition count 1961
Iterating global reduction 1 with 62 rules applied. Total rules applied 251 place count 1986 transition count 1961
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 273 place count 1964 transition count 1899
Iterating global reduction 1 with 22 rules applied. Total rules applied 295 place count 1964 transition count 1899
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 357 place count 1902 transition count 1837
Iterating global reduction 1 with 62 rules applied. Total rules applied 419 place count 1902 transition count 1837
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 481 place count 1840 transition count 1775
Iterating global reduction 1 with 62 rules applied. Total rules applied 543 place count 1840 transition count 1775
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 585 place count 1798 transition count 1733
Iterating global reduction 1 with 42 rules applied. Total rules applied 627 place count 1798 transition count 1733
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 669 place count 1756 transition count 1691
Iterating global reduction 1 with 42 rules applied. Total rules applied 711 place count 1756 transition count 1691
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 753 place count 1714 transition count 1649
Iterating global reduction 1 with 42 rules applied. Total rules applied 795 place count 1714 transition count 1649
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 837 place count 1672 transition count 1607
Iterating global reduction 1 with 42 rules applied. Total rules applied 879 place count 1672 transition count 1607
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 921 place count 1630 transition count 1565
Iterating global reduction 1 with 42 rules applied. Total rules applied 963 place count 1630 transition count 1565
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1005 place count 1588 transition count 1523
Iterating global reduction 1 with 42 rules applied. Total rules applied 1047 place count 1588 transition count 1523
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1089 place count 1546 transition count 1481
Iterating global reduction 1 with 42 rules applied. Total rules applied 1131 place count 1546 transition count 1481
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1173 place count 1504 transition count 1439
Iterating global reduction 1 with 42 rules applied. Total rules applied 1215 place count 1504 transition count 1439
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1257 place count 1462 transition count 1397
Iterating global reduction 1 with 42 rules applied. Total rules applied 1299 place count 1462 transition count 1397
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1341 place count 1420 transition count 1355
Iterating global reduction 1 with 42 rules applied. Total rules applied 1383 place count 1420 transition count 1355
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1425 place count 1378 transition count 1313
Iterating global reduction 1 with 42 rules applied. Total rules applied 1467 place count 1378 transition count 1313
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 1509 place count 1378 transition count 1271
Applied a total of 1509 rules in 1213 ms. Remains 1378 /2113 variables (removed 735) and now considering 1271/2085 (removed 814) transitions.
// Phase 1: matrix 1271 rows 1378 cols
[2023-03-22 04:01:41] [INFO ] Computed 129 place invariants in 17 ms
[2023-03-22 04:01:41] [INFO ] Implicit Places using invariants in 321 ms returned [621]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 323 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1377/2113 places, 1271/2085 transitions.
Applied a total of 0 rules in 52 ms. Remains 1377 /1377 variables (removed 0) and now considering 1271/1271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1589 ms. Remains : 1377/2113 places, 1271/2085 transitions.
Stuttering acceptance computed with spot in 294 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
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=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ s575 (ADD s1146 s1147 s1148 s1149 s1150 s1151 s1152 s1153 s1154 s1155 s1156 s1157 s1158 s1159 s1160 s1161 s1162 s1163 s1164 s1165 s1166))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 941 steps with 0 reset in 12 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-00 finished in 1959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 105 out of 2113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2113/2113 places, 2085/2085 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 2109 transition count 2085
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 66 place count 2047 transition count 2023
Iterating global reduction 1 with 62 rules applied. Total rules applied 128 place count 2047 transition count 2023
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 190 place count 1985 transition count 1961
Iterating global reduction 1 with 62 rules applied. Total rules applied 252 place count 1985 transition count 1961
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 274 place count 1963 transition count 1899
Iterating global reduction 1 with 22 rules applied. Total rules applied 296 place count 1963 transition count 1899
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 358 place count 1901 transition count 1837
Iterating global reduction 1 with 62 rules applied. Total rules applied 420 place count 1901 transition count 1837
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 482 place count 1839 transition count 1775
Iterating global reduction 1 with 62 rules applied. Total rules applied 544 place count 1839 transition count 1775
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 586 place count 1797 transition count 1733
Iterating global reduction 1 with 42 rules applied. Total rules applied 628 place count 1797 transition count 1733
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 670 place count 1755 transition count 1691
Iterating global reduction 1 with 42 rules applied. Total rules applied 712 place count 1755 transition count 1691
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 754 place count 1713 transition count 1649
Iterating global reduction 1 with 42 rules applied. Total rules applied 796 place count 1713 transition count 1649
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 838 place count 1671 transition count 1607
Iterating global reduction 1 with 42 rules applied. Total rules applied 880 place count 1671 transition count 1607
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 922 place count 1629 transition count 1565
Iterating global reduction 1 with 42 rules applied. Total rules applied 964 place count 1629 transition count 1565
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1006 place count 1587 transition count 1523
Iterating global reduction 1 with 42 rules applied. Total rules applied 1048 place count 1587 transition count 1523
Applied a total of 1048 rules in 849 ms. Remains 1587 /2113 variables (removed 526) and now considering 1523/2085 (removed 562) transitions.
// Phase 1: matrix 1523 rows 1587 cols
[2023-03-22 04:01:42] [INFO ] Computed 128 place invariants in 13 ms
[2023-03-22 04:01:42] [INFO ] Implicit Places using invariants in 281 ms returned [830]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 284 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1586/2113 places, 1523/2085 transitions.
Applied a total of 0 rules in 48 ms. Remains 1586 /1586 variables (removed 0) and now considering 1523/1523 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1184 ms. Remains : 1586/2113 places, 1523/2085 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ (ADD s1187 s1188 s1189 s1190 s1191 s1192 s1193 s1194 s1195 s1196 s1197 s1198 s1199 s1200 s1201 s1202 s1203 s1204 s1205 s1206 s1207 s1208 s1209 s12...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1016 ms.
Product exploration explored 100000 steps with 33333 reset in 944 ms.
Computed a total of 1586 stabilizing places and 1523 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1586 transition count 1523
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 (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 1 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 3653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1 U !p0))))'
Support contains 42 out of 2113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2113/2113 places, 2085/2085 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 2109 transition count 2085
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 66 place count 2047 transition count 2023
Iterating global reduction 1 with 62 rules applied. Total rules applied 128 place count 2047 transition count 2023
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 190 place count 1985 transition count 1961
Iterating global reduction 1 with 62 rules applied. Total rules applied 252 place count 1985 transition count 1961
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 274 place count 1963 transition count 1899
Iterating global reduction 1 with 22 rules applied. Total rules applied 296 place count 1963 transition count 1899
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 358 place count 1901 transition count 1837
Iterating global reduction 1 with 62 rules applied. Total rules applied 420 place count 1901 transition count 1837
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 482 place count 1839 transition count 1775
Iterating global reduction 1 with 62 rules applied. Total rules applied 544 place count 1839 transition count 1775
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 586 place count 1797 transition count 1733
Iterating global reduction 1 with 42 rules applied. Total rules applied 628 place count 1797 transition count 1733
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 670 place count 1755 transition count 1691
Iterating global reduction 1 with 42 rules applied. Total rules applied 712 place count 1755 transition count 1691
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 754 place count 1713 transition count 1649
Iterating global reduction 1 with 42 rules applied. Total rules applied 796 place count 1713 transition count 1649
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 838 place count 1671 transition count 1607
Iterating global reduction 1 with 42 rules applied. Total rules applied 880 place count 1671 transition count 1607
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 922 place count 1629 transition count 1565
Iterating global reduction 1 with 42 rules applied. Total rules applied 964 place count 1629 transition count 1565
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1006 place count 1587 transition count 1523
Iterating global reduction 1 with 42 rules applied. Total rules applied 1048 place count 1587 transition count 1523
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1090 place count 1545 transition count 1481
Iterating global reduction 1 with 42 rules applied. Total rules applied 1132 place count 1545 transition count 1481
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1174 place count 1503 transition count 1439
Iterating global reduction 1 with 42 rules applied. Total rules applied 1216 place count 1503 transition count 1439
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1258 place count 1461 transition count 1397
Iterating global reduction 1 with 42 rules applied. Total rules applied 1300 place count 1461 transition count 1397
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1342 place count 1419 transition count 1355
Iterating global reduction 1 with 42 rules applied. Total rules applied 1384 place count 1419 transition count 1355
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1426 place count 1377 transition count 1313
Iterating global reduction 1 with 42 rules applied. Total rules applied 1468 place count 1377 transition count 1313
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 1510 place count 1377 transition count 1271
Applied a total of 1510 rules in 1610 ms. Remains 1377 /2113 variables (removed 736) and now considering 1271/2085 (removed 814) transitions.
// Phase 1: matrix 1271 rows 1377 cols
[2023-03-22 04:01:47] [INFO ] Computed 128 place invariants in 14 ms
[2023-03-22 04:01:47] [INFO ] Implicit Places using invariants in 280 ms returned [620]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 284 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1376/2113 places, 1271/2085 transitions.
Applied a total of 0 rules in 39 ms. Remains 1376 /1376 variables (removed 0) and now considering 1271/1271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1935 ms. Remains : 1376/2113 places, 1271/2085 transitions.
Stuttering acceptance computed with spot in 135 ms :[p0, true, p0, p0]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT (ADD s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125) 2), p1:(LEQ 2 (ADD s830 s831 s832 s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1081 ms.
Product exploration explored 100000 steps with 50000 reset in 1080 ms.
Computed a total of 1376 stabilizing places and 1271 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1376 transition count 1271
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 10 factoid took 292 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-03 finished in 4803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 21 out of 2113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2113/2113 places, 2085/2085 transitions.
Graph (complete) has 2568 edges and 2113 vertex of which 924 are kept as prefixes of interest. Removing 1189 places using SCC suffix rule.10 ms
Discarding 1189 places :
Also discarding 1119 output transitions
Drop transitions removed 1119 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 819 transitions
Trivial Post-agglo rules discarded 819 transitions
Performed 819 trivial Post agglomeration. Transition count delta: 819
Iterating post reduction 0 with 819 rules applied. Total rules applied 820 place count 903 transition count 126
Reduce places removed 819 places and 0 transitions.
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 882 rules applied. Total rules applied 1702 place count 84 transition count 63
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 1723 place count 63 transition count 63
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 1723 place count 63 transition count 42
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 1765 place count 42 transition count 42
Applied a total of 1765 rules in 44 ms. Remains 42 /2113 variables (removed 2071) and now considering 42/2085 (removed 2043) transitions.
// Phase 1: matrix 42 rows 42 cols
[2023-03-22 04:01:50] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-22 04:01:50] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-22 04:01:50] [INFO ] Invariant cache hit.
[2023-03-22 04:01:50] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-22 04:01:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 04:01:50] [INFO ] Invariant cache hit.
[2023-03-22 04:01:50] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/2113 places, 42/2085 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 42/2113 places, 42/2085 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-04 finished in 189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(F(p0)&&G(p1))))))'
Support contains 126 out of 2113 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2113/2113 places, 2085/2085 transitions.
Graph (complete) has 2568 edges and 2113 vertex of which 1158 are kept as prefixes of interest. Removing 955 places using SCC suffix rule.8 ms
Discarding 955 places :
Also discarding 846 output transitions
Drop transitions removed 846 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 631 place count 1137 transition count 588
Reduce places removed 630 places and 0 transitions.
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Iterating post reduction 1 with 756 rules applied. Total rules applied 1387 place count 507 transition count 462
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 1513 place count 381 transition count 462
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 1513 place count 381 transition count 420
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1597 place count 339 transition count 420
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1599 place count 337 transition count 378
Iterating global reduction 3 with 2 rules applied. Total rules applied 1601 place count 337 transition count 378
Applied a total of 1601 rules in 73 ms. Remains 337 /2113 variables (removed 1776) and now considering 378/2085 (removed 1707) transitions.
// Phase 1: matrix 378 rows 337 cols
[2023-03-22 04:01:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 04:01:50] [INFO ] Implicit Places using invariants in 54 ms returned [294]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 336/2113 places, 378/2085 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 336 transition count 357
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 315 transition count 357
Applied a total of 42 rules in 10 ms. Remains 315 /336 variables (removed 21) and now considering 357/378 (removed 21) transitions.
// Phase 1: matrix 357 rows 315 cols
[2023-03-22 04:01:50] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-22 04:01:50] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-22 04:01:50] [INFO ] Invariant cache hit.
[2023-03-22 04:01:50] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 315/2113 places, 357/2085 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 294 ms. Remains : 315/2113 places, 357/2085 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-06 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 (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, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2010 steps with 163 reset in 15 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-06 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X(G(!p1)))))'
Support contains 42 out of 2113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2113/2113 places, 2085/2085 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 2109 transition count 2085
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 66 place count 2047 transition count 2023
Iterating global reduction 1 with 62 rules applied. Total rules applied 128 place count 2047 transition count 2023
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 190 place count 1985 transition count 1961
Iterating global reduction 1 with 62 rules applied. Total rules applied 252 place count 1985 transition count 1961
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 274 place count 1963 transition count 1899
Iterating global reduction 1 with 22 rules applied. Total rules applied 296 place count 1963 transition count 1899
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 338 place count 1921 transition count 1857
Iterating global reduction 1 with 42 rules applied. Total rules applied 380 place count 1921 transition count 1857
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 422 place count 1879 transition count 1815
Iterating global reduction 1 with 42 rules applied. Total rules applied 464 place count 1879 transition count 1815
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 506 place count 1837 transition count 1773
Iterating global reduction 1 with 42 rules applied. Total rules applied 548 place count 1837 transition count 1773
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 590 place count 1795 transition count 1731
Iterating global reduction 1 with 42 rules applied. Total rules applied 632 place count 1795 transition count 1731
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 674 place count 1753 transition count 1689
Iterating global reduction 1 with 42 rules applied. Total rules applied 716 place count 1753 transition count 1689
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 758 place count 1711 transition count 1647
Iterating global reduction 1 with 42 rules applied. Total rules applied 800 place count 1711 transition count 1647
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 842 place count 1669 transition count 1605
Iterating global reduction 1 with 42 rules applied. Total rules applied 884 place count 1669 transition count 1605
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 926 place count 1627 transition count 1563
Iterating global reduction 1 with 42 rules applied. Total rules applied 968 place count 1627 transition count 1563
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1010 place count 1585 transition count 1521
Iterating global reduction 1 with 42 rules applied. Total rules applied 1052 place count 1585 transition count 1521
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1094 place count 1543 transition count 1479
Iterating global reduction 1 with 42 rules applied. Total rules applied 1136 place count 1543 transition count 1479
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1178 place count 1501 transition count 1437
Iterating global reduction 1 with 42 rules applied. Total rules applied 1220 place count 1501 transition count 1437
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1262 place count 1459 transition count 1395
Iterating global reduction 1 with 42 rules applied. Total rules applied 1304 place count 1459 transition count 1395
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1346 place count 1417 transition count 1353
Iterating global reduction 1 with 42 rules applied. Total rules applied 1388 place count 1417 transition count 1353
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 1430 place count 1417 transition count 1311
Applied a total of 1430 rules in 1031 ms. Remains 1417 /2113 variables (removed 696) and now considering 1311/2085 (removed 774) transitions.
// Phase 1: matrix 1311 rows 1417 cols
[2023-03-22 04:01:51] [INFO ] Computed 128 place invariants in 16 ms
[2023-03-22 04:01:52] [INFO ] Implicit Places using invariants in 273 ms returned [660]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 274 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1416/2113 places, 1311/2085 transitions.
Applied a total of 0 rules in 41 ms. Remains 1416 /1416 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1346 ms. Remains : 1416/2113 places, 1311/2085 transitions.
Stuttering acceptance computed with spot in 148 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LEQ 3 (ADD s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 s478 s479 s480 s481 s482)) (LEQ 3 (ADD s105 s106 s107 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25007 reset in 721 ms.
Product exploration explored 100000 steps with 25069 reset in 696 ms.
Computed a total of 1416 stabilizing places and 1311 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1416 transition count 1311
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 293 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[p1, p1, (AND (NOT p0) p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1311 rows 1416 cols
[2023-03-22 04:01:54] [INFO ] Computed 127 place invariants in 5 ms
[2023-03-22 04:01:54] [INFO ] After 127ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0)]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 9 factoid took 462 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-08 finished in 4347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 84 out of 2113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2113/2113 places, 2085/2085 transitions.
Graph (complete) has 2568 edges and 2113 vertex of which 1830 are kept as prefixes of interest. Removing 283 places using SCC suffix rule.5 ms
Discarding 283 places :
Also discarding 258 output transitions
Drop transitions removed 258 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 1197 transitions
Trivial Post-agglo rules discarded 1197 transitions
Performed 1197 trivial Post agglomeration. Transition count delta: 1197
Iterating post reduction 0 with 1197 rules applied. Total rules applied 1198 place count 1809 transition count 609
Reduce places removed 1197 places and 0 transitions.
Iterating post reduction 1 with 1197 rules applied. Total rules applied 2395 place count 612 transition count 609
Performed 231 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 231 Pre rules applied. Total rules applied 2395 place count 612 transition count 378
Deduced a syphon composed of 231 places in 0 ms
Ensure Unique test removed 105 places
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 2 with 567 rules applied. Total rules applied 2962 place count 276 transition count 378
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 2 with 42 rules applied. Total rules applied 3004 place count 276 transition count 336
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 3067 place count 234 transition count 315
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 3067 place count 234 transition count 294
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 3109 place count 213 transition count 294
Applied a total of 3109 rules in 45 ms. Remains 213 /2113 variables (removed 1900) and now considering 294/2085 (removed 1791) transitions.
// Phase 1: matrix 294 rows 213 cols
[2023-03-22 04:01:55] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 04:01:55] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-22 04:01:55] [INFO ] Invariant cache hit.
[2023-03-22 04:01:55] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-22 04:01:55] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-22 04:01:55] [INFO ] Invariant cache hit.
[2023-03-22 04:01:55] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 213/2113 places, 294/2085 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 367 ms. Remains : 213/2113 places, 294/2085 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41)), p0:(GT 1 (ADD s129 s130 s131 s132 s133 s134 s135 s13...], 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 983 reset in 429 ms.
Product exploration explored 100000 steps with 979 reset in 491 ms.
Computed a total of 213 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 213 transition count 294
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 183 ms. Reduced automaton from 2 states, 4 edges and 2 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 1626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 24 out of 2113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2113/2113 places, 2085/2085 transitions.
Graph (complete) has 2568 edges and 2113 vertex of which 1182 are kept as prefixes of interest. Removing 931 places using SCC suffix rule.8 ms
Discarding 931 places :
Also discarding 825 output transitions
Drop transitions removed 825 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 966 transitions
Trivial Post-agglo rules discarded 966 transitions
Performed 966 trivial Post agglomeration. Transition count delta: 966
Iterating post reduction 0 with 966 rules applied. Total rules applied 967 place count 1161 transition count 273
Reduce places removed 966 places and 0 transitions.
Iterating post reduction 1 with 966 rules applied. Total rules applied 1933 place count 195 transition count 273
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 1933 place count 195 transition count 231
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 2017 place count 153 transition count 231
Applied a total of 2017 rules in 30 ms. Remains 153 /2113 variables (removed 1960) and now considering 231/2085 (removed 1854) transitions.
// Phase 1: matrix 231 rows 153 cols
[2023-03-22 04:01:56] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-22 04:01:56] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-22 04:01:56] [INFO ] Invariant cache hit.
[2023-03-22 04:01:56] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-22 04:01:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 04:01:56] [INFO ] Invariant cache hit.
[2023-03-22 04:01:57] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/2113 places, 231/2085 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 153/2113 places, 231/2085 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 (ADD s129 s130 s131)), p1:(GT 2 (ADD s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-11 finished in 419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(((!p0&&X(p1)) U p2))))))'
Support contains 85 out of 2113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2113/2113 places, 2085/2085 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 2109 transition count 2085
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 24 place count 2089 transition count 2065
Iterating global reduction 1 with 20 rules applied. Total rules applied 44 place count 2089 transition count 2065
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 64 place count 2069 transition count 2045
Iterating global reduction 1 with 20 rules applied. Total rules applied 84 place count 2069 transition count 2045
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 104 place count 2049 transition count 2025
Iterating global reduction 1 with 20 rules applied. Total rules applied 124 place count 2049 transition count 2025
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 144 place count 2029 transition count 2005
Iterating global reduction 1 with 20 rules applied. Total rules applied 164 place count 2029 transition count 2005
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 184 place count 2009 transition count 1985
Iterating global reduction 1 with 20 rules applied. Total rules applied 204 place count 2009 transition count 1985
Applied a total of 204 rules in 480 ms. Remains 2009 /2113 variables (removed 104) and now considering 1985/2085 (removed 100) transitions.
// Phase 1: matrix 1985 rows 2009 cols
[2023-03-22 04:01:57] [INFO ] Computed 128 place invariants in 27 ms
[2023-03-22 04:01:57] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-22 04:01:57] [INFO ] Invariant cache hit.
[2023-03-22 04:01:59] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
[2023-03-22 04:01:59] [INFO ] Invariant cache hit.
[2023-03-22 04:02:00] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2009/2113 places, 1985/2085 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3118 ms. Remains : 2009/2113 places, 1985/2085 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(OR (AND (NOT p2) p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 2 s821), p0:(GT 1 (ADD s1232 s1233 s1234 s1235 s1236 s1237 s1238 s1239 s1240 s1241 s1242 s1243 s1244 s1245 s1246 s1247 s1248 s1249 s1250 s1251 s12...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 974 steps with 0 reset in 4 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-13 finished in 3362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U X(G(p1)))))'
Support contains 105 out of 2113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2113/2113 places, 2085/2085 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 2109 transition count 2085
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 46 place count 2067 transition count 2043
Iterating global reduction 1 with 42 rules applied. Total rules applied 88 place count 2067 transition count 2043
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 130 place count 2025 transition count 2001
Iterating global reduction 1 with 42 rules applied. Total rules applied 172 place count 2025 transition count 2001
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 174 place count 2023 transition count 1959
Iterating global reduction 1 with 2 rules applied. Total rules applied 176 place count 2023 transition count 1959
Applied a total of 176 rules in 316 ms. Remains 2023 /2113 variables (removed 90) and now considering 1959/2085 (removed 126) transitions.
// Phase 1: matrix 1959 rows 2023 cols
[2023-03-22 04:02:00] [INFO ] Computed 128 place invariants in 21 ms
[2023-03-22 04:02:01] [INFO ] Implicit Places using invariants in 362 ms returned [1266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 364 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2022/2113 places, 1959/2085 transitions.
Applied a total of 0 rules in 76 ms. Remains 2022 /2022 variables (removed 0) and now considering 1959/1959 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 757 ms. Remains : 2022/2113 places, 1959/2085 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
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=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=4, aps=[p1:(GT 1 (ADD s1115 s1116 s1117 s1118 s1119 s1120 s1121 s1122 s1123 s1124 s1125 s1126 s1127 s1128 s1129 s1130 s1131 s1132 s1133 s1134 s1135 s1136 s1137 s1...], 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 1692 ms.
Product exploration explored 100000 steps with 50000 reset in 1696 ms.
Computed a total of 2022 stabilizing places and 1959 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2022 transition count 1959
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X p1)), true, (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 7 factoid took 387 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-14 finished in 5120 ms.
All properties solved by simple procedures.
Total runtime 32609 ms.
BK_STOP 1679457730066
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-COL-L00020M0002C001P001G001"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is FamilyReunion-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 r165-tall-167838850200307"
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 '
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 ;