About the Execution of LTSMin+red for FamilyReunion-COL-L00200M0020C010P010G005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15336.808 | 3600000.00 | 9597284.00 | 6012.40 | F?TFFFT?T?FFTT?T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r169-tall-167838855700331.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FamilyReunion-COL-L00200M0020C010P010G005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855700331
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.8K Feb 26 17:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 21:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 21:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 20:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 20:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 146K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-00
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-01
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-02
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-03
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-04
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-05
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-06
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-07
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-08
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-09
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-10
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-11
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-12
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-13
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-14
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678513314068
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00200M0020C010P010G005
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 05:41:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 05:41:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:41:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-11 05:41:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 05:41:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 725 ms
[2023-03-11 05:41:56] [INFO ] Detected 5 constant HL places corresponding to 56 PT places.
[2023-03-11 05:41:56] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 144109 PT places and 134480.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-11 05:41:56] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 7 ms.
[2023-03-11 05:41:56] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10102 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=336 ) properties (out of 22) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 66 rows 99 cols
[2023-03-11 05:41:57] [INFO ] Computed 33 place invariants in 8 ms
[2023-03-11 05:41:57] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-11 05:41:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:41:57] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-11 05:41:57] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2023-03-11 05:41:57] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :14
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-11 05:41:57] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :14
Fused 15 Parikh solutions to 12 different solutions.
Finished Parikh walk after 525 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=65 )
Parikh walk visited 14 properties in 296 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2023-03-11 05:41:58] [INFO ] Flatten gal took : 30 ms
[2023-03-11 05:41:58] [INFO ] Flatten gal took : 9 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 11
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :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 6
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
[2023-03-11 05:41:58] [INFO ] Unfolded HLPN to a Petri net with 128969 places and 110159 transitions 316597 arcs in 539 ms.
[2023-03-11 05:41:58] [INFO ] Unfolded 11 HLPN properties in 5 ms.
Deduced a syphon composed of 201 places in 386 ms
Reduce places removed 237 places and 0 transitions.
Support contains 39418 out of 128732 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128732/128732 places, 110159/110159 transitions.
Reduce places removed 627 places and 0 transitions.
Discarding 17286 places :
Implicit places reduction removed 17286 places
Iterating post reduction 0 with 17913 rules applied. Total rules applied 17913 place count 110819 transition count 110159
Applied a total of 17913 rules in 8564 ms. Remains 110819 /128732 variables (removed 17913) and now considering 110159/110159 (removed 0) transitions.
// Phase 1: matrix 110159 rows 110819 cols
[2023-03-11 05:42:53] [INFO ] Computed 12871 place invariants in 44723 ms
[2023-03-11 05:43:02] [INFO ] Implicit Places using invariants in 53270 ms returned []
Implicit Place search using SMT only with invariants took 53272 ms to find 0 implicit places.
[2023-03-11 05:43:02] [INFO ] Invariant cache hit.
[2023-03-11 05:43:11] [INFO ] Dead Transitions using invariants and state equation in 9400 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110819/128732 places, 110159/110159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71257 ms. Remains : 110819/128732 places, 110159/110159 transitions.
Support contains 39418 out of 110819 places after structural reductions.
[2023-03-11 05:43:15] [INFO ] Flatten gal took : 3271 ms
[2023-03-11 05:43:19] [INFO ] Flatten gal took : 3022 ms
[2023-03-11 05:43:26] [INFO ] Input system was already deterministic with 110159 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2507 ms. (steps per millisecond=3 ) properties (out of 22) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 647 ms. (steps per millisecond=15 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 863 ms. (steps per millisecond=11 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 646 ms. (steps per millisecond=15 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1566 ms. (steps per millisecond=6 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-11 05:43:34] [INFO ] Invariant cache hit.
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2340)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 05:43:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 05:43:59] [INFO ] After 25122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 13288 out of 110819 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110819/110819 places, 110159/110159 transitions.
Graph (complete) has 160197 edges and 110819 vertex of which 110607 are kept as prefixes of interest. Removing 212 places using SCC suffix rule.177 ms
Discarding 212 places :
Also discarding 212 output transitions
Drop transitions removed 212 transitions
Discarding 8643 places :
Implicit places reduction removed 8643 places
Drop transitions removed 58089 transitions
Trivial Post-agglo rules discarded 58089 transitions
Performed 58089 trivial Post agglomeration. Transition count delta: 58089
Iterating post reduction 0 with 66732 rules applied. Total rules applied 66733 place count 101964 transition count 51858
Reduce places removed 58089 places and 0 transitions.
Performed 2613 Post agglomeration using F-continuation condition.Transition count delta: 2613
Iterating post reduction 1 with 60702 rules applied. Total rules applied 127435 place count 43875 transition count 49245
Reduce places removed 2613 places and 0 transitions.
Iterating post reduction 2 with 2613 rules applied. Total rules applied 130048 place count 41262 transition count 49245
Performed 1005 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1005 Pre rules applied. Total rules applied 130048 place count 41262 transition count 48240
Deduced a syphon composed of 1005 places in 40 ms
Ensure Unique test removed 402 places
Reduce places removed 1407 places and 0 transitions.
Iterating global reduction 3 with 2412 rules applied. Total rules applied 132460 place count 39855 transition count 48240
Discarding 402 places :
Implicit places reduction removed 402 places
Iterating post reduction 3 with 402 rules applied. Total rules applied 132862 place count 39453 transition count 48240
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 201 Pre rules applied. Total rules applied 132862 place count 39453 transition count 48039
Deduced a syphon composed of 201 places in 44 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 402 rules applied. Total rules applied 133264 place count 39252 transition count 48039
Performed 4824 Post agglomeration using F-continuation condition.Transition count delta: 4824
Deduced a syphon composed of 4824 places in 30 ms
Reduce places removed 4824 places and 0 transitions.
Iterating global reduction 4 with 9648 rules applied. Total rules applied 142912 place count 34428 transition count 43215
Free-agglomeration rule (complex) applied 4221 times.
Iterating global reduction 4 with 4221 rules applied. Total rules applied 147133 place count 34428 transition count 38994
Reduce places removed 4221 places and 0 transitions.
Iterating post reduction 4 with 4221 rules applied. Total rules applied 151354 place count 30207 transition count 38994
Applied a total of 151354 rules in 28637 ms. Remains 30207 /110819 variables (removed 80612) and now considering 38994/110159 (removed 71165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28639 ms. Remains : 30207/110819 places, 38994/110159 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1642 ms. (steps per millisecond=6 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 609 ms. (steps per millisecond=16 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 38994 rows 30207 cols
[2023-03-11 05:44:34] [INFO ] Computed 3424 place invariants in 3479 ms
[2023-03-11 05:44:41] [INFO ] [Real]Absence check using 2 positive place invariants in 208 ms returned sat
[2023-03-11 05:44:46] [INFO ] [Real]Absence check using 2 positive and 3422 generalized place invariants in 5596 ms returned sat
[2023-03-11 05:44:47] [INFO ] After 12330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 05:44:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 214 ms returned sat
[2023-03-11 05:44:58] [INFO ] [Nat]Absence check using 2 positive and 3422 generalized place invariants in 4677 ms returned sat
[2023-03-11 05:45:12] [INFO ] After 12341ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-11 05:45:12] [INFO ] After 12388ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 05:45:12] [INFO ] After 25084ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3417 out of 30207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30207/30207 places, 38994/38994 transitions.
Graph (complete) has 76803 edges and 30207 vertex of which 30185 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.19 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions removed 603 transitions
Trivial Post-agglo rules discarded 603 transitions
Performed 603 trivial Post agglomeration. Transition count delta: 603
Iterating post reduction 0 with 603 rules applied. Total rules applied 604 place count 30185 transition count 38391
Reduce places removed 603 places and 0 transitions.
Performed 402 Post agglomeration using F-continuation condition.Transition count delta: 402
Iterating post reduction 1 with 1005 rules applied. Total rules applied 1609 place count 29582 transition count 37989
Reduce places removed 402 places and 0 transitions.
Iterating post reduction 2 with 402 rules applied. Total rules applied 2011 place count 29180 transition count 37989
Performed 4824 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4824 Pre rules applied. Total rules applied 2011 place count 29180 transition count 33165
Deduced a syphon composed of 4824 places in 13 ms
Ensure Unique test removed 2211 places
Reduce places removed 7035 places and 0 transitions.
Iterating global reduction 3 with 11859 rules applied. Total rules applied 13870 place count 22145 transition count 33165
Drop transitions removed 2211 transitions
Trivial Post-agglo rules discarded 2211 transitions
Performed 2211 trivial Post agglomeration. Transition count delta: 2211
Iterating post reduction 3 with 2211 rules applied. Total rules applied 16081 place count 22145 transition count 30954
Reduce places removed 2211 places and 0 transitions.
Iterating post reduction 4 with 2211 rules applied. Total rules applied 18292 place count 19934 transition count 30954
Performed 2412 Post agglomeration using F-continuation condition.Transition count delta: 2412
Deduced a syphon composed of 2412 places in 10 ms
Ensure Unique test removed 201 places
Reduce places removed 2613 places and 0 transitions.
Iterating global reduction 5 with 5025 rules applied. Total rules applied 23317 place count 17321 transition count 28542
Free-agglomeration rule (complex) applied 4623 times.
Iterating global reduction 5 with 4623 rules applied. Total rules applied 27940 place count 17321 transition count 64119
Ensure Unique test removed 201 places
Reduce places removed 4824 places and 0 transitions.
Iterating post reduction 5 with 4824 rules applied. Total rules applied 32764 place count 12497 transition count 64119
Discarding 2030 places :
Symmetric choice reduction at 6 with 2030 rule applications. Total rules 34794 place count 10467 transition count 17889
Ensure Unique test removed 201 places
Iterating global reduction 6 with 2231 rules applied. Total rules applied 37025 place count 10266 transition count 17889
Discarding 4020 places :
Symmetric choice reduction at 6 with 4020 rule applications. Total rules 41045 place count 6246 transition count 13869
Ensure Unique test removed 201 places
Iterating global reduction 6 with 4221 rules applied. Total rules applied 45266 place count 6045 transition count 13869
Ensure Unique test removed 4020 transitions
Reduce isomorphic transitions removed 4020 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 6 with 4221 rules applied. Total rules applied 49487 place count 6045 transition count 9648
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 7 with 201 rules applied. Total rules applied 49688 place count 5844 transition count 9648
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 201
Deduced a syphon composed of 201 places in 2 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 8 with 402 rules applied. Total rules applied 50090 place count 5643 transition count 9447
Reduce places removed 201 places and 201 transitions.
Iterating global reduction 8 with 201 rules applied. Total rules applied 50291 place count 5442 transition count 9246
Applied a total of 50291 rules in 12210 ms. Remains 5442 /30207 variables (removed 24765) and now considering 9246/38994 (removed 29748) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12210 ms. Remains : 5442/30207 places, 9246/38994 transitions.
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 110819 stabilizing places and 110159 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 110819 transition count 110159
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 402 out of 110819 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110819/110819 places, 110159/110159 transitions.
Graph (complete) has 160197 edges and 110819 vertex of which 108574 are kept as prefixes of interest. Removing 2245 places using SCC suffix rule.200 ms
Discarding 2245 places :
Also discarding 2222 output transitions
Drop transitions removed 2222 transitions
Reduce places removed 201 places and 201 transitions.
Discarding 8844 places :
Implicit places reduction removed 8844 places
Drop transitions removed 67938 transitions
Trivial Post-agglo rules discarded 67938 transitions
Performed 67938 trivial Post agglomeration. Transition count delta: 67938
Iterating post reduction 0 with 76782 rules applied. Total rules applied 76783 place count 99529 transition count 39798
Reduce places removed 67938 places and 0 transitions.
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 201
Iterating post reduction 1 with 68139 rules applied. Total rules applied 144922 place count 31591 transition count 39597
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 2 with 201 rules applied. Total rules applied 145123 place count 31390 transition count 39597
Performed 5628 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5628 Pre rules applied. Total rules applied 145123 place count 31390 transition count 33969
Deduced a syphon composed of 5628 places in 13 ms
Ensure Unique test removed 2613 places
Reduce places removed 8241 places and 0 transitions.
Iterating global reduction 3 with 13869 rules applied. Total rules applied 158992 place count 23149 transition count 33969
Discarding 402 places :
Implicit places reduction removed 402 places
Drop transitions removed 2211 transitions
Trivial Post-agglo rules discarded 2211 transitions
Performed 2211 trivial Post agglomeration. Transition count delta: 2211
Iterating post reduction 3 with 2613 rules applied. Total rules applied 161605 place count 22747 transition count 31758
Reduce places removed 2211 places and 0 transitions.
Iterating post reduction 4 with 2211 rules applied. Total rules applied 163816 place count 20536 transition count 31758
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 402 Pre rules applied. Total rules applied 163816 place count 20536 transition count 31356
Deduced a syphon composed of 402 places in 11 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 5 with 804 rules applied. Total rules applied 164620 place count 20134 transition count 31356
Performed 4623 Post agglomeration using F-continuation condition.Transition count delta: 4623
Deduced a syphon composed of 4623 places in 10 ms
Reduce places removed 4623 places and 0 transitions.
Iterating global reduction 5 with 9246 rules applied. Total rules applied 173866 place count 15511 transition count 26733
Applied a total of 173866 rules in 11114 ms. Remains 15511 /110819 variables (removed 95308) and now considering 26733/110159 (removed 83426) transitions.
// Phase 1: matrix 26733 rows 15511 cols
[2023-03-11 05:45:37] [INFO ] Computed 808 place invariants in 726 ms
[2023-03-11 05:45:38] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:45:38] [INFO ] Implicit Places using invariants in 2044 ms returned []
Implicit Place search using SMT only with invariants took 2046 ms to find 0 implicit places.
[2023-03-11 05:45:38] [INFO ] Invariant cache hit.
[2023-03-11 05:45:40] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:45:40] [INFO ] Dead Transitions using invariants and state equation in 1264 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15511/110819 places, 26733/110159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14428 ms. Remains : 15511/110819 places, 26733/110159 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s15310 s15311 s15312 s15313 s15314 s15315 s15316 s15317 s15318 s15319 s15320 s15321 s15322 s15323 s15324 s15325 s15326 s15327 s15328 s15329 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 92330 steps with 145 reset in 10001 ms.
Product exploration timeout after 93120 steps with 146 reset in 10001 ms.
Computed a total of 15511 stabilizing places and 26733 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 15511 transition count 26733
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)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 142 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 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 473 steps, including 0 resets, run visited all 1 properties in 61 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 141 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2023-03-11 05:46:29] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 402 out of 15511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15511/15511 places, 26733/26733 transitions.
Applied a total of 0 rules in 918 ms. Remains 15511 /15511 variables (removed 0) and now considering 26733/26733 (removed 0) transitions.
[2023-03-11 05:46:45] [INFO ] Invariant cache hit.
[2023-03-11 05:46:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:46:47] [INFO ] Implicit Places using invariants in 1314 ms returned []
Implicit Place search using SMT only with invariants took 1326 ms to find 0 implicit places.
[2023-03-11 05:46:47] [INFO ] Invariant cache hit.
[2023-03-11 05:46:48] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:46:48] [INFO ] Dead Transitions using invariants and state equation in 1302 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3549 ms. Remains : 15511/15511 places, 26733/26733 transitions.
Computed a total of 15511 stabilizing places and 26733 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 15511 transition count 26733
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)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 149 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 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 532 steps, including 0 resets, run visited all 1 properties in 59 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 137 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2023-03-11 05:47:28] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 94870 steps with 148 reset in 10001 ms.
Product exploration timeout after 94120 steps with 146 reset in 10001 ms.
Support contains 402 out of 15511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15511/15511 places, 26733/26733 transitions.
Applied a total of 0 rules in 309 ms. Remains 15511 /15511 variables (removed 0) and now considering 26733/26733 (removed 0) transitions.
[2023-03-11 05:48:03] [INFO ] Invariant cache hit.
[2023-03-11 05:48:04] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:48:04] [INFO ] Implicit Places using invariants in 1237 ms returned []
Implicit Place search using SMT only with invariants took 1239 ms to find 0 implicit places.
[2023-03-11 05:48:04] [INFO ] Invariant cache hit.
[2023-03-11 05:48:05] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:48:05] [INFO ] Dead Transitions using invariants and state equation in 1254 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2804 ms. Remains : 15511/15511 places, 26733/26733 transitions.
Treatment of property FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-01 finished in 165046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p1))))'
Support contains 402 out of 110819 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110819/110819 places, 110159/110159 transitions.
Reduce places removed 22 places and 0 transitions.
Discarding 8643 places :
Implicit places reduction removed 8643 places
Iterating post reduction 0 with 8665 rules applied. Total rules applied 8665 place count 102154 transition count 110159
Applied a total of 8665 rules in 1766 ms. Remains 102154 /110819 variables (removed 8665) and now considering 110159/110159 (removed 0) transitions.
// Phase 1: matrix 110159 rows 102154 cols
[2023-03-11 05:48:31] [INFO ] Computed 4226 place invariants in 19029 ms
[2023-03-11 05:48:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:48:39] [INFO ] Implicit Places using invariants in 27226 ms returned []
Implicit Place search using SMT only with invariants took 27228 ms to find 0 implicit places.
[2023-03-11 05:48:39] [INFO ] Invariant cache hit.
[2023-03-11 05:48:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:48:47] [INFO ] Dead Transitions using invariants and state equation in 8109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102154/110819 places, 110159/110159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37106 ms. Remains : 102154/110819 places, 110159/110159 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT 2 (ADD s62916 s62917 s62918 s62919 s62920 s62921 s62922 s62923 s62924 s62925 s62926 s62927 s62928 s62929 s62930 s62931 s62932 s62933 s62934 s62935 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8848 steps with 0 reset in 662 ms.
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-03 finished in 38250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G((p1||X(G(p1)))) U (p0&&G((p1||X(G(p1))))))))))'
Support contains 6633 out of 110819 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110819/110819 places, 110159/110159 transitions.
Reduce places removed 22 places and 0 transitions.
Discarding 8844 places :
Implicit places reduction removed 8844 places
Iterating post reduction 0 with 8866 rules applied. Total rules applied 8866 place count 101953 transition count 110159
Applied a total of 8866 rules in 1831 ms. Remains 101953 /110819 variables (removed 8866) and now considering 110159/110159 (removed 0) transitions.
// Phase 1: matrix 110159 rows 101953 cols
[2023-03-11 05:49:11] [INFO ] Computed 4025 place invariants in 20709 ms
[2023-03-11 05:49:18] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:49:19] [INFO ] Implicit Places using invariants in 28240 ms returned []
Implicit Place search using SMT only with invariants took 28241 ms to find 0 implicit places.
[2023-03-11 05:49:19] [INFO ] Invariant cache hit.
[2023-03-11 05:49:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:49:27] [INFO ] Dead Transitions using invariants and state equation in 8076 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101953/110819 places, 110159/110159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38153 ms. Remains : 101953/110819 places, 110159/110159 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true]
Running random walk in product with property : FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 2 (ADD s45428 s45429 s45430 s45431 s45432 s45433 s45434 s45435 s45436 s45437 s45438 s45439 s45440 s45441 s45442 s45443 s45444 s45445 s45446 s45447...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9278 steps with 0 reset in 1852 ms.
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-04 finished in 40587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&G((p1 U p2))) U G(p3)))'
Support contains 3015 out of 110819 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110819/110819 places, 110159/110159 transitions.
Graph (complete) has 160197 edges and 110819 vertex of which 106763 are kept as prefixes of interest. Removing 4056 places using SCC suffix rule.128 ms
Discarding 4056 places :
Also discarding 3629 output transitions
Drop transitions removed 3629 transitions
Reduce places removed 201 places and 201 transitions.
Discarding 8643 places :
Implicit places reduction removed 8643 places
Drop transitions removed 64521 transitions
Trivial Post-agglo rules discarded 64521 transitions
Performed 64521 trivial Post agglomeration. Transition count delta: 64521
Iterating post reduction 0 with 73164 rules applied. Total rules applied 73165 place count 97919 transition count 41808
Reduce places removed 64521 places and 0 transitions.
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 201
Iterating post reduction 1 with 64722 rules applied. Total rules applied 137887 place count 33398 transition count 41607
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 2 with 201 rules applied. Total rules applied 138088 place count 33197 transition count 41607
Performed 3417 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3417 Pre rules applied. Total rules applied 138088 place count 33197 transition count 38190
Deduced a syphon composed of 3417 places in 17 ms
Ensure Unique test removed 603 places
Reduce places removed 4020 places and 0 transitions.
Iterating global reduction 3 with 7437 rules applied. Total rules applied 145525 place count 29177 transition count 38190
Discarding 2211 places :
Implicit places reduction removed 2211 places
Performed 2211 Post agglomeration using F-continuation condition.Transition count delta: 2211
Iterating post reduction 3 with 4422 rules applied. Total rules applied 149947 place count 26966 transition count 35979
Reduce places removed 2211 places and 0 transitions.
Iterating post reduction 4 with 2211 rules applied. Total rules applied 152158 place count 24755 transition count 35979
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 201 Pre rules applied. Total rules applied 152158 place count 24755 transition count 35778
Deduced a syphon composed of 201 places in 16 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 152560 place count 24554 transition count 35778
Performed 4623 Post agglomeration using F-continuation condition.Transition count delta: 4623
Deduced a syphon composed of 4623 places in 14 ms
Reduce places removed 4623 places and 0 transitions.
Iterating global reduction 5 with 9246 rules applied. Total rules applied 161806 place count 19931 transition count 31155
Applied a total of 161806 rules in 13101 ms. Remains 19931 /110819 variables (removed 90888) and now considering 31155/110159 (removed 79004) transitions.
// Phase 1: matrix 31155 rows 19931 cols
[2023-03-11 05:49:44] [INFO ] Computed 806 place invariants in 1464 ms
[2023-03-11 05:49:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:49:45] [INFO ] Implicit Places using invariants in 3125 ms returned []
Implicit Place search using SMT only with invariants took 3126 ms to find 0 implicit places.
[2023-03-11 05:49:45] [INFO ] Invariant cache hit.
[2023-03-11 05:49:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:49:47] [INFO ] Dead Transitions using invariants and state equation in 1564 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19931/110819 places, 31155/110159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17795 ms. Remains : 19931/110819 places, 31155/110159 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p3)]
Running random walk in product with property : FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 (NOT p0) p2) (AND p3 (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p3 p0) (AND p3 (NOT p2) (NOT p1))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(OR (LEQ (ADD s9468 s9469 s9470 s9471 s9472 s9473 s9474 s9475 s9476 s9477 s9478 s9479 s9480 s9481 s9482 s9483 s9484 s9485 s9486 s9487 s9488 s9489 s9490...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 288 steps with 0 reset in 60 ms.
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-05 finished in 18159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1&&X((p1 U (p2||G(p1)))))))))'
Support contains 4623 out of 110819 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110819/110819 places, 110159/110159 transitions.
Reduce places removed 22 places and 0 transitions.
Discarding 8844 places :
Implicit places reduction removed 8844 places
Iterating post reduction 0 with 8866 rules applied. Total rules applied 8866 place count 101953 transition count 110159
Applied a total of 8866 rules in 1503 ms. Remains 101953 /110819 variables (removed 8866) and now considering 110159/110159 (removed 0) transitions.
// Phase 1: matrix 110159 rows 101953 cols
[2023-03-11 05:50:09] [INFO ] Computed 4025 place invariants in 19875 ms
[2023-03-11 05:50:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:50:17] [INFO ] Implicit Places using invariants in 28267 ms returned []
Implicit Place search using SMT only with invariants took 28268 ms to find 0 implicit places.
[2023-03-11 05:50:17] [INFO ] Invariant cache hit.
[2023-03-11 05:50:24] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:50:24] [INFO ] Dead Transitions using invariants and state equation in 7187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101953/110819 places, 110159/110159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36965 ms. Remains : 101953/110819 places, 110159/110159 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 3 (ADD s41006 s41007 s41008 s41009 s41010 s41011 s41012 s41013 s41014 s41015 s41016 s41017 s41018 s41019 s41020 s41021 s41022 s41023 s41024 s41025 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 17180 steps with 5719 reset in 10015 ms.
Product exploration timeout after 17150 steps with 5724 reset in 10001 ms.
Computed a total of 101953 stabilizing places and 110159 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 101953 transition count 110159
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)...)
Could not satisfy deadlock states : solver returned sat
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 693 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 905 ms. (steps per millisecond=11 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:51:12] [INFO ] Invariant cache hit.
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2347)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 05:51:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 05:51:37] [INFO ] After 25038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 402 out of 101953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101953/101953 places, 110159/110159 transitions.
Graph (complete) has 138087 edges and 101953 vertex of which 99327 are kept as prefixes of interest. Removing 2626 places using SCC suffix rule.52 ms
Discarding 2626 places :
Also discarding 2624 output transitions
Drop transitions removed 2624 transitions
Drop transitions removed 63717 transitions
Trivial Post-agglo rules discarded 63717 transitions
Performed 63717 trivial Post agglomeration. Transition count delta: 63717
Iterating post reduction 0 with 63717 rules applied. Total rules applied 63718 place count 99327 transition count 43818
Reduce places removed 63717 places and 0 transitions.
Performed 4221 Post agglomeration using F-continuation condition.Transition count delta: 4221
Iterating post reduction 1 with 67938 rules applied. Total rules applied 131656 place count 35610 transition count 39597
Reduce places removed 4221 places and 0 transitions.
Iterating post reduction 2 with 4221 rules applied. Total rules applied 135877 place count 31389 transition count 39597
Performed 5829 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5829 Pre rules applied. Total rules applied 135877 place count 31389 transition count 33768
Deduced a syphon composed of 5829 places in 15 ms
Ensure Unique test removed 2814 places
Reduce places removed 8643 places and 0 transitions.
Iterating global reduction 3 with 14472 rules applied. Total rules applied 150349 place count 22746 transition count 33768
Discarding 201 places :
Implicit places reduction removed 201 places
Drop transitions removed 2412 transitions
Trivial Post-agglo rules discarded 2412 transitions
Performed 2412 trivial Post agglomeration. Transition count delta: 2412
Iterating post reduction 3 with 2613 rules applied. Total rules applied 152962 place count 22545 transition count 31356
Reduce places removed 2412 places and 0 transitions.
Iterating post reduction 4 with 2412 rules applied. Total rules applied 155374 place count 20133 transition count 31356
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 201 Pre rules applied. Total rules applied 155374 place count 20133 transition count 31155
Deduced a syphon composed of 201 places in 13 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 155776 place count 19932 transition count 31155
Performed 804 Post agglomeration using F-continuation condition.Transition count delta: 804
Deduced a syphon composed of 804 places in 11 ms
Reduce places removed 804 places and 0 transitions.
Iterating global reduction 5 with 1608 rules applied. Total rules applied 157384 place count 19128 transition count 30351
Free-agglomeration rule (complex) applied 2211 times.
Iterating global reduction 5 with 2211 rules applied. Total rules applied 159595 place count 19128 transition count 28140
Ensure Unique test removed 201 places
Reduce places removed 2412 places and 0 transitions.
Iterating post reduction 5 with 2412 rules applied. Total rules applied 162007 place count 16716 transition count 28140
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 162017 place count 16706 transition count 26130
Iterating global reduction 6 with 10 rules applied. Total rules applied 162027 place count 16706 transition count 26130
Free-agglomeration rule (complex) applied 201 times.
Iterating global reduction 6 with 201 rules applied. Total rules applied 162228 place count 16706 transition count 25929
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 6 with 201 rules applied. Total rules applied 162429 place count 16505 transition count 25929
Applied a total of 162429 rules in 14193 ms. Remains 16505 /101953 variables (removed 85448) and now considering 25929/110159 (removed 84230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14194 ms. Remains : 16505/101953 places, 25929/110159 transitions.
Finished random walk after 696 steps, including 0 resets, run visited all 2 properties in 67 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (NOT (AND p0 p2 p1))), (F (AND (NOT p2) p1)), (F (NOT p0)), (F (AND (NOT p0) p2 p1)), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 752 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Support contains 4623 out of 101953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101953/101953 places, 110159/110159 transitions.
Graph (complete) has 138087 edges and 101953 vertex of which 99327 are kept as prefixes of interest. Removing 2626 places using SCC suffix rule.107 ms
Discarding 2626 places :
Also discarding 2624 output transitions
Drop transitions removed 2624 transitions
Reduce places removed 201 places and 201 transitions.
Drop transitions removed 51054 transitions
Trivial Post-agglo rules discarded 51054 transitions
Performed 51054 trivial Post agglomeration. Transition count delta: 51054
Iterating post reduction 0 with 51054 rules applied. Total rules applied 51055 place count 99126 transition count 56280
Reduce places removed 51054 places and 0 transitions.
Performed 8442 Post agglomeration using F-continuation condition.Transition count delta: 8442
Iterating post reduction 1 with 59496 rules applied. Total rules applied 110551 place count 48072 transition count 47838
Reduce places removed 8442 places and 0 transitions.
Iterating post reduction 2 with 8442 rules applied. Total rules applied 118993 place count 39630 transition count 47838
Performed 5829 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5829 Pre rules applied. Total rules applied 118993 place count 39630 transition count 42009
Deduced a syphon composed of 5829 places in 22 ms
Ensure Unique test removed 2814 places
Reduce places removed 8643 places and 0 transitions.
Iterating global reduction 3 with 14472 rules applied. Total rules applied 133465 place count 30987 transition count 42009
Discarding 201 places :
Implicit places reduction removed 201 places
Drop transitions removed 2412 transitions
Trivial Post-agglo rules discarded 2412 transitions
Performed 2412 trivial Post agglomeration. Transition count delta: 2412
Iterating post reduction 3 with 2613 rules applied. Total rules applied 136078 place count 30786 transition count 39597
Reduce places removed 2412 places and 0 transitions.
Iterating post reduction 4 with 2412 rules applied. Total rules applied 138490 place count 28374 transition count 39597
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 201 Pre rules applied. Total rules applied 138490 place count 28374 transition count 39396
Deduced a syphon composed of 201 places in 19 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 138892 place count 28173 transition count 39396
Performed 603 Post agglomeration using F-continuation condition.Transition count delta: 603
Deduced a syphon composed of 603 places in 22 ms
Reduce places removed 603 places and 0 transitions.
Iterating global reduction 5 with 1206 rules applied. Total rules applied 140098 place count 27570 transition count 38793
Applied a total of 140098 rules in 17517 ms. Remains 27570 /101953 variables (removed 74383) and now considering 38793/110159 (removed 71366) transitions.
// Phase 1: matrix 38793 rows 27570 cols
[2023-03-11 05:52:12] [INFO ] Computed 807 place invariants in 1610 ms
[2023-03-11 05:52:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:52:14] [INFO ] Implicit Places using invariants in 3713 ms returned []
Implicit Place search using SMT only with invariants took 3715 ms to find 0 implicit places.
[2023-03-11 05:52:14] [INFO ] Invariant cache hit.
[2023-03-11 05:52:16] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:52:16] [INFO ] Dead Transitions using invariants and state equation in 2062 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27570/101953 places, 38793/110159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23298 ms. Remains : 27570/101953 places, 38793/110159 transitions.
Computed a total of 27570 stabilizing places and 38793 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27570 transition count 38793
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 p2), (X p1), (X (AND p0 p2 p1)), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 357 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Finished random walk after 972 steps, including 0 resets, run visited all 5 properties in 129 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X (AND p0 p2 p1)), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (NOT (AND p1 p2 p0))), (F (AND p1 p2 (NOT p0)))]
Knowledge based reduction with 8 factoid took 480 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Product exploration timeout after 93970 steps with 231 reset in 10002 ms.
Product exploration timeout after 91410 steps with 229 reset in 10001 ms.
Support contains 4623 out of 27570 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27570/27570 places, 38793/38793 transitions.
Applied a total of 0 rules in 424 ms. Remains 27570 /27570 variables (removed 0) and now considering 38793/38793 (removed 0) transitions.
[2023-03-11 05:53:35] [INFO ] Invariant cache hit.
[2023-03-11 05:53:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:53:37] [INFO ] Implicit Places using invariants in 2139 ms returned []
Implicit Place search using SMT only with invariants took 2140 ms to find 0 implicit places.
[2023-03-11 05:53:37] [INFO ] Invariant cache hit.
[2023-03-11 05:53:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:53:40] [INFO ] Dead Transitions using invariants and state equation in 2104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4671 ms. Remains : 27570/27570 places, 38793/38793 transitions.
Treatment of property FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-07 finished in 235965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Support contains 804 out of 110819 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110819/110819 places, 110159/110159 transitions.
Reduce places removed 22 places and 0 transitions.
Discarding 8643 places :
Implicit places reduction removed 8643 places
Iterating post reduction 0 with 8665 rules applied. Total rules applied 8665 place count 102154 transition count 110159
Applied a total of 8665 rules in 1980 ms. Remains 102154 /110819 variables (removed 8665) and now considering 110159/110159 (removed 0) transitions.
// Phase 1: matrix 110159 rows 102154 cols
[2023-03-11 05:54:05] [INFO ] Computed 4226 place invariants in 19603 ms
[2023-03-11 05:54:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:54:12] [INFO ] Implicit Places using invariants in 26984 ms returned []
Implicit Place search using SMT only with invariants took 26988 ms to find 0 implicit places.
[2023-03-11 05:54:12] [INFO ] Invariant cache hit.
[2023-03-11 05:54:19] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:54:19] [INFO ] Dead Transitions using invariants and state equation in 7195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102154/110819 places, 110159/110159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36168 ms. Remains : 102154/110819 places, 110159/110159 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 (ADD s64524 s64525 s64526 s64527 s64528 s64529 s64530 s64531 s64532 s64533 s64534 s64535 s64536 s64537 s64538 s64539 s64540 s64541 s64542 s64543...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11 reset in 6398 ms.
Product exploration explored 100000 steps with 11 reset in 6567 ms.
Computed a total of 102154 stabilizing places and 110159 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 102154 transition count 110159
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)...)
Could not satisfy deadlock states : solver returned sat
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 399 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 594 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95029 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95029 steps, saw 94560 distinct states, run finished after 3004 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:54:59] [INFO ] Invariant cache hit.
[2023-03-11 05:55:24] [INFO ] After 25025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 804 out of 102154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102154/102154 places, 110159/110159 transitions.
Graph (complete) has 138489 edges and 102154 vertex of which 101942 are kept as prefixes of interest. Removing 212 places using SCC suffix rule.53 ms
Discarding 212 places :
Also discarding 212 output transitions
Drop transitions removed 212 transitions
Drop transitions removed 67737 transitions
Trivial Post-agglo rules discarded 67737 transitions
Performed 67737 trivial Post agglomeration. Transition count delta: 67737
Iterating post reduction 0 with 67737 rules applied. Total rules applied 67738 place count 101942 transition count 42210
Reduce places removed 67737 places and 0 transitions.
Performed 402 Post agglomeration using F-continuation condition.Transition count delta: 402
Iterating post reduction 1 with 68139 rules applied. Total rules applied 135877 place count 34205 transition count 41808
Reduce places removed 402 places and 0 transitions.
Iterating post reduction 2 with 402 rules applied. Total rules applied 136279 place count 33803 transition count 41808
Performed 6030 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6030 Pre rules applied. Total rules applied 136279 place count 33803 transition count 35778
Deduced a syphon composed of 6030 places in 17 ms
Ensure Unique test removed 2814 places
Reduce places removed 8844 places and 0 transitions.
Iterating global reduction 3 with 14874 rules applied. Total rules applied 151153 place count 24959 transition count 35778
Drop transitions removed 2211 transitions
Trivial Post-agglo rules discarded 2211 transitions
Performed 2211 trivial Post agglomeration. Transition count delta: 2211
Iterating post reduction 3 with 2211 rules applied. Total rules applied 153364 place count 24959 transition count 33567
Reduce places removed 2211 places and 0 transitions.
Iterating post reduction 4 with 2211 rules applied. Total rules applied 155575 place count 22748 transition count 33567
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 201 Pre rules applied. Total rules applied 155575 place count 22748 transition count 33366
Deduced a syphon composed of 201 places in 15 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 155977 place count 22547 transition count 33366
Performed 5226 Post agglomeration using F-continuation condition.Transition count delta: 5226
Deduced a syphon composed of 5226 places in 11 ms
Ensure Unique test removed 201 places
Reduce places removed 5427 places and 0 transitions.
Iterating global reduction 5 with 10653 rules applied. Total rules applied 166630 place count 17120 transition count 28140
Free-agglomeration rule (complex) applied 7437 times.
Iterating global reduction 5 with 7437 rules applied. Total rules applied 174067 place count 17120 transition count 20703
Ensure Unique test removed 804 places
Reduce places removed 8241 places and 0 transitions.
Iterating post reduction 5 with 8241 rules applied. Total rules applied 182308 place count 8879 transition count 20703
Discarding 2040 places :
Symmetric choice reduction at 6 with 2040 rule applications. Total rules 184348 place count 6839 transition count 12663
Iterating global reduction 6 with 2040 rules applied. Total rules applied 186388 place count 6839 transition count 12663
Ensure Unique test removed 2010 transitions
Reduce isomorphic transitions removed 2010 transitions.
Discarding 201 places :
Implicit places reduction removed 201 places
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 6 with 2412 rules applied. Total rules applied 188800 place count 6638 transition count 10452
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 7 with 201 rules applied. Total rules applied 189001 place count 6437 transition count 10452
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 201 Pre rules applied. Total rules applied 189001 place count 6437 transition count 10251
Deduced a syphon composed of 201 places in 2 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 8 with 402 rules applied. Total rules applied 189403 place count 6236 transition count 10251
Discarding 4020 places :
Symmetric choice reduction at 8 with 4020 rule applications. Total rules 193423 place count 2216 transition count 6231
Ensure Unique test removed 201 places
Iterating global reduction 8 with 4221 rules applied. Total rules applied 197644 place count 2015 transition count 6231
Ensure Unique test removed 4020 transitions
Reduce isomorphic transitions removed 4020 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 8 with 4221 rules applied. Total rules applied 201865 place count 2015 transition count 2010
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 9 with 201 rules applied. Total rules applied 202066 place count 1814 transition count 2010
Reduce places removed 201 places and 201 transitions.
Iterating global reduction 10 with 201 rules applied. Total rules applied 202267 place count 1613 transition count 1809
Applied a total of 202267 rules in 18003 ms. Remains 1613 /102154 variables (removed 100541) and now considering 1809/110159 (removed 108350) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18003 ms. Remains : 1613/102154 places, 1809/110159 transitions.
Finished random walk after 161 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 308 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 70 ms :[(NOT p0), (NOT p0)]
[2023-03-11 05:55:43] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 804 out of 102154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102154/102154 places, 110159/110159 transitions.
Graph (complete) has 138489 edges and 102154 vertex of which 101942 are kept as prefixes of interest. Removing 212 places using SCC suffix rule.115 ms
Discarding 212 places :
Also discarding 212 output transitions
Drop transitions removed 212 transitions
Reduce places removed 201 places and 201 transitions.
Drop transitions removed 67737 transitions
Trivial Post-agglo rules discarded 67737 transitions
Performed 67737 trivial Post agglomeration. Transition count delta: 67737
Iterating post reduction 0 with 67737 rules applied. Total rules applied 67738 place count 101741 transition count 42009
Reduce places removed 67737 places and 0 transitions.
Performed 402 Post agglomeration using F-continuation condition.Transition count delta: 402
Iterating post reduction 1 with 68139 rules applied. Total rules applied 135877 place count 34004 transition count 41607
Reduce places removed 402 places and 0 transitions.
Iterating post reduction 2 with 402 rules applied. Total rules applied 136279 place count 33602 transition count 41607
Performed 6030 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6030 Pre rules applied. Total rules applied 136279 place count 33602 transition count 35577
Deduced a syphon composed of 6030 places in 15 ms
Ensure Unique test removed 2814 places
Reduce places removed 8844 places and 0 transitions.
Iterating global reduction 3 with 14874 rules applied. Total rules applied 151153 place count 24758 transition count 35577
Drop transitions removed 2211 transitions
Trivial Post-agglo rules discarded 2211 transitions
Performed 2211 trivial Post agglomeration. Transition count delta: 2211
Iterating post reduction 3 with 2211 rules applied. Total rules applied 153364 place count 24758 transition count 33366
Reduce places removed 2211 places and 0 transitions.
Iterating post reduction 4 with 2211 rules applied. Total rules applied 155575 place count 22547 transition count 33366
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 201 Pre rules applied. Total rules applied 155575 place count 22547 transition count 33165
Deduced a syphon composed of 201 places in 13 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 155977 place count 22346 transition count 33165
Performed 5025 Post agglomeration using F-continuation condition.Transition count delta: 5025
Deduced a syphon composed of 5025 places in 13 ms
Ensure Unique test removed 201 places
Reduce places removed 5226 places and 0 transitions.
Iterating global reduction 5 with 10251 rules applied. Total rules applied 166228 place count 17120 transition count 28140
Applied a total of 166228 rules in 10878 ms. Remains 17120 /102154 variables (removed 85034) and now considering 28140/110159 (removed 82019) transitions.
// Phase 1: matrix 28140 rows 17120 cols
[2023-03-11 05:56:10] [INFO ] Computed 1211 place invariants in 793 ms
[2023-03-11 05:56:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:56:11] [INFO ] Implicit Places using invariants in 2166 ms returned []
Implicit Place search using SMT only with invariants took 2167 ms to find 0 implicit places.
[2023-03-11 05:56:11] [INFO ] Invariant cache hit.
[2023-03-11 05:56:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:56:12] [INFO ] Dead Transitions using invariants and state equation in 1344 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17120/102154 places, 28140/110159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14392 ms. Remains : 17120/102154 places, 28140/110159 transitions.
Computed a total of 17120 stabilizing places and 28140 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17120 transition count 28140
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)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 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 54 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1631 steps, including 0 resets, run visited all 1 properties in 125 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 140 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2023-03-11 05:56:47] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 61 reset in 7661 ms.
Product exploration explored 100000 steps with 62 reset in 7849 ms.
Support contains 804 out of 17120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17120/17120 places, 28140/28140 transitions.
Applied a total of 0 rules in 448 ms. Remains 17120 /17120 variables (removed 0) and now considering 28140/28140 (removed 0) transitions.
[2023-03-11 05:57:18] [INFO ] Invariant cache hit.
[2023-03-11 05:57:19] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:57:19] [INFO ] Implicit Places using invariants in 1371 ms returned []
Implicit Place search using SMT only with invariants took 1373 ms to find 0 implicit places.
[2023-03-11 05:57:19] [INFO ] Invariant cache hit.
[2023-03-11 05:57:21] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:57:21] [INFO ] Dead Transitions using invariants and state equation in 1355 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3179 ms. Remains : 17120/17120 places, 28140/28140 transitions.
Treatment of property FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-09 finished in 220853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4222 out of 110819 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110819/110819 places, 110159/110159 transitions.
Reduce places removed 21 places and 0 transitions.
Discarding 8844 places :
Implicit places reduction removed 8844 places
Iterating post reduction 0 with 8865 rules applied. Total rules applied 8865 place count 101954 transition count 110159
Applied a total of 8865 rules in 2340 ms. Remains 101954 /110819 variables (removed 8865) and now considering 110159/110159 (removed 0) transitions.
// Phase 1: matrix 110159 rows 101954 cols
[2023-03-11 05:57:45] [INFO ] Computed 4026 place invariants in 18120 ms
[2023-03-11 05:57:52] [INFO ] Implicit Places using invariants in 25521 ms returned []
Implicit Place search using SMT only with invariants took 25522 ms to find 0 implicit places.
[2023-03-11 05:57:52] [INFO ] Invariant cache hit.
[2023-03-11 05:57:59] [INFO ] Dead Transitions using invariants and state equation in 7213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101954/110819 places, 110159/110159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35085 ms. Remains : 101954/110819 places, 110159/110159 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s54474 s54475 s54476 s54477 s54478 s54479 s54480 s54481 s54482 s54483 s54484 s54485 s54486 s54487 s54488 s54489 s54490 s54491 s54492 s54493 s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 6 ms.
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-11 finished in 35531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(p1))))'
Support contains 4422 out of 110819 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110819/110819 places, 110159/110159 transitions.
Reduce places removed 22 places and 0 transitions.
Discarding 8643 places :
Implicit places reduction removed 8643 places
Iterating post reduction 0 with 8665 rules applied. Total rules applied 8665 place count 102154 transition count 110159
Applied a total of 8665 rules in 1809 ms. Remains 102154 /110819 variables (removed 8665) and now considering 110159/110159 (removed 0) transitions.
// Phase 1: matrix 110159 rows 102154 cols
[2023-03-11 05:58:20] [INFO ] Computed 4226 place invariants in 18299 ms
[2023-03-11 05:58:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:58:27] [INFO ] Implicit Places using invariants in 25623 ms returned []
Implicit Place search using SMT only with invariants took 25623 ms to find 0 implicit places.
[2023-03-11 05:58:27] [INFO ] Invariant cache hit.
[2023-03-11 05:58:34] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 05:58:34] [INFO ] Dead Transitions using invariants and state equation in 7207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102154/110819 places, 110159/110159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34645 ms. Remains : 102154/110819 places, 110159/110159 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s54674 s54675 s54676 s54677 s54678 s54679 s54680 s54681 s54682 s54683 s54684 s54685 s54686 s54687 s54688 s54689 s54690 s54691 s54692 s54693...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration timeout after 12140 steps with 6070 reset in 10002 ms.
Product exploration timeout after 12090 steps with 6045 reset in 10006 ms.
Computed a total of 102154 stabilizing places and 110159 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 102154 transition count 110159
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)...)
Could not satisfy deadlock states : solver returned sat
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1)
Knowledge based reduction with 7 factoid took 213 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-12 finished in 83041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 4423 out of 110819 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110819/110819 places, 110159/110159 transitions.
Graph (complete) has 160197 edges and 110819 vertex of which 108373 are kept as prefixes of interest. Removing 2446 places using SCC suffix rule.135 ms
Discarding 2446 places :
Also discarding 2423 output transitions
Drop transitions removed 2423 transitions
Reduce places removed 201 places and 201 transitions.
Discarding 8844 places :
Implicit places reduction removed 8844 places
Drop transitions removed 63918 transitions
Trivial Post-agglo rules discarded 63918 transitions
Performed 63918 trivial Post agglomeration. Transition count delta: 63918
Iterating post reduction 0 with 72762 rules applied. Total rules applied 72763 place count 99328 transition count 43617
Reduce places removed 63918 places and 0 transitions.
Iterating post reduction 1 with 63918 rules applied. Total rules applied 136681 place count 35410 transition count 43617
Performed 5226 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5226 Pre rules applied. Total rules applied 136681 place count 35410 transition count 38391
Deduced a syphon composed of 5226 places in 17 ms
Ensure Unique test removed 2814 places
Reduce places removed 8040 places and 0 transitions.
Iterating global reduction 2 with 13266 rules applied. Total rules applied 149947 place count 27370 transition count 38391
Drop transitions removed 2412 transitions
Trivial Post-agglo rules discarded 2412 transitions
Performed 2412 trivial Post agglomeration. Transition count delta: 2412
Iterating post reduction 2 with 2412 rules applied. Total rules applied 152359 place count 27370 transition count 35979
Reduce places removed 2412 places and 0 transitions.
Iterating post reduction 3 with 2412 rules applied. Total rules applied 154771 place count 24958 transition count 35979
Performed 1005 Post agglomeration using F-continuation condition.Transition count delta: 1005
Deduced a syphon composed of 1005 places in 15 ms
Reduce places removed 1005 places and 0 transitions.
Iterating global reduction 4 with 2010 rules applied. Total rules applied 156781 place count 23953 transition count 34974
Applied a total of 156781 rules in 11579 ms. Remains 23953 /110819 variables (removed 86866) and now considering 34974/110159 (removed 75185) transitions.
// Phase 1: matrix 34974 rows 23953 cols
[2023-03-11 05:59:36] [INFO ] Computed 1009 place invariants in 1588 ms
[2023-03-11 05:59:38] [INFO ] Implicit Places using invariants in 3382 ms returned []
Implicit Place search using SMT only with invariants took 3382 ms to find 0 implicit places.
[2023-03-11 05:59:38] [INFO ] Invariant cache hit.
[2023-03-11 05:59:39] [INFO ] Dead Transitions using invariants and state equation in 1802 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23953/110819 places, 34974/110159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16767 ms. Remains : 23953/110819 places, 34974/110159 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 s5629), p0:(LEQ (ADD s9851 s9852 s9853 s9854 s9855 s9856 s9857 s9858 s9859 s9860 s9861 s9862 s9863 s9864 s9865 s9866 s9867 s9868 s9869 s9870 s98...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 61430 steps with 41 reset in 10001 ms.
Product exploration timeout after 60170 steps with 44 reset in 10002 ms.
Computed a total of 23953 stabilizing places and 34974 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23953 transition count 34974
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 245 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Finished random walk after 1341 steps, including 0 resets, run visited all 1 properties in 88 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
[2023-03-11 06:00:49] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 1 out of 23953 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 : 23953/23953 places, 34974/34974 transitions.
Applied a total of 0 rules in 531 ms. Remains 23953 /23953 variables (removed 0) and now considering 34974/34974 (removed 0) transitions.
[2023-03-11 06:01:04] [INFO ] Invariant cache hit.
[2023-03-11 06:01:06] [INFO ] Implicit Places using invariants in 1762 ms returned []
Implicit Place search using SMT only with invariants took 1763 ms to find 0 implicit places.
[2023-03-11 06:01:06] [INFO ] Invariant cache hit.
[2023-03-11 06:01:08] [INFO ] Dead Transitions using invariants and state equation in 1801 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4099 ms. Remains : 23953/23953 places, 34974/34974 transitions.
Computed a total of 23953 stabilizing places and 34974 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23953 transition count 34974
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)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Finished random walk after 1206 steps, including 0 resets, run visited all 1 properties in 81 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
[2023-03-11 06:01:54] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Product exploration explored 100000 steps with 75 reset in 6478 ms.
Product exploration explored 100000 steps with 74 reset in 6639 ms.
Support contains 1 out of 23953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23953/23953 places, 34974/34974 transitions.
Drop transitions removed 4221 transitions
Trivial Post-agglo rules discarded 4221 transitions
Performed 4221 trivial Post agglomeration. Transition count delta: 4221
Iterating post reduction 0 with 4221 rules applied. Total rules applied 4221 place count 23953 transition count 30753
Reduce places removed 4221 places and 0 transitions.
Iterating post reduction 1 with 4221 rules applied. Total rules applied 8442 place count 19732 transition count 30753
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 402 Pre rules applied. Total rules applied 8442 place count 19732 transition count 30351
Deduced a syphon composed of 402 places in 7 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 2 with 804 rules applied. Total rules applied 9246 place count 19330 transition count 30351
Performed 4221 Post agglomeration using F-continuation condition.Transition count delta: 4221
Deduced a syphon composed of 4221 places in 7 ms
Reduce places removed 4221 places and 0 transitions.
Iterating global reduction 2 with 8442 rules applied. Total rules applied 17688 place count 15109 transition count 26130
Applied a total of 17688 rules in 2805 ms. Remains 15109 /23953 variables (removed 8844) and now considering 26130/34974 (removed 8844) transitions.
// Phase 1: matrix 26130 rows 15109 cols
[2023-03-11 06:02:26] [INFO ] Computed 1009 place invariants in 1145 ms
[2023-03-11 06:02:27] [INFO ] Implicit Places using invariants in 2259 ms returned []
Implicit Place search using SMT only with invariants took 2261 ms to find 0 implicit places.
[2023-03-11 06:02:27] [INFO ] Invariant cache hit.
[2023-03-11 06:02:28] [INFO ] Dead Transitions using invariants and state equation in 1146 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15109/23953 places, 26130/34974 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6213 ms. Remains : 15109/23953 places, 26130/34974 transitions.
Treatment of property FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-14 finished in 188480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 8442 out of 110819 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110819/110819 places, 110159/110159 transitions.
Reduce places removed 22 places and 0 transitions.
Discarding 402 places :
Implicit places reduction removed 402 places
Iterating post reduction 0 with 424 rules applied. Total rules applied 424 place count 110395 transition count 110159
Applied a total of 424 rules in 1046 ms. Remains 110395 /110819 variables (removed 424) and now considering 110159/110159 (removed 0) transitions.
// Phase 1: matrix 110159 rows 110395 cols
[2023-03-11 06:03:17] [INFO ] Computed 12467 place invariants in 44575 ms
[2023-03-11 06:03:24] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:03:25] [INFO ] Implicit Places using invariants in 52419 ms returned []
Implicit Place search using SMT only with invariants took 52422 ms to find 0 implicit places.
[2023-03-11 06:03:25] [INFO ] Invariant cache hit.
[2023-03-11 06:03:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:03:32] [INFO ] Dead Transitions using invariants and state equation in 7765 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110395/110819 places, 110159/110159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61237 ms. Remains : 110395/110819 places, 110159/110159 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ (ADD s36382 s36383 s36384 s36385 s36386 s36387 s36388 s36389 s36390 s36391 s36392 s36393 s36394 s36395 s36396 s36397 s36398 s36399 s36400 s36401 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 16270 steps with 5423 reset in 10004 ms.
Product exploration timeout after 16290 steps with 5430 reset in 10005 ms.
Computed a total of 110395 stabilizing places and 110159 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 110395 transition count 110159
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)...)
Could not satisfy deadlock states : solver returned unknown
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-15 finished in 109886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1&&X((p1 U (p2||G(p1)))))))))'
Found a Shortening insensitive property : FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-07
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 4623 out of 110819 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 110819/110819 places, 110159/110159 transitions.
Graph (complete) has 160197 edges and 110819 vertex of which 108171 are kept as prefixes of interest. Removing 2648 places using SCC suffix rule.125 ms
Discarding 2648 places :
Also discarding 2624 output transitions
Drop transitions removed 2624 transitions
Reduce places removed 201 places and 201 transitions.
Discarding 8844 places :
Implicit places reduction removed 8844 places
Drop transitions removed 51054 transitions
Trivial Post-agglo rules discarded 51054 transitions
Performed 51054 trivial Post agglomeration. Transition count delta: 51054
Iterating post reduction 0 with 59898 rules applied. Total rules applied 59899 place count 99126 transition count 56280
Reduce places removed 51054 places and 0 transitions.
Performed 8442 Post agglomeration using F-continuation condition.Transition count delta: 8442
Iterating post reduction 1 with 59496 rules applied. Total rules applied 119395 place count 48072 transition count 47838
Reduce places removed 8442 places and 0 transitions.
Iterating post reduction 2 with 8442 rules applied. Total rules applied 127837 place count 39630 transition count 47838
Performed 5829 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5829 Pre rules applied. Total rules applied 127837 place count 39630 transition count 42009
Deduced a syphon composed of 5829 places in 18 ms
Ensure Unique test removed 2814 places
Reduce places removed 8643 places and 0 transitions.
Iterating global reduction 3 with 14472 rules applied. Total rules applied 142309 place count 30987 transition count 42009
Discarding 201 places :
Implicit places reduction removed 201 places
Drop transitions removed 2412 transitions
Trivial Post-agglo rules discarded 2412 transitions
Performed 2412 trivial Post agglomeration. Transition count delta: 2412
Iterating post reduction 3 with 2613 rules applied. Total rules applied 144922 place count 30786 transition count 39597
Reduce places removed 2412 places and 0 transitions.
Iterating post reduction 4 with 2412 rules applied. Total rules applied 147334 place count 28374 transition count 39597
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 201 Pre rules applied. Total rules applied 147334 place count 28374 transition count 39396
Deduced a syphon composed of 201 places in 16 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 147736 place count 28173 transition count 39396
Performed 603 Post agglomeration using F-continuation condition.Transition count delta: 603
Deduced a syphon composed of 603 places in 17 ms
Reduce places removed 603 places and 0 transitions.
Iterating global reduction 5 with 1206 rules applied. Total rules applied 148942 place count 27570 transition count 38793
Applied a total of 148942 rules in 18265 ms. Remains 27570 /110819 variables (removed 83249) and now considering 38793/110159 (removed 71366) transitions.
// Phase 1: matrix 38793 rows 27570 cols
[2023-03-11 06:04:41] [INFO ] Computed 807 place invariants in 1592 ms
[2023-03-11 06:04:43] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:04:43] [INFO ] Implicit Places using invariants in 3665 ms returned []
Implicit Place search using SMT only with invariants took 3674 ms to find 0 implicit places.
[2023-03-11 06:04:43] [INFO ] Invariant cache hit.
[2023-03-11 06:04:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:04:45] [INFO ] Dead Transitions using invariants and state equation in 2035 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 27570/110819 places, 38793/110159 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 23979 ms. Remains : 27570/110819 places, 38793/110159 transitions.
Running random walk in product with property : FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 3 (ADD s9247 s9248 s9249 s9250 s9251 s9252 s9253 s9254 s9255 s9256 s9257 s9258 s9259 s9260 s9261 s9262 s9263 s9264 s9265 s9266 s9267 s9268 s9269 s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 31240 steps with 10389 reset in 10003 ms.
Product exploration timeout after 31290 steps with 10400 reset in 10002 ms.
Computed a total of 27570 stabilizing places and 38793 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27570 transition count 38793
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 p2), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p2)))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 358 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Finished random walk after 1072 steps, including 0 resets, run visited all 4 properties in 100 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p2)))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 8 factoid took 377 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Support contains 402 out of 27570 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 : 27570/27570 places, 38793/38793 transitions.
Applied a total of 0 rules in 430 ms. Remains 27570 /27570 variables (removed 0) and now considering 38793/38793 (removed 0) transitions.
[2023-03-11 06:05:54] [INFO ] Invariant cache hit.
[2023-03-11 06:05:56] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:05:56] [INFO ] Implicit Places using invariants in 2074 ms returned []
Implicit Place search using SMT only with invariants took 2075 ms to find 0 implicit places.
[2023-03-11 06:05:56] [INFO ] Invariant cache hit.
[2023-03-11 06:05:58] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:05:58] [INFO ] Dead Transitions using invariants and state equation in 2098 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4607 ms. Remains : 27570/27570 places, 38793/38793 transitions.
Computed a total of 27570 stabilizing places and 38793 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27570 transition count 38793
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 p2), (X p1), (X (AND p1 p2)), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Finished random walk after 1171 steps, including 0 resets, run visited all 4 properties in 131 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p1 p2), (X p1), (X (AND p1 p2)), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 5 factoid took 312 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Product exploration timeout after 95980 steps with 244 reset in 10002 ms.
Product exploration timeout after 94080 steps with 238 reset in 10002 ms.
Support contains 402 out of 27570 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27570/27570 places, 38793/38793 transitions.
Drop transitions removed 8442 transitions
Trivial Post-agglo rules discarded 8442 transitions
Performed 8442 trivial Post agglomeration. Transition count delta: 8442
Iterating post reduction 0 with 8442 rules applied. Total rules applied 8442 place count 27570 transition count 30351
Reduce places removed 8442 places and 0 transitions.
Iterating post reduction 1 with 8442 rules applied. Total rules applied 16884 place count 19128 transition count 30351
Applied a total of 16884 rules in 754 ms. Remains 19128 /27570 variables (removed 8442) and now considering 30351/38793 (removed 8442) transitions.
// Phase 1: matrix 30351 rows 19128 cols
[2023-03-11 06:07:18] [INFO ] Computed 807 place invariants in 1249 ms
[2023-03-11 06:07:20] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:07:20] [INFO ] Implicit Places using invariants in 2747 ms returned []
Implicit Place search using SMT only with invariants took 2748 ms to find 0 implicit places.
[2023-03-11 06:07:20] [INFO ] Invariant cache hit.
[2023-03-11 06:07:21] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:07:21] [INFO ] Dead Transitions using invariants and state equation in 1494 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19128/27570 places, 30351/38793 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4999 ms. Remains : 19128/27570 places, 30351/38793 transitions.
Treatment of property FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-07 finished in 182984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Found a Lengthening insensitive property : FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-09
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 804 out of 110819 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 110819/110819 places, 110159/110159 transitions.
Graph (complete) has 160197 edges and 110819 vertex of which 110585 are kept as prefixes of interest. Removing 234 places using SCC suffix rule.124 ms
Discarding 234 places :
Also discarding 212 output transitions
Drop transitions removed 212 transitions
Reduce places removed 201 places and 201 transitions.
Discarding 8643 places :
Implicit places reduction removed 8643 places
Drop transitions removed 67737 transitions
Trivial Post-agglo rules discarded 67737 transitions
Performed 67737 trivial Post agglomeration. Transition count delta: 67737
Iterating post reduction 0 with 76380 rules applied. Total rules applied 76381 place count 101741 transition count 42009
Reduce places removed 67737 places and 0 transitions.
Performed 402 Post agglomeration using F-continuation condition.Transition count delta: 402
Iterating post reduction 1 with 68139 rules applied. Total rules applied 144520 place count 34004 transition count 41607
Reduce places removed 402 places and 0 transitions.
Iterating post reduction 2 with 402 rules applied. Total rules applied 144922 place count 33602 transition count 41607
Performed 6030 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6030 Pre rules applied. Total rules applied 144922 place count 33602 transition count 35577
Deduced a syphon composed of 6030 places in 14 ms
Ensure Unique test removed 2814 places
Reduce places removed 8844 places and 0 transitions.
Iterating global reduction 3 with 14874 rules applied. Total rules applied 159796 place count 24758 transition count 35577
Drop transitions removed 2211 transitions
Trivial Post-agglo rules discarded 2211 transitions
Performed 2211 trivial Post agglomeration. Transition count delta: 2211
Iterating post reduction 3 with 2211 rules applied. Total rules applied 162007 place count 24758 transition count 33366
Reduce places removed 2211 places and 0 transitions.
Iterating post reduction 4 with 2211 rules applied. Total rules applied 164218 place count 22547 transition count 33366
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 201 Pre rules applied. Total rules applied 164218 place count 22547 transition count 33165
Deduced a syphon composed of 201 places in 12 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 164620 place count 22346 transition count 33165
Performed 5025 Post agglomeration using F-continuation condition.Transition count delta: 5025
Deduced a syphon composed of 5025 places in 9 ms
Ensure Unique test removed 201 places
Reduce places removed 5226 places and 0 transitions.
Iterating global reduction 5 with 10251 rules applied. Total rules applied 174871 place count 17120 transition count 28140
Applied a total of 174871 rules in 11369 ms. Remains 17120 /110819 variables (removed 93699) and now considering 28140/110159 (removed 82019) transitions.
// Phase 1: matrix 28140 rows 17120 cols
[2023-03-11 06:07:36] [INFO ] Computed 1211 place invariants in 787 ms
[2023-03-11 06:07:38] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:07:38] [INFO ] Implicit Places using invariants in 2410 ms returned []
Implicit Place search using SMT only with invariants took 2411 ms to find 0 implicit places.
[2023-03-11 06:07:38] [INFO ] Invariant cache hit.
[2023-03-11 06:07:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:07:40] [INFO ] Dead Transitions using invariants and state equation in 1432 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 17120/110819 places, 28140/110159 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 15214 ms. Remains : 17120/110819 places, 28140/110159 transitions.
Running random walk in product with property : FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 (ADD s6837 s6838 s6839 s6840 s6841 s6842 s6843 s6844 s6845 s6846 s6847 s6848 s6849 s6850 s6851 s6852 s6853 s6854 s6855 s6856 s6857 s6858 s6859 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 61 reset in 8510 ms.
Product exploration explored 100000 steps with 61 reset in 8633 ms.
Computed a total of 17120 stabilizing places and 28140 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17120 transition count 28140
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 p1)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 166 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1631 steps, including 0 resets, run visited all 1 properties in 125 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 173 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2023-03-11 06:08:27] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 804 out of 17120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17120/17120 places, 28140/28140 transitions.
Applied a total of 0 rules in 433 ms. Remains 17120 /17120 variables (removed 0) and now considering 28140/28140 (removed 0) transitions.
[2023-03-11 06:08:42] [INFO ] Invariant cache hit.
[2023-03-11 06:08:43] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:08:43] [INFO ] Implicit Places using invariants in 1346 ms returned []
Implicit Place search using SMT only with invariants took 1347 ms to find 0 implicit places.
[2023-03-11 06:08:43] [INFO ] Invariant cache hit.
[2023-03-11 06:08:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:08:45] [INFO ] Dead Transitions using invariants and state equation in 1343 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3125 ms. Remains : 17120/17120 places, 28140/28140 transitions.
Computed a total of 17120 stabilizing places and 28140 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17120 transition count 28140
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)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 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 53 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1804 steps, including 0 resets, run visited all 1 properties in 134 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 147 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
[2023-03-11 06:09:12] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 61 reset in 7585 ms.
Product exploration explored 100000 steps with 61 reset in 7770 ms.
Support contains 804 out of 17120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17120/17120 places, 28140/28140 transitions.
Applied a total of 0 rules in 423 ms. Remains 17120 /17120 variables (removed 0) and now considering 28140/28140 (removed 0) transitions.
[2023-03-11 06:09:43] [INFO ] Invariant cache hit.
[2023-03-11 06:09:44] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:09:45] [INFO ] Implicit Places using invariants in 1354 ms returned []
Implicit Place search using SMT only with invariants took 1355 ms to find 0 implicit places.
[2023-03-11 06:09:45] [INFO ] Invariant cache hit.
[2023-03-11 06:09:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 06:09:46] [INFO ] Dead Transitions using invariants and state equation in 1358 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3139 ms. Remains : 17120/17120 places, 28140/28140 transitions.
Treatment of property FamilyReunion-COL-L00200M0020C010P010G005-LTLCardinality-09 finished in 145025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
[2023-03-11 06:09:52] [INFO ] Flatten gal took : 2498 ms
[2023-03-11 06:09:52] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 6 ms.
[2023-03-11 06:09:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 110819 places, 110159 transitions and 278396 arcs took 241 ms.
Total runtime 1676985 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2062/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393228 kB
MemFree: 2879736 kB
After kill :
MemTotal: 16393228 kB
MemFree: 16005560 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2062/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393228 kB
MemFree: 2847764 kB
After kill :
MemTotal: 16393228 kB
MemFree: 15998244 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2062/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393228 kB
MemFree: 3398412 kB
After kill :
MemTotal: 16393228 kB
MemFree: 15999260 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-COL-L00200M0020C010P010G005"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is FamilyReunion-COL-L00200M0020C010P010G005, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838855700331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00200M0020C010P010G005.tgz
mv FamilyReunion-COL-L00200M0020C010P010G005 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;