fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r417-tall-171690556400432
Last Updated
July 7, 2024

About the Execution of 2023-gold for Sudoku-PT-AN16

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16213.899 3600000.00 9743871.00 37437.00 FTTF?T?TFFTFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r417-tall-171690556400432.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Sudoku-PT-AN16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556400432
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 119M
-rw-r--r-- 1 mcc users 1.6M Apr 12 12:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.8M Apr 12 12:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9M Apr 12 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 18M Apr 12 10:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 698K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.2M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7M Apr 12 14:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22M Apr 12 14:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7M Apr 12 12:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40M Apr 12 12:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 144K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 345K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.3M May 18 16:43 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-PT-AN16-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717158907169

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN16
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 12:35:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 12:35:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 12:35:09] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2024-05-31 12:35:09] [INFO ] Transformed 4864 places.
[2024-05-31 12:35:09] [INFO ] Transformed 4096 transitions.
[2024-05-31 12:35:09] [INFO ] Found NUPN structural information;
[2024-05-31 12:35:09] [INFO ] Parsed PT model containing 4864 places and 4096 transitions and 16384 arcs in 315 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 668 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN16-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4864 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 48 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2024-05-31 12:35:14] [INFO ] Computed 768 invariants in 60 ms
[2024-05-31 12:35:15] [INFO ] Implicit Places using invariants in 4804 ms returned []
[2024-05-31 12:35:15] [INFO ] Invariant cache hit.
[2024-05-31 12:35:15] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 5669 ms to find 0 implicit places.
[2024-05-31 12:35:15] [INFO ] Invariant cache hit.
[2024-05-31 12:35:17] [INFO ] Dead Transitions using invariants and state equation in 1265 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6990 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Support contains 4864 out of 4864 places after structural reductions.
[2024-05-31 12:35:17] [INFO ] Flatten gal took : 358 ms
[2024-05-31 12:35:18] [INFO ] Flatten gal took : 216 ms
[2024-05-31 12:35:18] [INFO ] Input system was already deterministic with 4096 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 5102 ms. (steps per millisecond=1 ) properties (out of 27) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2057 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-31 12:35:27] [INFO ] Invariant cache hit.
[2024-05-31 12:35:30] [INFO ] After 1390ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2024-05-31 12:35:32] [INFO ] [Nat]Absence check using 768 positive place invariants in 291 ms returned sat
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.checkResults(DeadlockTester.java:800)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:624)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 12:35:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 12:35:55] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:6
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 78 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 4854 ms. (steps per millisecond=2 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2056 ms. (steps per millisecond=4 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 150639 steps, run timeout after 21109 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 150639 steps, saw 150594 distinct states, run finished after 21112 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-31 12:36:24] [INFO ] Invariant cache hit.
[2024-05-31 12:36:27] [INFO ] [Real]Absence check using 768 positive place invariants in 292 ms returned sat
[2024-05-31 12:36:51] [INFO ] After 25025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 12:36:52] [INFO ] [Nat]Absence check using 768 positive place invariants in 287 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:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 12:37:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 12:37:16] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 93 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 287 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 12:37:16] [INFO ] Invariant cache hit.
[2024-05-31 12:37:17] [INFO ] Implicit Places using invariants in 782 ms returned []
[2024-05-31 12:37:17] [INFO ] Invariant cache hit.
[2024-05-31 12:37:18] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1477 ms to find 0 implicit places.
[2024-05-31 12:37:18] [INFO ] Redundant transitions in 269 ms returned []
[2024-05-31 12:37:18] [INFO ] Invariant cache hit.
[2024-05-31 12:37:19] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2798 ms. Remains : 4864/4864 places, 4096/4096 transitions.
FORMULA Sudoku-PT-AN16-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 154 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 12:37:19] [INFO ] Invariant cache hit.
[2024-05-31 12:37:20] [INFO ] Implicit Places using invariants in 783 ms returned []
[2024-05-31 12:37:20] [INFO ] Invariant cache hit.
[2024-05-31 12:37:21] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1534 ms to find 0 implicit places.
[2024-05-31 12:37:21] [INFO ] Invariant cache hit.
[2024-05-31 12:37:22] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2388 ms. Remains : 4864/4864 places, 4096/4096 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT 1 (ADD s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 228 steps with 0 reset in 104 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-00 finished in 2816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 223 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 12:37:22] [INFO ] Invariant cache hit.
[2024-05-31 12:37:23] [INFO ] Implicit Places using invariants in 741 ms returned []
[2024-05-31 12:37:23] [INFO ] Invariant cache hit.
[2024-05-31 12:37:24] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 1454 ms to find 0 implicit places.
[2024-05-31 12:37:24] [INFO ] Invariant cache hit.
[2024-05-31 12:37:24] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2405 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-03 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:(LEQ (ADD s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 s...], 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 129 steps with 0 reset in 90 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-03 finished in 2646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X(G(p1))) U G(p2))))'
Support contains 4864 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 18 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 12:37:25] [INFO ] Invariant cache hit.
[2024-05-31 12:37:25] [INFO ] Implicit Places using invariants in 782 ms returned []
[2024-05-31 12:37:25] [INFO ] Invariant cache hit.
[2024-05-31 12:37:26] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 1466 ms to find 0 implicit places.
[2024-05-31 12:37:26] [INFO ] Invariant cache hit.
[2024-05-31 12:37:27] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2213 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p2), (NOT p2), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p2 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 2 (ADD s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 20230 steps with 89 reset in 10005 ms.
Product exploration timeout after 20390 steps with 90 reset in 10008 ms.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
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) p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND p2 p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 291 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (NOT p2), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 5238 ms. (steps per millisecond=1 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1106 ms. (steps per millisecond=9 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1084 ms. (steps per millisecond=9 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1091 ms. (steps per millisecond=9 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1083 ms. (steps per millisecond=9 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-31 12:38:00] [INFO ] Invariant cache hit.
[2024-05-31 12:38:05] [INFO ] After 1134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 12:38:06] [INFO ] [Nat]Absence check using 768 positive place invariants in 307 ms returned sat
[2024-05-31 12:38:07] [INFO ] After 2290ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND p2 p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G p1), (G (NOT (AND (NOT p0) p2))), (G (NOT (AND (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p2 (NOT p1))))]
False Knowledge obtained : [(F p2), (F (AND p0 p2)), (F (NOT (AND p0 (NOT p2)))), (F (NOT (AND (NOT p2) p1))), (F (AND p2 p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 1162 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
[2024-05-31 12:38:10] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
Support contains 4096 out of 4864 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 50 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 12:38:25] [INFO ] Invariant cache hit.
[2024-05-31 12:38:26] [INFO ] Implicit Places using invariants in 723 ms returned []
[2024-05-31 12:38:26] [INFO ] Invariant cache hit.
[2024-05-31 12:38:27] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
[2024-05-31 12:38:27] [INFO ] Redundant transitions in 220 ms returned []
[2024-05-31 12:38:27] [INFO ] Invariant cache hit.
[2024-05-31 12:38:28] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2316 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
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), (X (NOT p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 27 ms :[(NOT p2)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
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 37 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p2)]
[2024-05-31 12:38:32] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 37 ms :[(NOT p2)]
Product exploration timeout after 23160 steps with 102 reset in 10004 ms.
Product exploration timeout after 22870 steps with 101 reset in 10007 ms.
Built C files in :
/tmp/ltsmin11340792545933771238
[2024-05-31 12:39:07] [INFO ] Too many transitions (4096) to apply POR reductions. Disabling POR matrices.
[2024-05-31 12:39:07] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11340792545933771238
Running compilation step : cd /tmp/ltsmin11340792545933771238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11340792545933771238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11340792545933771238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 83 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 12:39:10] [INFO ] Invariant cache hit.
[2024-05-31 12:39:11] [INFO ] Implicit Places using invariants in 780 ms returned []
[2024-05-31 12:39:11] [INFO ] Invariant cache hit.
[2024-05-31 12:39:12] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1571 ms to find 0 implicit places.
[2024-05-31 12:39:12] [INFO ] Redundant transitions in 148 ms returned []
[2024-05-31 12:39:12] [INFO ] Invariant cache hit.
[2024-05-31 12:39:12] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2527 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Built C files in :
/tmp/ltsmin14330390317381089644
[2024-05-31 12:39:12] [INFO ] Too many transitions (4096) to apply POR reductions. Disabling POR matrices.
[2024-05-31 12:39:13] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14330390317381089644
Running compilation step : cd /tmp/ltsmin14330390317381089644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14330390317381089644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14330390317381089644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 12:39:16] [INFO ] Flatten gal took : 207 ms
[2024-05-31 12:39:16] [INFO ] Flatten gal took : 185 ms
[2024-05-31 12:39:17] [INFO ] Time to serialize gal into /tmp/LTL10130913355798617094.gal : 435 ms
[2024-05-31 12:39:17] [INFO ] Time to serialize properties into /tmp/LTL7000837320081002813.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10130913355798617094.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9787957009018731663.hoa' '-atoms' '/tmp/LTL7000837320081002813.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7000837320081002813.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9787957009018731663.hoa
Detected timeout of ITS tools.
[2024-05-31 12:39:32] [INFO ] Flatten gal took : 202 ms
[2024-05-31 12:39:32] [INFO ] Flatten gal took : 181 ms
[2024-05-31 12:39:32] [INFO ] Time to serialize gal into /tmp/LTL15532213846016484828.gal : 25 ms
[2024-05-31 12:39:32] [INFO ] Time to serialize properties into /tmp/LTL8792683596272030423.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15532213846016484828.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8792683596272030423.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((("(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+R...75829
Formula 0 simplified : X((!"(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+Ro...75820
Detected timeout of ITS tools.
[2024-05-31 12:39:48] [INFO ] Flatten gal took : 158 ms
[2024-05-31 12:39:48] [INFO ] Applying decomposition
[2024-05-31 12:39:48] [INFO ] Flatten gal took : 169 ms
[2024-05-31 12:40:05] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7209656971127421925.txt' '-o' '/tmp/graph7209656971127421925.bin' '-w' '/tmp/graph7209656971127421925.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:663)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:341)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 12:40:05] [INFO ] Flatten gal took : 162 ms
[2024-05-31 12:40:05] [INFO ] Time to serialize gal into /tmp/LTL4940321212489867714.gal : 25 ms
[2024-05-31 12:40:05] [INFO ] Time to serialize properties into /tmp/LTL15252119060685182875.ltl : 361 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4940321212489867714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15252119060685182875.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((("(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+R...75829
Formula 0 simplified : X((!"(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+Ro...75820
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5479181193028114738
[2024-05-31 12:40:20] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5479181193028114738
Running compilation step : cd /tmp/ltsmin5479181193028114738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5479181193028114738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5479181193028114738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-PT-AN16-LTLCardinality-04 finished in 178908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||X(X(p1)))))'
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 31 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 12:40:23] [INFO ] Invariant cache hit.
[2024-05-31 12:40:24] [INFO ] Implicit Places using invariants in 800 ms returned []
[2024-05-31 12:40:24] [INFO ] Invariant cache hit.
[2024-05-31 12:40:25] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1598 ms to find 0 implicit places.
[2024-05-31 12:40:25] [INFO ] Invariant cache hit.
[2024-05-31 12:40:26] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2404 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 863 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1)), (NOT p1), true, (AND (NOT p1) p0), p0]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 4}], [{ cond=p0, acceptance={} source=7 dest: 5}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=1, aps=[p1:(LEQ 3 (ADD s4608 s4609 s4610 s4611 s4612 s4613 s4614 s4615 s4616 s4617 s4618 s4619 s4620 s4621 s4622 s4623 s4624 s4625 s4626 s4627 s4628 s4629 s4630 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 13780 steps with 3445 reset in 10007 ms.
Product exploration timeout after 13590 steps with 3397 reset in 10008 ms.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 4419 ms. (steps per millisecond=2 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 950 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 975 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 12:40:56] [INFO ] Invariant cache hit.
[2024-05-31 12:40:58] [INFO ] [Real]Absence check using 768 positive place invariants in 287 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:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 12:41:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 12:41:21] [INFO ] After 25047ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 45 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 4661 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 953 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 956 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Probabilistic random walk after 133193 steps, saw 133154 distinct states, run finished after 18009 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-31 12:41:46] [INFO ] Invariant cache hit.
[2024-05-31 12:41:49] [INFO ] [Real]Absence check using 768 positive place invariants in 285 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:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 12:42:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 12:42:13] [INFO ] After 25050ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 53 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 42 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 12:42:13] [INFO ] Invariant cache hit.
[2024-05-31 12:42:13] [INFO ] Implicit Places using invariants in 813 ms returned []
[2024-05-31 12:42:13] [INFO ] Invariant cache hit.
[2024-05-31 12:42:14] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 1537 ms to find 0 implicit places.
[2024-05-31 12:42:14] [INFO ] Redundant transitions in 153 ms returned []
[2024-05-31 12:42:14] [INFO ] Invariant cache hit.
[2024-05-31 12:42:15] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2404 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 41 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-31 12:42:15] [INFO ] Invariant cache hit.
[2024-05-31 12:42:17] [INFO ] [Real]Absence check using 768 positive place invariants in 325 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:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:218)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:279)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 12:46:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 12:46:01] [INFO ] After 225040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 p0), (X (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 486 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 30 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 12:46:02] [INFO ] Invariant cache hit.
[2024-05-31 12:46:03] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-05-31 12:46:03] [INFO ] Invariant cache hit.
[2024-05-31 12:46:04] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 1375 ms to find 0 implicit places.
[2024-05-31 12:46:04] [INFO ] Invariant cache hit.
[2024-05-31 12:46:04] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2092 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 4500 ms. (steps per millisecond=2 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 976 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 12:46:13] [INFO ] Invariant cache hit.
[2024-05-31 12:46:16] [INFO ] [Real]Absence check using 768 positive place invariants in 289 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:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 12:46:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 12:46:40] [INFO ] After 25041ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 44 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 4606 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 960 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 949 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Probabilistic random walk after 132193 steps, saw 132154 distinct states, run finished after 18066 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-31 12:47:05] [INFO ] Invariant cache hit.
[2024-05-31 12:47:07] [INFO ] [Real]Absence check using 768 positive place invariants in 427 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:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 12:47:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 12:47:31] [INFO ] After 25063ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 39 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 38 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 12:47:31] [INFO ] Invariant cache hit.
[2024-05-31 12:47:32] [INFO ] Implicit Places using invariants in 879 ms returned []
[2024-05-31 12:47:32] [INFO ] Invariant cache hit.
[2024-05-31 12:47:32] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
[2024-05-31 12:47:32] [INFO ] Redundant transitions in 151 ms returned []
[2024-05-31 12:47:32] [INFO ] Invariant cache hit.
[2024-05-31 12:47:33] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2392 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 40 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-31 12:47:33] [INFO ] Invariant cache hit.
[2024-05-31 12:47:36] [INFO ] [Real]Absence check using 768 positive place invariants in 285 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:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:218)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:279)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 12:51:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 12:51:19] [INFO ] After 225040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration timeout after 14550 steps with 3637 reset in 10001 ms.
Product exploration timeout after 14460 steps with 3615 reset in 10003 ms.
Applying partial POR strategy [true, true, false, true, true, false, false]
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 146 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 12:51:41] [INFO ] Redundant transitions in 154 ms returned []
[2024-05-31 12:51:41] [INFO ] Invariant cache hit.
[2024-05-31 12:51:42] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1000 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Built C files in :
/tmp/ltsmin7988397423181262322
[2024-05-31 12:51:42] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7988397423181262322
Running compilation step : cd /tmp/ltsmin7988397423181262322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7988397423181262322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7988397423181262322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 48 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 12:51:45] [INFO ] Invariant cache hit.
[2024-05-31 12:51:46] [INFO ] Implicit Places using invariants in 701 ms returned []
[2024-05-31 12:51:46] [INFO ] Invariant cache hit.
[2024-05-31 12:51:46] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1426 ms to find 0 implicit places.
[2024-05-31 12:51:46] [INFO ] Invariant cache hit.
[2024-05-31 12:51:47] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2275 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Built C files in :
/tmp/ltsmin10095395892372878494
[2024-05-31 12:51:47] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10095395892372878494
Running compilation step : cd /tmp/ltsmin10095395892372878494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10095395892372878494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10095395892372878494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 12:51:51] [INFO ] Flatten gal took : 150 ms
[2024-05-31 12:51:51] [INFO ] Flatten gal took : 182 ms
[2024-05-31 12:51:51] [INFO ] Time to serialize gal into /tmp/LTL7610283432777424827.gal : 22 ms
[2024-05-31 12:51:51] [INFO ] Time to serialize properties into /tmp/LTL2912415792291692743.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7610283432777424827.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1053721072645154073.hoa' '-atoms' '/tmp/LTL2912415792291692743.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2912415792291692743.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1053721072645154073.hoa
Detected timeout of ITS tools.
[2024-05-31 12:52:06] [INFO ] Flatten gal took : 177 ms
[2024-05-31 12:52:06] [INFO ] Flatten gal took : 206 ms
[2024-05-31 12:52:06] [INFO ] Time to serialize gal into /tmp/LTL4933968163509751969.gal : 20 ms
[2024-05-31 12:52:07] [INFO ] Time to serialize properties into /tmp/LTL12222970152534810593.ltl : 76 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4933968163509751969.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12222970152534810593.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Bo...65780
Formula 0 simplified : X(F!"(((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Boar...65770
Detected timeout of ITS tools.
[2024-05-31 12:52:22] [INFO ] Flatten gal took : 191 ms
[2024-05-31 12:52:22] [INFO ] Applying decomposition
[2024-05-31 12:52:22] [INFO ] Flatten gal took : 153 ms
[2024-05-31 12:52:39] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5838374580224388704.txt' '-o' '/tmp/graph5838374580224388704.bin' '-w' '/tmp/graph5838374580224388704.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:663)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:341)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 12:52:39] [INFO ] Flatten gal took : 150 ms
[2024-05-31 12:52:39] [INFO ] Time to serialize gal into /tmp/LTL3447369917994664773.gal : 21 ms
[2024-05-31 12:52:39] [INFO ] Time to serialize properties into /tmp/LTL5785470381904207348.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3447369917994664773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5785470381904207348.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Bo...65780
Formula 0 simplified : X(F!"(((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Boar...65770
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16682680796177807839
[2024-05-31 12:52:54] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16682680796177807839
Running compilation step : cd /tmp/ltsmin16682680796177807839;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16682680796177807839;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16682680796177807839;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-PT-AN16-LTLCardinality-06 finished in 753914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 4608 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 19 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 12:52:57] [INFO ] Invariant cache hit.
[2024-05-31 12:52:58] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-05-31 12:52:58] [INFO ] Invariant cache hit.
[2024-05-31 12:52:59] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
[2024-05-31 12:52:59] [INFO ] Invariant cache hit.
[2024-05-31 12:52:59] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1991 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (GT (ADD s4608 s4609 s4610 s4611 s4612 s4613 s4614 s4615 s4616 s4617 s4618 s4619 s4620 s4621 s4622 s4623 s4624 s4625 s4626 s4627 s4628 s4629 s4630 ...], 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 19440 steps with 9720 reset in 10005 ms.
Product exploration timeout after 19420 steps with 9710 reset in 10005 ms.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) 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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN16-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN16-LTLCardinality-07 finished in 24478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&X(G((G(p3)||p2))))))))'
Support contains 6 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 769 are kept as prefixes of interest. Removing 4095 places using SCC suffix rule.12 ms
Discarding 4095 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 258 ms. Remains 769 /4864 variables (removed 4095) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 769 cols
[2024-05-31 12:53:22] [INFO ] Computed 47 invariants in 379 ms
[2024-05-31 12:53:27] [INFO ] Implicit Places using invariants in 4970 ms returned []
[2024-05-31 12:53:27] [INFO ] Invariant cache hit.
[2024-05-31 12:53:58] [INFO ] Performed 706/769 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 12:54:01] [INFO ] Implicit Places using invariants and state equation in 33948 ms returned []
Implicit Place search using SMT with State Equation took 38921 ms to find 0 implicit places.
[2024-05-31 12:54:01] [INFO ] Redundant transitions in 150 ms returned []
[2024-05-31 12:54:01] [INFO ] Invariant cache hit.
[2024-05-31 12:54:04] [INFO ] Dead Transitions using invariants and state equation in 2729 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 769/4864 places, 4096/4096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42077 ms. Remains : 769/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1, 2} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p3)), acceptance={0, 2} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={1, 2} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={1} source=2 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={1, 2} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p3), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={1, 2} source=3 dest: 3}, { cond=(AND p0 p1 p3), acceptance={1} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p3), acceptance={1, 2} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0, 2} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={1, 2} source=4 dest: 3}, { cond=(AND p0 p2 p3), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p0) p2 p3), acceptance={2} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={1, 2} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s256 1), p0:(EQ s246 1), p2:(OR (EQ s186 0) (EQ s300 1)), p3:(OR (EQ s248 0) (EQ s358 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 226 steps with 0 reset in 60 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-08 finished in 42433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 4 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4094 places and 0 transitions.
Iterating post reduction 0 with 4094 rules applied. Total rules applied 4094 place count 770 transition count 4096
Applied a total of 4094 rules in 126 ms. Remains 770 /4864 variables (removed 4094) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 770 cols
[2024-05-31 12:54:05] [INFO ] Computed 47 invariants in 564 ms
[2024-05-31 12:54:09] [INFO ] Implicit Places using invariants in 4879 ms returned []
[2024-05-31 12:54:09] [INFO ] Invariant cache hit.
[2024-05-31 12:54:41] [INFO ] Performed 708/770 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 12:54:43] [INFO ] Implicit Places using invariants and state equation in 33278 ms returned []
Implicit Place search using SMT with State Equation took 38162 ms to find 0 implicit places.
[2024-05-31 12:54:43] [INFO ] Invariant cache hit.
[2024-05-31 12:54:45] [INFO ] Dead Transitions using invariants and state equation in 2515 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 770/4864 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40814 ms. Remains : 770/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s256 0) (EQ s260 1)), p0:(AND (EQ s257 0) (EQ s515 1))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 137 steps with 0 reset in 59 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-11 finished in 41051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p2)||p1))||p0)))'
Support contains 4 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 768 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.8 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 112 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2024-05-31 12:54:46] [INFO ] Computed 47 invariants in 322 ms
[2024-05-31 12:54:50] [INFO ] Implicit Places using invariants in 4676 ms returned []
[2024-05-31 12:54:50] [INFO ] Invariant cache hit.
[2024-05-31 12:55:07] [INFO ] Implicit Places using invariants and state equation in 17312 ms returned []
Implicit Place search using SMT with State Equation took 21994 ms to find 0 implicit places.
[2024-05-31 12:55:08] [INFO ] Redundant transitions in 151 ms returned []
[2024-05-31 12:55:08] [INFO ] Invariant cache hit.
[2024-05-31 12:55:10] [INFO ] Dead Transitions using invariants and state equation in 2638 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 768/4864 places, 4096/4096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24907 ms. Remains : 768/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s440 0) (EQ s209 1)), p1:(OR (EQ s599 0) (EQ s65 1)), p2:(OR (EQ s599 0) (EQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2035 steps with 8 reset in 537 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-12 finished in 25592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(F(p0)&&G(p1)))))'
Support contains 2 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 769 are kept as prefixes of interest. Removing 4095 places using SCC suffix rule.7 ms
Discarding 4095 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 119 ms. Remains 769 /4864 variables (removed 4095) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 769 cols
[2024-05-31 12:55:11] [INFO ] Computed 47 invariants in 285 ms
[2024-05-31 12:55:16] [INFO ] Implicit Places using invariants in 4542 ms returned []
[2024-05-31 12:55:16] [INFO ] Invariant cache hit.
[2024-05-31 12:55:31] [INFO ] Implicit Places using invariants and state equation in 15096 ms returned []
Implicit Place search using SMT with State Equation took 19646 ms to find 0 implicit places.
[2024-05-31 12:55:31] [INFO ] Redundant transitions in 151 ms returned []
[2024-05-31 12:55:31] [INFO ] Invariant cache hit.
[2024-05-31 12:55:34] [INFO ] Dead Transitions using invariants and state equation in 2720 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 769/4864 places, 4096/4096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22651 ms. Remains : 769/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s123 0), p1:(AND (EQ s123 1) (EQ s256 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 907 steps with 3 reset in 242 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-13 finished in 23040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(F((!p0&&F(!p1))))&&G(!p1))||G((F(!p1)&&F(!p0))))))'
Support contains 4 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 768 transition count 4096
Applied a total of 4096 rules in 102 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2024-05-31 12:55:34] [INFO ] Computed 47 invariants in 267 ms
[2024-05-31 12:55:39] [INFO ] Implicit Places using invariants in 4633 ms returned []
[2024-05-31 12:55:39] [INFO ] Invariant cache hit.
[2024-05-31 12:56:05] [INFO ] Implicit Places using invariants and state equation in 25867 ms returned []
Implicit Place search using SMT with State Equation took 30501 ms to find 0 implicit places.
[2024-05-31 12:56:05] [INFO ] Invariant cache hit.
[2024-05-31 12:56:07] [INFO ] Dead Transitions using invariants and state equation in 2797 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 768/4864 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33401 ms. Remains : 768/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 376 ms :[(OR p1 p0), (OR p0 p1), p1, p0, p1]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s713 0) (EQ s91 1)), p0:(OR (EQ s479 0) (EQ s663 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 391 steps with 3 reset in 151 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-14 finished in 33963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X(G(p1))) U G(p2))))'
Found a Lengthening insensitive property : Sudoku-PT-AN16-LTLCardinality-04
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (NOT p2), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 4864 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 59 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2024-05-31 12:56:08] [INFO ] Computed 768 invariants in 49 ms
[2024-05-31 12:56:09] [INFO ] Implicit Places using invariants in 702 ms returned []
[2024-05-31 12:56:09] [INFO ] Invariant cache hit.
[2024-05-31 12:56:10] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
[2024-05-31 12:56:10] [INFO ] Invariant cache hit.
[2024-05-31 12:56:10] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2092 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p2 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 2 (ADD s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 19230 steps with 85 reset in 10006 ms.
Product exploration timeout after 21340 steps with 94 reset in 10001 ms.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
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) p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND p2 p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 313 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (NOT p2), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 5119 ms. (steps per millisecond=1 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1071 ms. (steps per millisecond=9 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1076 ms. (steps per millisecond=9 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1079 ms. (steps per millisecond=9 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1068 ms. (steps per millisecond=9 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-31 12:56:44] [INFO ] Invariant cache hit.
[2024-05-31 12:56:47] [INFO ] After 1150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 12:56:49] [INFO ] [Nat]Absence check using 768 positive place invariants in 325 ms returned sat
[2024-05-31 12:56:49] [INFO ] After 2166ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND p2 p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G p1), (G (NOT (AND (NOT p0) p2))), (G (NOT (AND (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p2 (NOT p1))))]
False Knowledge obtained : [(F p2), (F (AND p0 p2)), (F (NOT (AND p0 (NOT p2)))), (F (NOT (AND (NOT p2) p1))), (F (AND p2 p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 548 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p2)]
[2024-05-31 12:56:52] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
Support contains 4096 out of 4864 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 127 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 12:57:07] [INFO ] Invariant cache hit.
[2024-05-31 12:57:08] [INFO ] Implicit Places using invariants in 677 ms returned []
[2024-05-31 12:57:08] [INFO ] Invariant cache hit.
[2024-05-31 12:57:08] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
[2024-05-31 12:57:09] [INFO ] Redundant transitions in 155 ms returned []
[2024-05-31 12:57:09] [INFO ] Invariant cache hit.
[2024-05-31 12:57:09] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2301 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
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), (X (NOT p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 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 33 ms :[(NOT p2)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 103 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 26 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p2)]
[2024-05-31 12:57:14] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 42 ms :[(NOT p2)]
Product exploration timeout after 23100 steps with 102 reset in 10005 ms.
Product exploration timeout after 22930 steps with 101 reset in 10024 ms.
Built C files in :
/tmp/ltsmin8746808879601993594
[2024-05-31 12:57:49] [INFO ] Too many transitions (4096) to apply POR reductions. Disabling POR matrices.
[2024-05-31 12:57:49] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8746808879601993594
Running compilation step : cd /tmp/ltsmin8746808879601993594;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8746808879601993594;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8746808879601993594;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 99 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 12:57:52] [INFO ] Invariant cache hit.
[2024-05-31 12:57:53] [INFO ] Implicit Places using invariants in 728 ms returned []
[2024-05-31 12:57:53] [INFO ] Invariant cache hit.
[2024-05-31 12:57:54] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1435 ms to find 0 implicit places.
[2024-05-31 12:57:54] [INFO ] Redundant transitions in 154 ms returned []
[2024-05-31 12:57:54] [INFO ] Invariant cache hit.
[2024-05-31 12:57:55] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2470 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Built C files in :
/tmp/ltsmin7983069815826020217
[2024-05-31 12:57:55] [INFO ] Too many transitions (4096) to apply POR reductions. Disabling POR matrices.
[2024-05-31 12:57:55] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7983069815826020217
Running compilation step : cd /tmp/ltsmin7983069815826020217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7983069815826020217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7983069815826020217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 12:57:58] [INFO ] Flatten gal took : 162 ms
[2024-05-31 12:57:58] [INFO ] Flatten gal took : 147 ms
[2024-05-31 12:57:58] [INFO ] Time to serialize gal into /tmp/LTL15157533966172105768.gal : 20 ms
[2024-05-31 12:57:58] [INFO ] Time to serialize properties into /tmp/LTL8389756664237854797.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15157533966172105768.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6858310177648230830.hoa' '-atoms' '/tmp/LTL8389756664237854797.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8389756664237854797.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6858310177648230830.hoa
Detected timeout of ITS tools.
[2024-05-31 12:58:14] [INFO ] Flatten gal took : 187 ms
[2024-05-31 12:58:14] [INFO ] Flatten gal took : 142 ms
[2024-05-31 12:58:14] [INFO ] Time to serialize gal into /tmp/LTL15909472840260567769.gal : 19 ms
[2024-05-31 12:58:14] [INFO ] Time to serialize properties into /tmp/LTL464932979559786680.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15909472840260567769.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL464932979559786680.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((("(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+R...75829
Formula 0 simplified : X((!"(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+Ro...75820
Detected timeout of ITS tools.
[2024-05-31 12:58:29] [INFO ] Flatten gal took : 137 ms
[2024-05-31 12:58:29] [INFO ] Applying decomposition
[2024-05-31 12:58:29] [INFO ] Flatten gal took : 161 ms
[2024-05-31 12:58:48] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1213051105476441164.txt' '-o' '/tmp/graph1213051105476441164.bin' '-w' '/tmp/graph1213051105476441164.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:663)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:341)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 12:58:48] [INFO ] Flatten gal took : 148 ms
[2024-05-31 12:58:48] [INFO ] Time to serialize gal into /tmp/LTL6947013838944282596.gal : 20 ms
[2024-05-31 12:58:48] [INFO ] Time to serialize properties into /tmp/LTL15510549625310317496.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6947013838944282596.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15510549625310317496.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((("(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+R...75829
Formula 0 simplified : X((!"(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+Ro...75820
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10237439953838452957
[2024-05-31 12:59:03] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10237439953838452957
Running compilation step : cd /tmp/ltsmin10237439953838452957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10237439953838452957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10237439953838452957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-PT-AN16-LTLCardinality-04 finished in 178229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||X(X(p1)))))'
[2024-05-31 12:59:06] [INFO ] Flatten gal took : 170 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5277442665074475920
[2024-05-31 12:59:07] [INFO ] Too many transitions (4096) to apply POR reductions. Disabling POR matrices.
[2024-05-31 12:59:07] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5277442665074475920
Running compilation step : cd /tmp/ltsmin5277442665074475920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-31 12:59:07] [INFO ] Applying decomposition
[2024-05-31 12:59:07] [INFO ] Flatten gal took : 170 ms
Compilation finished in 28738 ms.
Running link step : cd /tmp/ltsmin5277442665074475920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin5277442665074475920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true)&&X([]((LTLAPp1==true)))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
[2024-05-31 12:59:42] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16009643324775266716.txt' '-o' '/tmp/graph16009643324775266716.bin' '-w' '/tmp/graph16009643324775266716.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:106)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:855)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 12:59:43] [INFO ] Flatten gal took : 335 ms
[2024-05-31 12:59:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality10066465158528138825.gal : 372 ms
[2024-05-31 12:59:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality18358154780834248792.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10066465158528138825.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18358154780834248792.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !((X((("(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+R...75829
Formula 0 simplified : X((!"(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+Ro...75820
Detected timeout of ITS tools.
[2024-05-31 13:27:44] [INFO ] Applying decomposition
[2024-05-31 13:27:46] [INFO ] Flatten gal took : 1995 ms
[2024-05-31 13:27:47] [INFO ] Decomposing Gal with order
[2024-05-31 13:27:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 13:27:52] [INFO ] Removed a total of 7631 redundant transitions.
[2024-05-31 13:27:53] [INFO ] Flatten gal took : 3713 ms
[2024-05-31 13:27:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 83 ms.
[2024-05-31 13:27:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality7221628105433202032.gal : 67 ms
[2024-05-31 13:27:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality11138999596636614369.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7221628105433202032.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11138999596636614369.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((X((("(((((((((gu277.Rows_0_0+gu278.Rows_0_1)+(gu279.Rows_0_2+gu280.Rows_0_3))+((gu281.Rows_0_4+gu282.Rows_0_5)+(gu283.Rows_0_6+gu28...104703
Formula 0 simplified : X((!"(((((((((gu277.Rows_0_0+gu278.Rows_0_1)+(gu279.Rows_0_2+gu280.Rows_0_3))+((gu281.Rows_0_4+gu282.Rows_0_5)+(gu283.Rows_0_6+gu284...104694
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin5277442665074475920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true)&&X([]((LTLAPp1==true)))) U []((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5277442665074475920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](!(LTLAPp3==true))||X(X((LTLAPp4==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.141: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.142: LTL layer: formula: X(([](!(LTLAPp3==true))||X(X((LTLAPp4==true)))))
pins2lts-mc-linux64( 4/ 8), 0.150: "X(([](!(LTLAPp3==true))||X(X((LTLAPp4==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.153: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.161: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.188: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.188: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.193: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.195: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.200: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.205: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.208: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 7.318: DFS-FIFO for weak LTL, using special progress label 4102
pins2lts-mc-linux64( 0/ 8), 7.319: There are 4103 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 7.319: State length is 4865, there are 4108 groups
pins2lts-mc-linux64( 0/ 8), 7.319: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 7.319: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 7.319: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 7.319: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 49.942: ~1 levels ~960 states ~3888368 transitions
pins2lts-mc-linux64( 2/ 8), 95.922: ~1 levels ~1920 states ~7776368 transitions
pins2lts-mc-linux64( 7/ 8), 145.476: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 240.924:
pins2lts-mc-linux64( 0/ 8), 240.924: mean standard work distribution: 2.8% (states) 2.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 240.924:
pins2lts-mc-linux64( 0/ 8), 240.924: Explored 2674 states 10816090 transitions, fanout: 4044.910
pins2lts-mc-linux64( 0/ 8), 240.924: Total exploration time 233.590 sec (161.550 sec minimum, 186.849 sec on average)
pins2lts-mc-linux64( 0/ 8), 240.924: States per second: 11, Transitions per second: 46304
pins2lts-mc-linux64( 0/ 8), 240.924:
pins2lts-mc-linux64( 0/ 8), 240.924: Progress states detected: 7587036
pins2lts-mc-linux64( 0/ 8), 240.924: Redundant explorations: -99.9648
pins2lts-mc-linux64( 0/ 8), 240.924:
pins2lts-mc-linux64( 0/ 8), 240.924: Queue width: 8B, total height: 8224353, memory: 62.75MB
pins2lts-mc-linux64( 0/ 8), 240.924: Tree memory: 313.9MB, 43.4 B/state, compr.: 0.2%
pins2lts-mc-linux64( 0/ 8), 240.924: Tree fill ratio (roots/leafs): 5.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 240.924: Stored 4436 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 240.924: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 240.924: Est. total memory use: 376.7MB (~1086.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5277442665074475920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](!(LTLAPp3==true))||X(X((LTLAPp4==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5277442665074475920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](!(LTLAPp3==true))||X(X((LTLAPp4==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10955744 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15436676 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Sudoku-PT-AN16, 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 r417-tall-171690556400432"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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