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

About the Execution of 2023-gold for MultiCrashLeafsetExtension-PT-S32C06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11632.367 3600000.00 4443136.00 21844.20 FTF?TFFFFFFTTTFT 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.r263-tall-171654372100112.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 MultiCrashLeafsetExtension-PT-S32C06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372100112
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 24M 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 MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716659241932

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=MultiCrashLeafsetExtension-PT-S32C06
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 17:47:23] [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-25 17:47:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 17:47:24] [INFO ] Load time of PNML (sax parser for PT used): 763 ms
[2024-05-25 17:47:24] [INFO ] Transformed 22816 places.
[2024-05-25 17:47:24] [INFO ] Transformed 35015 transitions.
[2024-05-25 17:47:24] [INFO ] Parsed PT model containing 22816 places and 35015 transitions and 137470 arcs in 1041 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 22816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22816/22816 places, 35015/35015 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 22768 transition count 35015
Applied a total of 48 rules in 1984 ms. Remains 22768 /22816 variables (removed 48) and now considering 35015/35015 (removed 0) transitions.
[2024-05-25 17:47:27] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
// Phase 1: matrix 33959 rows 22768 cols
[2024-05-25 17:47:30] [INFO ] Computed 1565 invariants in 3948 ms
[2024-05-25 17:47:33] [INFO ] Implicit Places using invariants in 6127 ms returned []
Implicit Place search using SMT only with invariants took 6196 ms to find 0 implicit places.
[2024-05-25 17:47:33] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2024-05-25 17:47:33] [INFO ] Invariant cache hit.
[2024-05-25 17:47:34] [INFO ] Dead Transitions using invariants and state equation in 1821 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22768/22816 places, 35015/35015 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10014 ms. Remains : 22768/22816 places, 35015/35015 transitions.
Support contains 37 out of 22768 places after structural reductions.
[2024-05-25 17:47:36] [INFO ] Flatten gal took : 1210 ms
[2024-05-25 17:47:37] [INFO ] Flatten gal took : 913 ms
[2024-05-25 17:47:39] [INFO ] Input system was already deterministic with 35015 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 809 ms. (steps per millisecond=12 ) properties (out of 22) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :1
Running SMT prover for 16 properties.
[2024-05-25 17:47:40] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2024-05-25 17:47:40] [INFO ] Invariant cache hit.
[2024-05-25 17:47:47] [INFO ] After 6750ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-25 17:47:54] [INFO ] [Nat]Absence check using 63 positive place invariants in 298 ms returned sat
[2024-05-25 17:47:55] [INFO ] [Nat]Absence check using 63 positive and 1502 generalized place invariants in 1464 ms returned sat
[2024-05-25 17:48:12] [INFO ] After 13066ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :11
[2024-05-25 17:48:12] [INFO ] State equation strengthened by 11266 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
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-25 17:48:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 17:48:12] [INFO ] After 25294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 19 out of 22768 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Drop transitions removed 6324 transitions
Trivial Post-agglo rules discarded 6324 transitions
Performed 6324 trivial Post agglomeration. Transition count delta: 6324
Iterating post reduction 0 with 6324 rules applied. Total rules applied 6324 place count 22768 transition count 28691
Reduce places removed 6324 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 6330 rules applied. Total rules applied 12654 place count 16444 transition count 28685
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 12660 place count 16438 transition count 28685
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 396 Pre rules applied. Total rules applied 12660 place count 16438 transition count 28289
Deduced a syphon composed of 396 places in 28 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 3 with 792 rules applied. Total rules applied 13452 place count 16042 transition count 28289
Discarding 5928 places :
Symmetric choice reduction at 3 with 5928 rule applications. Total rules 19380 place count 10114 transition count 22361
Iterating global reduction 3 with 5928 rules applied. Total rules applied 25308 place count 10114 transition count 22361
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 25308 place count 10114 transition count 22356
Deduced a syphon composed of 5 places in 17 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 25318 place count 10109 transition count 22356
Discarding 977 places :
Symmetric choice reduction at 3 with 977 rule applications. Total rules 26295 place count 9132 transition count 16494
Iterating global reduction 3 with 977 rules applied. Total rules applied 27272 place count 9132 transition count 16494
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 14 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 27338 place count 9099 transition count 16461
Free-agglomeration rule (complex) applied 587 times.
Iterating global reduction 3 with 587 rules applied. Total rules applied 27925 place count 9099 transition count 20759
Reduce places removed 587 places and 0 transitions.
Iterating post reduction 3 with 587 rules applied. Total rules applied 28512 place count 8512 transition count 20759
Partial Free-agglomeration rule applied 231 times.
Drop transitions removed 231 transitions
Iterating global reduction 4 with 231 rules applied. Total rules applied 28743 place count 8512 transition count 20759
Applied a total of 28743 rules in 11628 ms. Remains 8512 /22768 variables (removed 14256) and now considering 20759/35015 (removed 14256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11630 ms. Remains : 8512/22768 places, 20759/35015 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 764 ms. (steps per millisecond=13 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-25 17:48:25] [INFO ] Flow matrix only has 19194 transitions (discarded 1565 similar events)
// Phase 1: matrix 19194 rows 8512 cols
[2024-05-25 17:48:26] [INFO ] Computed 1565 invariants in 828 ms
[2024-05-25 17:48:28] [INFO ] After 1634ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-25 17:48:30] [INFO ] [Nat]Absence check using 65 positive place invariants in 176 ms returned sat
[2024-05-25 17:48:30] [INFO ] [Nat]Absence check using 65 positive and 1500 generalized place invariants in 542 ms returned sat
[2024-05-25 17:48:53] [INFO ] After 21637ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 17:48:53] [INFO ] State equation strengthened by 11266 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
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-25 17:48:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 17:48:53] [INFO ] After 25199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 16 out of 8512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8512/8512 places, 20759/20759 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8512 transition count 20757
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8510 transition count 20757
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 8510 transition count 20756
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 8509 transition count 20756
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 8508 transition count 20755
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 8508 transition count 20755
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 8508 transition count 20755
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 12 place count 8506 transition count 20753
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 8506 transition count 20753
Applied a total of 14 rules in 6219 ms. Remains 8506 /8512 variables (removed 6) and now considering 20753/20759 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6221 ms. Remains : 8506/8512 places, 20753/20759 transitions.
Incomplete random walk after 10000 steps, including 269 resets, run finished after 741 ms. (steps per millisecond=13 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-25 17:49:01] [INFO ] Flow matrix only has 19188 transitions (discarded 1565 similar events)
// Phase 1: matrix 19188 rows 8506 cols
[2024-05-25 17:49:02] [INFO ] Computed 1565 invariants in 882 ms
[2024-05-25 17:49:03] [INFO ] After 1454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-25 17:49:05] [INFO ] [Nat]Absence check using 65 positive place invariants in 141 ms returned sat
[2024-05-25 17:49:05] [INFO ] [Nat]Absence check using 65 positive and 1500 generalized place invariants in 542 ms returned sat
[2024-05-25 17:49:24] [INFO ] After 18040ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-25 17:49:24] [INFO ] State equation strengthened by 11266 read => feed constraints.
[2024-05-25 17:49:28] [INFO ] After 4016ms SMT Verify possible using 11266 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-25 17:49:28] [INFO ] After 4017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-25 17:49:28] [INFO ] After 25051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 50 ms.
Support contains 12 out of 8506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8506/8506 places, 20753/20753 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8506 transition count 20752
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8505 transition count 20752
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 8505 transition count 20749
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 8502 transition count 20749
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 11 place count 8499 transition count 20746
Iterating global reduction 3 with 3 rules applied. Total rules applied 14 place count 8499 transition count 20746
Applied a total of 14 rules in 3924 ms. Remains 8499 /8506 variables (removed 7) and now considering 20746/20753 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3926 ms. Remains : 8499/8506 places, 20746/20753 transitions.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16752 stabilizing places and 23046 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)))'
Support contains 2 out of 22768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Drop transitions removed 6334 transitions
Trivial Post-agglo rules discarded 6334 transitions
Performed 6334 trivial Post agglomeration. Transition count delta: 6334
Iterating post reduction 0 with 6334 rules applied. Total rules applied 6334 place count 22768 transition count 28681
Reduce places removed 6334 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6336 rules applied. Total rules applied 12670 place count 16434 transition count 28679
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12672 place count 16432 transition count 28679
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 396 Pre rules applied. Total rules applied 12672 place count 16432 transition count 28283
Deduced a syphon composed of 396 places in 24 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 3 with 792 rules applied. Total rules applied 13464 place count 16036 transition count 28283
Discarding 5938 places :
Symmetric choice reduction at 3 with 5938 rule applications. Total rules 19402 place count 10098 transition count 22345
Iterating global reduction 3 with 5938 rules applied. Total rules applied 25340 place count 10098 transition count 22345
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 25340 place count 10098 transition count 22335
Deduced a syphon composed of 10 places in 16 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 25360 place count 10088 transition count 22335
Discarding 988 places :
Symmetric choice reduction at 3 with 988 rule applications. Total rules 26348 place count 9100 transition count 16407
Iterating global reduction 3 with 988 rules applied. Total rules applied 27336 place count 9100 transition count 16407
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 27402 place count 9067 transition count 16374
Applied a total of 27402 rules in 9349 ms. Remains 9067 /22768 variables (removed 13701) and now considering 16374/35015 (removed 18641) transitions.
[2024-05-25 17:49:42] [INFO ] Flow matrix only has 15318 transitions (discarded 1056 similar events)
// Phase 1: matrix 15318 rows 9067 cols
[2024-05-25 17:49:43] [INFO ] Computed 1565 invariants in 718 ms
[2024-05-25 17:49:43] [INFO ] Implicit Places using invariants in 1505 ms returned []
Implicit Place search using SMT only with invariants took 1506 ms to find 0 implicit places.
[2024-05-25 17:49:43] [INFO ] Flow matrix only has 15318 transitions (discarded 1056 similar events)
[2024-05-25 17:49:43] [INFO ] Invariant cache hit.
[2024-05-25 17:49:44] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9067/22768 places, 16374/35015 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11632 ms. Remains : 9067/22768 places, 16374/35015 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 140 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s4488 s4216)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 7 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-00 finished in 11935 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(p0))'
Support contains 3 out of 22768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Drop transitions removed 6334 transitions
Trivial Post-agglo rules discarded 6334 transitions
Performed 6334 trivial Post agglomeration. Transition count delta: 6334
Iterating post reduction 0 with 6334 rules applied. Total rules applied 6334 place count 22768 transition count 28681
Reduce places removed 6334 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6335 rules applied. Total rules applied 12669 place count 16434 transition count 28680
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12670 place count 16433 transition count 28680
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 396 Pre rules applied. Total rules applied 12670 place count 16433 transition count 28284
Deduced a syphon composed of 396 places in 25 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 3 with 792 rules applied. Total rules applied 13462 place count 16037 transition count 28284
Discarding 5938 places :
Symmetric choice reduction at 3 with 5938 rule applications. Total rules 19400 place count 10099 transition count 22346
Iterating global reduction 3 with 5938 rules applied. Total rules applied 25338 place count 10099 transition count 22346
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 25338 place count 10099 transition count 22336
Deduced a syphon composed of 10 places in 16 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 25358 place count 10089 transition count 22336
Discarding 988 places :
Symmetric choice reduction at 3 with 988 rule applications. Total rules 26346 place count 9101 transition count 16408
Iterating global reduction 3 with 988 rules applied. Total rules applied 27334 place count 9101 transition count 16408
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 27400 place count 9068 transition count 16375
Applied a total of 27400 rules in 9420 ms. Remains 9068 /22768 variables (removed 13700) and now considering 16375/35015 (removed 18640) transitions.
[2024-05-25 17:49:54] [INFO ] Flow matrix only has 15319 transitions (discarded 1056 similar events)
// Phase 1: matrix 15319 rows 9068 cols
[2024-05-25 17:49:55] [INFO ] Computed 1565 invariants in 738 ms
[2024-05-25 17:49:55] [INFO ] Implicit Places using invariants in 1561 ms returned []
Implicit Place search using SMT only with invariants took 1563 ms to find 0 implicit places.
[2024-05-25 17:49:55] [INFO ] Flow matrix only has 15319 transitions (discarded 1056 similar events)
[2024-05-25 17:49:55] [INFO ] Invariant cache hit.
[2024-05-25 17:49:56] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9068/22768 places, 16375/35015 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11782 ms. Remains : 9068/22768 places, 16375/35015 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT s2014 s6749) (LEQ 3 s1308))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-02 finished in 11871 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 U p1))))'
Support contains 3 out of 22768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Drop transitions removed 6335 transitions
Trivial Post-agglo rules discarded 6335 transitions
Performed 6335 trivial Post agglomeration. Transition count delta: 6335
Iterating post reduction 0 with 6335 rules applied. Total rules applied 6335 place count 22768 transition count 28680
Reduce places removed 6335 places and 0 transitions.
Iterating post reduction 1 with 6335 rules applied. Total rules applied 12670 place count 16433 transition count 28680
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 12670 place count 16433 transition count 28284
Deduced a syphon composed of 396 places in 22 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 13462 place count 16037 transition count 28284
Discarding 5939 places :
Symmetric choice reduction at 2 with 5939 rule applications. Total rules 19401 place count 10098 transition count 22345
Iterating global reduction 2 with 5939 rules applied. Total rules applied 25340 place count 10098 transition count 22345
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 25340 place count 10098 transition count 22334
Deduced a syphon composed of 11 places in 16 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 25362 place count 10087 transition count 22334
Discarding 989 places :
Symmetric choice reduction at 2 with 989 rule applications. Total rules 26351 place count 9098 transition count 16400
Iterating global reduction 2 with 989 rules applied. Total rules applied 27340 place count 9098 transition count 16400
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 27406 place count 9065 transition count 16367
Applied a total of 27406 rules in 8935 ms. Remains 9065 /22768 variables (removed 13703) and now considering 16367/35015 (removed 18648) transitions.
[2024-05-25 17:50:05] [INFO ] Flow matrix only has 15311 transitions (discarded 1056 similar events)
// Phase 1: matrix 15311 rows 9065 cols
[2024-05-25 17:50:06] [INFO ] Computed 1565 invariants in 752 ms
[2024-05-25 17:50:07] [INFO ] Implicit Places using invariants in 1556 ms returned []
Implicit Place search using SMT only with invariants took 1557 ms to find 0 implicit places.
[2024-05-25 17:50:07] [INFO ] Flow matrix only has 15311 transitions (discarded 1056 similar events)
[2024-05-25 17:50:07] [INFO ] Invariant cache hit.
[2024-05-25 17:50:08] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9065/22768 places, 16367/35015 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11278 ms. Remains : 9065/22768 places, 16367/35015 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 1 s3675), p0:(LEQ s3946 s3798)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2271 reset in 1978 ms.
Product exploration explored 100000 steps with 2271 reset in 2002 ms.
Computed a total of 3082 stabilizing places and 4431 stable transitions
Computed a total of 3082 stabilizing places and 4431 stable transitions
Detected a total of 3082/9065 stabilizing places and 4431/16367 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 115 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 227 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 12509 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 12509 steps, saw 6071 distinct states, run finished after 3003 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 17:50:15] [INFO ] Flow matrix only has 15311 transitions (discarded 1056 similar events)
[2024-05-25 17:50:15] [INFO ] Invariant cache hit.
[2024-05-25 17:50:16] [INFO ] After 1100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 17:50:18] [INFO ] [Nat]Absence check using 65 positive place invariants in 160 ms returned sat
[2024-05-25 17:50:18] [INFO ] [Nat]Absence check using 65 positive and 1500 generalized place invariants in 590 ms returned sat
[2024-05-25 17:50:31] [INFO ] After 12488ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-25 17:50:31] [INFO ] State equation strengthened by 6321 read => feed constraints.
[2024-05-25 17:50:35] [INFO ] After 4271ms SMT Verify possible using 6321 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2024-05-25 17:50:50] [INFO ] Deduced a trap composed of 782 places in 14749 ms of which 14 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
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.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-25 17:50:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 17:50:50] [INFO ] After 33973ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 9065 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9065/9065 places, 16367/16367 transitions.
Free-agglomeration rule (complex) applied 575 times.
Iterating global reduction 0 with 575 rules applied. Total rules applied 575 place count 9065 transition count 20662
Reduce places removed 575 places and 0 transitions.
Iterating post reduction 0 with 575 rules applied. Total rules applied 1150 place count 8490 transition count 20662
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 1183 place count 8490 transition count 20662
Applied a total of 1183 rules in 5005 ms. Remains 8490 /9065 variables (removed 575) and now considering 20662/16367 (removed -4295) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5006 ms. Remains : 8490/9065 places, 20662/16367 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 12202 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 12202 steps, saw 5815 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 17:50:59] [INFO ] Flow matrix only has 19097 transitions (discarded 1565 similar events)
// Phase 1: matrix 19097 rows 8490 cols
[2024-05-25 17:51:00] [INFO ] Computed 1565 invariants in 837 ms
[2024-05-25 17:51:01] [INFO ] [Real]Absence check using 65 positive place invariants in 131 ms returned sat
[2024-05-25 17:51:01] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 545 ms returned sat
[2024-05-25 17:51:14] [INFO ] After 13742ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 17:51:15] [INFO ] [Nat]Absence check using 65 positive place invariants in 128 ms returned sat
[2024-05-25 17:51:15] [INFO ] [Nat]Absence check using 65 positive and 1500 generalized place invariants in 544 ms returned sat
[2024-05-25 17:51:30] [INFO ] After 14954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 17:51:30] [INFO ] State equation strengthened by 11191 read => feed constraints.
[2024-05-25 17:51:36] [INFO ] After 5193ms SMT Verify possible using 11191 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 17:51:37] [INFO ] After 6291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 624 ms.
[2024-05-25 17:51:37] [INFO ] After 23565ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 8490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8490/8490 places, 20662/20662 transitions.
Applied a total of 0 rules in 1316 ms. Remains 8490 /8490 variables (removed 0) and now considering 20662/20662 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1316 ms. Remains : 8490/8490 places, 20662/20662 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8490/8490 places, 20662/20662 transitions.
Applied a total of 0 rules in 1304 ms. Remains 8490 /8490 variables (removed 0) and now considering 20662/20662 (removed 0) transitions.
[2024-05-25 17:51:40] [INFO ] Flow matrix only has 19097 transitions (discarded 1565 similar events)
[2024-05-25 17:51:40] [INFO ] Invariant cache hit.
[2024-05-25 17:51:41] [INFO ] Implicit Places using invariants in 771 ms returned []
Implicit Place search using SMT only with invariants took 773 ms to find 0 implicit places.
[2024-05-25 17:51:41] [INFO ] Flow matrix only has 19097 transitions (discarded 1565 similar events)
[2024-05-25 17:51:41] [INFO ] Invariant cache hit.
[2024-05-25 17:51:41] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2846 ms. Remains : 8490/8490 places, 20662/20662 transitions.
Graph (trivial) has 7080 edges and 8490 vertex of which 33 / 8490 are part of one of the 1 SCC in 9 ms
Free SCC test removed 32 places
Drop transitions removed 1115 transitions
Ensure Unique test removed 1506 transitions
Reduce isomorphic transitions removed 2621 transitions.
Graph (complete) has 59007 edges and 8458 vertex of which 8428 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.9 ms
Discarding 30 places :
Also discarding 0 output transitions
Ensure Unique test removed 641 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t15687.t17493 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 449 transitions
Trivial Post-agglo rules discarded 449 transitions
Performed 449 trivial Post agglomeration. Transition count delta: 449
Iterating post reduction 0 with 451 rules applied. Total rules applied 453 place count 7786 transition count 17590
Ensure Unique test removed 1 places
Reduce places removed 450 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 448 transitions
Reduce isomorphic transitions removed 449 transitions.
Drop transitions removed 448 transitions
Trivial Post-agglo rules discarded 448 transitions
Performed 448 trivial Post agglomeration. Transition count delta: 448
Iterating post reduction 1 with 1347 rules applied. Total rules applied 1800 place count 7336 transition count 16693
Ensure Unique test removed 1 places
Reduce places removed 449 places and 0 transitions.
Drop transitions removed 56 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 448 transitions.
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 2 with 1289 rules applied. Total rules applied 3089 place count 6887 transition count 15853
Ensure Unique test removed 56 places
Reduce places removed 448 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 392 transitions.
Drop transitions removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 3 with 1229 rules applied. Total rules applied 4318 place count 6439 transition count 15072
Ensure Unique test removed 2 places
Reduce places removed 391 places and 0 transitions.
Drop transitions removed 51 transitions
Ensure Unique test removed 338 transitions
Reduce isomorphic transitions removed 389 transitions.
Drop transitions removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 4 with 1118 rules applied. Total rules applied 5436 place count 6048 transition count 14345
Ensure Unique test removed 51 places
Reduce places removed 389 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 338 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 5 with 1063 rules applied. Total rules applied 6499 place count 5659 transition count 13671
Ensure Unique test removed 2 places
Reduce places removed 338 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 336 transitions.
Drop transitions removed 288 transitions
Trivial Post-agglo rules discarded 288 transitions
Performed 288 trivial Post agglomeration. Transition count delta: 288
Iterating post reduction 6 with 962 rules applied. Total rules applied 7461 place count 5321 transition count 13047
Ensure Unique test removed 48 places
Reduce places removed 336 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 286 transitions
Reduce isomorphic transitions removed 288 transitions.
Drop transitions removed 286 transitions
Trivial Post-agglo rules discarded 286 transitions
Performed 286 trivial Post agglomeration. Transition count delta: 286
Iterating post reduction 7 with 910 rules applied. Total rules applied 8371 place count 4985 transition count 12473
Ensure Unique test removed 2 places
Reduce places removed 288 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 242 transitions
Reduce isomorphic transitions removed 286 transitions.
Drop transitions removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 8 with 816 rules applied. Total rules applied 9187 place count 4697 transition count 11945
Ensure Unique test removed 44 places
Reduce places removed 286 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 9 with 768 rules applied. Total rules applied 9955 place count 4411 transition count 11463
Ensure Unique test removed 2 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 10 with 682 rules applied. Total rules applied 10637 place count 4169 transition count 11023
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 11 with 638 rules applied. Total rules applied 11275 place count 3929 transition count 10625
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 12 with 560 rules applied. Total rules applied 11835 place count 3729 transition count 10265
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 13 with 520 rules applied. Total rules applied 12355 place count 3531 transition count 9943
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 14 with 450 rules applied. Total rules applied 12805 place count 3369 transition count 9655
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 15 with 414 rules applied. Total rules applied 13219 place count 3209 transition count 9401
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 16 with 352 rules applied. Total rules applied 13571 place count 3081 transition count 9177
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 17 with 320 rules applied. Total rules applied 13891 place count 2955 transition count 8983
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 18 with 266 rules applied. Total rules applied 14157 place count 2857 transition count 8815
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 19 with 238 rules applied. Total rules applied 14395 place count 2761 transition count 8673
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 20 with 192 rules applied. Total rules applied 14587 place count 2689 transition count 8553
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 21 with 168 rules applied. Total rules applied 14755 place count 2619 transition count 8455
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 22 with 130 rules applied. Total rules applied 14885 place count 2569 transition count 8375
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 23 with 110 rules applied. Total rules applied 14995 place count 2521 transition count 8313
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 24 with 80 rules applied. Total rules applied 15075 place count 2489 transition count 8265
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 25 with 64 rules applied. Total rules applied 15139 place count 2459 transition count 8231
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 26 with 42 rules applied. Total rules applied 15181 place count 2441 transition count 8207
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 27 with 30 rules applied. Total rules applied 15211 place count 2425 transition count 8193
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 28 with 16 rules applied. Total rules applied 15227 place count 2417 transition count 8185
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 29 with 9 rules applied. Total rules applied 15236 place count 2411 transition count 8182
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 15240 place count 2408 transition count 8181
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 396 Pre rules applied. Total rules applied 15240 place count 2408 transition count 7785
Deduced a syphon composed of 396 places in 1 ms
Ensure Unique test removed 395 places
Reduce places removed 791 places and 0 transitions.
Iterating global reduction 31 with 1187 rules applied. Total rules applied 16427 place count 1617 transition count 7785
Discarding 415 places :
Symmetric choice reduction at 31 with 415 rule applications. Total rules 16842 place count 1202 transition count 7370
Iterating global reduction 31 with 415 rules applied. Total rules applied 17257 place count 1202 transition count 7370
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 1 Pre rules applied. Total rules applied 17257 place count 1202 transition count 7369
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 17259 place count 1201 transition count 7369
Discarding 959 places :
Symmetric choice reduction at 31 with 959 rule applications. Total rules 18218 place count 242 transition count 1615
Iterating global reduction 31 with 959 rules applied. Total rules applied 19177 place count 242 transition count 1615
Ensure Unique test removed 959 transitions
Reduce isomorphic transitions removed 959 transitions.
Iterating post reduction 31 with 959 rules applied. Total rules applied 20136 place count 242 transition count 656
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 32 with 65 rules applied. Total rules applied 20201 place count 209 transition count 624
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 32 with 12 rules applied. Total rules applied 20213 place count 209 transition count 612
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 32 with 12 rules applied. Total rules applied 20225 place count 197 transition count 612
Discarding 30 places :
Symmetric choice reduction at 33 with 30 rule applications. Total rules 20255 place count 167 transition count 432
Ensure Unique test removed 15 places
Iterating global reduction 33 with 45 rules applied. Total rules applied 20300 place count 152 transition count 432
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 33 with 30 rules applied. Total rules applied 20330 place count 152 transition count 402
Discarding 15 places :
Symmetric choice reduction at 34 with 15 rule applications. Total rules 20345 place count 137 transition count 312
Iterating global reduction 34 with 15 rules applied. Total rules applied 20360 place count 137 transition count 312
Discarding 15 places :
Symmetric choice reduction at 34 with 15 rule applications. Total rules 20375 place count 122 transition count 297
Iterating global reduction 34 with 15 rules applied. Total rules applied 20390 place count 122 transition count 297
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 34 with 2 rules applied. Total rules applied 20392 place count 122 transition count 297
Applied a total of 20392 rules in 27339 ms. Remains 122 /8490 variables (removed 8368) and now considering 297/20662 (removed 20365) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 297 rows 122 cols
[2024-05-25 17:52:09] [INFO ] Computed 34 invariants in 9 ms
[2024-05-25 17:52:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 17:52:09] [INFO ] [Real]Absence check using 3 positive and 31 generalized place invariants in 5 ms returned sat
[2024-05-25 17:52:09] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 17:52:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-25 17:52:09] [INFO ] [Nat]Absence check using 3 positive and 31 generalized place invariants in 8 ms returned sat
[2024-05-25 17:52:09] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 17:52:09] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-25 17:52:09] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 116 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 9065 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 : 9065/9065 places, 16367/16367 transitions.
Applied a total of 0 rules in 2251 ms. Remains 9065 /9065 variables (removed 0) and now considering 16367/16367 (removed 0) transitions.
[2024-05-25 17:52:12] [INFO ] Flow matrix only has 15311 transitions (discarded 1056 similar events)
// Phase 1: matrix 15311 rows 9065 cols
[2024-05-25 17:52:12] [INFO ] Computed 1565 invariants in 728 ms
[2024-05-25 17:52:13] [INFO ] Implicit Places using invariants in 1558 ms returned []
Implicit Place search using SMT only with invariants took 1559 ms to find 0 implicit places.
[2024-05-25 17:52:13] [INFO ] Flow matrix only has 15311 transitions (discarded 1056 similar events)
[2024-05-25 17:52:13] [INFO ] Invariant cache hit.
[2024-05-25 17:52:14] [INFO ] Dead Transitions using invariants and state equation in 785 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4597 ms. Remains : 9065/9065 places, 16367/16367 transitions.
Computed a total of 3082 stabilizing places and 4431 stable transitions
Computed a total of 3082 stabilizing places and 4431 stable transitions
Detected a total of 3082/9065 stabilizing places and 4431/16367 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 12814 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 12814 steps, saw 6209 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 17:52:17] [INFO ] Flow matrix only has 15311 transitions (discarded 1056 similar events)
[2024-05-25 17:52:17] [INFO ] Invariant cache hit.
[2024-05-25 17:52:18] [INFO ] [Real]Absence check using 65 positive place invariants in 139 ms returned sat
[2024-05-25 17:52:19] [INFO ] [Real]Absence check using 65 positive and 1500 generalized place invariants in 558 ms returned sat
[2024-05-25 17:52:32] [INFO ] After 13298ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-25 17:52:33] [INFO ] State equation strengthened by 6321 read => feed constraints.
[2024-05-25 17:52:34] [INFO ] After 1491ms SMT Verify possible using 6321 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 17:52:34] [INFO ] After 16569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 17:52:35] [INFO ] [Nat]Absence check using 65 positive place invariants in 142 ms returned sat
[2024-05-25 17:52:36] [INFO ] [Nat]Absence check using 65 positive and 1500 generalized place invariants in 585 ms returned sat
[2024-05-25 17:52:49] [INFO ] After 12956ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 17:52:51] [INFO ] After 2033ms SMT Verify possible using 6321 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 17:53:05] [INFO ] Deduced a trap composed of 1025 places in 13947 ms of which 9 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
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.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-25 17:53:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 17:53:05] [INFO ] After 31078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 9065 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9065/9065 places, 16367/16367 transitions.
Free-agglomeration rule (complex) applied 577 times.
Iterating global reduction 0 with 577 rules applied. Total rules applied 577 place count 9065 transition count 20735
Reduce places removed 577 places and 0 transitions.
Iterating post reduction 0 with 577 rules applied. Total rules applied 1154 place count 8488 transition count 20735
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 1187 place count 8488 transition count 20735
Applied a total of 1187 rules in 5042 ms. Remains 8488 /9065 variables (removed 577) and now considering 20735/16367 (removed -4368) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5043 ms. Remains : 8488/9065 places, 20735/16367 transitions.
Finished random walk after 6692 steps, including 179 resets, run visited all 1 properties in 430 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2269 reset in 1857 ms.
Product exploration explored 100000 steps with 2268 reset in 1851 ms.
Built C files in :
/tmp/ltsmin14461276787849871239
[2024-05-25 17:53:15] [INFO ] Too many transitions (16367) to apply POR reductions. Disabling POR matrices.
[2024-05-25 17:53:15] [INFO ] Built C files in 189ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14461276787849871239
Running compilation step : cd /tmp/ltsmin14461276787849871239;'/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/ltsmin14461276787849871239;'/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/ltsmin14461276787849871239;'/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 1 out of 9065 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9065/9065 places, 16367/16367 transitions.
Applied a total of 0 rules in 2263 ms. Remains 9065 /9065 variables (removed 0) and now considering 16367/16367 (removed 0) transitions.
[2024-05-25 17:53:20] [INFO ] Flow matrix only has 15311 transitions (discarded 1056 similar events)
[2024-05-25 17:53:20] [INFO ] Invariant cache hit.
[2024-05-25 17:53:21] [INFO ] Implicit Places using invariants in 839 ms returned []
Implicit Place search using SMT only with invariants took 840 ms to find 0 implicit places.
[2024-05-25 17:53:21] [INFO ] Flow matrix only has 15311 transitions (discarded 1056 similar events)
[2024-05-25 17:53:21] [INFO ] Invariant cache hit.
[2024-05-25 17:53:22] [INFO ] Dead Transitions using invariants and state equation in 846 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3956 ms. Remains : 9065/9065 places, 16367/16367 transitions.
Built C files in :
/tmp/ltsmin1049326997704338145
[2024-05-25 17:53:22] [INFO ] Too many transitions (16367) to apply POR reductions. Disabling POR matrices.
[2024-05-25 17:53:22] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1049326997704338145
Running compilation step : cd /tmp/ltsmin1049326997704338145;'/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/ltsmin1049326997704338145;'/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/ltsmin1049326997704338145;'/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-25 17:53:26] [INFO ] Flatten gal took : 386 ms
[2024-05-25 17:53:27] [INFO ] Flatten gal took : 401 ms
[2024-05-25 17:53:27] [INFO ] Time to serialize gal into /tmp/LTL7524276158189461767.gal : 134 ms
[2024-05-25 17:53:27] [INFO ] Time to serialize properties into /tmp/LTL158829928870987139.prop : 0 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/LTL7524276158189461767.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14939920347475966261.hoa' '-atoms' '/tmp/LTL158829928870987139.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/LTL158829928870987139.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14939920347475966261.hoa
Detected timeout of ITS tools.
[2024-05-25 17:53:43] [INFO ] Flatten gal took : 386 ms
[2024-05-25 17:53:43] [INFO ] Flatten gal took : 396 ms
[2024-05-25 17:53:43] [INFO ] Time to serialize gal into /tmp/LTL11382730428664668300.gal : 130 ms
[2024-05-25 17:53:43] [INFO ] Time to serialize properties into /tmp/LTL14490134550829662967.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/LTL11382730428664668300.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14490134550829662967.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("(Node12WantsToManageTheCrashOfNode28<=Node11ThinksNode14ShouldBeNodeMasterToReplaceNode18)")U("(Node10HasTheLeafSetOfRx2ToRep...174
Formula 0 simplified : GF(!"(Node12WantsToManageTheCrashOfNode28<=Node11ThinksNode14ShouldBeNodeMasterToReplaceNode18)" R !"(Node10HasTheLeafSetOfRx2ToRepl...169
Detected timeout of ITS tools.
[2024-05-25 17:53:59] [INFO ] Flatten gal took : 495 ms
[2024-05-25 17:53:59] [INFO ] Applying decomposition
[2024-05-25 17:53:59] [INFO ] Flatten gal took : 387 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4441599167695720854.txt' '-o' '/tmp/graph4441599167695720854.bin' '-w' '/tmp/graph4441599167695720854.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4441599167695720854.bin' '-l' '-1' '-v' '-w' '/tmp/graph4441599167695720854.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:54:00] [INFO ] Decomposing Gal with order
[2024-05-25 17:54:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:54:05] [INFO ] Removed a total of 14935 redundant transitions.
[2024-05-25 17:54:05] [INFO ] Flatten gal took : 2904 ms
[2024-05-25 17:54:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 1585 labels/synchronizations in 677 ms.
[2024-05-25 17:54:08] [INFO ] Time to serialize gal into /tmp/LTL16699449326704323789.gal : 124 ms
[2024-05-25 17:54:08] [INFO ] Time to serialize properties into /tmp/LTL3735407041123335338.ltl : 1 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/LTL16699449326704323789.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3735407041123335338.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 : !((F(G(("(gu353.Node12WantsToManageTheCrashOfNode28<=gu353.Node11ThinksNode14ShouldBeNodeMasterToReplaceNode18)")U("(gi0.gi2.gu803.Nod...200
Formula 0 simplified : GF(!"(gu353.Node12WantsToManageTheCrashOfNode28<=gu353.Node11ThinksNode14ShouldBeNodeMasterToReplaceNode18)" R !"(gi0.gi2.gu803.Node...195
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5193462888376347662
[2024-05-25 17:54:23] [INFO ] Built C files in 132ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5193462888376347662
Running compilation step : cd /tmp/ltsmin5193462888376347662;'/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/ltsmin5193462888376347662;'/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/ltsmin5193462888376347662;'/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 MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-03 finished in 270109 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(X((F(p0)&&G(F(p1))))))'
Support contains 3 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1952 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2024-05-25 17:54:28] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
// Phase 1: matrix 33959 rows 22768 cols
[2024-05-25 17:54:32] [INFO ] Computed 1565 invariants in 3713 ms
[2024-05-25 17:54:34] [INFO ] Implicit Places using invariants in 5518 ms returned []
Implicit Place search using SMT only with invariants took 5519 ms to find 0 implicit places.
[2024-05-25 17:54:34] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2024-05-25 17:54:34] [INFO ] Invariant cache hit.
[2024-05-25 17:54:36] [INFO ] Dead Transitions using invariants and state equation in 2054 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9527 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s15134 s12086), p1:(LEQ 1 s15021)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-06 finished in 9917 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(p0)))'
Support contains 1 out of 22768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Drop transitions removed 6335 transitions
Trivial Post-agglo rules discarded 6335 transitions
Performed 6335 trivial Post agglomeration. Transition count delta: 6335
Iterating post reduction 0 with 6335 rules applied. Total rules applied 6335 place count 22768 transition count 28680
Reduce places removed 6335 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6336 rules applied. Total rules applied 12671 place count 16433 transition count 28679
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12672 place count 16432 transition count 28679
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 396 Pre rules applied. Total rules applied 12672 place count 16432 transition count 28283
Deduced a syphon composed of 396 places in 41 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 3 with 792 rules applied. Total rules applied 13464 place count 16036 transition count 28283
Discarding 5939 places :
Symmetric choice reduction at 3 with 5939 rule applications. Total rules 19403 place count 10097 transition count 22344
Iterating global reduction 3 with 5939 rules applied. Total rules applied 25342 place count 10097 transition count 22344
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 25342 place count 10097 transition count 22333
Deduced a syphon composed of 11 places in 18 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 25364 place count 10086 transition count 22333
Discarding 989 places :
Symmetric choice reduction at 3 with 989 rule applications. Total rules 26353 place count 9097 transition count 16399
Iterating global reduction 3 with 989 rules applied. Total rules applied 27342 place count 9097 transition count 16399
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 17 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 27408 place count 9064 transition count 16366
Applied a total of 27408 rules in 9577 ms. Remains 9064 /22768 variables (removed 13704) and now considering 16366/35015 (removed 18649) transitions.
[2024-05-25 17:54:46] [INFO ] Flow matrix only has 15310 transitions (discarded 1056 similar events)
// Phase 1: matrix 15310 rows 9064 cols
[2024-05-25 17:54:47] [INFO ] Computed 1565 invariants in 813 ms
[2024-05-25 17:54:47] [INFO ] Implicit Places using invariants in 1641 ms returned []
Implicit Place search using SMT only with invariants took 1642 ms to find 0 implicit places.
[2024-05-25 17:54:47] [INFO ] Flow matrix only has 15310 transitions (discarded 1056 similar events)
[2024-05-25 17:54:47] [INFO ] Invariant cache hit.
[2024-05-25 17:54:48] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9064/22768 places, 16366/35015 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12026 ms. Remains : 9064/22768 places, 16366/35015 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s3085)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-08 finished in 12198 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 1 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1933 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2024-05-25 17:54:50] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
// Phase 1: matrix 33959 rows 22768 cols
[2024-05-25 17:54:54] [INFO ] Computed 1565 invariants in 3609 ms
[2024-05-25 17:54:56] [INFO ] Implicit Places using invariants in 5424 ms returned []
Implicit Place search using SMT only with invariants took 5425 ms to find 0 implicit places.
[2024-05-25 17:54:56] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2024-05-25 17:54:56] [INFO ] Invariant cache hit.
[2024-05-25 17:54:58] [INFO ] Dead Transitions using invariants and state equation in 1772 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9133 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s22049)], 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 33411 steps with 543 reset in 935 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-09 finished in 10269 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(F((p0||(p1 U p2)))))'
Support contains 5 out of 22768 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1808 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2024-05-25 17:55:01] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2024-05-25 17:55:01] [INFO ] Invariant cache hit.
[2024-05-25 17:55:02] [INFO ] Implicit Places using invariants in 1760 ms returned []
Implicit Place search using SMT only with invariants took 1761 ms to find 0 implicit places.
[2024-05-25 17:55:02] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2024-05-25 17:55:02] [INFO ] Invariant cache hit.
[2024-05-25 17:55:04] [INFO ] Dead Transitions using invariants and state equation in 1825 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5394 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s19398 s6316), p2:(OR (LEQ 2 s13800) (LEQ s8629 s1970))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 67040 steps with 33520 reset in 10001 ms.
Product exploration timeout after 68870 steps with 34435 reset in 10001 ms.
Computed a total of 16752 stabilizing places and 23046 stable transitions
Computed a total of 16752 stabilizing places and 23046 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-12 finished in 25717 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 2 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1843 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2024-05-25 17:55:26] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2024-05-25 17:55:26] [INFO ] Invariant cache hit.
[2024-05-25 17:55:28] [INFO ] Implicit Places using invariants in 1762 ms returned []
Implicit Place search using SMT only with invariants took 1767 ms to find 0 implicit places.
[2024-05-25 17:55:28] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2024-05-25 17:55:28] [INFO ] Invariant cache hit.
[2024-05-25 17:55:30] [INFO ] Dead Transitions using invariants and state equation in 1780 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5393 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s6052 s13352)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-14 finished in 5573 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)||F((p1||X((p2 U p3)))))))'
Support contains 6 out of 22768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22768/22768 places, 35015/35015 transitions.
Applied a total of 0 rules in 1826 ms. Remains 22768 /22768 variables (removed 0) and now considering 35015/35015 (removed 0) transitions.
[2024-05-25 17:55:32] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2024-05-25 17:55:32] [INFO ] Invariant cache hit.
[2024-05-25 17:55:34] [INFO ] Implicit Places using invariants in 1764 ms returned []
Implicit Place search using SMT only with invariants took 1764 ms to find 0 implicit places.
[2024-05-25 17:55:34] [INFO ] Flow matrix only has 33959 transitions (discarded 1056 similar events)
[2024-05-25 17:55:34] [INFO ] Invariant cache hit.
[2024-05-25 17:55:35] [INFO ] Dead Transitions using invariants and state equation in 1756 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5348 ms. Remains : 22768/22768 places, 35015/35015 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s19398 s7737), p3:(AND (LEQ s8940 s3897) (LEQ s19398 s7737)), p0:(LEQ s16578 s16138)], 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]]
Product exploration timeout after 66070 steps with 33035 reset in 10001 ms.
Product exploration timeout after 69650 steps with 34825 reset in 10001 ms.
Computed a total of 16752 stabilizing places and 23046 stable transitions
Computed a total of 16752 stabilizing places and 23046 stable transitions
Detected a total of 16752/22768 stabilizing places and 23046/35015 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p3 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C06-LTLCardinality-15 finished in 25738 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 U p1))))'
[2024-05-25 17:55:57] [INFO ] Flatten gal took : 1008 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7374389836096037189
[2024-05-25 17:55:57] [INFO ] Too many transitions (35015) to apply POR reductions. Disabling POR matrices.
[2024-05-25 17:55:58] [INFO ] Built C files in 478ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7374389836096037189
Running compilation step : cd /tmp/ltsmin7374389836096037189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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-25 17:55:58] [INFO ] Applying decomposition
[2024-05-25 17:55:59] [INFO ] Flatten gal took : 1024 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9851062412798543361.txt' '-o' '/tmp/graph9851062412798543361.bin' '-w' '/tmp/graph9851062412798543361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9851062412798543361.bin' '-l' '-1' '-v' '-w' '/tmp/graph9851062412798543361.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:56:01] [INFO ] Decomposing Gal with order
[2024-05-25 17:56:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:56:22] [INFO ] Removed a total of 24897 redundant transitions.
[2024-05-25 17:56:23] [INFO ] Flatten gal took : 9799 ms
[2024-05-25 17:56:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 424 labels/synchronizations in 290 ms.
[2024-05-25 17:56:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality4378249331010933800.gal : 191 ms
[2024-05-25 17:56:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality8578907479183058914.ltl : 0 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/LTLCardinality4378249331010933800.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8578907479183058914.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...297
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gu477.Node12WantsToManageTheCrashOfNode28<=gu477.Node11ThinksNode14ShouldBeNodeMasterToReplaceNode18)")U("(gi0.gi10.gu961.No...201
Formula 0 simplified : GF(!"(gu477.Node12WantsToManageTheCrashOfNode28<=gu477.Node11ThinksNode14ShouldBeNodeMasterToReplaceNode18)" R !"(gi0.gi10.gu961.Nod...196
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/ltsmin7374389836096037189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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 720 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7374389836096037189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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 720 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)
Detected timeout of ITS tools.
[2024-05-25 18:19:19] [INFO ] Flatten gal took : 992 ms
[2024-05-25 18:19:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality6777000629231901317.gal : 138 ms
[2024-05-25 18:19:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality9773874877115901229.ltl : 1 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/LTLCardinality6777000629231901317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9773874877115901229.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...297
Read 1 LTL properties
Checking formula 0 : !((F(G(("(Node12WantsToManageTheCrashOfNode28<=Node11ThinksNode14ShouldBeNodeMasterToReplaceNode18)")U("(Node10HasTheLeafSetOfRx2ToRep...174
Formula 0 simplified : GF(!"(Node12WantsToManageTheCrashOfNode28<=Node11ThinksNode14ShouldBeNodeMasterToReplaceNode18)" R !"(Node10HasTheLeafSetOfRx2ToRepl...169
Detected timeout of ITS tools.
[2024-05-25 18:42:12] [INFO ] Flatten gal took : 1064 ms
[2024-05-25 18:42:13] [INFO ] Input system was already deterministic with 35015 transitions.
[2024-05-25 18:42:13] [INFO ] Transformed 22768 places.
[2024-05-25 18:42:13] [INFO ] Transformed 35015 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 18:42:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality12011639885785229434.gal : 125 ms
[2024-05-25 18:42:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality5819701201474410502.ltl : 1 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/LTLCardinality12011639885785229434.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5819701201474410502.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("(Node12WantsToManageTheCrashOfNode28<=Node11ThinksNode14ShouldBeNodeMasterToReplaceNode18)")U("(Node10HasTheLeafSetOfRx2ToRep...174
Formula 0 simplified : GF(!"(Node12WantsToManageTheCrashOfNode28<=Node11ThinksNode14ShouldBeNodeMasterToReplaceNode18)" R !"(Node10HasTheLeafSetOfRx2ToRepl...169
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10318204 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16007220 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="MultiCrashLeafsetExtension-PT-S32C06"
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 MultiCrashLeafsetExtension-PT-S32C06, 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 r263-tall-171654372100112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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