Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r167-tall-167838853100419.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853100419
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678476116749

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00100M0010C005P005G002
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 19:21:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 19:21:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 19:21:59] [INFO ] Load time of PNML (sax parser for PT used): 760 ms
[2023-03-10 19:21:59] [INFO ] Transformed 40605 places.
[2023-03-10 19:21:59] [INFO ] Transformed 36871 transitions.
[2023-03-10 19:21:59] [INFO ] Parsed PT model containing 40605 places and 36871 transitions and 112728 arcs in 999 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 2313 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 31 places and 0 transitions.
Support contains 11967 out of 40574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Reduce places removed 328 places and 0 transitions.
Discarding 4443 places :
Implicit places reduction removed 4443 places
Iterating post reduction 0 with 4771 rules applied. Total rules applied 4771 place count 35803 transition count 36871
Applied a total of 4771 rules in 1107 ms. Remains 35803 /40574 variables (removed 4771) and now considering 36871/36871 (removed 0) transitions.
// Phase 1: matrix 36871 rows 35803 cols
[2023-03-10 19:22:06] [INFO ] Computed 4150 place invariants in 2535 ms
[2023-03-10 19:22:10] [INFO ] Implicit Places using invariants in 7224 ms returned []
Implicit Place search using SMT only with invariants took 7253 ms to find 0 implicit places.
[2023-03-10 19:22:10] [INFO ] Invariant cache hit.
[2023-03-10 19:22:13] [INFO ] Dead Transitions using invariants and state equation in 3083 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 35803/40574 places, 36871/36871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11452 ms. Remains : 35803/40574 places, 36871/36871 transitions.
Support contains 11967 out of 35803 places after structural reductions.
[2023-03-10 19:22:15] [INFO ] Flatten gal took : 1321 ms
[2023-03-10 19:22:16] [INFO ] Flatten gal took : 953 ms
[2023-03-10 19:22:19] [INFO ] Input system was already deterministic with 36871 transitions.
Support contains 10845 out of 35803 places (down from 11967) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1214 ms. (steps per millisecond=8 ) properties (out of 34) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-10 19:22:20] [INFO ] Invariant cache hit.
[2023-03-10 19:22:34] [INFO ] After 13939ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-10 19:22:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 66 ms returned sat
[2023-03-10 19:22:54] [INFO ] [Nat]Absence check using 3 positive and 4147 generalized place invariants in 6148 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
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-10 19:23:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 19:23:00] [INFO ] After 25218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2252 out of 35803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35803/35803 places, 36871/36871 transitions.
Graph (complete) has 53938 edges and 35803 vertex of which 35184 are kept as prefixes of interest. Removing 619 places using SCC suffix rule.71 ms
Discarding 619 places :
Also discarding 511 output transitions
Drop transitions removed 511 transitions
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Discarding 2222 places :
Implicit places reduction removed 2222 places
Drop transitions removed 18254 transitions
Trivial Post-agglo rules discarded 18254 transitions
Performed 18254 trivial Post agglomeration. Transition count delta: 18254
Iterating post reduction 0 with 20779 rules applied. Total rules applied 20780 place count 32962 transition count 17803
Reduce places removed 18254 places and 0 transitions.
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Iterating post reduction 1 with 18370 rules applied. Total rules applied 39150 place count 14708 transition count 17687
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 39266 place count 14592 transition count 17687
Performed 2219 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2219 Pre rules applied. Total rules applied 39266 place count 14592 transition count 15468
Deduced a syphon composed of 2219 places in 9 ms
Ensure Unique test removed 705 places
Reduce places removed 2924 places and 0 transitions.
Iterating global reduction 3 with 5143 rules applied. Total rules applied 44409 place count 11668 transition count 15468
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 44411 place count 11666 transition count 15468
Discarding 3534 places :
Symmetric choice reduction at 4 with 3534 rule applications. Total rules 47945 place count 8132 transition count 11934
Iterating global reduction 4 with 3534 rules applied. Total rules applied 51479 place count 8132 transition count 11934
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Discarding 200 places :
Implicit places reduction removed 200 places
Drop transitions removed 599 transitions
Trivial Post-agglo rules discarded 599 transitions
Performed 599 trivial Post agglomeration. Transition count delta: 599
Iterating post reduction 4 with 1303 rules applied. Total rules applied 52782 place count 7932 transition count 10831
Reduce places removed 599 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 600 rules applied. Total rules applied 53382 place count 7333 transition count 10830
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 53383 place count 7332 transition count 10830
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 100 Pre rules applied. Total rules applied 53383 place count 7332 transition count 10730
Deduced a syphon composed of 100 places in 6 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 7 with 200 rules applied. Total rules applied 53583 place count 7232 transition count 10730
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 53593 place count 7222 transition count 9720
Iterating global reduction 7 with 10 rules applied. Total rules applied 53603 place count 7222 transition count 9720
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 7 with 200 rules applied. Total rules applied 53803 place count 7121 transition count 9621
Reduce places removed 99 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 100 rules applied. Total rules applied 53903 place count 7022 transition count 9620
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 53904 place count 7021 transition count 9620
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 100 Pre rules applied. Total rules applied 53904 place count 7021 transition count 9520
Deduced a syphon composed of 100 places in 14 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 10 with 200 rules applied. Total rules applied 54104 place count 6921 transition count 9520
Discarding 1007 places :
Symmetric choice reduction at 10 with 1007 rule applications. Total rules 55111 place count 5914 transition count 8513
Iterating global reduction 10 with 1007 rules applied. Total rules applied 56118 place count 5914 transition count 8513
Ensure Unique test removed 1007 transitions
Reduce isomorphic transitions removed 1007 transitions.
Discarding 98 places :
Implicit places reduction removed 98 places
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 10 with 1301 rules applied. Total rules applied 57419 place count 5816 transition count 7310
Reduce places removed 196 places and 0 transitions.
Iterating post reduction 11 with 196 rules applied. Total rules applied 57615 place count 5620 transition count 7310
Performed 207 Post agglomeration using F-continuation condition.Transition count delta: 207
Deduced a syphon composed of 207 places in 5 ms
Ensure Unique test removed 101 places
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 12 with 515 rules applied. Total rules applied 58130 place count 5312 transition count 7103
Free-agglomeration rule (complex) applied 304 times.
Iterating global reduction 12 with 304 rules applied. Total rules applied 58434 place count 5312 transition count 6799
Reduce places removed 304 places and 0 transitions.
Iterating post reduction 12 with 304 rules applied. Total rules applied 58738 place count 5008 transition count 6799
Reduce places removed 98 places and 98 transitions.
Iterating global reduction 13 with 98 rules applied. Total rules applied 58836 place count 4910 transition count 6701
Applied a total of 58836 rules in 6106 ms. Remains 4910 /35803 variables (removed 30893) and now considering 6701/36871 (removed 30170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6106 ms. Remains : 4910/35803 places, 6701/36871 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 18) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6701 rows 4910 cols
[2023-03-10 19:23:06] [INFO ] Computed 618 place invariants in 124 ms
[2023-03-10 19:23:07] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2023-03-10 19:23:07] [INFO ] [Real]Absence check using 1 positive and 617 generalized place invariants in 241 ms returned sat
[2023-03-10 19:23:12] [INFO ] After 6024ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 35803 stabilizing places and 36871 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35803 transition count 36871
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U (p1&&X(p2)))||G(!p0)))'
Support contains 2335 out of 35803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35803/35803 places, 36871/36871 transitions.
Reduce places removed 7 places and 0 transitions.
Discarding 2223 places :
Implicit places reduction removed 2223 places
Iterating post reduction 0 with 2230 rules applied. Total rules applied 2230 place count 33573 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 2432 place count 33371 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 2634 place count 33371 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2636 place count 33369 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 2638 place count 33369 transition count 36265
Applied a total of 2638 rules in 922 ms. Remains 33369 /35803 variables (removed 2434) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 33369 cols
[2023-03-10 19:23:15] [INFO ] Computed 1925 place invariants in 1340 ms
[2023-03-10 19:23:18] [INFO ] Implicit Places using invariants in 3872 ms returned []
Implicit Place search using SMT only with invariants took 3874 ms to find 0 implicit places.
[2023-03-10 19:23:18] [INFO ] Invariant cache hit.
[2023-03-10 19:23:20] [INFO ] Dead Transitions using invariants and state equation in 2498 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33369/35803 places, 36265/36871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7299 ms. Remains : 33369/35803 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 382 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (OR (NOT p2) (NOT p0)), p0, (AND p0 (NOT p2)), (NOT p0), true, (OR (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 7}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 7}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 5}, { cond=(NOT p0), acceptance={0} source=2 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 p0), acceptance={0} source=7 dest: 2}, { cond=(NOT p0), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ (ADD s8086 s8087 s8088 s8089 s8090 s8091 s8092 s8093 s8094 s8095 s8096 s8097 s8098 s8099 s8100 s8101 s8102 s8103 s8104 s8105 s8106 s8107 s8108 s81...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 40070 steps with 20035 reset in 10002 ms.
Product exploration timeout after 41460 steps with 20730 reset in 10001 ms.
Computed a total of 33369 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33369 transition count 36265
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X (AND p0 p2))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (AND p1 p0))
Knowledge based reduction with 18 factoid took 289 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-00 finished in 65453 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))'
Support contains 101 out of 35803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35803/35803 places, 36871/36871 transitions.
Graph (complete) has 53938 edges and 35803 vertex of which 32439 are kept as prefixes of interest. Removing 3364 places using SCC suffix rule.54 ms
Discarding 3364 places :
Also discarding 4248 output transitions
Drop transitions removed 4248 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 2223 places :
Implicit places reduction removed 2223 places
Drop transitions removed 18988 transitions
Trivial Post-agglo rules discarded 18988 transitions
Performed 18988 trivial Post agglomeration. Transition count delta: 18988
Iterating post reduction 0 with 21211 rules applied. Total rules applied 21212 place count 30115 transition count 13534
Reduce places removed 18988 places and 0 transitions.
Iterating post reduction 1 with 18988 rules applied. Total rules applied 40200 place count 11127 transition count 13534
Performed 1717 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1717 Pre rules applied. Total rules applied 40200 place count 11127 transition count 11817
Deduced a syphon composed of 1717 places in 5 ms
Ensure Unique test removed 909 places
Reduce places removed 2626 places and 0 transitions.
Iterating global reduction 2 with 4343 rules applied. Total rules applied 44543 place count 8501 transition count 11817
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 2 with 707 rules applied. Total rules applied 45250 place count 8501 transition count 11110
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 3 with 707 rules applied. Total rules applied 45957 place count 7794 transition count 11110
Discarding 4040 places :
Symmetric choice reduction at 4 with 4040 rule applications. Total rules 49997 place count 3754 transition count 7070
Iterating global reduction 4 with 4040 rules applied. Total rules applied 54037 place count 3754 transition count 7070
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 909 transitions
Trivial Post-agglo rules discarded 909 transitions
Performed 909 trivial Post agglomeration. Transition count delta: 909
Iterating post reduction 4 with 2222 rules applied. Total rules applied 56259 place count 3451 transition count 5151
Reduce places removed 909 places and 0 transitions.
Iterating post reduction 5 with 909 rules applied. Total rules applied 57168 place count 2542 transition count 5151
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 101 Pre rules applied. Total rules applied 57168 place count 2542 transition count 5050
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 57370 place count 2441 transition count 5050
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 57385 place count 2426 transition count 3535
Iterating global reduction 6 with 15 rules applied. Total rules applied 57400 place count 2426 transition count 3535
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 6 with 1010 rules applied. Total rules applied 58410 place count 2123 transition count 2828
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 7 with 202 rules applied. Total rules applied 58612 place count 1921 transition count 2828
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 202 Pre rules applied. Total rules applied 58612 place count 1921 transition count 2626
Deduced a syphon composed of 202 places in 0 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 404 rules applied. Total rules applied 59016 place count 1719 transition count 2626
Discarding 1010 places :
Symmetric choice reduction at 8 with 1010 rule applications. Total rules 60026 place count 709 transition count 1616
Iterating global reduction 8 with 1010 rules applied. Total rules applied 61036 place count 709 transition count 1616
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 8 with 1010 rules applied. Total rules applied 62046 place count 709 transition count 606
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 62046 place count 709 transition count 505
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 303 rules applied. Total rules applied 62349 place count 507 transition count 505
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 9 with 101 rules applied. Total rules applied 62450 place count 406 transition count 404
Applied a total of 62450 rules in 2383 ms. Remains 406 /35803 variables (removed 35397) and now considering 404/36871 (removed 36467) transitions.
// Phase 1: matrix 404 rows 406 cols
[2023-03-10 19:24:21] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-10 19:24:21] [INFO ] Implicit Places using invariants in 195 ms returned [202, 203]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 206 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/35803 places, 404/36871 transitions.
Reduce places removed 101 places and 101 transitions.
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 101 Pre rules applied. Total rules applied 0 place count 303 transition count 202
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 202 rules applied. Total rules applied 202 place count 202 transition count 202
Applied a total of 202 rules in 6 ms. Remains 202 /404 variables (removed 202) and now considering 202/404 (removed 202) transitions.
// Phase 1: matrix 202 rows 202 cols
[2023-03-10 19:24:21] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 19:24:21] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-10 19:24:21] [INFO ] Invariant cache hit.
[2023-03-10 19:24:21] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 202/35803 places, 202/36871 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2719 ms. Remains : 202/35803 places, 202/36871 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 24632 reset in 632 ms.
Product exploration explored 100000 steps with 24634 reset in 716 ms.
Computed a total of 202 stabilizing places and 202 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 202 transition count 202
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 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 29 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 255 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-10 19:24:23] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-01 finished in 4950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3434 out of 35803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35803/35803 places, 36871/36871 transitions.
Reduce places removed 13 places and 0 transitions.
Discarding 1112 places :
Implicit places reduction removed 1112 places
Iterating post reduction 0 with 1125 rules applied. Total rules applied 1125 place count 34678 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 1327 place count 34476 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 1529 place count 34476 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1531 place count 34474 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 1533 place count 34474 transition count 36265
Applied a total of 1533 rules in 859 ms. Remains 34474 /35803 variables (removed 1329) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 34474 cols
[2023-03-10 19:24:26] [INFO ] Computed 3035 place invariants in 1984 ms
[2023-03-10 19:24:29] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:24:29] [INFO ] Implicit Places using invariants in 4892 ms returned []
Implicit Place search using SMT only with invariants took 4893 ms to find 0 implicit places.
[2023-03-10 19:24:29] [INFO ] Invariant cache hit.
[2023-03-10 19:24:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:24:32] [INFO ] Dead Transitions using invariants and state equation in 2793 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 34474/35803 places, 36265/36871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8549 ms. Remains : 34474/35803 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GT 6 (ADD s14449 s14450 s14451 s14452 s14453 s14454 s14455 s14456 s14457 s14458 s14459 s14460 s14461 s14462 s14463 s14464 s14465 s14466 s14467 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 43390 steps with 21695 reset in 10002 ms.
Product exploration timeout after 43560 steps with 21780 reset in 10003 ms.
Computed a total of 34474 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 34474 transition count 36265
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 72 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-03 finished in 73767 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&&(p1||X(F(p2)))))))'
Support contains 2020 out of 35803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35803/35803 places, 36871/36871 transitions.
Graph (complete) has 53938 edges and 35803 vertex of which 34670 are kept as prefixes of interest. Removing 1133 places using SCC suffix rule.38 ms
Discarding 1133 places :
Also discarding 1521 output transitions
Drop transitions removed 1521 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 2223 places :
Implicit places reduction removed 2223 places
Drop transitions removed 15857 transitions
Trivial Post-agglo rules discarded 15857 transitions
Performed 15857 trivial Post agglomeration. Transition count delta: 15857
Iterating post reduction 0 with 18080 rules applied. Total rules applied 18081 place count 32346 transition count 19392
Reduce places removed 15857 places and 0 transitions.
Performed 1111 Post agglomeration using F-continuation condition.Transition count delta: 1111
Iterating post reduction 1 with 16968 rules applied. Total rules applied 35049 place count 16489 transition count 18281
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 2 with 1111 rules applied. Total rules applied 36160 place count 15378 transition count 18281
Performed 1111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1111 Pre rules applied. Total rules applied 36160 place count 15378 transition count 17170
Deduced a syphon composed of 1111 places in 10 ms
Ensure Unique test removed 303 places
Reduce places removed 1414 places and 0 transitions.
Iterating global reduction 3 with 2525 rules applied. Total rules applied 38685 place count 13964 transition count 17170
Discarding 606 places :
Implicit places reduction removed 606 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 3 with 707 rules applied. Total rules applied 39392 place count 13358 transition count 17069
Reduce places removed 101 places and 0 transitions.
Performed 606 Post agglomeration using F-continuation condition.Transition count delta: 606
Iterating post reduction 4 with 707 rules applied. Total rules applied 40099 place count 13257 transition count 16463
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 5 with 606 rules applied. Total rules applied 40705 place count 12651 transition count 16463
Discarding 4747 places :
Symmetric choice reduction at 6 with 4747 rule applications. Total rules 45452 place count 7904 transition count 11716
Iterating global reduction 6 with 4747 rules applied. Total rules applied 50199 place count 7904 transition count 11716
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 505 transitions
Trivial Post-agglo rules discarded 505 transitions
Performed 505 trivial Post agglomeration. Transition count delta: 505
Iterating post reduction 6 with 1212 rules applied. Total rules applied 51411 place count 7702 transition count 10706
Reduce places removed 505 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 7 with 606 rules applied. Total rules applied 52017 place count 7197 transition count 10605
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 8 with 101 rules applied. Total rules applied 52118 place count 7096 transition count 10605
Performed 303 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 303 Pre rules applied. Total rules applied 52118 place count 7096 transition count 10302
Deduced a syphon composed of 303 places in 4 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 9 with 606 rules applied. Total rules applied 52724 place count 6793 transition count 10302
Discarding 22 places :
Symmetric choice reduction at 9 with 22 rule applications. Total rules 52746 place count 6771 transition count 8080
Iterating global reduction 9 with 22 rules applied. Total rules applied 52768 place count 6771 transition count 8080
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 9 with 1010 rules applied. Total rules applied 53778 place count 6468 transition count 7373
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 10 with 202 rules applied. Total rules applied 53980 place count 6266 transition count 7373
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 202 Pre rules applied. Total rules applied 53980 place count 6266 transition count 7171
Deduced a syphon composed of 202 places in 2 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 11 with 404 rules applied. Total rules applied 54384 place count 6064 transition count 7171
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 11 with 202 rules applied. Total rules applied 54586 place count 5963 transition count 7070
Applied a total of 54586 rules in 5853 ms. Remains 5963 /35803 variables (removed 29840) and now considering 7070/36871 (removed 29801) transitions.
// Phase 1: matrix 7070 rows 5963 cols
[2023-03-10 19:25:43] [INFO ] Computed 408 place invariants in 115 ms
[2023-03-10 19:25:44] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:25:45] [INFO ] Implicit Places using invariants in 1757 ms returned [115, 4560]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1769 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5961/35803 places, 7070/36871 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 5961 transition count 7059
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 5950 transition count 7059
Applied a total of 22 rules in 569 ms. Remains 5950 /5961 variables (removed 11) and now considering 7059/7070 (removed 11) transitions.
// Phase 1: matrix 7059 rows 5950 cols
[2023-03-10 19:25:45] [INFO ] Computed 406 place invariants in 124 ms
[2023-03-10 19:25:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:25:47] [INFO ] Implicit Places using invariants in 1993 ms returned [144, 161, 4560]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1999 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5947/35803 places, 7059/36871 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 5947 transition count 7037
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 5925 transition count 7037
Applied a total of 44 rules in 522 ms. Remains 5925 /5947 variables (removed 22) and now considering 7037/7059 (removed 22) transitions.
// Phase 1: matrix 7037 rows 5925 cols
[2023-03-10 19:25:48] [INFO ] Computed 403 place invariants in 132 ms
[2023-03-10 19:25:48] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:25:50] [INFO ] Implicit Places using invariants in 1854 ms returned [123, 146, 4560]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1861 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 5922/35803 places, 7037/36871 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 5922 transition count 7015
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 5900 transition count 7015
Applied a total of 44 rules in 531 ms. Remains 5900 /5922 variables (removed 22) and now considering 7015/7037 (removed 22) transitions.
// Phase 1: matrix 7015 rows 5900 cols
[2023-03-10 19:25:50] [INFO ] Computed 400 place invariants in 131 ms
[2023-03-10 19:25:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:25:52] [INFO ] Implicit Places using invariants in 1839 ms returned [177, 194, 4560]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1843 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 5897/35803 places, 7015/36871 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 5897 transition count 6993
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 5875 transition count 6993
Applied a total of 44 rules in 500 ms. Remains 5875 /5897 variables (removed 22) and now considering 6993/7015 (removed 22) transitions.
// Phase 1: matrix 6993 rows 5875 cols
[2023-03-10 19:25:53] [INFO ] Computed 397 place invariants in 144 ms
[2023-03-10 19:25:53] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:25:54] [INFO ] Implicit Places using invariants in 1847 ms returned [4487, 4560]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1851 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 5873/35803 places, 6993/36871 transitions.
Applied a total of 0 rules in 471 ms. Remains 5873 /5873 variables (removed 0) and now considering 6993/6993 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 6 iterations and 17773 ms. Remains : 5873/35803 places, 6993/36871 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s5165 s5166 s5167 s5168 s5169 s5170 s5171 s5172 s5173 s5174 s5175 s5176 s5177 s5178 s5179 s5180 s5181 s5182 s5183 s5184 s5185 s5186 s5187 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 133 reset in 4233 ms.
Product exploration explored 100000 steps with 133 reset in 4324 ms.
Computed a total of 5873 stabilizing places and 6993 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5873 transition count 6993
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))))]
Knowledge based reduction with 11 factoid took 610 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 331 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (F p0)]
Knowledge based reduction with 11 factoid took 409 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
// Phase 1: matrix 6993 rows 5873 cols
[2023-03-10 19:26:51] [INFO ] Computed 395 place invariants in 123 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 11 factoid took 238 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-04 finished in 88805 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)||G(p1))))'
Support contains 1319 out of 35803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35803/35803 places, 36871/36871 transitions.
Graph (complete) has 53938 edges and 35803 vertex of which 33865 are kept as prefixes of interest. Removing 1938 places using SCC suffix rule.32 ms
Discarding 1938 places :
Also discarding 2430 output transitions
Drop transitions removed 2430 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 2223 places :
Implicit places reduction removed 2223 places
Drop transitions removed 17170 transitions
Trivial Post-agglo rules discarded 17170 transitions
Performed 17170 trivial Post agglomeration. Transition count delta: 17170
Iterating post reduction 0 with 19393 rules applied. Total rules applied 19394 place count 31541 transition count 17170
Reduce places removed 17170 places and 0 transitions.
Iterating post reduction 1 with 17170 rules applied. Total rules applied 36564 place count 14371 transition count 17170
Performed 1717 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1717 Pre rules applied. Total rules applied 36564 place count 14371 transition count 15453
Deduced a syphon composed of 1717 places in 9 ms
Ensure Unique test removed 202 places
Reduce places removed 1919 places and 0 transitions.
Iterating global reduction 2 with 3636 rules applied. Total rules applied 40200 place count 12452 transition count 15453
Discarding 707 places :
Implicit places reduction removed 707 places
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 2 with 808 rules applied. Total rules applied 41008 place count 11745 transition count 15352
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 3 with 101 rules applied. Total rules applied 41109 place count 11644 transition count 15352
Discarding 4640 places :
Symmetric choice reduction at 4 with 4640 rule applications. Total rules 45749 place count 7004 transition count 10712
Iterating global reduction 4 with 4640 rules applied. Total rules applied 50389 place count 7004 transition count 10712
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 4 with 1414 rules applied. Total rules applied 51803 place count 6802 transition count 9500
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 5 with 707 rules applied. Total rules applied 52510 place count 6095 transition count 9500
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 101 Pre rules applied. Total rules applied 52510 place count 6095 transition count 9399
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 52712 place count 5994 transition count 9399
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 52727 place count 5979 transition count 7884
Iterating global reduction 6 with 15 rules applied. Total rules applied 52742 place count 5979 transition count 7884
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 6 with 303 rules applied. Total rules applied 53045 place count 5777 transition count 7783
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 7 with 101 rules applied. Total rules applied 53146 place count 5676 transition count 7783
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 202 Pre rules applied. Total rules applied 53146 place count 5676 transition count 7581
Deduced a syphon composed of 202 places in 3 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 404 rules applied. Total rules applied 53550 place count 5474 transition count 7581
Discarding 1010 places :
Symmetric choice reduction at 8 with 1010 rule applications. Total rules 54560 place count 4464 transition count 6571
Iterating global reduction 8 with 1010 rules applied. Total rules applied 55570 place count 4464 transition count 6571
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 8 with 1010 rules applied. Total rules applied 56580 place count 4464 transition count 5561
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 56580 place count 4464 transition count 5460
Deduced a syphon composed of 101 places in 2 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 303 rules applied. Total rules applied 56883 place count 4262 transition count 5460
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Deduced a syphon composed of 202 places in 1 ms
Ensure Unique test removed 101 places
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 9 with 505 rules applied. Total rules applied 57388 place count 3959 transition count 5258
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 57590 place count 3858 transition count 5157
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 9 with 101 rules applied. Total rules applied 57691 place count 3757 transition count 5056
Applied a total of 57691 rules in 4977 ms. Remains 3757 /35803 variables (removed 32046) and now considering 5056/36871 (removed 31815) transitions.
// Phase 1: matrix 5056 rows 3757 cols
[2023-03-10 19:27:11] [INFO ] Computed 206 place invariants in 110 ms
[2023-03-10 19:27:12] [INFO ] Implicit Places using invariants in 1323 ms returned [927]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1326 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3756/35803 places, 5056/36871 transitions.
Applied a total of 0 rules in 176 ms. Remains 3756 /3756 variables (removed 0) and now considering 5056/5056 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6479 ms. Remains : 3756/35803 places, 5056/36871 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s820 s821 s822 s823 s824 s825) (ADD s3655 s3656 s3657 s3658 s3659 s3660 s3661 s3662 s3663 s3664 s3665 s3666 s3667 s3668 s3669 s3670 s3671 s36...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 89 reset in 5903 ms.
Product exploration explored 100000 steps with 89 reset in 5961 ms.
Computed a total of 3756 stabilizing places and 5056 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3756 transition count 5056
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 11 factoid took 286 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-05 finished in 37125 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(p0)||(X(F(p2))&&p1)))))'
Support contains 1111 out of 35803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35803/35803 places, 36871/36871 transitions.
Reduce places removed 13 places and 0 transitions.
Discarding 2223 places :
Implicit places reduction removed 2223 places
Iterating post reduction 0 with 2236 rules applied. Total rules applied 2236 place count 33567 transition count 36871
Applied a total of 2236 rules in 341 ms. Remains 33567 /35803 variables (removed 2236) and now considering 36871/36871 (removed 0) transitions.
// Phase 1: matrix 36871 rows 33567 cols
[2023-03-10 19:27:45] [INFO ] Computed 1924 place invariants in 1458 ms
[2023-03-10 19:27:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:27:47] [INFO ] Implicit Places using invariants in 3999 ms returned []
Implicit Place search using SMT only with invariants took 4001 ms to find 0 implicit places.
[2023-03-10 19:27:47] [INFO ] Invariant cache hit.
[2023-03-10 19:27:50] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:27:50] [INFO ] Dead Transitions using invariants and state equation in 2498 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33567/35803 places, 36871/36871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6851 ms. Remains : 33567/35803 places, 36871/36871 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(LEQ (ADD s20526 s20527 s20528 s20529 s20530 s20531 s20532 s20533 s20534 s20535 s20536 s20537 s20538 s20539 s20540 s20541 s20542 s20543 s20544 s20545 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3204 steps with 0 reset in 100 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-06 finished in 7260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 606 out of 35803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35803/35803 places, 36871/36871 transitions.
Graph (complete) has 53938 edges and 35803 vertex of which 32237 are kept as prefixes of interest. Removing 3566 places using SCC suffix rule.30 ms
Discarding 3566 places :
Also discarding 4450 output transitions
Drop transitions removed 4450 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 2223 places :
Implicit places reduction removed 2223 places
Drop transitions removed 18382 transitions
Trivial Post-agglo rules discarded 18382 transitions
Performed 18382 trivial Post agglomeration. Transition count delta: 18382
Iterating post reduction 0 with 20605 rules applied. Total rules applied 20606 place count 29913 transition count 13938
Reduce places removed 18382 places and 0 transitions.
Iterating post reduction 1 with 18382 rules applied. Total rules applied 38988 place count 11531 transition count 13938
Performed 1717 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1717 Pre rules applied. Total rules applied 38988 place count 11531 transition count 12221
Deduced a syphon composed of 1717 places in 5 ms
Ensure Unique test removed 909 places
Reduce places removed 2626 places and 0 transitions.
Iterating global reduction 2 with 4343 rules applied. Total rules applied 43331 place count 8905 transition count 12221
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 2 with 707 rules applied. Total rules applied 44038 place count 8905 transition count 11514
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 3 with 707 rules applied. Total rules applied 44745 place count 8198 transition count 11514
Discarding 3535 places :
Symmetric choice reduction at 4 with 3535 rule applications. Total rules 48280 place count 4663 transition count 7979
Iterating global reduction 4 with 3535 rules applied. Total rules applied 51815 place count 4663 transition count 7979
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 4 with 1414 rules applied. Total rules applied 53229 place count 4461 transition count 6767
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 5 with 707 rules applied. Total rules applied 53936 place count 3754 transition count 6767
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 53951 place count 3739 transition count 5252
Iterating global reduction 6 with 15 rules applied. Total rules applied 53966 place count 3739 transition count 5252
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 6 with 1111 rules applied. Total rules applied 55077 place count 3436 transition count 4444
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 7 with 303 rules applied. Total rules applied 55380 place count 3133 transition count 4444
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 202 Pre rules applied. Total rules applied 55380 place count 3133 transition count 4242
Deduced a syphon composed of 202 places in 1 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 404 rules applied. Total rules applied 55784 place count 2931 transition count 4242
Discarding 1010 places :
Symmetric choice reduction at 8 with 1010 rule applications. Total rules 56794 place count 1921 transition count 3232
Iterating global reduction 8 with 1010 rules applied. Total rules applied 57804 place count 1921 transition count 3232
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 8 with 1010 rules applied. Total rules applied 58814 place count 1921 transition count 2222
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 58814 place count 1921 transition count 2121
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 303 rules applied. Total rules applied 59117 place count 1719 transition count 2121
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 59319 place count 1618 transition count 2020
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 9 with 101 rules applied. Total rules applied 59420 place count 1517 transition count 1919
Applied a total of 59420 rules in 2436 ms. Remains 1517 /35803 variables (removed 34286) and now considering 1919/36871 (removed 34952) transitions.
// Phase 1: matrix 1919 rows 1517 cols
[2023-03-10 19:27:53] [INFO ] Computed 103 place invariants in 27 ms
[2023-03-10 19:27:53] [INFO ] Implicit Places using invariants in 731 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 1414, 1415]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 734 ms to find 103 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1414/35803 places, 1919/36871 transitions.
Reduce places removed 101 places and 101 transitions.
Applied a total of 0 rules in 20 ms. Remains 1313 /1414 variables (removed 101) and now considering 1818/1919 (removed 101) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3190 ms. Remains : 1313/35803 places, 1818/36871 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s606 s607 s608 s609 s610 s611 s612 s613 s614 s615 s616 s617 s618 s619 s620 s621 s622 s623 s624 s625 s626 s627 s628 s629 s630 s631 s632 s633...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 303 steps with 0 reset in 17 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-07 finished in 3285 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 U p1)||(p2&&X(p3))))))'
Support contains 5 out of 35803 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 35803/35803 places, 36871/36871 transitions.
Reduce places removed 13 places and 0 transitions.
Discarding 2222 places :
Implicit places reduction removed 2222 places
Iterating post reduction 0 with 2235 rules applied. Total rules applied 2235 place count 33568 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 2437 place count 33366 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 2639 place count 33366 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2641 place count 33364 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 2643 place count 33364 transition count 36265
Applied a total of 2643 rules in 828 ms. Remains 33364 /35803 variables (removed 2439) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 33364 cols
[2023-03-10 19:27:56] [INFO ] Computed 1925 place invariants in 1345 ms
[2023-03-10 19:27:58] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:27:58] [INFO ] Implicit Places using invariants in 3825 ms returned []
Implicit Place search using SMT only with invariants took 3827 ms to find 0 implicit places.
[2023-03-10 19:27:58] [INFO ] Invariant cache hit.
[2023-03-10 19:28:01] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:28:01] [INFO ] Dead Transitions using invariants and state equation in 2886 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33364/35803 places, 36265/36871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7544 ms. Remains : 33364/35803 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s28376 s29719), p2:(GT 1 s5557), p3:(LEQ s9803 s18181)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 19 reset in 2370 ms.
Product exploration explored 100000 steps with 19 reset in 2480 ms.
Computed a total of 33364 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33364 transition count 36265
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 p3), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 12 factoid took 363 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-09 finished in 51762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 35803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35803/35803 places, 36871/36871 transitions.
Reduce places removed 13 places and 0 transitions.
Discarding 2223 places :
Implicit places reduction removed 2223 places
Iterating post reduction 0 with 2236 rules applied. Total rules applied 2236 place count 33567 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 2438 place count 33365 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 2640 place count 33365 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2642 place count 33363 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 2644 place count 33363 transition count 36265
Applied a total of 2644 rules in 917 ms. Remains 33363 /35803 variables (removed 2440) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2023-03-10 19:28:48] [INFO ] Computed 1924 place invariants in 1360 ms
[2023-03-10 19:28:50] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:28:51] [INFO ] Implicit Places using invariants in 4282 ms returned []
Implicit Place search using SMT only with invariants took 4284 ms to find 0 implicit places.
[2023-03-10 19:28:51] [INFO ] Invariant cache hit.
[2023-03-10 19:28:53] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:28:53] [INFO ] Dead Transitions using invariants and state equation in 2467 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/35803 places, 36265/36871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7671 ms. Remains : 33363/35803 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s31284)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 50750 steps with 25375 reset in 10001 ms.
Product exploration timeout after 49230 steps with 24615 reset in 10002 ms.
Computed a total of 33363 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33363 transition count 36265
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-11 finished in 75590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 35803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35803/35803 places, 36871/36871 transitions.
Graph (complete) has 53938 edges and 35803 vertex of which 18396 are kept as prefixes of interest. Removing 17407 places using SCC suffix rule.25 ms
Discarding 17407 places :
Also discarding 18790 output transitions
Drop transitions removed 18790 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 2223 places :
Implicit places reduction removed 2223 places
Drop transitions removed 13428 transitions
Trivial Post-agglo rules discarded 13428 transitions
Performed 13428 trivial Post agglomeration. Transition count delta: 13428
Iterating post reduction 0 with 15651 rules applied. Total rules applied 15652 place count 16072 transition count 4552
Reduce places removed 13428 places and 0 transitions.
Iterating post reduction 1 with 13428 rules applied. Total rules applied 29080 place count 2644 transition count 4552
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 29080 place count 2644 transition count 4450
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 29284 place count 2542 transition count 4450
Discarding 1117 places :
Symmetric choice reduction at 2 with 1117 rule applications. Total rules 30401 place count 1425 transition count 2335
Iterating global reduction 2 with 1117 rules applied. Total rules applied 31518 place count 1425 transition count 2335
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 31518 place count 1425 transition count 2334
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 31520 place count 1424 transition count 2334
Discarding 1005 places :
Symmetric choice reduction at 2 with 1005 rule applications. Total rules 32525 place count 419 transition count 1329
Iterating global reduction 2 with 1005 rules applied. Total rules applied 33530 place count 419 transition count 1329
Ensure Unique test removed 907 transitions
Reduce isomorphic transitions removed 907 transitions.
Iterating post reduction 2 with 907 rules applied. Total rules applied 34437 place count 419 transition count 422
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 34437 place count 419 transition count 421
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34439 place count 418 transition count 421
Applied a total of 34439 rules in 624 ms. Remains 418 /35803 variables (removed 35385) and now considering 421/36871 (removed 36450) transitions.
// Phase 1: matrix 421 rows 418 cols
[2023-03-10 19:30:02] [INFO ] Computed 102 place invariants in 5 ms
[2023-03-10 19:30:02] [INFO ] Implicit Places using invariants in 209 ms returned [101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 210 ms to find 101 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 317/35803 places, 421/36871 transitions.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 204 place count 317 transition count 217
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 1 with 204 rules applied. Total rules applied 408 place count 113 transition count 217
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 504 place count 17 transition count 25
Iterating global reduction 2 with 96 rules applied. Total rules applied 600 place count 17 transition count 25
Applied a total of 600 rules in 4 ms. Remains 17 /317 variables (removed 300) and now considering 25/421 (removed 396) transitions.
// Phase 1: matrix 25 rows 17 cols
[2023-03-10 19:30:02] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-10 19:30:02] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-10 19:30:02] [INFO ] Invariant cache hit.
[2023-03-10 19:30:02] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/35803 places, 25/36871 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 896 ms. Remains : 17/35803 places, 25/36871 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s16 s7), p1:(GT s8 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 203 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-14 finished in 1114 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 2 out of 35803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35803/35803 places, 36871/36871 transitions.
Reduce places removed 13 places and 0 transitions.
Discarding 2223 places :
Implicit places reduction removed 2223 places
Iterating post reduction 0 with 2236 rules applied. Total rules applied 2236 place count 33567 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 2438 place count 33365 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 2640 place count 33365 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2642 place count 33363 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 2644 place count 33363 transition count 36265
Applied a total of 2644 rules in 928 ms. Remains 33363 /35803 variables (removed 2440) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2023-03-10 19:30:04] [INFO ] Computed 1924 place invariants in 1367 ms
[2023-03-10 19:30:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:30:07] [INFO ] Implicit Places using invariants in 3897 ms returned []
Implicit Place search using SMT only with invariants took 3898 ms to find 0 implicit places.
[2023-03-10 19:30:07] [INFO ] Invariant cache hit.
[2023-03-10 19:30:09] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:30:09] [INFO ] Dead Transitions using invariants and state equation in 2468 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/35803 places, 36265/36871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7297 ms. Remains : 33363/35803 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-15 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 s10949 s26666)], 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 1 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-15 finished in 7508 ms.
All properties solved by simple procedures.
Total runtime 491722 ms.
ITS solved all properties within timeout

BK_STOP 1678476611527

--------------------
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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is 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 r167-tall-167838853100419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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