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.r157-smll-171636265600396.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 greatspnxred
Input is FamilyReunion-COL-L00020M0002C001P001G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265600396
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-01
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-02
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-03
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-04
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-05
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-06
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-07
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-08
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-09
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-10
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-11
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-12
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-13
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-14
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716618530302

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00020M0002C001P001G001
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 06:28:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 06:28:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 06:28:52] [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-25 06:28:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 06:28:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1179 ms
[2024-05-25 06:28:53] [INFO ] Detected 5 constant HL places corresponding to 11 PT places.
[2024-05-25 06:28:53] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 3292 PT places and 2774.0 transition bindings in 60 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 06:28:53] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 8 ms.
[2024-05-25 06:28:53] [INFO ] Skeletonized 16 HLPN properties in 5 ms.
Initial state reduction rules removed 4 formulas.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-13 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 12 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).
RANDOM walk for 31737 steps (22 resets) in 355 ms. (89 steps per ms) remains 0/19 properties
[2024-05-25 06:28:54] [INFO ] Flatten gal took : 73 ms
[2024-05-25 06:28:54] [INFO ] Flatten gal took : 15 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-25 06:28:54] [INFO ] Unfolded HLPN to a Petri net with 3095 places and 2438 transitions 6997 arcs in 93 ms.
[2024-05-25 06:28:54] [INFO ] Unfolded 12 HLPN properties in 0 ms.
[2024-05-25 06:28:54] [INFO ] Reduced 21 identical enabling conditions.
[2024-05-25 06:28:54] [INFO ] Reduced 21 identical enabling conditions.
Deduced a syphon composed of 21 places in 22 ms
Reduce places removed 30 places and 0 transitions.
Support contains 1095 out of 3065 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3065/3065 places, 2438/2438 transitions.
Reduce places removed 73 places and 0 transitions.
Discarding 231 places :
Implicit places reduction removed 231 places
Iterating post reduction 0 with 304 rules applied. Total rules applied 304 place count 2761 transition count 2438
Discarding 169 places :
Symmetric choice reduction at 1 with 169 rule applications. Total rules 473 place count 2592 transition count 2269
Iterating global reduction 1 with 169 rules applied. Total rules applied 642 place count 2592 transition count 2269
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 663 place count 2571 transition count 2228
Iterating global reduction 1 with 21 rules applied. Total rules applied 684 place count 2571 transition count 2228
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 705 place count 2550 transition count 2228
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 726 place count 2529 transition count 2207
Iterating global reduction 2 with 21 rules applied. Total rules applied 747 place count 2529 transition count 2207
Applied a total of 747 rules in 989 ms. Remains 2529 /3065 variables (removed 536) and now considering 2207/2438 (removed 231) transitions.
// Phase 1: matrix 2207 rows 2529 cols
[2024-05-25 06:28:55] [INFO ] Computed 446 invariants in 151 ms
[2024-05-25 06:28:57] [INFO ] Implicit Places using invariants in 1836 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 588, 1409, 1452, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1467, 1468, 1469, 1470, 1471, 1472, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748, 1749, 1750, 1940, 1941, 1942, 1943, 1944, 1945, 1946, 1947, 1948, 1949, 1950, 1951, 1952, 1953, 1954, 1955, 1956, 1957, 1958, 1959, 1960, 2276]
Discarding 87 places :
Implicit Place search using SMT only with invariants took 1886 ms to find 87 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2442/3065 places, 2207/2438 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2401 transition count 2166
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2401 transition count 2166
Applied a total of 82 rules in 138 ms. Remains 2401 /2442 variables (removed 41) and now considering 2166/2207 (removed 41) transitions.
// Phase 1: matrix 2166 rows 2401 cols
[2024-05-25 06:28:57] [INFO ] Computed 359 invariants in 66 ms
[2024-05-25 06:28:58] [INFO ] Implicit Places using invariants in 941 ms returned []
[2024-05-25 06:28:58] [INFO ] Invariant cache hit.
[2024-05-25 06:29:01] [INFO ] Implicit Places using invariants and state equation in 2584 ms returned []
Implicit Place search using SMT with State Equation took 3533 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2401/3065 places, 2166/2438 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6579 ms. Remains : 2401/3065 places, 2166/2438 transitions.
Support contains 1095 out of 2401 places after structural reductions.
[2024-05-25 06:29:01] [INFO ] Flatten gal took : 195 ms
[2024-05-25 06:29:01] [INFO ] Flatten gal took : 158 ms
[2024-05-25 06:29:02] [INFO ] Input system was already deterministic with 2166 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 4000 steps (0 resets) in 1015 ms. (3 steps per ms) remains 0/19 properties
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 2401 stabilizing places and 2166 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2401 transition count 2166
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(F(!p0))) U G(!p1)))'
Support contains 63 out of 2401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2401/2401 places, 2166/2166 transitions.
Graph (complete) has 3068 edges and 2401 vertex of which 2082 are kept as prefixes of interest. Removing 319 places using SCC suffix rule.20 ms
Discarding 319 places :
Also discarding 318 output transitions
Drop transitions (Output transitions of discarded places.) removed 318 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 231 places :
Implicit places reduction removed 231 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1302 transitions
Trivial Post-agglo rules discarded 1302 transitions
Performed 1302 trivial Post agglomeration. Transition count delta: 1302
Iterating post reduction 0 with 1533 rules applied. Total rules applied 1534 place count 1830 transition count 525
Reduce places removed 1302 places and 0 transitions.
Iterating post reduction 1 with 1302 rules applied. Total rules applied 2836 place count 528 transition count 525
Performed 189 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 189 Pre rules applied. Total rules applied 2836 place count 528 transition count 336
Deduced a syphon composed of 189 places in 0 ms
Ensure Unique test removed 63 places
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 441 rules applied. Total rules applied 3277 place count 276 transition count 336
Discarding 42 places :
Implicit places reduction removed 42 places
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 2 with 84 rules applied. Total rules applied 3361 place count 234 transition count 294
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 3403 place count 192 transition count 294
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 3405 place count 190 transition count 252
Iterating global reduction 4 with 2 rules applied. Total rules applied 3407 place count 190 transition count 252
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 3449 place count 190 transition count 210
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 5 with 42 rules applied. Total rules applied 3491 place count 169 transition count 189
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 5 with 21 rules applied. Total rules applied 3512 place count 148 transition count 168
Applied a total of 3512 rules in 312 ms. Remains 148 /2401 variables (removed 2253) and now considering 168/2166 (removed 1998) transitions.
// Phase 1: matrix 168 rows 148 cols
[2024-05-25 06:29:03] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 06:29:03] [INFO ] Implicit Places using invariants in 219 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 223 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/2401 places, 168/2166 transitions.
Applied a total of 0 rules in 7 ms. Remains 147 /147 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 542 ms. Remains : 147/2401 places, 168/2166 transitions.
Stuttering acceptance computed with spot in 344 ms :[true, p1, (OR p0 p1), p1]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-00
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-00 finished in 1027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 105 out of 2401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2401/2401 places, 2166/2166 transitions.
Graph (complete) has 3068 edges and 2401 vertex of which 1767 are kept as prefixes of interest. Removing 634 places using SCC suffix rule.10 ms
Discarding 634 places :
Also discarding 570 output transitions
Drop transitions (Output transitions of discarded places.) removed 570 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 231 places :
Implicit places reduction removed 231 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1071 transitions
Trivial Post-agglo rules discarded 1071 transitions
Performed 1071 trivial Post agglomeration. Transition count delta: 1071
Iterating post reduction 0 with 1302 rules applied. Total rules applied 1303 place count 1515 transition count 504
Reduce places removed 1071 places and 0 transitions.
Iterating post reduction 1 with 1071 rules applied. Total rules applied 2374 place count 444 transition count 504
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 126 Pre rules applied. Total rules applied 2374 place count 444 transition count 378
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 2 with 294 rules applied. Total rules applied 2668 place count 276 transition count 378
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2670 place count 274 transition count 336
Iterating global reduction 2 with 2 rules applied. Total rules applied 2672 place count 274 transition count 336
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 2 with 42 rules applied. Total rules applied 2714 place count 253 transition count 315
Applied a total of 2714 rules in 112 ms. Remains 253 /2401 variables (removed 2148) and now considering 315/2166 (removed 1851) transitions.
// Phase 1: matrix 315 rows 253 cols
[2024-05-25 06:29:03] [INFO ] Computed 1 invariants in 2 ms
[2024-05-25 06:29:04] [INFO ] Implicit Places using invariants in 126 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 252/2401 places, 315/2166 transitions.
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 0 with 42 rules applied. Total rules applied 42 place count 231 transition count 336
Applied a total of 42 rules in 21 ms. Remains 231 /252 variables (removed 21) and now considering 336/315 (removed -21) transitions.
// Phase 1: matrix 336 rows 231 cols
[2024-05-25 06:29:04] [INFO ] Computed 0 invariants in 6 ms
[2024-05-25 06:29:04] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-25 06:29:04] [INFO ] Invariant cache hit.
[2024-05-25 06:29:04] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 231/2401 places, 336/2166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 582 ms. Remains : 231/2401 places, 336/2166 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-01
Product exploration explored 100000 steps with 3138 reset in 842 ms.
Product exploration explored 100000 steps with 3139 reset in 678 ms.
Computed a total of 231 stabilizing places and 336 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 231 transition count 336
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be false thanks to negative knowledge :(X (X (NOT p1)))
Knowledge based reduction with 6 factoid took 170 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-01 finished in 2673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p1)))))'
Support contains 108 out of 2401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2401/2401 places, 2166/2166 transitions.
Graph (complete) has 3068 edges and 2401 vertex of which 1557 are kept as prefixes of interest. Removing 844 places using SCC suffix rule.9 ms
Discarding 844 places :
Also discarding 738 output transitions
Drop transitions (Output transitions of discarded places.) removed 738 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 210 places :
Implicit places reduction removed 210 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 903 transitions
Trivial Post-agglo rules discarded 903 transitions
Performed 903 trivial Post agglomeration. Transition count delta: 903
Iterating post reduction 0 with 1113 rules applied. Total rules applied 1114 place count 1326 transition count 504
Reduce places removed 903 places and 0 transitions.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Iterating post reduction 1 with 987 rules applied. Total rules applied 2101 place count 423 transition count 420
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 2185 place count 339 transition count 420
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 2185 place count 339 transition count 357
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 2311 place count 276 transition count 357
Applied a total of 2311 rules in 66 ms. Remains 276 /2401 variables (removed 2125) and now considering 357/2166 (removed 1809) transitions.
// Phase 1: matrix 357 rows 276 cols
[2024-05-25 06:29:06] [INFO ] Computed 22 invariants in 2 ms
[2024-05-25 06:29:06] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-25 06:29:06] [INFO ] Invariant cache hit.
[2024-05-25 06:29:06] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-05-25 06:29:06] [INFO ] Redundant transitions in 27 ms returned []
Running 294 sub problems to find dead transitions.
[2024-05-25 06:29:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 357/612 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 21/633 variables, 21/298 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/633 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 0/633 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 633/633 variables, and 298 constraints, problems are : Problem set: 0 solved, 294 unsolved in 17923 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 357/612 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 294/571 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 21/633 variables, 21/592 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/633 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/633 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 633/633 variables, and 592 constraints, problems are : Problem set: 0 solved, 294 unsolved in 23460 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
After SMT, in 41628ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 41644ms
Starting structural reductions in SI_LTL mode, iteration 1 : 276/2401 places, 357/2166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42025 ms. Remains : 276/2401 places, 357/2166 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-02
Product exploration explored 100000 steps with 1228 reset in 501 ms.
Product exploration explored 100000 steps with 1208 reset in 587 ms.
Computed a total of 276 stabilizing places and 357 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 276 transition count 357
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 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 246 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 347 steps (0 resets) in 8 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-25 06:29:50] [INFO ] Invariant cache hit.
[2024-05-25 06:29:51] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 9 ms returned sat
[2024-05-25 06:29:51] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-25 06:29:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:29:51] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 9 ms returned sat
[2024-05-25 06:29:51] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2024-05-25 06:29:51] [INFO ] Computed and/alt/rep : 231/336/231 causal constraints (skipped 63 transitions) in 32 ms.
[2024-05-25 06:29:52] [INFO ] Added : 118 causal constraints over 24 iterations in 823 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 42 out of 276 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 : 276/276 places, 357/357 transitions.
Applied a total of 0 rules in 12 ms. Remains 276 /276 variables (removed 0) and now considering 357/357 (removed 0) transitions.
[2024-05-25 06:29:52] [INFO ] Invariant cache hit.
[2024-05-25 06:29:52] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-25 06:29:52] [INFO ] Invariant cache hit.
[2024-05-25 06:29:52] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2024-05-25 06:29:52] [INFO ] Redundant transitions in 27 ms returned []
Running 294 sub problems to find dead transitions.
[2024-05-25 06:29:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 357/612 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 21/633 variables, 21/298 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/633 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 0/633 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 633/633 variables, and 298 constraints, problems are : Problem set: 0 solved, 294 unsolved in 17937 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 357/612 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 294/571 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 21/633 variables, 21/592 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/633 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/633 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 633/633 variables, and 592 constraints, problems are : Problem set: 0 solved, 294 unsolved in 23209 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
After SMT, in 41263ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 41269ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41725 ms. Remains : 276/276 places, 357/357 transitions.
Computed a total of 276 stabilizing places and 357 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 276 transition count 357
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 309 steps (0 resets) in 6 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-25 06:30:34] [INFO ] Invariant cache hit.
[2024-05-25 06:30:35] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 9 ms returned sat
[2024-05-25 06:30:35] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-25 06:30:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:30:35] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 8 ms returned sat
[2024-05-25 06:30:35] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-25 06:30:35] [INFO ] Computed and/alt/rep : 231/336/231 causal constraints (skipped 63 transitions) in 34 ms.
[2024-05-25 06:30:36] [INFO ] Added : 118 causal constraints over 24 iterations in 690 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1249 reset in 508 ms.
Product exploration explored 100000 steps with 1273 reset in 529 ms.
Support contains 42 out of 276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 276/276 places, 357/357 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 255 transition count 252
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 231 place count 150 transition count 252
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 231 place count 150 transition count 210
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 315 place count 108 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 317 place count 106 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 319 place count 106 transition count 168
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 361 place count 106 transition count 126
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 382 place count 85 transition count 105
Applied a total of 382 rules in 19 ms. Remains 85 /276 variables (removed 191) and now considering 105/357 (removed 252) transitions.
// Phase 1: matrix 105 rows 85 cols
[2024-05-25 06:30:37] [INFO ] Computed 1 invariants in 3 ms
[2024-05-25 06:30:37] [INFO ] Implicit Places using invariants in 63 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/276 places, 105/357 transitions.
Reduce places removed 21 places and 21 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /84 variables (removed 21) and now considering 84/105 (removed 21) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 86 ms. Remains : 63/276 places, 84/357 transitions.
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-02 finished in 91307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (F(G(p0)) U p1))))'
Support contains 168 out of 2401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2401/2401 places, 2166/2166 transitions.
Discarding 168 places :
Implicit places reduction removed 168 places
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 2233 transition count 2166
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 251 place count 2150 transition count 2063
Iterating global reduction 1 with 83 rules applied. Total rules applied 334 place count 2150 transition count 2063
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 396 place count 2088 transition count 2001
Iterating global reduction 1 with 62 rules applied. Total rules applied 458 place count 2088 transition count 2001
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 480 place count 2066 transition count 1939
Iterating global reduction 1 with 22 rules applied. Total rules applied 502 place count 2066 transition count 1939
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 564 place count 2004 transition count 1877
Iterating global reduction 1 with 62 rules applied. Total rules applied 626 place count 2004 transition count 1877
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 688 place count 1942 transition count 1815
Iterating global reduction 1 with 62 rules applied. Total rules applied 750 place count 1942 transition count 1815
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 812 place count 1880 transition count 1753
Iterating global reduction 1 with 62 rules applied. Total rules applied 874 place count 1880 transition count 1753
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 936 place count 1818 transition count 1691
Iterating global reduction 1 with 62 rules applied. Total rules applied 998 place count 1818 transition count 1691
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1040 place count 1776 transition count 1649
Iterating global reduction 1 with 42 rules applied. Total rules applied 1082 place count 1776 transition count 1649
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1124 place count 1734 transition count 1607
Iterating global reduction 1 with 42 rules applied. Total rules applied 1166 place count 1734 transition count 1607
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1208 place count 1692 transition count 1565
Iterating global reduction 1 with 42 rules applied. Total rules applied 1250 place count 1692 transition count 1565
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1292 place count 1650 transition count 1523
Iterating global reduction 1 with 42 rules applied. Total rules applied 1334 place count 1650 transition count 1523
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1376 place count 1608 transition count 1481
Iterating global reduction 1 with 42 rules applied. Total rules applied 1418 place count 1608 transition count 1481
Applied a total of 1418 rules in 1831 ms. Remains 1608 /2401 variables (removed 793) and now considering 1481/2166 (removed 685) transitions.
// Phase 1: matrix 1481 rows 1608 cols
[2024-05-25 06:30:39] [INFO ] Computed 191 invariants in 15 ms
[2024-05-25 06:30:40] [INFO ] Implicit Places using invariants in 575 ms returned [851]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 592 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1607/2401 places, 1481/2166 transitions.
Applied a total of 0 rules in 97 ms. Remains 1607 /1607 variables (removed 0) and now considering 1481/1481 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2522 ms. Remains : 1607/2401 places, 1481/2166 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-03
Stuttering criterion allowed to conclude after 1214 steps with 0 reset in 25 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-03 finished in 2790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 126 out of 2401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2401/2401 places, 2166/2166 transitions.
Discarding 231 places :
Implicit places reduction removed 231 places
Iterating post reduction 0 with 231 rules applied. Total rules applied 231 place count 2170 transition count 2166
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 272 place count 2129 transition count 2105
Iterating global reduction 1 with 41 rules applied. Total rules applied 313 place count 2129 transition count 2105
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 333 place count 2109 transition count 2085
Iterating global reduction 1 with 20 rules applied. Total rules applied 353 place count 2109 transition count 2085
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 373 place count 2089 transition count 2065
Iterating global reduction 1 with 20 rules applied. Total rules applied 393 place count 2089 transition count 2065
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 413 place count 2069 transition count 2045
Iterating global reduction 1 with 20 rules applied. Total rules applied 433 place count 2069 transition count 2045
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 453 place count 2049 transition count 2025
Iterating global reduction 1 with 20 rules applied. Total rules applied 473 place count 2049 transition count 2025
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 493 place count 2029 transition count 2005
Iterating global reduction 1 with 20 rules applied. Total rules applied 513 place count 2029 transition count 2005
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 533 place count 2009 transition count 1985
Iterating global reduction 1 with 20 rules applied. Total rules applied 553 place count 2009 transition count 1985
Applied a total of 553 rules in 1359 ms. Remains 2009 /2401 variables (removed 392) and now considering 1985/2166 (removed 181) transitions.
// Phase 1: matrix 1985 rows 2009 cols
[2024-05-25 06:30:41] [INFO ] Computed 128 invariants in 20 ms
[2024-05-25 06:30:42] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-05-25 06:30:42] [INFO ] Invariant cache hit.
[2024-05-25 06:30:45] [INFO ] Implicit Places using invariants and state equation in 2862 ms returned []
Implicit Place search using SMT with State Equation took 3471 ms to find 0 implicit places.
Running 1964 sub problems to find dead transitions.
[2024-05-25 06:30:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1988 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1964 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1988/3994 variables, and 126 constraints, problems are : Problem set: 0 solved, 1964 unsolved in 30116 ms.
Refiners :[Generalized P Invariants (flows): 126/128 constraints, State Equation: 0/2009 constraints, PredecessorRefiner: 1964/1964 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1964 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1988 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1964 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1988/3994 variables, and 126 constraints, problems are : Problem set: 0 solved, 1964 unsolved in 30057 ms.
Refiners :[Generalized P Invariants (flows): 126/128 constraints, State Equation: 0/2009 constraints, PredecessorRefiner: 0/1964 constraints, Known Traps: 0/0 constraints]
After SMT, in 60925ms problems are : Problem set: 0 solved, 1964 unsolved
Search for dead transitions found 0 dead transitions in 60952ms
Starting structural reductions in LTL mode, iteration 1 : 2009/2401 places, 1985/2166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65795 ms. Remains : 2009/2401 places, 1985/2166 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-04
Product exploration explored 100000 steps with 380 reset in 687 ms.
Product exploration explored 100000 steps with 383 reset in 642 ms.
Computed a total of 2009 stabilizing places and 1985 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2009 transition count 1985
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 (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 256 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 954 steps (0 resets) in 11 ms. (79 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 11 factoid took 281 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-25 06:31:49] [INFO ] Invariant cache hit.
[2024-05-25 06:31:51] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 108 ms returned sat
[2024-05-25 06:31:54] [INFO ] [Real]Absence check using state equation in 3137 ms returned sat
[2024-05-25 06:31:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:31:56] [INFO ] [Nat]Absence check using 0 positive and 128 generalized place invariants in 105 ms returned sat
[2024-05-25 06:32:04] [INFO ] [Nat]Absence check using state equation in 7595 ms returned sat
[2024-05-25 06:32:04] [INFO ] Computed and/alt/rep : 1899/2131/1899 causal constraints (skipped 65 transitions) in 154 ms.
[2024-05-25 06:32:10] [INFO ] Added : 140 causal constraints over 28 iterations in 5448 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 63 out of 2009 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2009/2009 places, 1985/1985 transitions.
Applied a total of 0 rules in 155 ms. Remains 2009 /2009 variables (removed 0) and now considering 1985/1985 (removed 0) transitions.
[2024-05-25 06:32:10] [INFO ] Invariant cache hit.
[2024-05-25 06:32:10] [INFO ] Implicit Places using invariants in 582 ms returned []
[2024-05-25 06:32:10] [INFO ] Invariant cache hit.
[2024-05-25 06:32:13] [INFO ] Implicit Places using invariants and state equation in 2945 ms returned []
Implicit Place search using SMT with State Equation took 3555 ms to find 0 implicit places.
Running 1964 sub problems to find dead transitions.
[2024-05-25 06:32:13] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1988 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1964 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1988/3994 variables, and 126 constraints, problems are : Problem set: 0 solved, 1964 unsolved in 30062 ms.
Refiners :[Generalized P Invariants (flows): 126/128 constraints, State Equation: 0/2009 constraints, PredecessorRefiner: 1964/1964 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1964 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1988 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1964 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1988/3994 variables, and 126 constraints, problems are : Problem set: 0 solved, 1964 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 126/128 constraints, State Equation: 0/2009 constraints, PredecessorRefiner: 0/1964 constraints, Known Traps: 0/0 constraints]
After SMT, in 60619ms problems are : Problem set: 0 solved, 1964 unsolved
Search for dead transitions found 0 dead transitions in 60644ms
Finished structural reductions in LTL mode , in 1 iterations and 64358 ms. Remains : 2009/2009 places, 1985/1985 transitions.
Computed a total of 2009 stabilizing places and 1985 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2009 transition count 1985
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 1004 steps (0 resets) in 15 ms. (62 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-25 06:33:15] [INFO ] Invariant cache hit.
[2024-05-25 06:33:17] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 104 ms returned sat
[2024-05-25 06:33:20] [INFO ] [Real]Absence check using state equation in 3161 ms returned sat
[2024-05-25 06:33:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:33:22] [INFO ] [Nat]Absence check using 0 positive and 128 generalized place invariants in 108 ms returned sat
[2024-05-25 06:33:30] [INFO ] [Nat]Absence check using state equation in 7421 ms returned sat
[2024-05-25 06:33:30] [INFO ] Computed and/alt/rep : 1899/2131/1899 causal constraints (skipped 65 transitions) in 159 ms.
[2024-05-25 06:33:35] [INFO ] Added : 140 causal constraints over 28 iterations in 5358 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 383 reset in 552 ms.
Product exploration explored 100000 steps with 382 reset in 579 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 63 out of 2009 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2009/2009 places, 1985/1985 transitions.
Graph (complete) has 2384 edges and 2009 vertex of which 1074 are kept as prefixes of interest. Removing 935 places using SCC suffix rule.8 ms
Discarding 935 places :
Also discarding 830 output transitions
Drop transitions (Output transitions of discarded places.) removed 830 transitions
Performed 462 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 462 rules applied. Total rules applied 463 place count 1074 transition count 1155
Performed 357 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 357 Pre rules applied. Total rules applied 463 place count 1074 transition count 1197
Deduced a syphon composed of 819 places in 0 ms
Iterating global reduction 1 with 357 rules applied. Total rules applied 820 place count 1074 transition count 1197
Discarding 651 places :
Symmetric choice reduction at 1 with 651 rule applications. Total rules 1471 place count 423 transition count 546
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 1 with 651 rules applied. Total rules applied 2122 place count 423 transition count 546
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 252 places in 1 ms
Iterating global reduction 1 with 84 rules applied. Total rules applied 2206 place count 423 transition count 546
Discarding 147 places :
Symmetric choice reduction at 1 with 147 rule applications. Total rules 2353 place count 276 transition count 399
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 1 with 147 rules applied. Total rules applied 2500 place count 276 transition count 399
Deduced a syphon composed of 105 places in 0 ms
Applied a total of 2500 rules in 429 ms. Remains 276 /2009 variables (removed 1733) and now considering 399/1985 (removed 1586) transitions.
[2024-05-25 06:33:37] [INFO ] Redundant transitions in 2 ms returned []
Running 336 sub problems to find dead transitions.
// Phase 1: matrix 399 rows 276 cols
[2024-05-25 06:33:38] [INFO ] Computed 1 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
At refinement iteration 2 (OVERLAPS) 399/654 variables, 255/256 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/654 variables, 0/256 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 21/675 variables, 21/277 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/675 variables, 0/277 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/675 variables, 0/277 constraints. Problems are: Problem set: 147 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 277 constraints, problems are : Problem set: 147 solved, 189 unsolved in 12701 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 147 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 21/171 variables, 1/1 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/1 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 399/570 variables, 171/172 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 189/361 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/361 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 105/675 variables, 105/466 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/466 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 0/675 variables, 0/466 constraints. Problems are: Problem set: 147 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 675/675 variables, and 466 constraints, problems are : Problem set: 147 solved, 189 unsolved in 13478 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 189/336 constraints, Known Traps: 0/0 constraints]
After SMT, in 26323ms problems are : Problem set: 147 solved, 189 unsolved
Search for dead transitions found 147 dead transitions in 26329ms
Found 147 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 147 transitions
Dead transitions reduction (with SMT) removed 147 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 276/2009 places, 252/1985 transitions.
Graph (complete) has 273 edges and 276 vertex of which 171 are kept as prefixes of interest. Removing 105 places using SCC suffix rule.1 ms
Discarding 105 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 171 /276 variables (removed 105) and now considering 252/252 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 171/2009 places, 252/1985 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26778 ms. Remains : 171/2009 places, 252/1985 transitions.
Support contains 63 out of 2009 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2009/2009 places, 1985/1985 transitions.
Applied a total of 0 rules in 123 ms. Remains 2009 /2009 variables (removed 0) and now considering 1985/1985 (removed 0) transitions.
// Phase 1: matrix 1985 rows 2009 cols
[2024-05-25 06:34:04] [INFO ] Computed 128 invariants in 15 ms
[2024-05-25 06:34:05] [INFO ] Implicit Places using invariants in 687 ms returned []
[2024-05-25 06:34:05] [INFO ] Invariant cache hit.
[2024-05-25 06:34:08] [INFO ] Implicit Places using invariants and state equation in 3018 ms returned []
Implicit Place search using SMT with State Equation took 3712 ms to find 0 implicit places.
Running 1964 sub problems to find dead transitions.
[2024-05-25 06:34:08] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1988 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1964 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1988/3994 variables, and 126 constraints, problems are : Problem set: 0 solved, 1964 unsolved in 30053 ms.
Refiners :[Generalized P Invariants (flows): 126/128 constraints, State Equation: 0/2009 constraints, PredecessorRefiner: 1964/1964 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1964 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1988 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1964 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1988/3994 variables, and 126 constraints, problems are : Problem set: 0 solved, 1964 unsolved in 30045 ms.
Refiners :[Generalized P Invariants (flows): 126/128 constraints, State Equation: 0/2009 constraints, PredecessorRefiner: 0/1964 constraints, Known Traps: 0/0 constraints]
After SMT, in 60601ms problems are : Problem set: 0 solved, 1964 unsolved
Search for dead transitions found 0 dead transitions in 60626ms
Finished structural reductions in LTL mode , in 1 iterations and 64465 ms. Remains : 2009/2009 places, 1985/1985 transitions.
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-04 finished in 268371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(!p1 U (p2||G(!p1))))))'
Support contains 108 out of 2401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2401/2401 places, 2166/2166 transitions.
Discarding 231 places :
Implicit places reduction removed 231 places
Iterating post reduction 0 with 231 rules applied. Total rules applied 231 place count 2170 transition count 2166
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 314 place count 2087 transition count 2063
Iterating global reduction 1 with 83 rules applied. Total rules applied 397 place count 2087 transition count 2063
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 459 place count 2025 transition count 2001
Iterating global reduction 1 with 62 rules applied. Total rules applied 521 place count 2025 transition count 2001
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 541 place count 2005 transition count 1981
Iterating global reduction 1 with 20 rules applied. Total rules applied 561 place count 2005 transition count 1981
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 581 place count 1985 transition count 1961
Iterating global reduction 1 with 20 rules applied. Total rules applied 601 place count 1985 transition count 1961
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 621 place count 1965 transition count 1941
Iterating global reduction 1 with 20 rules applied. Total rules applied 641 place count 1965 transition count 1941
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 661 place count 1945 transition count 1921
Iterating global reduction 1 with 20 rules applied. Total rules applied 681 place count 1945 transition count 1921
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 701 place count 1925 transition count 1901
Iterating global reduction 1 with 20 rules applied. Total rules applied 721 place count 1925 transition count 1901
Applied a total of 721 rules in 1045 ms. Remains 1925 /2401 variables (removed 476) and now considering 1901/2166 (removed 265) transitions.
// Phase 1: matrix 1901 rows 1925 cols
[2024-05-25 06:35:10] [INFO ] Computed 128 invariants in 14 ms
[2024-05-25 06:35:10] [INFO ] Implicit Places using invariants in 638 ms returned []
[2024-05-25 06:35:10] [INFO ] Invariant cache hit.
[2024-05-25 06:35:12] [INFO ] Implicit Places using invariants and state equation in 1893 ms returned []
Implicit Place search using SMT with State Equation took 2538 ms to find 0 implicit places.
Running 1880 sub problems to find dead transitions.
[2024-05-25 06:35:12] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1904 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1880 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1904/3826 variables, and 126 constraints, problems are : Problem set: 0 solved, 1880 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 126/128 constraints, State Equation: 0/1925 constraints, PredecessorRefiner: 1880/1880 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1880 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1904 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1880 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1904/3826 variables, and 126 constraints, problems are : Problem set: 0 solved, 1880 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 126/128 constraints, State Equation: 0/1925 constraints, PredecessorRefiner: 0/1880 constraints, Known Traps: 0/0 constraints]
After SMT, in 60557ms problems are : Problem set: 0 solved, 1880 unsolved
Search for dead transitions found 0 dead transitions in 60579ms
Starting structural reductions in LTL mode, iteration 1 : 1925/2401 places, 1901/2166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64168 ms. Remains : 1925/2401 places, 1901/2166 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-06 finished in 64343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 84 out of 2401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2401/2401 places, 2166/2166 transitions.
Discarding 210 places :
Implicit places reduction removed 210 places
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2191 transition count 2166
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 293 place count 2108 transition count 2063
Iterating global reduction 1 with 83 rules applied. Total rules applied 376 place count 2108 transition count 2063
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 438 place count 2046 transition count 2001
Iterating global reduction 1 with 62 rules applied. Total rules applied 500 place count 2046 transition count 2001
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 522 place count 2024 transition count 1939
Iterating global reduction 1 with 22 rules applied. Total rules applied 544 place count 2024 transition count 1939
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 606 place count 1962 transition count 1877
Iterating global reduction 1 with 62 rules applied. Total rules applied 668 place count 1962 transition count 1877
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 730 place count 1900 transition count 1815
Iterating global reduction 1 with 62 rules applied. Total rules applied 792 place count 1900 transition count 1815
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 854 place count 1838 transition count 1753
Iterating global reduction 1 with 62 rules applied. Total rules applied 916 place count 1838 transition count 1753
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 978 place count 1776 transition count 1691
Iterating global reduction 1 with 62 rules applied. Total rules applied 1040 place count 1776 transition count 1691
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1082 place count 1734 transition count 1649
Iterating global reduction 1 with 42 rules applied. Total rules applied 1124 place count 1734 transition count 1649
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1166 place count 1692 transition count 1607
Iterating global reduction 1 with 42 rules applied. Total rules applied 1208 place count 1692 transition count 1607
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1250 place count 1650 transition count 1565
Iterating global reduction 1 with 42 rules applied. Total rules applied 1292 place count 1650 transition count 1565
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1334 place count 1608 transition count 1523
Iterating global reduction 1 with 42 rules applied. Total rules applied 1376 place count 1608 transition count 1523
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1418 place count 1566 transition count 1481
Iterating global reduction 1 with 42 rules applied. Total rules applied 1460 place count 1566 transition count 1481
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1502 place count 1524 transition count 1439
Iterating global reduction 1 with 42 rules applied. Total rules applied 1544 place count 1524 transition count 1439
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1586 place count 1482 transition count 1397
Iterating global reduction 1 with 42 rules applied. Total rules applied 1628 place count 1482 transition count 1397
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1670 place count 1440 transition count 1355
Iterating global reduction 1 with 42 rules applied. Total rules applied 1712 place count 1440 transition count 1355
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1754 place count 1398 transition count 1313
Iterating global reduction 1 with 42 rules applied. Total rules applied 1796 place count 1398 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 1838 place count 1398 transition count 1271
Applied a total of 1838 rules in 1651 ms. Remains 1398 /2401 variables (removed 1003) and now considering 1271/2166 (removed 895) transitions.
// Phase 1: matrix 1271 rows 1398 cols
[2024-05-25 06:36:14] [INFO ] Computed 149 invariants in 9 ms
[2024-05-25 06:36:15] [INFO ] Implicit Places using invariants in 524 ms returned [620]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 526 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1397/2401 places, 1271/2166 transitions.
Applied a total of 0 rules in 59 ms. Remains 1397 /1397 variables (removed 0) and now considering 1271/1271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2239 ms. Remains : 1397/2401 places, 1271/2166 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-08
Product exploration explored 100000 steps with 432 reset in 443 ms.
Product exploration explored 100000 steps with 482 reset in 477 ms.
Computed a total of 1397 stabilizing places and 1271 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1397 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 p1) p0), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 167 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1639 steps (0 resets) in 17 ms. (91 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 201 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 1271 rows 1397 cols
[2024-05-25 06:36:17] [INFO ] Computed 148 invariants in 11 ms
[2024-05-25 06:36:19] [INFO ] [Real]Absence check using 0 positive and 148 generalized place invariants in 90 ms returned sat
[2024-05-25 06:36:20] [INFO ] [Real]Absence check using state equation in 1098 ms returned sat
[2024-05-25 06:36:20] [INFO ] Computed and/alt/rep : 1248/1417/1248 causal constraints (skipped 2 transitions) in 106 ms.
[2024-05-25 06:36:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:36:34] [INFO ] [Nat]Absence check using 0 positive and 148 generalized place invariants in 106 ms returned sat
[2024-05-25 06:36:36] [INFO ] [Nat]Absence check using state equation in 1913 ms returned sat
[2024-05-25 06:36:36] [INFO ] Computed and/alt/rep : 1248/1417/1248 causal constraints (skipped 2 transitions) in 83 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-25 06:36:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 42 out of 1397 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 : 1397/1397 places, 1271/1271 transitions.
Graph (complete) has 1586 edges and 1397 vertex of which 714 are kept as prefixes of interest. Removing 683 places using SCC suffix rule.2 ms
Discarding 683 places :
Also discarding 557 output transitions
Drop transitions (Output transitions of discarded places.) removed 557 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 483 transitions
Trivial Post-agglo rules discarded 483 transitions
Performed 483 trivial Post agglomeration. Transition count delta: 483
Iterating post reduction 0 with 483 rules applied. Total rules applied 484 place count 693 transition count 210
Reduce places removed 483 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 504 rules applied. Total rules applied 988 place count 210 transition count 189
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 1009 place count 189 transition count 189
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 1009 place count 189 transition count 147
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 1093 place count 147 transition count 147
Applied a total of 1093 rules in 15 ms. Remains 147 /1397 variables (removed 1250) and now considering 147/1271 (removed 1124) transitions.
// Phase 1: matrix 147 rows 147 cols
[2024-05-25 06:36:47] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 06:36:48] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-25 06:36:48] [INFO ] Invariant cache hit.
[2024-05-25 06:36:48] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-25 06:36:48] [INFO ] Redundant transitions in 0 ms returned []
Running 126 sub problems to find dead transitions.
[2024-05-25 06:36:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 147/273 variables, 126/147 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 21/294 variables, 21/168 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 168 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3962 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 147/273 variables, 126/147 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 126/273 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 21/294 variables, 21/294 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/294 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 294 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3451 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
After SMT, in 7425ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 7426ms
Starting structural reductions in SI_LTL mode, iteration 1 : 147/1397 places, 147/1271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7639 ms. Remains : 147/1397 places, 147/1271 transitions.
Computed a total of 147 stabilizing places and 147 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 147
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 93 steps (0 resets) in 7 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
[2024-05-25 06:36:56] [INFO ] Invariant cache hit.
[2024-05-25 06:36:56] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 8 ms returned sat
[2024-05-25 06:36:56] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-25 06:36:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:36:56] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 8 ms returned sat
[2024-05-25 06:36:56] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-25 06:36:56] [INFO ] Computed and/alt/rep : 126/147/126 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-25 06:36:56] [INFO ] Added : 42 causal constraints over 9 iterations in 129 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 4330 reset in 427 ms.
Product exploration explored 100000 steps with 4319 reset in 454 ms.
Support contains 42 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 147/147 transitions.
Reduce places removed 21 places and 21 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 0 place count 126 transition count 84
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 0 with 105 rules applied. Total rules applied 105 place count 63 transition count 84
Applied a total of 105 rules in 5 ms. Remains 63 /147 variables (removed 84) and now considering 84/147 (removed 63) transitions.
// Phase 1: matrix 84 rows 63 cols
[2024-05-25 06:36:57] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 06:36:57] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 06:36:57] [INFO ] Invariant cache hit.
[2024-05-25 06:36:57] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-25 06:36:57] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-25 06:36:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 84/126 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 21/147 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 0/147 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 63 constraints, problems are : Problem set: 0 solved, 42 unsolved in 641 ms.
Refiners :[State Equation: 63/63 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 84/126 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 42/84 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 21/147 variables, 21/105 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/147 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 105 constraints, problems are : Problem set: 0 solved, 42 unsolved in 542 ms.
Refiners :[State Equation: 63/63 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 1203ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1203ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/147 places, 84/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1298 ms. Remains : 63/147 places, 84/147 transitions.
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-08 finished in 45715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 105 out of 2401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2401/2401 places, 2166/2166 transitions.
Graph (complete) has 3068 edges and 2401 vertex of which 2398 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 21 places and 21 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 231 places :
Implicit places reduction removed 231 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1512 transitions
Trivial Post-agglo rules discarded 1512 transitions
Performed 1512 trivial Post agglomeration. Transition count delta: 1512
Iterating post reduction 0 with 1764 rules applied. Total rules applied 1765 place count 2146 transition count 609
Reduce places removed 1512 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 1533 rules applied. Total rules applied 3298 place count 634 transition count 588
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 3319 place count 613 transition count 588
Performed 210 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 210 Pre rules applied. Total rules applied 3319 place count 613 transition count 378
Deduced a syphon composed of 210 places in 0 ms
Ensure Unique test removed 63 places
Reduce places removed 273 places and 0 transitions.
Iterating global reduction 3 with 483 rules applied. Total rules applied 3802 place count 340 transition count 378
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 42 rules applied. Total rules applied 3844 place count 340 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 4 with 63 rules applied. Total rules applied 3907 place count 298 transition count 315
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 3909 place count 296 transition count 273
Iterating global reduction 5 with 2 rules applied. Total rules applied 3911 place count 296 transition count 273
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 5 with 63 rules applied. Total rules applied 3974 place count 296 transition count 210
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 3995 place count 275 transition count 210
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 7 with 21 rules applied. Total rules applied 4016 place count 254 transition count 189
Applied a total of 4016 rules in 102 ms. Remains 254 /2401 variables (removed 2147) and now considering 189/2166 (removed 1977) transitions.
// Phase 1: matrix 189 rows 254 cols
[2024-05-25 06:36:59] [INFO ] Computed 65 invariants in 1 ms
[2024-05-25 06:36:59] [INFO ] Implicit Places using invariants in 215 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 216 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 253/2401 places, 189/2166 transitions.
Reduce places removed 21 places and 21 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /253 variables (removed 21) and now considering 168/189 (removed 21) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 322 ms. Remains : 232/2401 places, 168/2166 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-09
Product exploration explored 100000 steps with 1213 reset in 902 ms.
Product exploration explored 100000 steps with 1219 reset in 985 ms.
Computed a total of 232 stabilizing places and 168 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 232 transition count 168
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 (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 306 steps (0 resets) in 10 ms. (27 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 11 factoid took 254 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-09 finished in 3005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 147 out of 2401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2401/2401 places, 2166/2166 transitions.
Graph (complete) has 3068 edges and 2401 vertex of which 2398 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 21 places and 21 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 168 places :
Implicit places reduction removed 168 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1218 transitions
Trivial Post-agglo rules discarded 1218 transitions
Performed 1218 trivial Post agglomeration. Transition count delta: 1218
Iterating post reduction 0 with 1407 rules applied. Total rules applied 1408 place count 2209 transition count 903
Reduce places removed 1218 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 1 with 1281 rules applied. Total rules applied 2689 place count 991 transition count 840
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 2752 place count 928 transition count 840
Performed 357 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 357 Pre rules applied. Total rules applied 2752 place count 928 transition count 483
Deduced a syphon composed of 357 places in 0 ms
Ensure Unique test removed 126 places
Reduce places removed 483 places and 0 transitions.
Iterating global reduction 3 with 840 rules applied. Total rules applied 3592 place count 445 transition count 483
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 42 rules applied. Total rules applied 3634 place count 445 transition count 441
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 84 rules applied. Total rules applied 3718 place count 403 transition count 399
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 3739 place count 382 transition count 399
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 3739 place count 382 transition count 378
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 3781 place count 361 transition count 378
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 3783 place count 359 transition count 336
Iterating global reduction 6 with 2 rules applied. Total rules applied 3785 place count 359 transition count 336
Applied a total of 3785 rules in 72 ms. Remains 359 /2401 variables (removed 2042) and now considering 336/2166 (removed 1830) transitions.
// Phase 1: matrix 336 rows 359 cols
[2024-05-25 06:37:02] [INFO ] Computed 65 invariants in 2 ms
[2024-05-25 06:37:02] [INFO ] Implicit Places using invariants in 158 ms returned [337]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 161 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 358/2401 places, 336/2166 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 358 transition count 315
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 337 transition count 315
Applied a total of 42 rules in 7 ms. Remains 337 /358 variables (removed 21) and now considering 315/336 (removed 21) transitions.
// Phase 1: matrix 315 rows 337 cols
[2024-05-25 06:37:02] [INFO ] Computed 64 invariants in 1 ms
[2024-05-25 06:37:02] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-25 06:37:02] [INFO ] Invariant cache hit.
[2024-05-25 06:37:02] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 337/2401 places, 315/2166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 619 ms. Remains : 337/2401 places, 315/2166 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-11
Product exploration explored 100000 steps with 1314 reset in 676 ms.
Product exploration explored 100000 steps with 1310 reset in 824 ms.
Computed a total of 337 stabilizing places and 315 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 337 transition count 315
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 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-11 finished in 2423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 63 out of 2401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2401/2401 places, 2166/2166 transitions.
Graph (complete) has 3068 edges and 2401 vertex of which 105 are kept as prefixes of interest. Removing 2296 places using SCC suffix rule.2 ms
Discarding 2296 places :
Also discarding 2019 output transitions
Drop transitions (Output transitions of discarded places.) removed 2019 transitions
Reduce places removed 21 places and 21 transitions.
Applied a total of 1 rules in 6 ms. Remains 84 /2401 variables (removed 2317) and now considering 126/2166 (removed 2040) transitions.
// Phase 1: matrix 126 rows 84 cols
[2024-05-25 06:37:04] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 06:37:04] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-25 06:37:04] [INFO ] Invariant cache hit.
[2024-05-25 06:37:04] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-25 06:37:04] [INFO ] Redundant transitions in 0 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-25 06:37:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 126/189 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 21/210 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 0/210 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 84 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1248 ms.
Refiners :[State Equation: 84/84 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 126/189 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 63/126 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 21/210 variables, 21/147 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 147 constraints, problems are : Problem set: 0 solved, 63 unsolved in 990 ms.
Refiners :[State Equation: 84/84 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 2244ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2244ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/2401 places, 126/2166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2365 ms. Remains : 84/2401 places, 126/2166 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 408 ms.
Product exploration explored 100000 steps with 50000 reset in 432 ms.
Computed a total of 84 stabilizing places and 126 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 126
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-14 finished in 3319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 189 out of 2401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2401/2401 places, 2166/2166 transitions.
Discarding 168 places :
Implicit places reduction removed 168 places
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 2233 transition count 2166
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 251 place count 2150 transition count 2063
Iterating global reduction 1 with 83 rules applied. Total rules applied 334 place count 2150 transition count 2063
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 396 place count 2088 transition count 2001
Iterating global reduction 1 with 62 rules applied. Total rules applied 458 place count 2088 transition count 2001
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 480 place count 2066 transition count 1939
Iterating global reduction 1 with 22 rules applied. Total rules applied 502 place count 2066 transition count 1939
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 522 place count 2046 transition count 1919
Iterating global reduction 1 with 20 rules applied. Total rules applied 542 place count 2046 transition count 1919
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 562 place count 2026 transition count 1899
Iterating global reduction 1 with 20 rules applied. Total rules applied 582 place count 2026 transition count 1899
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 602 place count 2006 transition count 1879
Iterating global reduction 1 with 20 rules applied. Total rules applied 622 place count 2006 transition count 1879
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 642 place count 1986 transition count 1859
Iterating global reduction 1 with 20 rules applied. Total rules applied 662 place count 1986 transition count 1859
Applied a total of 662 rules in 951 ms. Remains 1986 /2401 variables (removed 415) and now considering 1859/2166 (removed 307) transitions.
// Phase 1: matrix 1859 rows 1986 cols
[2024-05-25 06:37:08] [INFO ] Computed 191 invariants in 13 ms
[2024-05-25 06:37:09] [INFO ] Implicit Places using invariants in 695 ms returned [1229]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 697 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1985/2401 places, 1859/2166 transitions.
Applied a total of 0 rules in 121 ms. Remains 1985 /1985 variables (removed 0) and now considering 1859/1859 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1770 ms. Remains : 1985/2401 places, 1859/2166 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 871 ms.
Product exploration explored 100000 steps with 50000 reset in 895 ms.
Computed a total of 1985 stabilizing places and 1859 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1985 transition count 1859
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 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 19 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-15 finished in 4370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
[2024-05-25 06:37:12] [INFO ] Flatten gal took : 96 ms
[2024-05-25 06:37:12] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2024-05-25 06:37:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2401 places, 2166 transitions and 5234 arcs took 18 ms.
Total runtime 500635 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FamilyReunion-COL-L00020M0002C001P001G001

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2401
TRANSITIONS: 2166
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.035s, Sys 0.017s]


SAVING FILE /home/mcc/execution/407/model (.net / .def) ...
EXPORT TIME: [User 0.011s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1383
MODEL NAME: /home/mcc/execution/407/model
2401 places, 2166 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FamilyReunion-COL-L00020M0002C001P001G001, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r157-smll-171636265600396"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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