fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r233-tall-167856419500883
Last Updated
May 14, 2023

About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S24C12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5217.644 822497.00 1070179.00 2125.30 FTTFTF?TFFTFFFFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 9.6K Feb 26 03:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 03:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 03:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 03:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 03:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 03:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 20M 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 MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679650825093

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C12
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 09:40:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 09:40:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 09:40:27] [INFO ] Load time of PNML (sax parser for PT used): 709 ms
[2023-03-24 09:40:27] [INFO ] Transformed 20612 places.
[2023-03-24 09:40:27] [INFO ] Transformed 29875 transitions.
[2023-03-24 09:40:27] [INFO ] Parsed PT model containing 20612 places and 29875 transitions and 109334 arcs in 913 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 20612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20612/20612 places, 29875/29875 transitions.
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 20560 transition count 29875
Applied a total of 52 rules in 894 ms. Remains 20560 /20612 variables (removed 52) and now considering 29875/29875 (removed 0) transitions.
[2023-03-24 09:40:28] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2023-03-24 09:40:31] [INFO ] Computed 1301 place invariants in 2921 ms
[2023-03-24 09:40:33] [INFO ] Implicit Places using invariants in 5035 ms returned []
Implicit Place search using SMT only with invariants took 5095 ms to find 0 implicit places.
[2023-03-24 09:40:34] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-24 09:40:34] [INFO ] Invariant cache hit.
[2023-03-24 09:40:35] [INFO ] Dead Transitions using invariants and state equation in 1796 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20560/20612 places, 29875/29875 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7800 ms. Remains : 20560/20612 places, 29875/29875 transitions.
Support contains 40 out of 20560 places after structural reductions.
[2023-03-24 09:40:37] [INFO ] Flatten gal took : 1134 ms
[2023-03-24 09:40:38] [INFO ] Flatten gal took : 833 ms
[2023-03-24 09:40:39] [INFO ] Input system was already deterministic with 29875 transitions.
Incomplete random walk after 10000 steps, including 81 resets, run finished after 905 ms. (steps per millisecond=11 ) properties (out of 25) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) 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 19) 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 19) 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 19) seen :0
Running SMT prover for 19 properties.
[2023-03-24 09:40:41] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-24 09:40:41] [INFO ] Invariant cache hit.
[2023-03-24 09:40:48] [INFO ] After 7127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-24 09:40:55] [INFO ] [Nat]Absence check using 47 positive place invariants in 270 ms returned sat
[2023-03-24 09:40:56] [INFO ] [Nat]Absence check using 47 positive and 1254 generalized place invariants in 916 ms returned sat
[2023-03-24 09:41:13] [INFO ] After 13210ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :13
[2023-03-24 09:41:13] [INFO ] State equation strengthened by 9202 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
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-24 09:41:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 09:41:13] [INFO ] After 25204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:19
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 24 out of 20560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7185 transitions
Trivial Post-agglo rules discarded 7185 transitions
Performed 7185 trivial Post agglomeration. Transition count delta: 7185
Iterating post reduction 0 with 7185 rules applied. Total rules applied 7185 place count 20560 transition count 22690
Reduce places removed 7185 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 7193 rules applied. Total rules applied 14378 place count 13375 transition count 22682
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 14386 place count 13367 transition count 22682
Performed 599 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 599 Pre rules applied. Total rules applied 14386 place count 13367 transition count 22083
Deduced a syphon composed of 599 places in 26 ms
Reduce places removed 599 places and 0 transitions.
Iterating global reduction 3 with 1198 rules applied. Total rules applied 15584 place count 12768 transition count 22083
Discarding 6585 places :
Symmetric choice reduction at 3 with 6585 rule applications. Total rules 22169 place count 6183 transition count 15498
Iterating global reduction 3 with 6585 rules applied. Total rules applied 28754 place count 6183 transition count 15498
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 28754 place count 6183 transition count 15483
Deduced a syphon composed of 15 places in 12 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 28784 place count 6168 transition count 15483
Discarding 535 places :
Symmetric choice reduction at 3 with 535 rule applications. Total rules 29319 place count 5633 transition count 9063
Iterating global reduction 3 with 535 rules applied. Total rules applied 29854 place count 5633 transition count 9063
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 13 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 29904 place count 5608 transition count 9038
Free-agglomeration rule (complex) applied 348 times.
Iterating global reduction 3 with 348 rules applied. Total rules applied 30252 place count 5608 transition count 14212
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 3 with 348 rules applied. Total rules applied 30600 place count 5260 transition count 14212
Partial Free-agglomeration rule applied 225 times.
Drop transitions removed 225 transitions
Iterating global reduction 4 with 225 rules applied. Total rules applied 30825 place count 5260 transition count 14212
Applied a total of 30825 rules in 6616 ms. Remains 5260 /20560 variables (removed 15300) and now considering 14212/29875 (removed 15663) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6619 ms. Remains : 5260/20560 places, 14212/29875 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 851 ms. (steps per millisecond=11 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-24 09:41:22] [INFO ] Flow matrix only has 13326 transitions (discarded 886 similar events)
// Phase 1: matrix 13326 rows 5260 cols
[2023-03-24 09:41:23] [INFO ] Computed 1301 place invariants in 450 ms
[2023-03-24 09:41:24] [INFO ] After 1356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-24 09:41:26] [INFO ] [Nat]Absence check using 49 positive place invariants in 111 ms returned sat
[2023-03-24 09:41:26] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 355 ms returned sat
[2023-03-24 09:41:42] [INFO ] After 14612ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-24 09:41:42] [INFO ] State equation strengthened by 8839 read => feed constraints.
[2023-03-24 09:41:49] [INFO ] After 7650ms SMT Verify possible using 8839 Read/Feed constraints in natural domain returned unsat :1 sat :10
[2023-03-24 09:41:49] [INFO ] After 7653ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-24 09:41:49] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 125 ms.
Support contains 18 out of 5260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5260/5260 places, 14212/14212 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 5260 transition count 14209
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 5257 transition count 14209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 5257 transition count 14208
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 5256 transition count 14208
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 5256 transition count 14207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 5255 transition count 14207
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 12 place count 5253 transition count 14205
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 5253 transition count 14205
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 5253 transition count 14205
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 18 place count 5251 transition count 14203
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 5251 transition count 14203
Applied a total of 20 rules in 3441 ms. Remains 5251 /5260 variables (removed 9) and now considering 14203/14212 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3441 ms. Remains : 5251/5260 places, 14203/14212 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 809 ms. (steps per millisecond=12 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 35591 steps, run timeout after 6001 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 35591 steps, saw 16277 distinct states, run finished after 6003 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-24 09:42:01] [INFO ] Flow matrix only has 13317 transitions (discarded 886 similar events)
// Phase 1: matrix 13317 rows 5251 cols
[2023-03-24 09:42:01] [INFO ] Computed 1301 place invariants in 396 ms
[2023-03-24 09:42:03] [INFO ] [Real]Absence check using 49 positive place invariants in 74 ms returned sat
[2023-03-24 09:42:03] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 342 ms returned sat
[2023-03-24 09:42:09] [INFO ] After 5933ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:10
[2023-03-24 09:42:09] [INFO ] State equation strengthened by 8839 read => feed constraints.
[2023-03-24 09:42:14] [INFO ] After 5089ms SMT Verify possible using 8839 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-24 09:42:14] [INFO ] After 12792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-24 09:42:15] [INFO ] [Nat]Absence check using 49 positive place invariants in 73 ms returned sat
[2023-03-24 09:42:16] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 346 ms returned sat
[2023-03-24 09:42:34] [INFO ] After 16804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-24 09:42:39] [INFO ] After 5777ms SMT Verify possible using 8839 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-24 09:42:39] [INFO ] After 5779ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-24 09:42:39] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 82 ms.
Support contains 18 out of 5251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5251/5251 places, 14203/14203 transitions.
Applied a total of 0 rules in 825 ms. Remains 5251 /5251 variables (removed 0) and now considering 14203/14203 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 825 ms. Remains : 5251/5251 places, 14203/14203 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5251/5251 places, 14203/14203 transitions.
Applied a total of 0 rules in 834 ms. Remains 5251 /5251 variables (removed 0) and now considering 14203/14203 (removed 0) transitions.
[2023-03-24 09:42:41] [INFO ] Flow matrix only has 13317 transitions (discarded 886 similar events)
[2023-03-24 09:42:41] [INFO ] Invariant cache hit.
[2023-03-24 09:42:47] [INFO ] Implicit Places using invariants in 6245 ms returned []
Implicit Place search using SMT only with invariants took 6249 ms to find 0 implicit places.
[2023-03-24 09:42:47] [INFO ] Flow matrix only has 13317 transitions (discarded 886 similar events)
[2023-03-24 09:42:47] [INFO ] Invariant cache hit.
[2023-03-24 09:42:56] [INFO ] Dead Transitions using invariants and state equation in 9092 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16179 ms. Remains : 5251/5251 places, 14203/14203 transitions.
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17936 stabilizing places and 24674 stable transitions
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((F(p0)&&X(X(p1)))))'
Support contains 4 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 595 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2023-03-24 09:42:57] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2023-03-24 09:43:00] [INFO ] Computed 1301 place invariants in 2748 ms
[2023-03-24 09:43:02] [INFO ] Implicit Places using invariants in 4376 ms returned []
Implicit Place search using SMT only with invariants took 4381 ms to find 0 implicit places.
[2023-03-24 09:43:02] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-24 09:43:02] [INFO ] Invariant cache hit.
[2023-03-24 09:43:03] [INFO ] Dead Transitions using invariants and state equation in 1572 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6556 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LEQ 1 s15967) (LEQ s588 s20249)), p1:(LEQ 1 s5835)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 11 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-00 finished in 7107 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||X(!p1))))))'
Support contains 4 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7198 transitions
Trivial Post-agglo rules discarded 7198 transitions
Performed 7198 trivial Post agglomeration. Transition count delta: 7198
Iterating post reduction 0 with 7198 rules applied. Total rules applied 7198 place count 20560 transition count 22677
Reduce places removed 7198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7199 rules applied. Total rules applied 14397 place count 13362 transition count 22676
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14398 place count 13361 transition count 22676
Performed 599 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 599 Pre rules applied. Total rules applied 14398 place count 13361 transition count 22077
Deduced a syphon composed of 599 places in 20 ms
Reduce places removed 599 places and 0 transitions.
Iterating global reduction 3 with 1198 rules applied. Total rules applied 15596 place count 12762 transition count 22077
Discarding 6598 places :
Symmetric choice reduction at 3 with 6598 rule applications. Total rules 22194 place count 6164 transition count 15479
Iterating global reduction 3 with 6598 rules applied. Total rules applied 28792 place count 6164 transition count 15479
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 28792 place count 6164 transition count 15457
Deduced a syphon composed of 22 places in 11 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 28836 place count 6142 transition count 15457
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 29384 place count 5594 transition count 8881
Iterating global reduction 3 with 548 rules applied. Total rules applied 29932 place count 5594 transition count 8881
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 29982 place count 5569 transition count 8856
Applied a total of 29982 rules in 3623 ms. Remains 5569 /20560 variables (removed 14991) and now considering 8856/29875 (removed 21019) transitions.
[2023-03-24 09:43:07] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
// Phase 1: matrix 8256 rows 5569 cols
[2023-03-24 09:43:08] [INFO ] Computed 1301 place invariants in 260 ms
[2023-03-24 09:43:12] [INFO ] Implicit Places using invariants in 4539 ms returned []
[2023-03-24 09:43:12] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2023-03-24 09:43:12] [INFO ] Invariant cache hit.
[2023-03-24 09:43:16] [INFO ] Implicit Places using invariants and state equation in 4271 ms returned []
Implicit Place search using SMT with State Equation took 8819 ms to find 0 implicit places.
[2023-03-24 09:43:17] [INFO ] Redundant transitions in 1198 ms returned []
[2023-03-24 09:43:17] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2023-03-24 09:43:17] [INFO ] Invariant cache hit.
[2023-03-24 09:43:23] [INFO ] Dead Transitions using invariants and state equation in 5307 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5569/20560 places, 8856/29875 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18964 ms. Remains : 5569/20560 places, 8856/29875 transitions.
Stuttering acceptance computed with spot in 97 ms :[false, false]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s2475 s561), p1:(GT s4933 s1107)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1151 reset in 1351 ms.
Product exploration explored 100000 steps with 1151 reset in 1213 ms.
Computed a total of 2970 stabilizing places and 3680 stable transitions
Computed a total of 2970 stabilizing places and 3680 stable transitions
Detected a total of 2970/5569 stabilizing places and 3680/8856 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (OR (G p1) (G (NOT p1))))
Knowledge based reduction with 9 factoid took 411 ms. Reduced automaton from 2 states, 8 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-02 finished in 22114 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((p0||X(p0))))'
Support contains 2 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 581 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2023-03-24 09:43:26] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2023-03-24 09:43:29] [INFO ] Computed 1301 place invariants in 2809 ms
[2023-03-24 09:43:31] [INFO ] Implicit Places using invariants in 4400 ms returned []
Implicit Place search using SMT only with invariants took 4414 ms to find 0 implicit places.
[2023-03-24 09:43:31] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-24 09:43:31] [INFO ] Invariant cache hit.
[2023-03-24 09:43:33] [INFO ] Dead Transitions using invariants and state equation in 1832 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6830 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=1, aps=[p0:(GT s9936 s18835)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-05 finished in 7042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&X((p1 U (!p2||G(p1)))))))))'
Support contains 3 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 553 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2023-03-24 09:43:34] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-24 09:43:34] [INFO ] Invariant cache hit.
[2023-03-24 09:43:35] [INFO ] Implicit Places using invariants in 1813 ms returned []
Implicit Place search using SMT only with invariants took 1816 ms to find 0 implicit places.
[2023-03-24 09:43:35] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-24 09:43:35] [INFO ] Invariant cache hit.
[2023-03-24 09:43:37] [INFO ] Dead Transitions using invariants and state equation in 1581 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3956 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(GT 1 s2460), p0:(GT s2204 s12692), p2:(OR (LEQ 1 s2460) (LEQ s2204 s12692))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 811 reset in 1860 ms.
Product exploration explored 100000 steps with 812 reset in 1846 ms.
Computed a total of 17936 stabilizing places and 24674 stable transitions
Computed a total of 17936 stabilizing places and 24674 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 754 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 80 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 8942 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8942 steps, saw 4439 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-24 09:43:46] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-24 09:43:46] [INFO ] Invariant cache hit.
[2023-03-24 09:43:50] [INFO ] [Real]Absence check using 47 positive place invariants in 238 ms returned sat
[2023-03-24 09:43:51] [INFO ] [Real]Absence check using 47 positive and 1254 generalized place invariants in 789 ms returned sat
[2023-03-24 09:44:11] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-24 09:44:15] [INFO ] [Nat]Absence check using 47 positive place invariants in 240 ms returned sat
[2023-03-24 09:44:16] [INFO ] [Nat]Absence check using 47 positive and 1254 generalized place invariants in 758 ms returned sat
[2023-03-24 09:44:36] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 20560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7199 transitions
Trivial Post-agglo rules discarded 7199 transitions
Performed 7199 trivial Post agglomeration. Transition count delta: 7199
Iterating post reduction 0 with 7199 rules applied. Total rules applied 7199 place count 20560 transition count 22676
Reduce places removed 7199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14399 place count 13361 transition count 22675
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 600 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22075
Deduced a syphon composed of 600 places in 20 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 3 with 1200 rules applied. Total rules applied 15600 place count 12760 transition count 22075
Discarding 6599 places :
Symmetric choice reduction at 3 with 6599 rule applications. Total rules 22199 place count 6161 transition count 15476
Iterating global reduction 3 with 6599 rules applied. Total rules applied 28798 place count 6161 transition count 15476
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 28798 place count 6161 transition count 15453
Deduced a syphon composed of 23 places in 12 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 28844 place count 6138 transition count 15453
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 29393 place count 5589 transition count 8865
Iterating global reduction 3 with 549 rules applied. Total rules applied 29942 place count 5589 transition count 8865
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 29992 place count 5564 transition count 8840
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 3 with 337 rules applied. Total rules applied 30329 place count 5564 transition count 14542
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 3 with 337 rules applied. Total rules applied 30666 place count 5227 transition count 14542
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 30691 place count 5227 transition count 14542
Applied a total of 30691 rules in 5186 ms. Remains 5227 /20560 variables (removed 15333) and now considering 14542/29875 (removed 15333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5188 ms. Remains : 5227/20560 places, 14542/29875 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 869 ms. (steps per millisecond=11 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 18769 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18769 steps, saw 8887 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-24 09:44:46] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2023-03-24 09:44:46] [INFO ] Computed 1301 place invariants in 385 ms
[2023-03-24 09:44:47] [INFO ] [Real]Absence check using 49 positive place invariants in 80 ms returned sat
[2023-03-24 09:44:48] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 336 ms returned sat
[2023-03-24 09:44:58] [INFO ] After 11229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-24 09:44:59] [INFO ] [Nat]Absence check using 49 positive place invariants in 71 ms returned sat
[2023-03-24 09:44:59] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 345 ms returned sat
[2023-03-24 09:45:10] [INFO ] After 10527ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-24 09:45:10] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2023-03-24 09:45:23] [INFO ] After 12722ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-24 09:45:23] [INFO ] After 12724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-24 09:45:23] [INFO ] After 25060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 5227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 833 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 834 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 798 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
[2023-03-24 09:45:24] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-24 09:45:24] [INFO ] Invariant cache hit.
[2023-03-24 09:45:29] [INFO ] Implicit Places using invariants in 5041 ms returned []
Implicit Place search using SMT only with invariants took 5045 ms to find 0 implicit places.
[2023-03-24 09:45:29] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-24 09:45:29] [INFO ] Invariant cache hit.
[2023-03-24 09:45:38] [INFO ] Dead Transitions using invariants and state equation in 8837 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14688 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 991 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Support contains 3 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 559 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2023-03-24 09:45:40] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2023-03-24 09:45:43] [INFO ] Computed 1301 place invariants in 2729 ms
[2023-03-24 09:45:44] [INFO ] Implicit Places using invariants in 4310 ms returned []
Implicit Place search using SMT only with invariants took 4317 ms to find 0 implicit places.
[2023-03-24 09:45:44] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-24 09:45:44] [INFO ] Invariant cache hit.
[2023-03-24 09:45:46] [INFO ] Dead Transitions using invariants and state equation in 1568 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6467 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Computed a total of 17936 stabilizing places and 24674 stable transitions
Computed a total of 17936 stabilizing places and 24674 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND p1 p2)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (AND p1 p2))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 518 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 81 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 8869 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8869 steps, saw 4400 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-24 09:45:51] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-24 09:45:51] [INFO ] Invariant cache hit.
[2023-03-24 09:45:54] [INFO ] After 3578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-24 09:45:58] [INFO ] [Nat]Absence check using 47 positive place invariants in 241 ms returned sat
[2023-03-24 09:45:59] [INFO ] [Nat]Absence check using 47 positive and 1254 generalized place invariants in 777 ms returned sat
[2023-03-24 09:46:19] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 20560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7199 transitions
Trivial Post-agglo rules discarded 7199 transitions
Performed 7199 trivial Post agglomeration. Transition count delta: 7199
Iterating post reduction 0 with 7199 rules applied. Total rules applied 7199 place count 20560 transition count 22676
Reduce places removed 7199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14399 place count 13361 transition count 22675
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 600 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22075
Deduced a syphon composed of 600 places in 20 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 3 with 1200 rules applied. Total rules applied 15600 place count 12760 transition count 22075
Discarding 6599 places :
Symmetric choice reduction at 3 with 6599 rule applications. Total rules 22199 place count 6161 transition count 15476
Iterating global reduction 3 with 6599 rules applied. Total rules applied 28798 place count 6161 transition count 15476
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 28798 place count 6161 transition count 15453
Deduced a syphon composed of 23 places in 11 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 28844 place count 6138 transition count 15453
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 29393 place count 5589 transition count 8865
Iterating global reduction 3 with 549 rules applied. Total rules applied 29942 place count 5589 transition count 8865
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 7 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 29992 place count 5564 transition count 8840
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 3 with 337 rules applied. Total rules applied 30329 place count 5564 transition count 14542
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 3 with 337 rules applied. Total rules applied 30666 place count 5227 transition count 14542
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 30691 place count 5227 transition count 14542
Applied a total of 30691 rules in 5114 ms. Remains 5227 /20560 variables (removed 15333) and now considering 14542/29875 (removed 15333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5114 ms. Remains : 5227/20560 places, 14542/29875 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 823 ms. (steps per millisecond=12 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 19017 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19017 steps, saw 8997 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-24 09:46:29] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2023-03-24 09:46:29] [INFO ] Computed 1301 place invariants in 393 ms
[2023-03-24 09:46:30] [INFO ] [Real]Absence check using 49 positive place invariants in 71 ms returned sat
[2023-03-24 09:46:30] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 334 ms returned sat
[2023-03-24 09:46:38] [INFO ] After 7304ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-24 09:46:38] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2023-03-24 09:46:40] [INFO ] After 2249ms SMT Verify possible using 9202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-24 09:46:40] [INFO ] After 10903ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-24 09:46:41] [INFO ] [Nat]Absence check using 49 positive place invariants in 68 ms returned sat
[2023-03-24 09:46:41] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 336 ms returned sat
[2023-03-24 09:46:51] [INFO ] After 9264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-24 09:47:05] [INFO ] After 14266ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-24 09:47:05] [INFO ] After 14267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-24 09:47:05] [INFO ] After 25063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 5227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 820 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 820 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 802 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
[2023-03-24 09:47:07] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-24 09:47:07] [INFO ] Invariant cache hit.
[2023-03-24 09:47:12] [INFO ] Implicit Places using invariants in 5020 ms returned []
Implicit Place search using SMT only with invariants took 5029 ms to find 0 implicit places.
[2023-03-24 09:47:12] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-24 09:47:12] [INFO ] Invariant cache hit.
[2023-03-24 09:47:20] [INFO ] Dead Transitions using invariants and state equation in 8220 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14064 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Graph (trivial) has 3625 edges and 5227 vertex of which 25 / 5227 are part of one of the 1 SCC in 9 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 55758 edges and 5203 vertex of which 5181 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.8 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t12373.t14833 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4795 transition count 12813
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 1 with 722 rules applied. Total rules applied 967 place count 4553 transition count 12333
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 2 with 678 rules applied. Total rules applied 1645 place count 4313 transition count 11895
Ensure Unique test removed 40 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 199 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 3 with 635 rules applied. Total rules applied 2280 place count 4074 transition count 11499
Ensure Unique test removed 2 places
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 161 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 4 with 556 rules applied. Total rules applied 2836 place count 3875 transition count 11142
Ensure Unique test removed 36 places
Reduce places removed 196 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 158 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 5 with 514 rules applied. Total rules applied 3350 place count 3679 transition count 10824
Ensure Unique test removed 2 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 158 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 6 with 444 rules applied. Total rules applied 3794 place count 3519 transition count 10540
Ensure Unique test removed 32 places
Reduce places removed 158 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 7 with 408 rules applied. Total rules applied 4202 place count 3361 transition count 10290
Ensure Unique test removed 2 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 124 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 8 with 346 rules applied. Total rules applied 4548 place count 3235 transition count 10070
Ensure Unique test removed 28 places
Reduce places removed 124 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 9 with 314 rules applied. Total rules applied 4862 place count 3111 transition count 9880
Ensure Unique test removed 2 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 23 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 10 with 261 rules applied. Total rules applied 5123 place count 3015 transition count 9715
Ensure Unique test removed 23 places
Reduce places removed 94 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 11 with 234 rules applied. Total rules applied 5357 place count 2921 transition count 9575
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 12 with 189 rules applied. Total rules applied 5546 place count 2850 transition count 9457
Ensure Unique test removed 20 places
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 13 with 165 rules applied. Total rules applied 5711 place count 2781 transition count 9361
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 128 rules applied. Total rules applied 5839 place count 2732 transition count 9282
Ensure Unique test removed 15 places
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 109 rules applied. Total rules applied 5948 place count 2685 transition count 9220
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6028 place count 2653 transition count 9172
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6092 place count 2623 transition count 9138
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6134 place count 2605 transition count 9114
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6164 place count 2589 transition count 9100
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6180 place count 2581 transition count 9092
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 21 with 10 rules applied. Total rules applied 6190 place count 2575 transition count 9088
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 6196 place count 2571 transition count 9086
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 600 Pre rules applied. Total rules applied 6196 place count 2571 transition count 8486
Deduced a syphon composed of 600 places in 2 ms
Ensure Unique test removed 599 places
Reduce places removed 1199 places and 0 transitions.
Iterating global reduction 23 with 1799 rules applied. Total rules applied 7995 place count 1372 transition count 8486
Discarding 599 places :
Symmetric choice reduction at 23 with 599 rule applications. Total rules 8594 place count 773 transition count 7887
Iterating global reduction 23 with 599 rules applied. Total rules applied 9193 place count 773 transition count 7887
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9193 place count 773 transition count 7886
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9195 place count 772 transition count 7886
Discarding 538 places :
Symmetric choice reduction at 23 with 538 rule applications. Total rules 9733 place count 234 transition count 1430
Iterating global reduction 23 with 538 rules applied. Total rules applied 10271 place count 234 transition count 1430
Ensure Unique test removed 538 transitions
Reduce isomorphic transitions removed 538 transitions.
Iterating post reduction 23 with 538 rules applied. Total rules applied 10809 place count 234 transition count 892
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 24 with 77 rules applied. Total rules applied 10886 place count 195 transition count 854
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 24 with 13 rules applied. Total rules applied 10899 place count 195 transition count 841
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 25 with 2 rules applied. Total rules applied 10901 place count 195 transition count 839
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 25 with 26 rules applied. Total rules applied 10927 place count 195 transition count 813
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 25 with 26 rules applied. Total rules applied 10953 place count 169 transition count 813
Discarding 22 places :
Symmetric choice reduction at 26 with 22 rule applications. Total rules 10975 place count 147 transition count 549
Ensure Unique test removed 10 places
Iterating global reduction 26 with 32 rules applied. Total rules applied 11007 place count 137 transition count 549
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 26 with 22 rules applied. Total rules applied 11029 place count 137 transition count 527
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 11039 place count 127 transition count 407
Iterating global reduction 27 with 10 rules applied. Total rules applied 11049 place count 127 transition count 407
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 11059 place count 117 transition count 397
Iterating global reduction 27 with 10 rules applied. Total rules applied 11069 place count 117 transition count 397
Applied a total of 11069 rules in 9944 ms. Remains 117 /5227 variables (removed 5110) and now considering 397/14542 (removed 14145) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 397 rows 117 cols
[2023-03-24 09:47:30] [INFO ] Computed 44 place invariants in 5 ms
[2023-03-24 09:47:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-24 09:47:30] [INFO ] [Real]Absence check using 4 positive and 40 generalized place invariants in 7 ms returned sat
[2023-03-24 09:47:30] [INFO ] After 82ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-24 09:47:30] [INFO ] After 99ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-24 09:47:30] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:4
[2023-03-24 09:47:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-24 09:47:30] [INFO ] [Nat]Absence check using 4 positive and 40 generalized place invariants in 7 ms returned sat
[2023-03-24 09:47:30] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-24 09:47:31] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-24 09:47:31] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND p1 p2)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (AND p1 p2))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 674 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 811 reset in 1738 ms.
Product exploration explored 100000 steps with 812 reset in 1761 ms.
Support contains 3 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 1365 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2023-03-24 09:47:37] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2023-03-24 09:47:39] [INFO ] Computed 1301 place invariants in 2721 ms
[2023-03-24 09:47:41] [INFO ] Implicit Places using invariants in 4576 ms returned []
Implicit Place search using SMT only with invariants took 4577 ms to find 0 implicit places.
[2023-03-24 09:47:41] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-24 09:47:41] [INFO ] Invariant cache hit.
[2023-03-24 09:47:43] [INFO ] Dead Transitions using invariants and state equation in 1554 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7510 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06 finished in 251378 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) U p1)))'
Support contains 4 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 714 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2023-03-24 09:47:45] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-24 09:47:45] [INFO ] Invariant cache hit.
[2023-03-24 09:47:47] [INFO ] Implicit Places using invariants in 1793 ms returned []
Implicit Place search using SMT only with invariants took 1795 ms to find 0 implicit places.
[2023-03-24 09:47:47] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-24 09:47:47] [INFO ] Invariant cache hit.
[2023-03-24 09:47:48] [INFO ] Dead Transitions using invariants and state equation in 1591 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4112 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s14986 s4189), p0:(GT s16941 s12258)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 86350 steps with 43175 reset in 10001 ms.
Product exploration timeout after 90270 steps with 45135 reset in 10001 ms.
Computed a total of 17936 stabilizing places and 24674 stable transitions
Computed a total of 17936 stabilizing places and 24674 stable transitions
Detected a total of 17936/20560 stabilizing places and 24674/29875 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 9 factoid took 137 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-07 finished in 24567 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(p1))) U X(p2))))'
Support contains 6 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 634 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2023-03-24 09:48:10] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-24 09:48:10] [INFO ] Invariant cache hit.
[2023-03-24 09:48:11] [INFO ] Implicit Places using invariants in 1629 ms returned []
Implicit Place search using SMT only with invariants took 1634 ms to find 0 implicit places.
[2023-03-24 09:48:11] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-24 09:48:11] [INFO ] Invariant cache hit.
[2023-03-24 09:48:13] [INFO ] Dead Transitions using invariants and state equation in 1563 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3841 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) p0), (OR (NOT p1) (NOT p2) p0), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(LEQ s11166 s18217), p1:(LEQ s160 s7809), p2:(GT s1740 s7308)], 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-09 finished in 4134 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 4 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 633 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2023-03-24 09:48:14] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-24 09:48:14] [INFO ] Invariant cache hit.
[2023-03-24 09:48:15] [INFO ] Implicit Places using invariants in 1535 ms returned []
Implicit Place search using SMT only with invariants took 1545 ms to find 0 implicit places.
[2023-03-24 09:48:15] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-24 09:48:15] [INFO ] Invariant cache hit.
[2023-03-24 09:48:17] [INFO ] Dead Transitions using invariants and state equation in 1608 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3798 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 1 s6630) (LEQ 3 s10908) (AND (GT s3530 s577) (GT 3 s10908)))], 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 MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-12 finished in 3968 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 2 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7199 transitions
Trivial Post-agglo rules discarded 7199 transitions
Performed 7199 trivial Post agglomeration. Transition count delta: 7199
Iterating post reduction 0 with 7199 rules applied. Total rules applied 7199 place count 20560 transition count 22676
Reduce places removed 7199 places and 0 transitions.
Iterating post reduction 1 with 7199 rules applied. Total rules applied 14398 place count 13361 transition count 22676
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14398 place count 13361 transition count 22076
Deduced a syphon composed of 600 places in 20 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15598 place count 12761 transition count 22076
Discarding 6599 places :
Symmetric choice reduction at 2 with 6599 rule applications. Total rules 22197 place count 6162 transition count 15477
Iterating global reduction 2 with 6599 rules applied. Total rules applied 28796 place count 6162 transition count 15477
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 28796 place count 6162 transition count 15454
Deduced a syphon composed of 23 places in 10 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 28842 place count 6139 transition count 15454
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 29391 place count 5590 transition count 8866
Iterating global reduction 2 with 549 rules applied. Total rules applied 29940 place count 5590 transition count 8866
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 29990 place count 5565 transition count 8841
Applied a total of 29990 rules in 3674 ms. Remains 5565 /20560 variables (removed 14995) and now considering 8841/29875 (removed 21034) transitions.
[2023-03-24 09:48:21] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2023-03-24 09:48:21] [INFO ] Computed 1301 place invariants in 275 ms
[2023-03-24 09:48:25] [INFO ] Implicit Places using invariants in 4522 ms returned []
[2023-03-24 09:48:25] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
[2023-03-24 09:48:25] [INFO ] Invariant cache hit.
[2023-03-24 09:48:31] [INFO ] Implicit Places using invariants and state equation in 6175 ms returned []
Implicit Place search using SMT with State Equation took 10701 ms to find 0 implicit places.
[2023-03-24 09:48:33] [INFO ] Redundant transitions in 1340 ms returned []
[2023-03-24 09:48:33] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
[2023-03-24 09:48:33] [INFO ] Invariant cache hit.
[2023-03-24 09:48:39] [INFO ] Dead Transitions using invariants and state equation in 5915 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5565/20560 places, 8841/29875 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21653 ms. Remains : 5565/20560 places, 8841/29875 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s4854 s344)], 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]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-14 finished in 21738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&X((p1 U (!p2||G(p1)))))))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2)]
Support contains 3 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7199 transitions
Trivial Post-agglo rules discarded 7199 transitions
Performed 7199 trivial Post agglomeration. Transition count delta: 7199
Iterating post reduction 0 with 7199 rules applied. Total rules applied 7199 place count 20560 transition count 22676
Reduce places removed 7199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14399 place count 13361 transition count 22675
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 600 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22075
Deduced a syphon composed of 600 places in 27 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 3 with 1200 rules applied. Total rules applied 15600 place count 12760 transition count 22075
Discarding 6599 places :
Symmetric choice reduction at 3 with 6599 rule applications. Total rules 22199 place count 6161 transition count 15476
Iterating global reduction 3 with 6599 rules applied. Total rules applied 28798 place count 6161 transition count 15476
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 28798 place count 6161 transition count 15453
Deduced a syphon composed of 23 places in 12 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 28844 place count 6138 transition count 15453
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 29393 place count 5589 transition count 8865
Iterating global reduction 3 with 549 rules applied. Total rules applied 29942 place count 5589 transition count 8865
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 7 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 29992 place count 5564 transition count 8840
Applied a total of 29992 rules in 3719 ms. Remains 5564 /20560 variables (removed 14996) and now considering 8840/29875 (removed 21035) transitions.
[2023-03-24 09:48:43] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
// Phase 1: matrix 8240 rows 5564 cols
[2023-03-24 09:48:43] [INFO ] Computed 1301 place invariants in 275 ms
[2023-03-24 09:48:47] [INFO ] Implicit Places using invariants in 4529 ms returned []
[2023-03-24 09:48:47] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
[2023-03-24 09:48:47] [INFO ] Invariant cache hit.
[2023-03-24 09:48:51] [INFO ] Implicit Places using invariants and state equation in 4254 ms returned []
Implicit Place search using SMT with State Equation took 8788 ms to find 0 implicit places.
[2023-03-24 09:48:51] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
[2023-03-24 09:48:51] [INFO ] Invariant cache hit.
[2023-03-24 09:48:57] [INFO ] Dead Transitions using invariants and state equation in 5358 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 5564/20560 places, 8840/29875 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 17880 ms. Remains : 5564/20560 places, 8840/29875 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(GT 1 s911), p0:(GT s792 s2881), p2:(OR (LEQ 1 s911) (LEQ s792 s2881))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1155 reset in 1221 ms.
Product exploration explored 100000 steps with 1154 reset in 1223 ms.
Computed a total of 2965 stabilizing places and 3664 stable transitions
Computed a total of 2965 stabilizing places and 3664 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 783 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 115 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 21577 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21577 steps, saw 10357 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-24 09:49:04] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
[2023-03-24 09:49:04] [INFO ] Invariant cache hit.
[2023-03-24 09:49:05] [INFO ] [Real]Absence check using 49 positive place invariants in 72 ms returned sat
[2023-03-24 09:49:06] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 368 ms returned sat
[2023-03-24 09:49:12] [INFO ] After 5699ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:7
[2023-03-24 09:49:12] [INFO ] State equation strengthened by 3163 read => feed constraints.
[2023-03-24 09:49:12] [INFO ] After 909ms SMT Verify possible using 3163 Read/Feed constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-24 09:49:12] [INFO ] After 8254ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-24 09:49:14] [INFO ] [Nat]Absence check using 49 positive place invariants in 71 ms returned sat
[2023-03-24 09:49:14] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 368 ms returned sat
[2023-03-24 09:49:22] [INFO ] After 7147ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2023-03-24 09:49:30] [INFO ] After 8492ms SMT Verify possible using 3163 Read/Feed constraints in natural domain returned unsat :3 sat :6
[2023-03-24 09:49:37] [INFO ] Deduced a trap composed of 911 places in 6363 ms of which 18 ms to minimize.
[2023-03-24 09:49:43] [INFO ] Deduced a trap composed of 390 places in 6455 ms of which 9 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-24 09:49:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 09:49:43] [INFO ] After 30871ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:8
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 5564 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5564/5564 places, 8840/8840 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5564 transition count 14542
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5227 transition count 14542
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 699 place count 5227 transition count 14542
Applied a total of 699 rules in 2977 ms. Remains 5227 /5564 variables (removed 337) and now considering 14542/8840 (removed -5702) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2981 ms. Remains : 5227/5564 places, 14542/8840 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 753 ms. (steps per millisecond=13 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 19360 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19360 steps, saw 9162 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-24 09:49:51] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2023-03-24 09:49:51] [INFO ] Computed 1301 place invariants in 426 ms
[2023-03-24 09:49:52] [INFO ] [Real]Absence check using 49 positive place invariants in 83 ms returned sat
[2023-03-24 09:49:53] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 410 ms returned sat
[2023-03-24 09:50:05] [INFO ] After 14026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-24 09:50:06] [INFO ] [Nat]Absence check using 49 positive place invariants in 83 ms returned sat
[2023-03-24 09:50:07] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 410 ms returned sat
[2023-03-24 09:50:20] [INFO ] After 13188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-24 09:50:20] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2023-03-24 09:50:30] [INFO ] After 9861ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-24 09:50:30] [INFO ] After 9862ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-24 09:50:30] [INFO ] After 25070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 5227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 853 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 854 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 841 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
[2023-03-24 09:50:32] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-24 09:50:32] [INFO ] Invariant cache hit.
[2023-03-24 09:50:38] [INFO ] Implicit Places using invariants in 5469 ms returned []
Implicit Place search using SMT only with invariants took 5469 ms to find 0 implicit places.
[2023-03-24 09:50:38] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-24 09:50:38] [INFO ] Invariant cache hit.
[2023-03-24 09:50:46] [INFO ] Dead Transitions using invariants and state equation in 8020 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14333 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 817 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Support contains 3 out of 5564 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5564/5564 places, 8840/8840 transitions.
Applied a total of 0 rules in 441 ms. Remains 5564 /5564 variables (removed 0) and now considering 8840/8840 (removed 0) transitions.
[2023-03-24 09:50:47] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
// Phase 1: matrix 8240 rows 5564 cols
[2023-03-24 09:50:47] [INFO ] Computed 1301 place invariants in 244 ms
[2023-03-24 09:50:52] [INFO ] Implicit Places using invariants in 4507 ms returned []
[2023-03-24 09:50:52] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
[2023-03-24 09:50:52] [INFO ] Invariant cache hit.
[2023-03-24 09:50:56] [INFO ] Implicit Places using invariants and state equation in 4404 ms returned []
Implicit Place search using SMT with State Equation took 8918 ms to find 0 implicit places.
[2023-03-24 09:50:56] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
[2023-03-24 09:50:56] [INFO ] Invariant cache hit.
[2023-03-24 09:51:01] [INFO ] Dead Transitions using invariants and state equation in 5128 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14489 ms. Remains : 5564/5564 places, 8840/8840 transitions.
Computed a total of 2965 stabilizing places and 3664 stable transitions
Computed a total of 2965 stabilizing places and 3664 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND p1 p2)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (AND p1 p2))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 547 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 115 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 22016 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22016 steps, saw 10556 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-24 09:51:05] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
[2023-03-24 09:51:05] [INFO ] Invariant cache hit.
[2023-03-24 09:51:06] [INFO ] After 915ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-24 09:51:07] [INFO ] [Nat]Absence check using 49 positive place invariants in 79 ms returned sat
[2023-03-24 09:51:08] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 363 ms returned sat
[2023-03-24 09:51:14] [INFO ] After 6441ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-24 09:51:14] [INFO ] State equation strengthened by 3163 read => feed constraints.
[2023-03-24 09:51:21] [INFO ] After 6288ms SMT Verify possible using 3163 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-24 09:51:27] [INFO ] Deduced a trap composed of 1131 places in 6323 ms of which 6 ms to minimize.
[2023-03-24 09:51:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6843 ms
[2023-03-24 09:51:30] [INFO ] After 15419ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 1468 ms.
[2023-03-24 09:51:31] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 5564 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5564/5564 places, 8840/8840 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5564 transition count 14542
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5227 transition count 14542
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 699 place count 5227 transition count 14542
Applied a total of 699 rules in 2423 ms. Remains 5227 /5564 variables (removed 337) and now considering 14542/8840 (removed -5702) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2424 ms. Remains : 5227/5564 places, 14542/8840 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 739 ms. (steps per millisecond=13 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 18430 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18430 steps, saw 8735 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-24 09:51:38] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2023-03-24 09:51:38] [INFO ] Computed 1301 place invariants in 393 ms
[2023-03-24 09:51:39] [INFO ] [Real]Absence check using 49 positive place invariants in 76 ms returned sat
[2023-03-24 09:51:40] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 380 ms returned sat
[2023-03-24 09:51:49] [INFO ] After 9372ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-24 09:51:49] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2023-03-24 09:51:52] [INFO ] After 2536ms SMT Verify possible using 9202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-24 09:51:52] [INFO ] After 13381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-24 09:51:53] [INFO ] [Nat]Absence check using 49 positive place invariants in 79 ms returned sat
[2023-03-24 09:51:53] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 379 ms returned sat
[2023-03-24 09:52:03] [INFO ] After 9939ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-24 09:52:17] [INFO ] After 13480ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-24 09:52:17] [INFO ] After 13481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-24 09:52:17] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 5227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 892 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 894 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 879 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
[2023-03-24 09:52:19] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-24 09:52:19] [INFO ] Invariant cache hit.
[2023-03-24 09:52:24] [INFO ] Implicit Places using invariants in 5346 ms returned []
Implicit Place search using SMT only with invariants took 5349 ms to find 0 implicit places.
[2023-03-24 09:52:24] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-24 09:52:24] [INFO ] Invariant cache hit.
[2023-03-24 09:52:33] [INFO ] Dead Transitions using invariants and state equation in 8598 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14830 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Graph (trivial) has 3625 edges and 5227 vertex of which 25 / 5227 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 55758 edges and 5203 vertex of which 5181 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.8 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t12373.t14833 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4795 transition count 12813
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 1 with 722 rules applied. Total rules applied 967 place count 4553 transition count 12333
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 2 with 678 rules applied. Total rules applied 1645 place count 4313 transition count 11895
Ensure Unique test removed 40 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 199 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 3 with 635 rules applied. Total rules applied 2280 place count 4074 transition count 11499
Ensure Unique test removed 2 places
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 161 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 4 with 556 rules applied. Total rules applied 2836 place count 3875 transition count 11142
Ensure Unique test removed 36 places
Reduce places removed 196 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 158 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 5 with 514 rules applied. Total rules applied 3350 place count 3679 transition count 10824
Ensure Unique test removed 2 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 158 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 6 with 444 rules applied. Total rules applied 3794 place count 3519 transition count 10540
Ensure Unique test removed 32 places
Reduce places removed 158 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 7 with 408 rules applied. Total rules applied 4202 place count 3361 transition count 10290
Ensure Unique test removed 2 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 124 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 8 with 346 rules applied. Total rules applied 4548 place count 3235 transition count 10070
Ensure Unique test removed 28 places
Reduce places removed 124 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 9 with 314 rules applied. Total rules applied 4862 place count 3111 transition count 9880
Ensure Unique test removed 2 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 23 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 10 with 261 rules applied. Total rules applied 5123 place count 3015 transition count 9715
Ensure Unique test removed 23 places
Reduce places removed 94 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 11 with 234 rules applied. Total rules applied 5357 place count 2921 transition count 9575
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 12 with 189 rules applied. Total rules applied 5546 place count 2850 transition count 9457
Ensure Unique test removed 20 places
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 13 with 165 rules applied. Total rules applied 5711 place count 2781 transition count 9361
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 128 rules applied. Total rules applied 5839 place count 2732 transition count 9282
Ensure Unique test removed 15 places
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 109 rules applied. Total rules applied 5948 place count 2685 transition count 9220
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6028 place count 2653 transition count 9172
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6092 place count 2623 transition count 9138
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6134 place count 2605 transition count 9114
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6164 place count 2589 transition count 9100
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6180 place count 2581 transition count 9092
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 21 with 10 rules applied. Total rules applied 6190 place count 2575 transition count 9088
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 6196 place count 2571 transition count 9086
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 600 Pre rules applied. Total rules applied 6196 place count 2571 transition count 8486
Deduced a syphon composed of 600 places in 3 ms
Ensure Unique test removed 599 places
Reduce places removed 1199 places and 0 transitions.
Iterating global reduction 23 with 1799 rules applied. Total rules applied 7995 place count 1372 transition count 8486
Discarding 599 places :
Symmetric choice reduction at 23 with 599 rule applications. Total rules 8594 place count 773 transition count 7887
Iterating global reduction 23 with 599 rules applied. Total rules applied 9193 place count 773 transition count 7887
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9193 place count 773 transition count 7886
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9195 place count 772 transition count 7886
Discarding 538 places :
Symmetric choice reduction at 23 with 538 rule applications. Total rules 9733 place count 234 transition count 1430
Iterating global reduction 23 with 538 rules applied. Total rules applied 10271 place count 234 transition count 1430
Ensure Unique test removed 538 transitions
Reduce isomorphic transitions removed 538 transitions.
Iterating post reduction 23 with 538 rules applied. Total rules applied 10809 place count 234 transition count 892
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 24 with 77 rules applied. Total rules applied 10886 place count 195 transition count 854
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 24 with 13 rules applied. Total rules applied 10899 place count 195 transition count 841
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 25 with 2 rules applied. Total rules applied 10901 place count 195 transition count 839
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 25 with 26 rules applied. Total rules applied 10927 place count 195 transition count 813
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 25 with 26 rules applied. Total rules applied 10953 place count 169 transition count 813
Discarding 22 places :
Symmetric choice reduction at 26 with 22 rule applications. Total rules 10975 place count 147 transition count 549
Ensure Unique test removed 10 places
Iterating global reduction 26 with 32 rules applied. Total rules applied 11007 place count 137 transition count 549
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 26 with 22 rules applied. Total rules applied 11029 place count 137 transition count 527
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 11039 place count 127 transition count 407
Iterating global reduction 27 with 10 rules applied. Total rules applied 11049 place count 127 transition count 407
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 11059 place count 117 transition count 397
Iterating global reduction 27 with 10 rules applied. Total rules applied 11069 place count 117 transition count 397
Applied a total of 11069 rules in 10792 ms. Remains 117 /5227 variables (removed 5110) and now considering 397/14542 (removed 14145) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 397 rows 117 cols
[2023-03-24 09:52:44] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-24 09:52:44] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-24 09:52:44] [INFO ] [Real]Absence check using 4 positive and 40 generalized place invariants in 7 ms returned sat
[2023-03-24 09:52:44] [INFO ] After 83ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-24 09:52:44] [INFO ] After 100ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-24 09:52:44] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:4
[2023-03-24 09:52:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-24 09:52:44] [INFO ] [Nat]Absence check using 4 positive and 40 generalized place invariants in 7 ms returned sat
[2023-03-24 09:52:44] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-24 09:52:44] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-24 09:52:44] [INFO ] After 307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND p1 p2)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (AND p1 p2))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 636 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 1155 reset in 1338 ms.
Product exploration explored 100000 steps with 1155 reset in 1401 ms.
Support contains 3 out of 5564 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5564/5564 places, 8840/8840 transitions.
Applied a total of 0 rules in 453 ms. Remains 5564 /5564 variables (removed 0) and now considering 8840/8840 (removed 0) transitions.
[2023-03-24 09:52:48] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
// Phase 1: matrix 8240 rows 5564 cols
[2023-03-24 09:52:49] [INFO ] Computed 1301 place invariants in 242 ms
[2023-03-24 09:52:53] [INFO ] Implicit Places using invariants in 4843 ms returned []
[2023-03-24 09:52:53] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
[2023-03-24 09:52:53] [INFO ] Invariant cache hit.
[2023-03-24 09:52:58] [INFO ] Implicit Places using invariants and state equation in 4557 ms returned []
Implicit Place search using SMT with State Equation took 9408 ms to find 0 implicit places.
[2023-03-24 09:52:58] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
[2023-03-24 09:52:58] [INFO ] Invariant cache hit.
[2023-03-24 09:53:03] [INFO ] Dead Transitions using invariants and state equation in 5478 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15342 ms. Remains : 5564/5564 places, 8840/8840 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06 finished in 265377 ms.
[2023-03-24 09:53:05] [INFO ] Flatten gal took : 805 ms
[2023-03-24 09:53:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-24 09:53:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 20560 places, 29875 transitions and 109282 arcs took 104 ms.
Total runtime 759064 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1500/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06

BK_STOP 1679651647590

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06
ltl formula formula --ltl=/tmp/1500/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 20560 places, 29875 transitions and 109282 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.420 real 1.170 user 1.290 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1500/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1500/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1500/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1500/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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="MultiCrashLeafsetExtension-PT-S24C12"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C12, 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 r233-tall-167856419500883"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C12.tgz
mv MultiCrashLeafsetExtension-PT-S24C12 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 ;