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.r487-tall-167912702600099.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Sudoku-COL-AN13, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702600099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 8.1K Feb 26 09:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 09:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 08:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 08:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 09:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 09:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 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 Sudoku-COL-AN13-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679165460419

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN13
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 18:51:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 18:51:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 18:51:02] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-18 18:51:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 18:51:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 362 ms
[2023-03-18 18:51:02] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2704 PT places and 2197.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 18:51:02] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2023-03-18 18:51:02] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN13-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10088 steps, including 58 resets, run finished after 24 ms. (steps per millisecond=420 ) properties (out of 19) seen :16
Incomplete Best-First random walk after 10088 steps, including 58 resets, run finished after 13 ms. (steps per millisecond=776 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10088 steps, including 58 resets, run finished after 10 ms. (steps per millisecond=1008 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10088 steps, including 58 resets, run finished after 7 ms. (steps per millisecond=1441 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 18:51:02] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-18 18:51:02] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 18:51:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-18 18:51:02] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-COL-AN13-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 18:51:02] [INFO ] Flatten gal took : 11 ms
[2023-03-18 18:51:02] [INFO ] Flatten gal took : 1 ms
Domain [N(13), N(13)] of place Rows breaks symmetries in sort N
[2023-03-18 18:51:02] [INFO ] Unfolded HLPN to a Petri net with 2704 places and 2197 transitions 8788 arcs in 35 ms.
[2023-03-18 18:51:02] [INFO ] Unfolded 13 HLPN properties in 7 ms.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 34 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-18 18:51:03] [INFO ] Computed 507 place invariants in 35 ms
[2023-03-18 18:51:03] [INFO ] Implicit Places using invariants in 523 ms returned []
[2023-03-18 18:51:03] [INFO ] Invariant cache hit.
[2023-03-18 18:51:05] [INFO ] Implicit Places using invariants and state equation in 1360 ms returned []
Implicit Place search using SMT with State Equation took 1886 ms to find 0 implicit places.
[2023-03-18 18:51:05] [INFO ] Invariant cache hit.
[2023-03-18 18:51:06] [INFO ] Dead Transitions using invariants and state equation in 1252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3176 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Support contains 2704 out of 2704 places after structural reductions.
[2023-03-18 18:51:06] [INFO ] Flatten gal took : 218 ms
[2023-03-18 18:51:06] [INFO ] Flatten gal took : 154 ms
[2023-03-18 18:51:07] [INFO ] Input system was already deterministic with 2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 2876 ms. (steps per millisecond=3 ) properties (out of 17) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 651 ms. (steps per millisecond=15 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-18 18:51:12] [INFO ] Invariant cache hit.
[2023-03-18 18:51:13] [INFO ] [Real]Absence check using 507 positive place invariants in 129 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 18:51:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 18:51:38] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 36 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 2694 ms. (steps per millisecond=3 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 120108 steps, run timeout after 12018 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 120108 steps, saw 120018 distinct states, run finished after 12021 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 12 properties.
[2023-03-18 18:51:54] [INFO ] Invariant cache hit.
[2023-03-18 18:51:56] [INFO ] [Real]Absence check using 507 positive place invariants in 119 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 18:52:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 18:52:20] [INFO ] After 25038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 31 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 22 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:52:20] [INFO ] Invariant cache hit.
[2023-03-18 18:52:20] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-18 18:52:20] [INFO ] Invariant cache hit.
[2023-03-18 18:52:22] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 1698 ms to find 0 implicit places.
[2023-03-18 18:52:22] [INFO ] Redundant transitions in 114 ms returned []
[2023-03-18 18:52:22] [INFO ] Invariant cache hit.
[2023-03-18 18:52:23] [INFO ] Dead Transitions using invariants and state equation in 1266 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3106 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 19 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Running SMT prover for 12 properties.
[2023-03-18 18:52:23] [INFO ] Invariant cache hit.
[2023-03-18 18:52:24] [INFO ] [Real]Absence check using 507 positive place invariants in 122 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
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-18 18:56:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 18:56:08] [INFO ] After 225028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 92 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-18 18:56:09] [INFO ] Computed 38 place invariants in 98 ms
[2023-03-18 18:56:09] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-18 18:56:09] [INFO ] Invariant cache hit.
[2023-03-18 18:56:11] [INFO ] Implicit Places using invariants and state equation in 1635 ms returned []
Implicit Place search using SMT with State Equation took 2086 ms to find 0 implicit places.
[2023-03-18 18:56:11] [INFO ] Invariant cache hit.
[2023-03-18 18:56:12] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2840 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 2 (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 ...], 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 2 ms.
FORMULA Sudoku-COL-AN13-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLCardinality-00 finished in 3082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 109 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-18 18:56:12] [INFO ] Computed 507 place invariants in 12 ms
[2023-03-18 18:56:13] [INFO ] Implicit Places using invariants in 1256 ms returned []
[2023-03-18 18:56:13] [INFO ] Invariant cache hit.
[2023-03-18 18:56:16] [INFO ] Implicit Places using invariants and state equation in 3161 ms returned []
Implicit Place search using SMT with State Equation took 4421 ms to find 0 implicit places.
[2023-03-18 18:56:16] [INFO ] Redundant transitions in 93 ms returned []
[2023-03-18 18:56:16] [INFO ] Invariant cache hit.
[2023-03-18 18:56:18] [INFO ] Dead Transitions using invariants and state equation in 1217 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5849 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 43 ms.
FORMULA Sudoku-COL-AN13-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLCardinality-02 finished in 5985 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 36 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-18 18:56:18] [INFO ] Computed 38 place invariants in 62 ms
[2023-03-18 18:56:18] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-18 18:56:18] [INFO ] Invariant cache hit.
[2023-03-18 18:56:20] [INFO ] Implicit Places using invariants and state equation in 1536 ms returned []
Implicit Place search using SMT with State Equation took 1930 ms to find 0 implicit places.
[2023-03-18 18:56:20] [INFO ] Invariant cache hit.
[2023-03-18 18:56:20] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2606 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ 1 (ADD s338 s339 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351 s352 s353 s354 s355 s356 s357 s358 s359 s360 s361 s362 s363 s364 s365...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration timeout after 69410 steps with 468 reset in 10004 ms.
Product exploration timeout after 68830 steps with 464 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1538 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 127686 steps, run timeout after 3010 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127686 steps, saw 127590 distinct states, run finished after 3010 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 18:56:46] [INFO ] Invariant cache hit.
[2023-03-18 18:56:46] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 26 ms returned sat
[2023-03-18 18:56:47] [INFO ] After 1205ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-18 18:56:47] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 31 ms returned sat
[2023-03-18 18:56:49] [INFO ] After 1391ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-18 18:56:49] [INFO ] After 1477ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-18 18:56:49] [INFO ] After 1631ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 10 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0))))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 6 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN13-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLCardinality-03 finished in 31281 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((F(p2)||p1))))'
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 27 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:56:49] [INFO ] Invariant cache hit.
[2023-03-18 18:56:49] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-18 18:56:49] [INFO ] Invariant cache hit.
[2023-03-18 18:56:51] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 1795 ms to find 0 implicit places.
[2023-03-18 18:56:51] [INFO ] Invariant cache hit.
[2023-03-18 18:56:52] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2489 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 71190 steps with 480 reset in 10001 ms.
Product exploration timeout after 70580 steps with 476 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND p0 p1) (AND p0 p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 335 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1371 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 236042 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 236042 steps, saw 218849 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 18:57:17] [INFO ] Invariant cache hit.
[2023-03-18 18:57:17] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2023-03-18 18:57:18] [INFO ] After 1071ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:57:18] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 26 ms returned sat
[2023-03-18 18:57:19] [INFO ] After 869ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:57:19] [INFO ] After 957ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-18 18:57:19] [INFO ] After 1108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 169 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND p0 p1) (AND p0 p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 255 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 21 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:57:20] [INFO ] Invariant cache hit.
[2023-03-18 18:57:20] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-18 18:57:20] [INFO ] Invariant cache hit.
[2023-03-18 18:57:21] [INFO ] Implicit Places using invariants and state equation in 1390 ms returned []
Implicit Place search using SMT with State Equation took 1740 ms to find 0 implicit places.
[2023-03-18 18:57:21] [INFO ] Invariant cache hit.
[2023-03-18 18:57:22] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2399 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1373 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 237080 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 237080 steps, saw 219077 distinct states, run finished after 3002 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 18:57:27] [INFO ] Invariant cache hit.
[2023-03-18 18:57:27] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 26 ms returned sat
[2023-03-18 18:57:28] [INFO ] After 1035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:57:28] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 26 ms returned sat
[2023-03-18 18:57:29] [INFO ] After 888ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:57:29] [INFO ] After 965ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-18 18:57:29] [INFO ] After 1107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 169 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Product exploration timeout after 70920 steps with 478 reset in 10001 ms.
Product exploration timeout after 71220 steps with 480 reset in 10002 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 61 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:57:50] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-18 18:57:50] [INFO ] Invariant cache hit.
[2023-03-18 18:57:51] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 761 ms. Remains : 507/507 places, 2197/2197 transitions.
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 20 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:57:51] [INFO ] Invariant cache hit.
[2023-03-18 18:57:51] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-18 18:57:51] [INFO ] Invariant cache hit.
[2023-03-18 18:57:52] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned []
Implicit Place search using SMT with State Equation took 1755 ms to find 0 implicit places.
[2023-03-18 18:57:52] [INFO ] Invariant cache hit.
[2023-03-18 18:57:53] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2407 ms. Remains : 507/507 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-04 finished in 64291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(p1)||G(p2))))))'
Support contains 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 13 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-18 18:57:53] [INFO ] Computed 507 place invariants in 12 ms
[2023-03-18 18:57:54] [INFO ] Implicit Places using invariants in 659 ms returned []
[2023-03-18 18:57:54] [INFO ] Invariant cache hit.
[2023-03-18 18:57:56] [INFO ] Implicit Places using invariants and state equation in 2028 ms returned []
Implicit Place search using SMT with State Equation took 2696 ms to find 0 implicit places.
[2023-03-18 18:57:56] [INFO ] Invariant cache hit.
[2023-03-18 18:57:57] [INFO ] Dead Transitions using invariants and state equation in 1185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3896 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(GT 1 (ADD s2366 s2367 s2368 s2369 s2370 s2371 s2372 s2373 s2374 s2375 s2376 s2377 s2378 s2379 s2380 s2381 s2382 s2383 s2384 s2385 s2386 s2387 s2388 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN13-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLCardinality-05 finished in 4152 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 U X(p1)))))'
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 21 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:57:58] [INFO ] Invariant cache hit.
[2023-03-18 18:57:58] [INFO ] Implicit Places using invariants in 898 ms returned []
[2023-03-18 18:57:58] [INFO ] Invariant cache hit.
[2023-03-18 18:58:01] [INFO ] Implicit Places using invariants and state equation in 2489 ms returned []
Implicit Place search using SMT with State Equation took 3389 ms to find 0 implicit places.
[2023-03-18 18:58:01] [INFO ] Invariant cache hit.
[2023-03-18 18:58:02] [INFO ] Dead Transitions using invariants and state equation in 1202 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4613 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 36720 steps with 422 reset in 10002 ms.
Product exploration timeout after 36050 steps with 414 reset in 10003 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 339 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1595 ms. (steps per millisecond=6 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 636 ms. (steps per millisecond=15 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 18:58:26] [INFO ] Invariant cache hit.
[2023-03-18 18:58:26] [INFO ] [Real]Absence check using 507 positive place invariants in 125 ms returned sat
[2023-03-18 18:58:51] [INFO ] After 25013ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:58:51] [INFO ] [Nat]Absence check using 507 positive place invariants in 123 ms returned sat
[2023-03-18 18:59:07] [INFO ] After 16393ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.5 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 36 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 507/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1367 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 242252 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 242252 steps, saw 220011 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-18 18:59:12] [INFO ] Computed 38 place invariants in 47 ms
[2023-03-18 18:59:12] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2023-03-18 18:59:15] [INFO ] After 2573ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:59:15] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 24 ms returned sat
[2023-03-18 18:59:20] [INFO ] After 5463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 18:59:20] [INFO ] After 5537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-18 18:59:20] [INFO ] After 5667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 7 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (OR p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 274 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-18 18:59:21] [INFO ] Computed 507 place invariants in 15 ms
Could not prove EG (NOT p1)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 35 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 18:59:36] [INFO ] Invariant cache hit.
[2023-03-18 18:59:37] [INFO ] Implicit Places using invariants in 943 ms returned []
[2023-03-18 18:59:37] [INFO ] Invariant cache hit.
[2023-03-18 18:59:40] [INFO ] Implicit Places using invariants and state equation in 2579 ms returned []
Implicit Place search using SMT with State Equation took 3524 ms to find 0 implicit places.
[2023-03-18 18:59:40] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-18 18:59:40] [INFO ] Invariant cache hit.
[2023-03-18 18:59:41] [INFO ] Dead Transitions using invariants and state equation in 1199 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4810 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
[2023-03-18 18:59:43] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1)]
Product exploration timeout after 27620 steps with 314 reset in 10004 ms.
Product exploration timeout after 27570 steps with 313 reset in 10002 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 41 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:00:18] [INFO ] Invariant cache hit.
[2023-03-18 19:00:19] [INFO ] Implicit Places using invariants in 938 ms returned []
[2023-03-18 19:00:19] [INFO ] Invariant cache hit.
[2023-03-18 19:00:21] [INFO ] Implicit Places using invariants and state equation in 2550 ms returned []
Implicit Place search using SMT with State Equation took 3492 ms to find 0 implicit places.
[2023-03-18 19:00:21] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-18 19:00:21] [INFO ] Invariant cache hit.
[2023-03-18 19:00:23] [INFO ] Dead Transitions using invariants and state equation in 1274 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4869 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-06 finished in 145564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0||X(((G(F(p1)) U p2) U (!p0&&(G(F(p1)) U p2)))))))))'
Support contains 169 out of 2704 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 11 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:00:23] [INFO ] Invariant cache hit.
[2023-03-18 19:00:24] [INFO ] Implicit Places using invariants in 585 ms returned []
[2023-03-18 19:00:24] [INFO ] Invariant cache hit.
[2023-03-18 19:00:26] [INFO ] Implicit Places using invariants and state equation in 1867 ms returned []
Implicit Place search using SMT with State Equation took 2454 ms to find 0 implicit places.
[2023-03-18 19:00:26] [INFO ] Invariant cache hit.
[2023-03-18 19:00:27] [INFO ] Dead Transitions using invariants and state equation in 1182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3648 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 93 ms :[p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 3 (ADD s2535 s2536 s2537 s2538 s2539 s2540 s2541 s2542 s2543 s2544 s2545 s2546 s2547 s2548 s2549 s2550 s2551 s2552 s2553 s2554 s2555 s2556 s2557 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 36120 steps with 12040 reset in 10003 ms.
Product exploration timeout after 36090 steps with 12030 reset in 10003 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[p0, p0, p0]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1407 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 217118 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217118 steps, saw 215159 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 19:00:52] [INFO ] Invariant cache hit.
[2023-03-18 19:00:52] [INFO ] [Real]Absence check using 507 positive place invariants in 124 ms returned sat
[2023-03-18 19:01:17] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.2 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 34 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 507/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1364 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 229186 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 229186 steps, saw 217581 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-18 19:01:22] [INFO ] Computed 38 place invariants in 52 ms
[2023-03-18 19:01:22] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2023-03-18 19:01:23] [INFO ] After 1597ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:01:23] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 25 ms returned sat
[2023-03-18 19:01:25] [INFO ] After 1971ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:01:25] [INFO ] After 2042ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-18 19:01:26] [INFO ] After 2188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 112 ms :[p0, p0, p0]
Support contains 169 out of 2704 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 13 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-18 19:01:26] [INFO ] Computed 507 place invariants in 15 ms
[2023-03-18 19:01:27] [INFO ] Implicit Places using invariants in 598 ms returned []
[2023-03-18 19:01:27] [INFO ] Invariant cache hit.
[2023-03-18 19:01:29] [INFO ] Implicit Places using invariants and state equation in 1964 ms returned []
Implicit Place search using SMT with State Equation took 2563 ms to find 0 implicit places.
[2023-03-18 19:01:29] [INFO ] Invariant cache hit.
[2023-03-18 19:01:30] [INFO ] Dead Transitions using invariants and state equation in 1184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3762 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[p0, p0, p0]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1403 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 221681 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 221681 steps, saw 216039 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 19:01:35] [INFO ] Invariant cache hit.
[2023-03-18 19:01:35] [INFO ] [Real]Absence check using 507 positive place invariants in 126 ms returned sat
[2023-03-18 19:02:00] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.3 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 40 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 507/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1395 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 226744 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 226744 steps, saw 217076 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-18 19:02:05] [INFO ] Computed 38 place invariants in 60 ms
[2023-03-18 19:02:05] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2023-03-18 19:02:06] [INFO ] After 1596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:02:06] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 26 ms returned sat
[2023-03-18 19:02:08] [INFO ] After 2030ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:02:08] [INFO ] After 2103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-18 19:02:09] [INFO ] After 2261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 89 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 114 ms :[p0, p0, p0]
Product exploration timeout after 35560 steps with 11853 reset in 10003 ms.
Product exploration timeout after 35500 steps with 11833 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[p0, p0, p0]
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.5 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 43 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:02:29] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-18 19:02:29] [INFO ] Invariant cache hit.
[2023-03-18 19:02:30] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 753 ms. Remains : 507/2704 places, 2197/2197 transitions.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 26 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:02:30] [INFO ] Invariant cache hit.
[2023-03-18 19:02:30] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-18 19:02:30] [INFO ] Invariant cache hit.
[2023-03-18 19:02:32] [INFO ] Implicit Places using invariants and state equation in 1432 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
[2023-03-18 19:02:32] [INFO ] Invariant cache hit.
[2023-03-18 19:02:32] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2460 ms. Remains : 507/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-08 finished in 129502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(F(!p0))||F(!p1)) U p2))))'
Support contains 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 14 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-18 19:02:33] [INFO ] Computed 507 place invariants in 10 ms
[2023-03-18 19:02:33] [INFO ] Implicit Places using invariants in 647 ms returned []
[2023-03-18 19:02:33] [INFO ] Invariant cache hit.
[2023-03-18 19:02:35] [INFO ] Implicit Places using invariants and state equation in 1957 ms returned []
Implicit Place search using SMT with State Equation took 2606 ms to find 0 implicit places.
[2023-03-18 19:02:35] [INFO ] Invariant cache hit.
[2023-03-18 19:02:36] [INFO ] Dead Transitions using invariants and state equation in 1238 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3863 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p1 p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 3 (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196...], nbAcceptance=0, 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 28410 steps with 7102 reset in 10004 ms.
Product exploration timeout after 28250 steps with 7062 reset in 10004 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 2023 ms. (steps per millisecond=4 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 633 ms. (steps per millisecond=15 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:03:00] [INFO ] Invariant cache hit.
[2023-03-18 19:03:01] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:03:02] [INFO ] [Nat]Absence check using 507 positive place invariants in 126 ms returned sat
[2023-03-18 19:03:02] [INFO ] After 1354ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 p1))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 6 factoid took 338 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p2), (NOT p2), (NOT p2)]
[2023-03-18 19:03:04] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 19:03:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 2197 out of 2704 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 8 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:03:19] [INFO ] Invariant cache hit.
[2023-03-18 19:03:20] [INFO ] Implicit Places using invariants in 627 ms returned []
[2023-03-18 19:03:20] [INFO ] Invariant cache hit.
[2023-03-18 19:03:22] [INFO ] Implicit Places using invariants and state equation in 2025 ms returned []
Implicit Place search using SMT with State Equation took 2653 ms to find 0 implicit places.
[2023-03-18 19:03:22] [INFO ] Invariant cache hit.
[2023-03-18 19:03:23] [INFO ] Dead Transitions using invariants and state equation in 1188 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3851 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (NOT p2), (NOT p2)]
[2023-03-18 19:03:25] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 19:03:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (NOT p2), (NOT p2)]
Product exploration timeout after 30730 steps with 7682 reset in 10002 ms.
Product exploration timeout after 30630 steps with 7657 reset in 10004 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(NOT p2), (NOT p2), (NOT p2)]
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 42 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:04:01] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-18 19:04:01] [INFO ] Invariant cache hit.
[2023-03-18 19:04:02] [INFO ] Dead Transitions using invariants and state equation in 1241 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1336 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 34 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:04:02] [INFO ] Invariant cache hit.
[2023-03-18 19:04:03] [INFO ] Implicit Places using invariants in 1188 ms returned []
[2023-03-18 19:04:03] [INFO ] Invariant cache hit.
[2023-03-18 19:04:06] [INFO ] Implicit Places using invariants and state equation in 3094 ms returned []
Implicit Place search using SMT with State Equation took 4284 ms to find 0 implicit places.
[2023-03-18 19:04:06] [INFO ] Invariant cache hit.
[2023-03-18 19:04:07] [INFO ] Dead Transitions using invariants and state equation in 1200 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5520 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-09 finished in 95013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 14 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:04:08] [INFO ] Invariant cache hit.
[2023-03-18 19:04:08] [INFO ] Implicit Places using invariants in 651 ms returned []
[2023-03-18 19:04:08] [INFO ] Invariant cache hit.
[2023-03-18 19:04:10] [INFO ] Implicit Places using invariants and state equation in 2040 ms returned []
Implicit Place search using SMT with State Equation took 2697 ms to find 0 implicit places.
[2023-03-18 19:04:10] [INFO ] Invariant cache hit.
[2023-03-18 19:04:11] [INFO ] Dead Transitions using invariants and state equation in 1197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3910 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(GT (ADD s2366 s2367 s2368 s2369 s2370 s2371 s2372 s2373 s2374 s2375 s2376 s2377 s2378 s2379 s2380 s2381 s2382 s2383 s2384 s2385 s2386 s2387 s2388 s238...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 144 steps with 0 reset in 48 ms.
FORMULA Sudoku-COL-AN13-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLCardinality-11 finished in 4050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 20 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:04:12] [INFO ] Invariant cache hit.
[2023-03-18 19:04:13] [INFO ] Implicit Places using invariants in 938 ms returned []
[2023-03-18 19:04:13] [INFO ] Invariant cache hit.
[2023-03-18 19:04:15] [INFO ] Implicit Places using invariants and state equation in 2589 ms returned []
Implicit Place search using SMT with State Equation took 3529 ms to find 0 implicit places.
[2023-03-18 19:04:15] [INFO ] Invariant cache hit.
[2023-03-18 19:04:16] [INFO ] Dead Transitions using invariants and state equation in 1210 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4762 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 38980 steps with 453 reset in 10003 ms.
Product exploration timeout after 38650 steps with 449 reset in 10003 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-03-18 19:04:38] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 27 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:04:53] [INFO ] Invariant cache hit.
[2023-03-18 19:04:54] [INFO ] Implicit Places using invariants in 919 ms returned []
[2023-03-18 19:04:54] [INFO ] Invariant cache hit.
[2023-03-18 19:04:57] [INFO ] Implicit Places using invariants and state equation in 2580 ms returned []
Implicit Place search using SMT with State Equation took 3501 ms to find 0 implicit places.
[2023-03-18 19:04:57] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-18 19:04:57] [INFO ] Invariant cache hit.
[2023-03-18 19:04:58] [INFO ] Dead Transitions using invariants and state equation in 1237 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4827 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-18 19:05:00] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration timeout after 38300 steps with 445 reset in 10003 ms.
Product exploration timeout after 38640 steps with 449 reset in 10003 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 36 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:05:35] [INFO ] Invariant cache hit.
[2023-03-18 19:05:36] [INFO ] Implicit Places using invariants in 920 ms returned []
[2023-03-18 19:05:36] [INFO ] Invariant cache hit.
[2023-03-18 19:05:38] [INFO ] Implicit Places using invariants and state equation in 2546 ms returned []
Implicit Place search using SMT with State Equation took 3467 ms to find 0 implicit places.
[2023-03-18 19:05:38] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-18 19:05:38] [INFO ] Invariant cache hit.
[2023-03-18 19:05:40] [INFO ] Dead Transitions using invariants and state equation in 1194 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4749 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-12 finished in 88089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 42 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:05:40] [INFO ] Invariant cache hit.
[2023-03-18 19:05:41] [INFO ] Implicit Places using invariants in 1174 ms returned []
[2023-03-18 19:05:41] [INFO ] Invariant cache hit.
[2023-03-18 19:05:44] [INFO ] Implicit Places using invariants and state equation in 3060 ms returned []
Implicit Place search using SMT with State Equation took 4239 ms to find 0 implicit places.
[2023-03-18 19:05:44] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-18 19:05:44] [INFO ] Invariant cache hit.
[2023-03-18 19:05:45] [INFO ] Dead Transitions using invariants and state equation in 1185 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5519 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 44260 steps with 298 reset in 10001 ms.
Product exploration timeout after 44050 steps with 297 reset in 10001 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2023-03-18 19:06:07] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 19:06:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 52 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:06:23] [INFO ] Invariant cache hit.
[2023-03-18 19:06:24] [INFO ] Implicit Places using invariants in 1172 ms returned []
[2023-03-18 19:06:24] [INFO ] Invariant cache hit.
[2023-03-18 19:06:27] [INFO ] Implicit Places using invariants and state equation in 3028 ms returned []
Implicit Place search using SMT with State Equation took 4202 ms to find 0 implicit places.
[2023-03-18 19:06:27] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-18 19:06:27] [INFO ] Invariant cache hit.
[2023-03-18 19:06:28] [INFO ] Dead Transitions using invariants and state equation in 1178 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5492 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-18 19:06:30] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 19:06:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 151 ms :[(NOT p0)]
Product exploration timeout after 44660 steps with 301 reset in 10001 ms.
Product exploration timeout after 44740 steps with 301 reset in 10002 ms.
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 41 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:07:05] [INFO ] Invariant cache hit.
[2023-03-18 19:07:06] [INFO ] Implicit Places using invariants in 1135 ms returned []
[2023-03-18 19:07:06] [INFO ] Invariant cache hit.
[2023-03-18 19:07:09] [INFO ] Implicit Places using invariants and state equation in 2970 ms returned []
Implicit Place search using SMT with State Equation took 4105 ms to find 0 implicit places.
[2023-03-18 19:07:09] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-18 19:07:09] [INFO ] Invariant cache hit.
[2023-03-18 19:07:11] [INFO ] Dead Transitions using invariants and state equation in 1170 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5377 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-13 finished in 91065 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))'
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 24 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:07:11] [INFO ] Invariant cache hit.
[2023-03-18 19:07:12] [INFO ] Implicit Places using invariants in 905 ms returned []
[2023-03-18 19:07:12] [INFO ] Invariant cache hit.
[2023-03-18 19:07:14] [INFO ] Implicit Places using invariants and state equation in 2521 ms returned []
Implicit Place search using SMT with State Equation took 3427 ms to find 0 implicit places.
[2023-03-18 19:07:14] [INFO ] Invariant cache hit.
[2023-03-18 19:07:15] [INFO ] Dead Transitions using invariants and state equation in 1164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4616 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 80 ms :[p0, p0, true]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN13-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLCardinality-14 finished in 4720 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&&(p1 U p2))))'
Support contains 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 21 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:07:16] [INFO ] Invariant cache hit.
[2023-03-18 19:07:16] [INFO ] Implicit Places using invariants in 637 ms returned []
[2023-03-18 19:07:16] [INFO ] Invariant cache hit.
[2023-03-18 19:07:18] [INFO ] Implicit Places using invariants and state equation in 1890 ms returned []
Implicit Place search using SMT with State Equation took 2529 ms to find 0 implicit places.
[2023-03-18 19:07:18] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-18 19:07:18] [INFO ] Invariant cache hit.
[2023-03-18 19:07:19] [INFO ] Dead Transitions using invariants and state equation in 1189 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3799 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 29780 steps with 1488 reset in 10002 ms.
Product exploration timeout after 29520 steps with 1427 reset in 10010 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (AND p0 (NOT p2) p1)), (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR (AND p0 p2) (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 423 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 2749 ms. (steps per millisecond=3 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1130 ms. (steps per millisecond=8 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1095 ms. (steps per millisecond=9 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 954 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 19:07:47] [INFO ] Invariant cache hit.
[2023-03-18 19:07:50] [INFO ] After 377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 19:07:50] [INFO ] [Nat]Absence check using 507 positive place invariants in 126 ms returned sat
[2023-03-18 19:08:10] [INFO ] After 10355ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-18 19:08:15] [INFO ] After 14890ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-18 19:08:15] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 167 steps, including 0 resets, run visited all 2 properties in 34 ms. (steps per millisecond=4 )
Parikh walk visited 2 properties in 35 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (AND p0 (NOT p2) p1)), (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR (AND p0 p2) (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (NOT (AND p0 p1 (NOT p2)))), (F (OR (NOT p0) (AND (NOT p1) (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (AND p0 p1) (AND p0 p2))))
Knowledge based reduction with 10 factoid took 174 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN13-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLCardinality-15 finished in 59366 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((F(p2)||p1))))'
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 U X(p1)))))'
Found a Lengthening insensitive property : Sudoku-COL-AN13-LTLCardinality-06
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 31 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:08:15] [INFO ] Invariant cache hit.
[2023-03-18 19:08:16] [INFO ] Implicit Places using invariants in 969 ms returned []
[2023-03-18 19:08:16] [INFO ] Invariant cache hit.
[2023-03-18 19:08:19] [INFO ] Implicit Places using invariants and state equation in 2528 ms returned []
Implicit Place search using SMT with State Equation took 3498 ms to find 0 implicit places.
[2023-03-18 19:08:19] [INFO ] Invariant cache hit.
[2023-03-18 19:08:20] [INFO ] Dead Transitions using invariants and state equation in 1164 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4695 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 36360 steps with 418 reset in 10002 ms.
Product exploration timeout after 36410 steps with 418 reset in 10002 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 242 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1564 ms. (steps per millisecond=6 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 641 ms. (steps per millisecond=15 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:08:43] [INFO ] Invariant cache hit.
[2023-03-18 19:08:44] [INFO ] [Real]Absence check using 507 positive place invariants in 133 ms returned sat
[2023-03-18 19:09:09] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:09:09] [INFO ] [Nat]Absence check using 507 positive place invariants in 126 ms returned sat
[2023-03-18 19:09:25] [INFO ] After 16732ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.4 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 33 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 507/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1385 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 226333 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 226333 steps, saw 216975 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-18 19:09:30] [INFO ] Computed 38 place invariants in 54 ms
[2023-03-18 19:09:30] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2023-03-18 19:09:33] [INFO ] After 2665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:09:33] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 26 ms returned sat
[2023-03-18 19:09:39] [INFO ] After 5978ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:09:39] [INFO ] After 6053ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-18 19:09:39] [INFO ] After 6191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 6 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (OR p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 569 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-18 19:09:40] [INFO ] Computed 507 place invariants in 16 ms
Could not prove EG (NOT p1)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 32 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:09:55] [INFO ] Invariant cache hit.
[2023-03-18 19:09:56] [INFO ] Implicit Places using invariants in 925 ms returned []
[2023-03-18 19:09:56] [INFO ] Invariant cache hit.
[2023-03-18 19:09:59] [INFO ] Implicit Places using invariants and state equation in 2544 ms returned []
Implicit Place search using SMT with State Equation took 3471 ms to find 0 implicit places.
[2023-03-18 19:09:59] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-18 19:09:59] [INFO ] Invariant cache hit.
[2023-03-18 19:10:00] [INFO ] Dead Transitions using invariants and state equation in 1165 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4723 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
[2023-03-18 19:10:02] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Product exploration timeout after 27620 steps with 313 reset in 10001 ms.
Product exploration timeout after 27450 steps with 311 reset in 10001 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 25 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:10:37] [INFO ] Invariant cache hit.
[2023-03-18 19:10:38] [INFO ] Implicit Places using invariants in 918 ms returned []
[2023-03-18 19:10:38] [INFO ] Invariant cache hit.
[2023-03-18 19:10:40] [INFO ] Implicit Places using invariants and state equation in 2551 ms returned []
Implicit Place search using SMT with State Equation took 3471 ms to find 0 implicit places.
[2023-03-18 19:10:40] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-18 19:10:40] [INFO ] Invariant cache hit.
[2023-03-18 19:10:41] [INFO ] Dead Transitions using invariants and state equation in 1213 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4760 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-06 finished in 146634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0||X(((G(F(p1)) U p2) U (!p0&&(G(F(p1)) U p2)))))))))'
Found a Shortening insensitive property : Sudoku-COL-AN13-LTLCardinality-08
Stuttering acceptance computed with spot in 109 ms :[p0, p0, p0]
Support contains 169 out of 2704 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 19 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:10:42] [INFO ] Invariant cache hit.
[2023-03-18 19:10:42] [INFO ] Implicit Places using invariants in 580 ms returned []
[2023-03-18 19:10:42] [INFO ] Invariant cache hit.
[2023-03-18 19:10:44] [INFO ] Implicit Places using invariants and state equation in 1903 ms returned []
Implicit Place search using SMT with State Equation took 2485 ms to find 0 implicit places.
[2023-03-18 19:10:44] [INFO ] Invariant cache hit.
[2023-03-18 19:10:45] [INFO ] Dead Transitions using invariants and state equation in 1167 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3673 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 3 (ADD s2535 s2536 s2537 s2538 s2539 s2540 s2541 s2542 s2543 s2544 s2545 s2546 s2547 s2548 s2549 s2550 s2551 s2552 s2553 s2554 s2555 s2556 s2557 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 36450 steps with 12150 reset in 10005 ms.
Product exploration timeout after 36330 steps with 12110 reset in 10002 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[p0, p0, p0]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1371 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 215770 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215770 steps, saw 214805 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 19:11:11] [INFO ] Invariant cache hit.
[2023-03-18 19:11:11] [INFO ] [Real]Absence check using 507 positive place invariants in 121 ms returned sat
[2023-03-18 19:11:36] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.2 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 30 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 507/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1358 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 232493 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 232493 steps, saw 218257 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-18 19:11:40] [INFO ] Computed 38 place invariants in 52 ms
[2023-03-18 19:11:40] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2023-03-18 19:11:42] [INFO ] After 1566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:11:42] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 26 ms returned sat
[2023-03-18 19:11:44] [INFO ] After 1923ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:11:44] [INFO ] After 2005ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-18 19:11:44] [INFO ] After 2169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 90 ms :[p0, p0, p0]
Support contains 169 out of 2704 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 14 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-18 19:11:44] [INFO ] Computed 507 place invariants in 14 ms
[2023-03-18 19:11:45] [INFO ] Implicit Places using invariants in 600 ms returned []
[2023-03-18 19:11:45] [INFO ] Invariant cache hit.
[2023-03-18 19:11:47] [INFO ] Implicit Places using invariants and state equation in 1910 ms returned []
Implicit Place search using SMT with State Equation took 2512 ms to find 0 implicit places.
[2023-03-18 19:11:47] [INFO ] Invariant cache hit.
[2023-03-18 19:11:48] [INFO ] Dead Transitions using invariants and state equation in 1200 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3726 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[p0, p0, p0]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1365 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 219944 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219944 steps, saw 215672 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 19:11:53] [INFO ] Invariant cache hit.
[2023-03-18 19:11:54] [INFO ] [Real]Absence check using 507 positive place invariants in 123 ms returned sat
[2023-03-18 19:12:18] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.1 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 33 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 507/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1366 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 231219 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 231219 steps, saw 217978 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-18 19:12:23] [INFO ] Computed 38 place invariants in 49 ms
[2023-03-18 19:12:23] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 28 ms returned sat
[2023-03-18 19:12:25] [INFO ] After 1559ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:12:25] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 25 ms returned sat
[2023-03-18 19:12:27] [INFO ] After 1971ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:12:27] [INFO ] After 2039ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-18 19:12:27] [INFO ] After 2183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 86 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 173 ms :[p0, p0, p0]
Product exploration timeout after 36690 steps with 12230 reset in 10002 ms.
Product exploration timeout after 36310 steps with 12103 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 99 ms :[p0, p0, p0]
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.7 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 37 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:12:48] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-18 19:12:48] [INFO ] Invariant cache hit.
[2023-03-18 19:12:48] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 723 ms. Remains : 507/2704 places, 2197/2197 transitions.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 25 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:12:48] [INFO ] Invariant cache hit.
[2023-03-18 19:12:49] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-18 19:12:49] [INFO ] Invariant cache hit.
[2023-03-18 19:12:50] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
[2023-03-18 19:12:50] [INFO ] Invariant cache hit.
[2023-03-18 19:12:51] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2450 ms. Remains : 507/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-08 finished in 129157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(F(!p0))||F(!p1)) U p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : Sudoku-COL-AN13-LTLCardinality-12
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 24 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-18 19:12:51] [INFO ] Computed 507 place invariants in 13 ms
[2023-03-18 19:12:52] [INFO ] Implicit Places using invariants in 932 ms returned []
[2023-03-18 19:12:52] [INFO ] Invariant cache hit.
[2023-03-18 19:12:54] [INFO ] Implicit Places using invariants and state equation in 2486 ms returned []
Implicit Place search using SMT with State Equation took 3419 ms to find 0 implicit places.
[2023-03-18 19:12:54] [INFO ] Invariant cache hit.
[2023-03-18 19:12:56] [INFO ] Dead Transitions using invariants and state equation in 1169 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4613 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration timeout after 39250 steps with 456 reset in 10002 ms.
Product exploration timeout after 38990 steps with 453 reset in 10001 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-18 19:13:17] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 25 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:13:32] [INFO ] Invariant cache hit.
[2023-03-18 19:13:33] [INFO ] Implicit Places using invariants in 949 ms returned []
[2023-03-18 19:13:33] [INFO ] Invariant cache hit.
[2023-03-18 19:13:36] [INFO ] Implicit Places using invariants and state equation in 2428 ms returned []
Implicit Place search using SMT with State Equation took 3379 ms to find 0 implicit places.
[2023-03-18 19:13:36] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-18 19:13:36] [INFO ] Invariant cache hit.
[2023-03-18 19:13:37] [INFO ] Dead Transitions using invariants and state equation in 1170 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4636 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2023-03-18 19:13:38] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration timeout after 38470 steps with 447 reset in 10004 ms.
Product exploration timeout after 38290 steps with 445 reset in 10003 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 24 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 19:14:13] [INFO ] Invariant cache hit.
[2023-03-18 19:14:14] [INFO ] Implicit Places using invariants in 930 ms returned []
[2023-03-18 19:14:14] [INFO ] Invariant cache hit.
[2023-03-18 19:14:17] [INFO ] Implicit Places using invariants and state equation in 2563 ms returned []
Implicit Place search using SMT with State Equation took 3501 ms to find 0 implicit places.
[2023-03-18 19:14:17] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-18 19:14:17] [INFO ] Invariant cache hit.
[2023-03-18 19:14:18] [INFO ] Dead Transitions using invariants and state equation in 1178 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4756 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-12 finished in 87537 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)))'
[2023-03-18 19:14:19] [INFO ] Flatten gal took : 101 ms
[2023-03-18 19:14:19] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 7 ms.
[2023-03-18 19:14:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2704 places, 2197 transitions and 8788 arcs took 11 ms.
Total runtime 1397333 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-COL-AN13
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

FORMULA Sudoku-COL-AN13-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679167008165

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:153
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:168
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 24 (type SKEL/FNDP) for 0 Sudoku-COL-AN13-LTLCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type SKEL/EQUN) for 0 Sudoku-COL-AN13-LTLCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 26 (type SKEL/SRCH) for 0 Sudoku-COL-AN13-LTLCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 27 (type SKEL/SRCH) for 0 Sudoku-COL-AN13-LTLCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 26 (type SKEL/SRCH) for Sudoku-COL-AN13-LTLCardinality-04
lola: result : true
lola: markings : 170
lola: fired transitions : 169
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 24 (type FNDP) for Sudoku-COL-AN13-LTLCardinality-04 (obsolete)
lola: CANCELED task # 25 (type EQUN) for Sudoku-COL-AN13-LTLCardinality-04 (obsolete)
lola: CANCELED task # 27 (type SRCH) for Sudoku-COL-AN13-LTLCardinality-04 (obsolete)
lola: FINISHED task # 24 (type SKEL/FNDP) for Sudoku-COL-AN13-LTLCardinality-04
lola: result : true
lola: fired transitions : 168
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/373/LTLCardinality-25.sara.

lola: Created skeleton in 1.000000 secs.
lola: FINISHED task # 25 (type SKEL/EQUN) for Sudoku-COL-AN13-LTLCardinality-04
lola: result : true
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 5 (type EXCL) for 0 Sudoku-COL-AN13-LTLCardinality-04
lola: time limit : 513 sec
lola: memory limit: 32 pages
lola: FINISHED task # 5 (type EXCL) for Sudoku-COL-AN13-LTLCardinality-04
lola: result : true
lola: markings : 2198
lola: fired transitions : 2197
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 31 (type EXCL) for 0 Sudoku-COL-AN13-LTLCardinality-04
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 29 (type FNDP) for 0 Sudoku-COL-AN13-LTLCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 30 (type EQUN) for 0 Sudoku-COL-AN13-LTLCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 32 (type SRCH) for 0 Sudoku-COL-AN13-LTLCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 32 (type SRCH) for Sudoku-COL-AN13-LTLCardinality-04
lola: result : unknown
lola: time used : 0.000000
lola: memory pages used : 1
sara: try reading problem file /home/mcc/execution/373/LTLCardinality-30.sara.
sara: place or transition ordering is non-deterministic
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-04: CONJ 0 0 3 0 6 0 0 1
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
29 EF FNDP 4/3597 0/5 Sudoku-COL-AN13-LTLCardinality-04 66131 t fired, 440 attempts, .
30 EF STEQ 4/3597 0/5 Sudoku-COL-AN13-LTLCardinality-04 sara is running.
31 EF EXCL 4/599 1/32 Sudoku-COL-AN13-LTLCardinality-04 79646 m, 15929 m/sec, 460712 t fired, .

Time elapsed: 7 secs. Pages in use: 2
# running tasks: 3 of 4 Visible: 6

lola: FINISHED task # 30 (type EQUN) for Sudoku-COL-AN13-LTLCardinality-04
lola: result : true
lola: CANCELED task # 29 (type FNDP) for Sudoku-COL-AN13-LTLCardinality-04 (obsolete)
lola: CANCELED task # 31 (type EXCL) for Sudoku-COL-AN13-LTLCardinality-04 (obsolete)
lola: LAUNCH task # 17 (type EXCL) for 16 Sudoku-COL-AN13-LTLCardinality-12
lola: time limit : 718 sec
lola: memory limit: 32 pages
lola: FINISHED task # 29 (type FNDP) for Sudoku-COL-AN13-LTLCardinality-04
lola: result : unknown
lola: fired transitions : 116137
lola: tried executions : 773
lola: time used : 7.000000
lola: memory pages used : 0
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 2/718 3/32 Sudoku-COL-AN13-LTLCardinality-12 88067 m, 17613 m/sec, 116948 t fired, .

Time elapsed: 12 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 7/718 7/32 Sudoku-COL-AN13-LTLCardinality-12 229469 m, 28280 m/sec, 430285 t fired, .

Time elapsed: 17 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 12/718 12/32 Sudoku-COL-AN13-LTLCardinality-12 387378 m, 31581 m/sec, 737814 t fired, .

Time elapsed: 22 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 17/718 17/32 Sudoku-COL-AN13-LTLCardinality-12 549463 m, 32417 m/sec, 1041410 t fired, .

Time elapsed: 27 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 22/718 21/32 Sudoku-COL-AN13-LTLCardinality-12 685903 m, 27288 m/sec, 1357228 t fired, .

Time elapsed: 32 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 27/718 26/32 Sudoku-COL-AN13-LTLCardinality-12 849759 m, 32771 m/sec, 1660094 t fired, .

Time elapsed: 37 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 32/718 31/32 Sudoku-COL-AN13-LTLCardinality-12 1005127 m, 31073 m/sec, 1973115 t fired, .

Time elapsed: 42 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 17 (type EXCL) for Sudoku-COL-AN13-LTLCardinality-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 47 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 14 (type EXCL) for 13 Sudoku-COL-AN13-LTLCardinality-09
lola: time limit : 888 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 5/888 5/32 Sudoku-COL-AN13-LTLCardinality-09 183849 m, 36769 m/sec, 187011 t fired, .

Time elapsed: 52 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 10/888 9/32 Sudoku-COL-AN13-LTLCardinality-09 362096 m, 35649 m/sec, 376181 t fired, .

Time elapsed: 57 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 15/888 13/32 Sudoku-COL-AN13-LTLCardinality-09 539863 m, 35553 m/sec, 574012 t fired, .

Time elapsed: 62 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 20/888 17/32 Sudoku-COL-AN13-LTLCardinality-09 713515 m, 34730 m/sec, 776388 t fired, .

Time elapsed: 67 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 25/888 23/32 Sudoku-COL-AN13-LTLCardinality-09 883606 m, 34018 m/sec, 986498 t fired, .

Time elapsed: 72 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 30/888 27/32 Sudoku-COL-AN13-LTLCardinality-09 1045746 m, 32428 m/sec, 1198791 t fired, .

Time elapsed: 77 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 14 (type EXCL) for Sudoku-COL-AN13-LTLCardinality-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 83 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 11 (type EXCL) for 10 Sudoku-COL-AN13-LTLCardinality-08
lola: time limit : 1172 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 5/1172 5/32 Sudoku-COL-AN13-LTLCardinality-08 196550 m, 39310 m/sec, 200055 t fired, .

Time elapsed: 88 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 10/1172 10/32 Sudoku-COL-AN13-LTLCardinality-08 385009 m, 37691 m/sec, 400509 t fired, .

Time elapsed: 93 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 15/1172 12/32 Sudoku-COL-AN13-LTLCardinality-08 480704 m, 19139 m/sec, 505974 t fired, .

Time elapsed: 98 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 20/1172 13/32 Sudoku-COL-AN13-LTLCardinality-08 531636 m, 10186 m/sec, 563148 t fired, .

Time elapsed: 103 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 25/1172 14/32 Sudoku-COL-AN13-LTLCardinality-08 599589 m, 13590 m/sec, 640757 t fired, .

Time elapsed: 108 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 30/1172 16/32 Sudoku-COL-AN13-LTLCardinality-08 651206 m, 10323 m/sec, 700676 t fired, .

Time elapsed: 113 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 35/1172 17/32 Sudoku-COL-AN13-LTLCardinality-08 713387 m, 12436 m/sec, 773566 t fired, .

Time elapsed: 118 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 42/1172 19/32 Sudoku-COL-AN13-LTLCardinality-08 790811 m, 15484 m/sec, 866684 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 48/1172 21/32 Sudoku-COL-AN13-LTLCardinality-08 858642 m, 13566 m/sec, 950439 t fired, .

Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN13-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN13-LTLCardinality-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 64/1172 22/32 Sudoku-COL-AN13-LTLCardinality-08/home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin//../BenchKit_head.sh: line 63: 2579 Killed lola --conf=$BIN_DIR/configfiles/ltlcardinalityconf --formula=$DIR/LTLCardinality.xml --verdictfile=$DIR/GenericPropertiesVerdict.xml $DIR/model.pnml

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="Sudoku-COL-AN13"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Sudoku-COL-AN13, 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 r487-tall-167912702600099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN13.tgz
mv Sudoku-COL-AN13 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 ;