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.r329-tall-171662361800217.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 RERS2020-PT-pb103, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361800217
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 18M 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 RERS2020-PT-pb103-LTLCardinality-00
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-01
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-02
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-03
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-04
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-05
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-06
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-07
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-08
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-09
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-10
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-11
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-12
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-13
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-14
FORMULA_NAME RERS2020-PT-pb103-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716841635981

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=RERS2020-PT-pb103
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 20:27:17] [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-27 20:27:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:27:18] [INFO ] Load time of PNML (sax parser for PT used): 804 ms
[2024-05-27 20:27:18] [INFO ] Transformed 520 places.
[2024-05-27 20:27:18] [INFO ] Transformed 31658 transitions.
[2024-05-27 20:27:18] [INFO ] Found NUPN structural information;
[2024-05-27 20:27:18] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 1038 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA RERS2020-PT-pb103-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 28429
Applied a total of 7 rules in 145 ms. Remains 513 /520 variables (removed 7) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:27:19] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2024-05-27 20:27:19] [INFO ] Computed 8 invariants in 139 ms
[2024-05-27 20:27:20] [INFO ] Implicit Places using invariants in 1685 ms returned []
Implicit Place search using SMT only with invariants took 1709 ms to find 0 implicit places.
[2024-05-27 20:27:20] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:27:20] [INFO ] Invariant cache hit.
[2024-05-27 20:27:29] [INFO ] Dead Transitions using invariants and state equation in 8358 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 513/520 places, 28429/28429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10222 ms. Remains : 513/520 places, 28429/28429 transitions.
Support contains 29 out of 513 places after structural reductions.
[2024-05-27 20:27:30] [INFO ] Flatten gal took : 1035 ms
[2024-05-27 20:27:31] [INFO ] Flatten gal took : 805 ms
[2024-05-27 20:27:32] [INFO ] Input system was already deterministic with 28429 transitions.
Support contains 26 out of 513 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 733 ms. (steps per millisecond=13 ) properties (out of 18) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-27 20:27:34] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:27:34] [INFO ] Invariant cache hit.
[2024-05-27 20:27:34] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-27 20:27:39] [INFO ] After 5013ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-27 20:27:39] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2024-05-27 20:27:41] [INFO ] After 1911ms SMT Verify possible using 1379 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-27 20:27:41] [INFO ] After 7365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-27 20:27:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-05-27 20:27:46] [INFO ] After 5025ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-27 20:27:56] [INFO ] After 9616ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-27 20:27:59] [INFO ] Deduced a trap composed of 22 places in 1806 ms of which 7 ms to minimize.
[2024-05-27 20:28:01] [INFO ] Deduced a trap composed of 50 places in 1660 ms of which 1 ms to minimize.
[2024-05-27 20:28:03] [INFO ] Deduced a trap composed of 73 places in 1639 ms of which 2 ms to minimize.
[2024-05-27 20:28:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6597 ms
[2024-05-27 20:28:08] [INFO ] Deduced a trap composed of 67 places in 1965 ms of which 2 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.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-27 20:28:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:28:08] [INFO ] After 26668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 43 ms.
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 30 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 1081 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1084 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 35059 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35059 steps, saw 24934 distinct states, run finished after 3005 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-27 20:28:13] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:28:13] [INFO ] Computed 8 invariants in 74 ms
[2024-05-27 20:28:13] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:28:18] [INFO ] After 4954ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-27 20:28:18] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:28:19] [INFO ] After 1276ms SMT Verify possible using 1374 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-27 20:28:19] [INFO ] After 6551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-27 20:28:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:28:24] [INFO ] After 4515ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-27 20:28:30] [INFO ] After 5793ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-27 20:28:32] [INFO ] Deduced a trap composed of 153 places in 1920 ms of which 1 ms to minimize.
[2024-05-27 20:28:34] [INFO ] Deduced a trap composed of 72 places in 1913 ms of which 0 ms to minimize.
[2024-05-27 20:28:37] [INFO ] Deduced a trap composed of 185 places in 1733 ms of which 1 ms to minimize.
[2024-05-27 20:28:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6933 ms
[2024-05-27 20:28:40] [INFO ] Deduced a trap composed of 75 places in 1919 ms of which 2 ms to minimize.
[2024-05-27 20:28:42] [INFO ] Deduced a trap composed of 60 places in 1822 ms of which 0 ms to minimize.
[2024-05-27 20:28:46] [INFO ] Deduced a trap composed of 90 places in 1966 ms of which 0 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.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-27 20:28:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:28:46] [INFO ] After 26233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 25 ms.
Support contains 8 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 109 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 101 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2024-05-27 20:28:46] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:28:46] [INFO ] Invariant cache hit.
[2024-05-27 20:28:47] [INFO ] Implicit Places using invariants in 951 ms returned []
Implicit Place search using SMT only with invariants took 952 ms to find 0 implicit places.
[2024-05-27 20:28:47] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:28:47] [INFO ] Invariant cache hit.
[2024-05-27 20:28:54] [INFO ] Dead Transitions using invariants and state equation in 7684 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8740 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10062 edges and 497 vertex of which 376 / 497 are part of one of the 62 SCC in 5 ms
Free SCC test removed 314 places
Drop transitions removed 10785 transitions
Ensure Unique test removed 14108 transitions
Reduce isomorphic transitions removed 24893 transitions.
Graph (complete) has 2470 edges and 183 vertex of which 176 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 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 12 rules applied. Total rules applied 14 place count 176 transition count 2551
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 174 transition count 2551
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 173 transition count 2541
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 173 transition count 2541
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 171 transition count 2539
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 171 transition count 2506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 170 transition count 2516
Drop transitions removed 1368 transitions
Redundant transition composition rules discarded 1368 transitions
Iterating global reduction 3 with 1368 rules applied. Total rules applied 1425 place count 170 transition count 1148
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1357 edges and 168 vertex of which 152 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1436 place count 152 transition count 1138
Drop transitions removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 4 with 98 rules applied. Total rules applied 1534 place count 152 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1536 place count 150 transition count 1030
Iterating global reduction 5 with 2 rules applied. Total rules applied 1538 place count 150 transition count 1030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1539 place count 150 transition count 1029
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1541 place count 149 transition count 1028
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1546 place count 149 transition count 1023
Free-agglomeration rule applied 6 times with reduction of 2 identical transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1552 place count 149 transition count 1015
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1558 place count 143 transition count 1015
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 7 with 27 rules applied. Total rules applied 1585 place count 143 transition count 988
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1587 place count 143 transition count 986
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1589 place count 141 transition count 986
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1592 place count 141 transition count 983
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 1597 place count 141 transition count 1081
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 1616 place count 136 transition count 1067
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1617 place count 135 transition count 1062
Iterating global reduction 9 with 1 rules applied. Total rules applied 1618 place count 135 transition count 1062
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1627 place count 135 transition count 1053
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 1648 place count 135 transition count 1032
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1650 place count 135 transition count 1032
Applied a total of 1650 rules in 283 ms. Remains 135 /497 variables (removed 362) and now considering 1032/27456 (removed 26424) transitions.
Running SMT prover for 5 properties.
[2024-05-27 20:28:55] [INFO ] Flow matrix only has 999 transitions (discarded 33 similar events)
// Phase 1: matrix 999 rows 135 cols
[2024-05-27 20:28:55] [INFO ] Computed 0 invariants in 23 ms
[2024-05-27 20:28:55] [INFO ] After 295ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-27 20:28:55] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-27 20:28:55] [INFO ] After 29ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-27 20:28:55] [INFO ] After 438ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-27 20:28:56] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-27 20:28:56] [INFO ] After 123ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-27 20:28:56] [INFO ] After 306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 115 ms.
[2024-05-27 20:28:56] [INFO ] After 713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Computed a total of 121 stabilizing places and 10286 stable transitions
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 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 296 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2024-05-27 20:28:57] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2024-05-27 20:28:57] [INFO ] Computed 8 invariants in 65 ms
[2024-05-27 20:28:57] [INFO ] Implicit Places using invariants in 823 ms returned []
Implicit Place search using SMT only with invariants took 828 ms to find 0 implicit places.
[2024-05-27 20:28:57] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:28:57] [INFO ] Invariant cache hit.
[2024-05-27 20:29:05] [INFO ] Dead Transitions using invariants and state equation in 7831 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8961 ms. Remains : 510/513 places, 28438/28429 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 197 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-00 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:(AND (EQ s358 0) (EQ s319 1))], 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 65 steps with 0 reset in 10 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-00 finished in 9283 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)))'
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 259 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2024-05-27 20:29:06] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:29:06] [INFO ] Invariant cache hit.
[2024-05-27 20:29:07] [INFO ] Implicit Places using invariants in 756 ms returned []
Implicit Place search using SMT only with invariants took 758 ms to find 0 implicit places.
[2024-05-27 20:29:07] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:29:07] [INFO ] Invariant cache hit.
[2024-05-27 20:29:14] [INFO ] Dead Transitions using invariants and state equation in 7631 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8651 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s429 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1794 ms.
Product exploration explored 100000 steps with 0 reset in 2217 ms.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Finished Best-First random walk after 3597 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=327 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 111 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2024-05-27 20:29:19] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:29:19] [INFO ] Invariant cache hit.
[2024-05-27 20:29:20] [INFO ] Implicit Places using invariants in 794 ms returned []
Implicit Place search using SMT only with invariants took 795 ms to find 0 implicit places.
[2024-05-27 20:29:20] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:29:20] [INFO ] Invariant cache hit.
[2024-05-27 20:29:28] [INFO ] Dead Transitions using invariants and state equation in 7747 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8659 ms. Remains : 510/510 places, 28438/28438 transitions.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Finished Best-First random walk after 268 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=89 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2197 ms.
Product exploration explored 100000 steps with 0 reset in 2300 ms.
Built C files in :
/tmp/ltsmin13169373615042102351
[2024-05-27 20:29:33] [INFO ] Too many transitions (28438) to apply POR reductions. Disabling POR matrices.
[2024-05-27 20:29:33] [INFO ] Built C files in 290ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13169373615042102351
Running compilation step : cd /tmp/ltsmin13169373615042102351;'/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/ltsmin13169373615042102351;'/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/ltsmin13169373615042102351;'/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 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 107 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2024-05-27 20:29:36] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:29:36] [INFO ] Invariant cache hit.
[2024-05-27 20:29:37] [INFO ] Implicit Places using invariants in 806 ms returned []
Implicit Place search using SMT only with invariants took 807 ms to find 0 implicit places.
[2024-05-27 20:29:37] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:29:37] [INFO ] Invariant cache hit.
[2024-05-27 20:29:45] [INFO ] Dead Transitions using invariants and state equation in 7827 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8744 ms. Remains : 510/510 places, 28438/28438 transitions.
Built C files in :
/tmp/ltsmin12084709656146477223
[2024-05-27 20:29:45] [INFO ] Too many transitions (28438) to apply POR reductions. Disabling POR matrices.
[2024-05-27 20:29:45] [INFO ] Built C files in 229ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12084709656146477223
Running compilation step : cd /tmp/ltsmin12084709656146477223;'/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/ltsmin12084709656146477223;'/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/ltsmin12084709656146477223;'/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-27 20:29:50] [INFO ] Flatten gal took : 683 ms
[2024-05-27 20:29:50] [INFO ] Flatten gal took : 689 ms
[2024-05-27 20:29:50] [INFO ] Time to serialize gal into /tmp/LTL3461376353361391707.gal : 129 ms
[2024-05-27 20:29:51] [INFO ] Time to serialize properties into /tmp/LTL4337851808526420545.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/LTL3461376353361391707.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4703976724828286231.hoa' '-atoms' '/tmp/LTL4337851808526420545.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/LTL4337851808526420545.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4703976724828286231.hoa
Detected timeout of ITS tools.
[2024-05-27 20:30:07] [INFO ] Flatten gal took : 754 ms
[2024-05-27 20:30:07] [INFO ] Flatten gal took : 735 ms
[2024-05-27 20:30:08] [INFO ] Time to serialize gal into /tmp/LTL2224291555493838208.gal : 108 ms
[2024-05-27 20:30:08] [INFO ] Time to serialize properties into /tmp/LTL8644412745189619736.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/LTL2224291555493838208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8644412745189619736.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(ps90==0)"))))
Formula 0 simplified : GF!"(ps90==0)"
Detected timeout of ITS tools.
[2024-05-27 20:30:23] [INFO ] Flatten gal took : 738 ms
[2024-05-27 20:30:23] [INFO ] Applying decomposition
[2024-05-27 20:30:24] [INFO ] Flatten gal took : 795 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/graph1032974958323097361.txt' '-o' '/tmp/graph1032974958323097361.bin' '-w' '/tmp/graph1032974958323097361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1032974958323097361.bin' '-l' '-1' '-v' '-w' '/tmp/graph1032974958323097361.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:30:26] [INFO ] Decomposing Gal with order
[2024-05-27 20:30:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:30:29] [INFO ] Removed a total of 64244 redundant transitions.
[2024-05-27 20:30:29] [INFO ] Flatten gal took : 1960 ms
[2024-05-27 20:30:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2412 labels/synchronizations in 768 ms.
[2024-05-27 20:30:30] [INFO ] Time to serialize gal into /tmp/LTL2350681662566359300.gal : 63 ms
[2024-05-27 20:30:30] [INFO ] Time to serialize properties into /tmp/LTL13151371042437822319.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/LTL2350681662566359300.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13151371042437822319.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(i6.i2.u52.ps90==0)"))))
Formula 0 simplified : GF!"(i6.i2.u52.ps90==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3671809746518621788
[2024-05-27 20:30:45] [INFO ] Built C files in 200ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3671809746518621788
Running compilation step : cd /tmp/ltsmin3671809746518621788;'/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/ltsmin3671809746518621788;'/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/ltsmin3671809746518621788;'/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 RERS2020-PT-pb103-LTLCardinality-01 finished in 102957 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(X((X(F(X((F(p0) U !p0)))) U p1))))'
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 35 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:30:49] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2024-05-27 20:30:49] [INFO ] Computed 8 invariants in 76 ms
[2024-05-27 20:30:49] [INFO ] Implicit Places using invariants in 913 ms returned []
Implicit Place search using SMT only with invariants took 914 ms to find 0 implicit places.
[2024-05-27 20:30:49] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:30:49] [INFO ] Invariant cache hit.
[2024-05-27 20:30:58] [INFO ] Dead Transitions using invariants and state equation in 8149 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9100 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s419 0) (EQ s33 1)), p0:(EQ s132 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2329 ms.
Product exploration explored 100000 steps with 0 reset in 2014 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 33596 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33596 steps, saw 23049 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-27 20:31:06] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:31:06] [INFO ] Invariant cache hit.
[2024-05-27 20:31:06] [INFO ] [Real]Absence check using 8 positive place invariants in 22 ms returned sat
[2024-05-27 20:31:10] [INFO ] After 3964ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 20:31:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-27 20:31:14] [INFO ] After 3726ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 20:31:14] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2024-05-27 20:31:22] [INFO ] After 7985ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-27 20:31:25] [INFO ] Deduced a trap composed of 61 places in 1400 ms of which 0 ms to minimize.
[2024-05-27 20:31:28] [INFO ] Deduced a trap composed of 96 places in 1608 ms of which 1 ms to minimize.
[2024-05-27 20:31:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4254 ms
[2024-05-27 20:31:30] [INFO ] Deduced a trap composed of 50 places in 1683 ms of which 0 ms to minimize.
[2024-05-27 20:31:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2467 ms
[2024-05-27 20:31:31] [INFO ] After 17122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 931 ms.
[2024-05-27 20:31:32] [INFO ] After 22021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 633 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 633 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 36485 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 36485 steps, saw 25888 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-27 20:31:36] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:31:36] [INFO ] Computed 8 invariants in 58 ms
[2024-05-27 20:31:36] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:31:40] [INFO ] After 3907ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 20:31:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-27 20:31:44] [INFO ] After 3875ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 20:31:44] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:31:52] [INFO ] After 7671ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-27 20:31:54] [INFO ] Deduced a trap composed of 60 places in 1596 ms of which 0 ms to minimize.
[2024-05-27 20:31:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2440 ms
[2024-05-27 20:31:56] [INFO ] After 11518ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2842 ms.
[2024-05-27 20:31:59] [INFO ] After 18439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 97 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 96 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2024-05-27 20:31:59] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:31:59] [INFO ] Invariant cache hit.
[2024-05-27 20:32:00] [INFO ] Implicit Places using invariants in 1025 ms returned []
Implicit Place search using SMT only with invariants took 1026 ms to find 0 implicit places.
[2024-05-27 20:32:00] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:32:00] [INFO ] Invariant cache hit.
[2024-05-27 20:32:08] [INFO ] Dead Transitions using invariants and state equation in 7779 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8903 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10215 edges and 497 vertex of which 379 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 317 places
Drop transitions removed 10976 transitions
Ensure Unique test removed 14056 transitions
Reduce isomorphic transitions removed 25032 transitions.
Graph (complete) has 2391 edges and 180 vertex of which 173 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 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 12 rules applied. Total rules applied 14 place count 173 transition count 2412
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 171 transition count 2412
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 169 transition count 2410
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 53 place count 169 transition count 2377
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 168 transition count 2387
Drop transitions removed 1292 transitions
Redundant transition composition rules discarded 1292 transitions
Iterating global reduction 3 with 1292 rules applied. Total rules applied 1347 place count 168 transition count 1095
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1301 edges and 166 vertex of which 148 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1358 place count 148 transition count 1085
Drop transitions removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 4 with 104 rules applied. Total rules applied 1462 place count 148 transition count 981
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1464 place count 146 transition count 971
Iterating global reduction 5 with 2 rules applied. Total rules applied 1466 place count 146 transition count 971
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1467 place count 146 transition count 970
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1469 place count 145 transition count 969
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1474 place count 145 transition count 964
Free-agglomeration rule applied 9 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 9 rules applied. Total rules applied 1483 place count 145 transition count 948
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 1510 place count 136 transition count 930
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1511 place count 135 transition count 928
Iterating global reduction 7 with 1 rules applied. Total rules applied 1512 place count 135 transition count 928
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1520 place count 135 transition count 920
Drop transitions removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 8 with 43 rules applied. Total rules applied 1563 place count 135 transition count 877
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1566 place count 135 transition count 874
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1569 place count 132 transition count 874
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 1574 place count 132 transition count 962
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 1591 place count 127 transition count 950
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1592 place count 126 transition count 946
Iterating global reduction 10 with 1 rules applied. Total rules applied 1593 place count 126 transition count 946
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1602 place count 126 transition count 937
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 1623 place count 126 transition count 916
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1625 place count 126 transition count 916
Applied a total of 1625 rules in 211 ms. Remains 126 /497 variables (removed 371) and now considering 916/27456 (removed 26540) transitions.
Running SMT prover for 2 properties.
[2024-05-27 20:32:08] [INFO ] Flow matrix only has 883 transitions (discarded 33 similar events)
// Phase 1: matrix 883 rows 126 cols
[2024-05-27 20:32:08] [INFO ] Computed 0 invariants in 5 ms
[2024-05-27 20:32:08] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 20:32:08] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 20:32:08] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-27 20:32:08] [INFO ] After 49ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-27 20:32:08] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-27 20:32:08] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 33 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:32:09] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2024-05-27 20:32:09] [INFO ] Computed 8 invariants in 57 ms
[2024-05-27 20:32:10] [INFO ] Implicit Places using invariants in 824 ms returned []
Implicit Place search using SMT only with invariants took 825 ms to find 0 implicit places.
[2024-05-27 20:32:10] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:32:10] [INFO ] Invariant cache hit.
[2024-05-27 20:32:18] [INFO ] Dead Transitions using invariants and state equation in 7869 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8729 ms. Remains : 513/513 places, 28429/28429 transitions.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:32:18] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:32:18] [INFO ] Invariant cache hit.
[2024-05-27 20:32:18] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-27 20:32:22] [INFO ] After 3271ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-27 20:32:22] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2024-05-27 20:32:23] [INFO ] After 1705ms SMT Verify possible using 1379 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:32:23] [INFO ] After 5187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:32:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:32:27] [INFO ] After 3837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:32:34] [INFO ] After 6640ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:32:36] [INFO ] Deduced a trap composed of 85 places in 1955 ms of which 1 ms to minimize.
[2024-05-27 20:32:39] [INFO ] Deduced a trap composed of 96 places in 1721 ms of which 1 ms to minimize.
[2024-05-27 20:32:41] [INFO ] Deduced a trap composed of 53 places in 1581 ms of which 2 ms to minimize.
[2024-05-27 20:32:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 7107 ms
[2024-05-27 20:32:42] [INFO ] After 14095ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2076 ms.
[2024-05-27 20:32:44] [INFO ] After 20119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 605 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 606 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 38088 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 38088 steps, saw 26963 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:32:47] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:32:48] [INFO ] Computed 8 invariants in 58 ms
[2024-05-27 20:32:48] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-27 20:32:52] [INFO ] After 3927ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-27 20:32:52] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:32:53] [INFO ] After 1386ms SMT Verify possible using 1374 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:32:53] [INFO ] After 5505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:32:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:32:56] [INFO ] After 3233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:33:02] [INFO ] After 5598ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:33:04] [INFO ] Deduced a trap composed of 51 places in 1645 ms of which 0 ms to minimize.
[2024-05-27 20:33:06] [INFO ] Deduced a trap composed of 185 places in 1665 ms of which 1 ms to minimize.
[2024-05-27 20:33:08] [INFO ] Deduced a trap composed of 19 places in 1643 ms of which 1 ms to minimize.
[2024-05-27 20:33:10] [INFO ] Deduced a trap composed of 121 places in 1698 ms of which 0 ms to minimize.
[2024-05-27 20:33:13] [INFO ] Deduced a trap composed of 144 places in 1792 ms of which 1 ms to minimize.
[2024-05-27 20:33:15] [INFO ] Deduced a trap composed of 118 places in 1806 ms of which 0 ms to minimize.
[2024-05-27 20:33:17] [INFO ] Deduced a trap composed of 164 places in 1664 ms of which 0 ms to minimize.
[2024-05-27 20:33:19] [INFO ] Deduced a trap composed of 92 places in 1581 ms of which 1 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-27 20:33:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:33:19] [INFO ] After 26420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 89 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 91 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2024-05-27 20:33:20] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:33:20] [INFO ] Invariant cache hit.
[2024-05-27 20:33:21] [INFO ] Implicit Places using invariants in 931 ms returned []
Implicit Place search using SMT only with invariants took 932 ms to find 0 implicit places.
[2024-05-27 20:33:21] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:33:21] [INFO ] Invariant cache hit.
[2024-05-27 20:33:28] [INFO ] Dead Transitions using invariants and state equation in 7329 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8355 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10337 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 171 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 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 12 rules applied. Total rules applied 14 place count 171 transition count 2297
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 169 transition count 2297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 168 transition count 2287
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 168 transition count 2287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 166 transition count 2285
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 166 transition count 2252
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 165 transition count 2262
Drop transitions removed 1209 transitions
Redundant transition composition rules discarded 1209 transitions
Iterating global reduction 3 with 1209 rules applied. Total rules applied 1266 place count 165 transition count 1053
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1233 edges and 163 vertex of which 144 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1277 place count 144 transition count 1042
Drop transitions removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 4 with 111 rules applied. Total rules applied 1388 place count 144 transition count 931
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1390 place count 142 transition count 921
Iterating global reduction 5 with 2 rules applied. Total rules applied 1392 place count 142 transition count 921
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1393 place count 142 transition count 920
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1395 place count 141 transition count 919
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1400 place count 141 transition count 914
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1412 place count 141 transition count 895
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1444 place count 129 transition count 875
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1445 place count 128 transition count 873
Iterating global reduction 7 with 1 rules applied. Total rules applied 1446 place count 128 transition count 873
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1454 place count 128 transition count 865
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1512 place count 128 transition count 807
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1518 place count 128 transition count 801
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1528 place count 122 transition count 797
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1534 place count 122 transition count 791
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1536 place count 122 transition count 789
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1540 place count 120 transition count 787
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1544 place count 120 transition count 783
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1546 place count 120 transition count 781
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1550 place count 118 transition count 779
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1552 place count 118 transition count 777
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1557 place count 118 transition count 855
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1574 place count 113 transition count 843
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1575 place count 112 transition count 839
Iterating global reduction 12 with 1 rules applied. Total rules applied 1576 place count 112 transition count 839
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1585 place count 112 transition count 830
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1604 place count 112 transition count 811
Applied a total of 1604 rules in 219 ms. Remains 112 /497 variables (removed 385) and now considering 811/27456 (removed 26645) transitions.
Running SMT prover for 1 properties.
[2024-05-27 20:33:28] [INFO ] Flow matrix only has 779 transitions (discarded 32 similar events)
// Phase 1: matrix 779 rows 112 cols
[2024-05-27 20:33:28] [INFO ] Computed 0 invariants in 2 ms
[2024-05-27 20:33:28] [INFO ] After 111ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-27 20:33:28] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-27 20:33:28] [INFO ] After 20ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:33:28] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:33:29] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:33:29] [INFO ] After 27ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:33:29] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-27 20:33:29] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Product exploration explored 100000 steps with 0 reset in 1659 ms.
Product exploration explored 100000 steps with 1 reset in 2218 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0]
Support contains 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 10 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 28429
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 10 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 513 transition count 28442
Deduced a syphon composed of 2 places in 10 ms
Applied a total of 2 rules in 230 ms. Remains 513 /513 variables (removed 0) and now considering 28442/28429 (removed -13) transitions.
[2024-05-27 20:33:34] [INFO ] Flow matrix only has 18686 transitions (discarded 9756 similar events)
// Phase 1: matrix 18686 rows 513 cols
[2024-05-27 20:33:34] [INFO ] Computed 8 invariants in 51 ms
[2024-05-27 20:33:42] [INFO ] Dead Transitions using invariants and state equation in 8078 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/513 places, 28442/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8311 ms. Remains : 513/513 places, 28442/28429 transitions.
Built C files in :
/tmp/ltsmin14118075285313450023
[2024-05-27 20:33:42] [INFO ] Built C files in 188ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14118075285313450023
Running compilation step : cd /tmp/ltsmin14118075285313450023;'/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/ltsmin14118075285313450023;'/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/ltsmin14118075285313450023;'/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 3 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 33 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:33:45] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2024-05-27 20:33:45] [INFO ] Computed 8 invariants in 46 ms
[2024-05-27 20:33:46] [INFO ] Implicit Places using invariants in 800 ms returned []
Implicit Place search using SMT only with invariants took 805 ms to find 0 implicit places.
[2024-05-27 20:33:46] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:33:46] [INFO ] Invariant cache hit.
[2024-05-27 20:33:54] [INFO ] Dead Transitions using invariants and state equation in 7798 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8639 ms. Remains : 513/513 places, 28429/28429 transitions.
Built C files in :
/tmp/ltsmin11771997078230545597
[2024-05-27 20:33:54] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11771997078230545597
Running compilation step : cd /tmp/ltsmin11771997078230545597;'/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/ltsmin11771997078230545597;'/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/ltsmin11771997078230545597;'/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-27 20:33:58] [INFO ] Flatten gal took : 662 ms
[2024-05-27 20:33:59] [INFO ] Flatten gal took : 678 ms
[2024-05-27 20:33:59] [INFO ] Time to serialize gal into /tmp/LTL9669042594266173559.gal : 126 ms
[2024-05-27 20:33:59] [INFO ] Time to serialize properties into /tmp/LTL5469040419590607226.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/LTL9669042594266173559.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2263585705141203692.hoa' '-atoms' '/tmp/LTL5469040419590607226.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/LTL5469040419590607226.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2263585705141203692.hoa
Detected timeout of ITS tools.
[2024-05-27 20:34:15] [INFO ] Flatten gal took : 654 ms
[2024-05-27 20:34:16] [INFO ] Flatten gal took : 782 ms
[2024-05-27 20:34:16] [INFO ] Time to serialize gal into /tmp/LTL11307075218220604024.gal : 93 ms
[2024-05-27 20:34:16] [INFO ] Time to serialize properties into /tmp/LTL9095923887185786158.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/LTL11307075218220604024.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9095923887185786158.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 : !((G(X((X(F(X((F("(ps328==1)"))U("(ps328==0)")))))U("((ps49==0)||(ps458==1))")))))
Formula 0 simplified : XF(!"((ps49==0)||(ps458==1))" & X(!"((ps49==0)||(ps458==1))" W XG!"(ps328==0)"))
Detected timeout of ITS tools.
[2024-05-27 20:34:31] [INFO ] Flatten gal took : 654 ms
[2024-05-27 20:34:31] [INFO ] Applying decomposition
[2024-05-27 20:34:32] [INFO ] Flatten gal took : 677 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/graph15342455851365243730.txt' '-o' '/tmp/graph15342455851365243730.bin' '-w' '/tmp/graph15342455851365243730.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15342455851365243730.bin' '-l' '-1' '-v' '-w' '/tmp/graph15342455851365243730.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:34:33] [INFO ] Decomposing Gal with order
[2024-05-27 20:34:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:34:35] [INFO ] Removed a total of 64249 redundant transitions.
[2024-05-27 20:34:35] [INFO ] Flatten gal took : 1195 ms
[2024-05-27 20:34:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 2238 labels/synchronizations in 603 ms.
[2024-05-27 20:34:36] [INFO ] Time to serialize gal into /tmp/LTL1878211769873129289.gal : 37 ms
[2024-05-27 20:34:36] [INFO ] Time to serialize properties into /tmp/LTL13305815446510809070.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/LTL1878211769873129289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13305815446510809070.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((G(X((X(F(X((F("(i0.i1.u35.ps328==1)"))U("(i0.i1.u35.ps328==0)")))))U("((i1.i1.u116.ps49==0)||(i6.u58.ps458==1))")))))
Formula 0 simplified : XF(!"((i1.i1.u116.ps49==0)||(i6.u58.ps458==1))" & X(!"((i1.i1.u116.ps49==0)||(i6.u58.ps458==1))" W XG!"(i0.i1.u35.ps328==0)"))
Reverse transition relation is NOT exact ! Due to transitions t219, t282, t614, t630, t646, t710, t727, t743, t1026, t1034, t1042, t1065, t1379, t1443, t14...2030
Computing Next relation with stutter on 6 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6130480513376009460
[2024-05-27 20:34:51] [INFO ] Built C files in 165ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6130480513376009460
Running compilation step : cd /tmp/ltsmin6130480513376009460;'/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/ltsmin6130480513376009460;'/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/ltsmin6130480513376009460;'/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 RERS2020-PT-pb103-LTLCardinality-05 finished in 245819 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)))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 31 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:34:54] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:34:54] [INFO ] Invariant cache hit.
[2024-05-27 20:34:55] [INFO ] Implicit Places using invariants in 712 ms returned []
Implicit Place search using SMT only with invariants took 713 ms to find 0 implicit places.
[2024-05-27 20:34:55] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:34:55] [INFO ] Invariant cache hit.
[2024-05-27 20:35:03] [INFO ] Dead Transitions using invariants and state equation in 8040 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8787 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s176 0) (EQ s232 1))], 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 explored 100000 steps with 50000 reset in 3425 ms.
Product exploration explored 100000 steps with 50000 reset in 3470 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb103-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb103-LTLCardinality-06 finished in 15919 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((X(p0)||F(((p2&&F(p3))||p1)))))'
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 31 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:35:10] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:35:10] [INFO ] Invariant cache hit.
[2024-05-27 20:35:11] [INFO ] Implicit Places using invariants in 749 ms returned []
Implicit Place search using SMT only with invariants took 752 ms to find 0 implicit places.
[2024-05-27 20:35:11] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:35:11] [INFO ] Invariant cache hit.
[2024-05-27 20:35:19] [INFO ] Dead Transitions using invariants and state equation in 8003 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8789 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s78 0) (EQ s365 1)), p2:(OR (EQ s61 0) (EQ s19 1)), p3:(OR (EQ s265 0) (EQ s245 1)), p0:(AND (EQ s0 0) (EQ s399 1))], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1917 ms.
Product exploration explored 100000 steps with 0 reset in 2432 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Detected a total of 121/513 stabilizing places and 10286/28429 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p2 p3 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 133 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 33584 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33584 steps, saw 23039 distinct states, run finished after 3003 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-27 20:35:28] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:35:28] [INFO ] Invariant cache hit.
[2024-05-27 20:35:28] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-27 20:35:28] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:35:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-27 20:35:33] [INFO ] After 5012ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:35:33] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2024-05-27 20:35:44] [INFO ] After 10672ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:35:47] [INFO ] Deduced a trap composed of 12 places in 2071 ms of which 0 ms to minimize.
[2024-05-27 20:35:49] [INFO ] Deduced a trap composed of 14 places in 2177 ms of which 0 ms to minimize.
[2024-05-27 20:35:52] [INFO ] Deduced a trap composed of 50 places in 2158 ms of which 1 ms to minimize.
[2024-05-27 20:35:54] [INFO ] Deduced a trap composed of 34 places in 2228 ms of which 0 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-27 20:35:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:35:54] [INFO ] After 26183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 609 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 610 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 35031 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35031 steps, saw 24919 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-27 20:35:59] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:35:59] [INFO ] Computed 8 invariants in 53 ms
[2024-05-27 20:35:59] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-27 20:35:59] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:35:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:36:04] [INFO ] After 4837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:36:04] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:36:15] [INFO ] After 10850ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:36:18] [INFO ] Deduced a trap composed of 120 places in 1690 ms of which 5 ms to minimize.
[2024-05-27 20:36:20] [INFO ] Deduced a trap composed of 32 places in 1960 ms of which 1 ms to minimize.
[2024-05-27 20:36:24] [INFO ] Deduced a trap composed of 77 places in 1993 ms of which 0 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-27 20:36:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:36:24] [INFO ] After 25405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 8 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 93 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 92 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2024-05-27 20:36:25] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:36:25] [INFO ] Invariant cache hit.
[2024-05-27 20:36:26] [INFO ] Implicit Places using invariants in 869 ms returned []
Implicit Place search using SMT only with invariants took 870 ms to find 0 implicit places.
[2024-05-27 20:36:26] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:36:26] [INFO ] Invariant cache hit.
[2024-05-27 20:36:33] [INFO ] Dead Transitions using invariants and state equation in 7539 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8505 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 9903 edges and 497 vertex of which 378 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 316 places
Drop transitions removed 10625 transitions
Ensure Unique test removed 14226 transitions
Reduce isomorphic transitions removed 24851 transitions.
Graph (complete) has 2518 edges and 181 vertex of which 173 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 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 14 rules applied. Total rules applied 16 place count 173 transition count 2591
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 171 transition count 2591
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 169 transition count 2589
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 169 transition count 2556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 168 transition count 2566
Drop transitions removed 1367 transitions
Redundant transition composition rules discarded 1367 transitions
Iterating global reduction 3 with 1367 rules applied. Total rules applied 1424 place count 168 transition count 1199
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1392 edges and 166 vertex of which 147 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 1434 place count 147 transition count 1189
Drop transitions removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 4 with 108 rules applied. Total rules applied 1542 place count 147 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1544 place count 145 transition count 1069
Iterating global reduction 5 with 2 rules applied. Total rules applied 1546 place count 145 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1547 place count 145 transition count 1068
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1551 place count 145 transition count 1064
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1555 place count 145 transition count 1060
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1561 place count 141 transition count 1058
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 1595 place count 141 transition count 1024
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1596 place count 141 transition count 1023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1597 place count 140 transition count 1023
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1601 place count 140 transition count 1019
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1603 place count 140 transition count 1024
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1613 place count 138 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1614 place count 137 transition count 1010
Iterating global reduction 9 with 1 rules applied. Total rules applied 1615 place count 137 transition count 1010
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1624 place count 137 transition count 1001
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1626 place count 137 transition count 1001
Applied a total of 1626 rules in 196 ms. Remains 137 /497 variables (removed 360) and now considering 1001/27456 (removed 26455) transitions.
Running SMT prover for 6 properties.
[2024-05-27 20:36:33] [INFO ] Flow matrix only has 965 transitions (discarded 36 similar events)
// Phase 1: matrix 965 rows 137 cols
[2024-05-27 20:36:33] [INFO ] Computed 0 invariants in 5 ms
[2024-05-27 20:36:34] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:36:34] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:36:34] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-27 20:36:34] [INFO ] After 218ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:36:35] [INFO ] After 502ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 220 ms.
[2024-05-27 20:36:35] [INFO ] After 1092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p1 p2 p3 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 130 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 32 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:36:35] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2024-05-27 20:36:35] [INFO ] Computed 8 invariants in 53 ms
[2024-05-27 20:36:36] [INFO ] Implicit Places using invariants in 812 ms returned []
Implicit Place search using SMT only with invariants took 812 ms to find 0 implicit places.
[2024-05-27 20:36:36] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:36:36] [INFO ] Invariant cache hit.
[2024-05-27 20:36:44] [INFO ] Dead Transitions using invariants and state equation in 7887 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8734 ms. Remains : 513/513 places, 28429/28429 transitions.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Detected a total of 121/513 stabilizing places and 10286/28429 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p2 p3 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 129 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 36501 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 36501 steps, saw 24950 distinct states, run finished after 3003 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-27 20:36:48] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:36:48] [INFO ] Invariant cache hit.
[2024-05-27 20:36:48] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:36:48] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:36:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:36:54] [INFO ] After 4974ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:36:54] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2024-05-27 20:37:06] [INFO ] After 12198ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:37:08] [INFO ] Deduced a trap composed of 12 places in 1933 ms of which 1 ms to minimize.
[2024-05-27 20:37:11] [INFO ] Deduced a trap composed of 14 places in 1930 ms of which 1 ms to minimize.
[2024-05-27 20:37:13] [INFO ] Deduced a trap composed of 50 places in 2004 ms of which 0 ms to minimize.
[2024-05-27 20:37:16] [INFO ] Deduced a trap composed of 9 places in 2414 ms of which 4 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-27 20:37:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:37:16] [INFO ] After 27479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 803 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 803 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 34722 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34722 steps, saw 24729 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-27 20:37:21] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:37:21] [INFO ] Computed 8 invariants in 50 ms
[2024-05-27 20:37:21] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:37:21] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:37:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:37:26] [INFO ] After 4992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:37:26] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:37:37] [INFO ] After 11112ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:37:40] [INFO ] Deduced a trap composed of 120 places in 1690 ms of which 1 ms to minimize.
[2024-05-27 20:37:42] [INFO ] Deduced a trap composed of 32 places in 1985 ms of which 0 ms to minimize.
[2024-05-27 20:37:47] [INFO ] Deduced a trap composed of 77 places in 2164 ms of which 0 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-27 20:37:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:37:47] [INFO ] After 26088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 8 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 119 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 118 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2024-05-27 20:37:47] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:37:47] [INFO ] Invariant cache hit.
[2024-05-27 20:37:48] [INFO ] Implicit Places using invariants in 940 ms returned []
Implicit Place search using SMT only with invariants took 941 ms to find 0 implicit places.
[2024-05-27 20:37:48] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:37:48] [INFO ] Invariant cache hit.
[2024-05-27 20:37:56] [INFO ] Dead Transitions using invariants and state equation in 8023 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9090 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 9903 edges and 497 vertex of which 378 / 497 are part of one of the 62 SCC in 1 ms
Free SCC test removed 316 places
Drop transitions removed 10625 transitions
Ensure Unique test removed 14226 transitions
Reduce isomorphic transitions removed 24851 transitions.
Graph (complete) has 2518 edges and 181 vertex of which 173 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 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 14 rules applied. Total rules applied 16 place count 173 transition count 2591
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 171 transition count 2591
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 169 transition count 2589
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 169 transition count 2556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 168 transition count 2566
Drop transitions removed 1367 transitions
Redundant transition composition rules discarded 1367 transitions
Iterating global reduction 3 with 1367 rules applied. Total rules applied 1424 place count 168 transition count 1199
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1392 edges and 166 vertex of which 147 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 1434 place count 147 transition count 1189
Drop transitions removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 4 with 108 rules applied. Total rules applied 1542 place count 147 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1544 place count 145 transition count 1069
Iterating global reduction 5 with 2 rules applied. Total rules applied 1546 place count 145 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1547 place count 145 transition count 1068
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1551 place count 145 transition count 1064
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1555 place count 145 transition count 1060
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1561 place count 141 transition count 1058
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 1595 place count 141 transition count 1024
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1596 place count 141 transition count 1023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1597 place count 140 transition count 1023
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1601 place count 140 transition count 1019
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1603 place count 140 transition count 1024
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1613 place count 138 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1614 place count 137 transition count 1010
Iterating global reduction 9 with 1 rules applied. Total rules applied 1615 place count 137 transition count 1010
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1624 place count 137 transition count 1001
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1626 place count 137 transition count 1001
Applied a total of 1626 rules in 207 ms. Remains 137 /497 variables (removed 360) and now considering 1001/27456 (removed 26455) transitions.
Running SMT prover for 6 properties.
[2024-05-27 20:37:56] [INFO ] Flow matrix only has 965 transitions (discarded 36 similar events)
// Phase 1: matrix 965 rows 137 cols
[2024-05-27 20:37:56] [INFO ] Computed 0 invariants in 8 ms
[2024-05-27 20:37:57] [INFO ] After 381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:37:57] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:37:57] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-27 20:37:57] [INFO ] After 215ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:37:58] [INFO ] After 496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 225 ms.
[2024-05-27 20:37:58] [INFO ] After 1098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p1 p2 p3 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 128 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 2456 ms.
Product exploration explored 100000 steps with 0 reset in 2606 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 11 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 28429
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 10 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 513 transition count 28442
Deduced a syphon composed of 2 places in 10 ms
Applied a total of 2 rules in 216 ms. Remains 513 /513 variables (removed 0) and now considering 28442/28429 (removed -13) transitions.
[2024-05-27 20:38:04] [INFO ] Flow matrix only has 18686 transitions (discarded 9756 similar events)
// Phase 1: matrix 18686 rows 513 cols
[2024-05-27 20:38:04] [INFO ] Computed 8 invariants in 54 ms
[2024-05-27 20:38:12] [INFO ] Dead Transitions using invariants and state equation in 8110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/513 places, 28442/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8327 ms. Remains : 513/513 places, 28442/28429 transitions.
Built C files in :
/tmp/ltsmin2954702242616047837
[2024-05-27 20:38:13] [INFO ] Built C files in 187ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2954702242616047837
Running compilation step : cd /tmp/ltsmin2954702242616047837;'/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/ltsmin2954702242616047837;'/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/ltsmin2954702242616047837;'/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 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 36 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2024-05-27 20:38:16] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2024-05-27 20:38:16] [INFO ] Computed 8 invariants in 64 ms
[2024-05-27 20:38:17] [INFO ] Implicit Places using invariants in 883 ms returned []
Implicit Place search using SMT only with invariants took 883 ms to find 0 implicit places.
[2024-05-27 20:38:17] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2024-05-27 20:38:17] [INFO ] Invariant cache hit.
[2024-05-27 20:38:25] [INFO ] Dead Transitions using invariants and state equation in 8145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9067 ms. Remains : 513/513 places, 28429/28429 transitions.
Built C files in :
/tmp/ltsmin2644581496847366792
[2024-05-27 20:38:25] [INFO ] Built C files in 173ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2644581496847366792
Running compilation step : cd /tmp/ltsmin2644581496847366792;'/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/ltsmin2644581496847366792;'/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/ltsmin2644581496847366792;'/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-27 20:38:29] [INFO ] Flatten gal took : 681 ms
[2024-05-27 20:38:30] [INFO ] Flatten gal took : 654 ms
[2024-05-27 20:38:30] [INFO ] Time to serialize gal into /tmp/LTL14257894740141706572.gal : 101 ms
[2024-05-27 20:38:30] [INFO ] Time to serialize properties into /tmp/LTL3510099041296196393.prop : 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/LTL14257894740141706572.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7818901656907828173.hoa' '-atoms' '/tmp/LTL3510099041296196393.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3510099041296196393.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7818901656907828173.hoa
Detected timeout of ITS tools.
[2024-05-27 20:38:46] [INFO ] Flatten gal took : 808 ms
[2024-05-27 20:38:47] [INFO ] Flatten gal took : 640 ms
[2024-05-27 20:38:47] [INFO ] Time to serialize gal into /tmp/LTL5932138119892669657.gal : 97 ms
[2024-05-27 20:38:47] [INFO ] Time to serialize properties into /tmp/LTL6484961555227168143.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/LTL5932138119892669657.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6484961555227168143.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X("((ps303==0)&&(ps386==1))"))||(F(("((ps97==0)||(ps138==1))")||(("((ps494==0)||(ps468==1))")&&(F("((ps512==0)||(ps350==1))"))))...159
Formula 0 simplified : F(X!"((ps303==0)&&(ps386==1))" & G(!"((ps97==0)||(ps138==1))" & (!"((ps494==0)||(ps468==1))" | G!"((ps512==0)||(ps350==1))")))
Detected timeout of ITS tools.
[2024-05-27 20:39:03] [INFO ] Flatten gal took : 658 ms
[2024-05-27 20:39:03] [INFO ] Applying decomposition
[2024-05-27 20:39:04] [INFO ] Flatten gal took : 774 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/graph6837732867976990737.txt' '-o' '/tmp/graph6837732867976990737.bin' '-w' '/tmp/graph6837732867976990737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6837732867976990737.bin' '-l' '-1' '-v' '-w' '/tmp/graph6837732867976990737.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:39:05] [INFO ] Decomposing Gal with order
[2024-05-27 20:39:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:39:06] [INFO ] Removed a total of 64198 redundant transitions.
[2024-05-27 20:39:07] [INFO ] Flatten gal took : 1150 ms
[2024-05-27 20:39:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 2267 labels/synchronizations in 614 ms.
[2024-05-27 20:39:08] [INFO ] Time to serialize gal into /tmp/LTL5413783394821602277.gal : 36 ms
[2024-05-27 20:39:08] [INFO ] Time to serialize properties into /tmp/LTL17451109610288744416.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5413783394821602277.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17451109610288744416.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((G((X("((i3.i0.u68.ps303==0)&&(i7.i0.u67.ps386==1))"))||(F(("((i5.i0.u99.ps97==0)||(i2.i0.u102.ps138==1))")||(("((i4.u106.ps494==0)|...238
Formula 0 simplified : F(X!"((i3.i0.u68.ps303==0)&&(i7.i0.u67.ps386==1))" & G(!"((i5.i0.u99.ps97==0)||(i2.i0.u102.ps138==1))" & (!"((i4.u106.ps494==0)||(i3...228
Reverse transition relation is NOT exact ! Due to transitions t217, t280, t612, t628, t644, t708, t725, t741, t1025, t1033, t1041, t1064, t1377, t1441, t14...2155
Computing Next relation with stutter on 6 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin120890506270442816
[2024-05-27 20:39:23] [INFO ] Built C files in 185ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin120890506270442816
Running compilation step : cd /tmp/ltsmin120890506270442816;'/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/ltsmin120890506270442816;'/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/ltsmin120890506270442816;'/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 RERS2020-PT-pb103-LTLCardinality-07 finished in 255557 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((p0 U (G(F(p2))||p1))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 257 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2024-05-27 20:39:26] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2024-05-27 20:39:26] [INFO ] Computed 8 invariants in 59 ms
[2024-05-27 20:39:27] [INFO ] Implicit Places using invariants in 854 ms returned []
Implicit Place search using SMT only with invariants took 855 ms to find 0 implicit places.
[2024-05-27 20:39:27] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:39:27] [INFO ] Invariant cache hit.
[2024-05-27 20:39:35] [INFO ] Dead Transitions using invariants and state equation in 8133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9248 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s7 0) (EQ s8 1)), p0:(OR (EQ s149 0) (EQ s443 1)), p2:(OR (EQ s7 0) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 1911 ms.
Product exploration explored 100000 steps with 0 reset in 1891 ms.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 127 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-27 20:39:40] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:39:40] [INFO ] Invariant cache hit.
[2024-05-27 20:39:40] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:39:45] [INFO ] After 4791ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:39:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:39:50] [INFO ] After 4475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:39:50] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2024-05-27 20:40:00] [INFO ] After 10282ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 20:40:02] [INFO ] Deduced a trap composed of 11 places in 1546 ms of which 1 ms to minimize.
[2024-05-27 20:40:04] [INFO ] Deduced a trap composed of 58 places in 1483 ms of which 0 ms to minimize.
[2024-05-27 20:40:06] [INFO ] Deduced a trap composed of 48 places in 1623 ms of which 0 ms to minimize.
[2024-05-27 20:40:08] [INFO ] Deduced a trap composed of 104 places in 1637 ms of which 0 ms to minimize.
[2024-05-27 20:40:10] [INFO ] Deduced a trap composed of 52 places in 1666 ms of which 0 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-27 20:40:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:40:10] [INFO ] After 25561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 510 transition count 27376
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 510 transition count 27364
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 497 transition count 27456
Applied a total of 1176 rules in 389 ms. Remains 497 /510 variables (removed 13) and now considering 27456/28438 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 497/510 places, 27456/28438 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 33738 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33738 steps, saw 24068 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-27 20:40:14] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:40:14] [INFO ] Computed 8 invariants in 51 ms
[2024-05-27 20:40:15] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:40:19] [INFO ] After 4324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:40:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-27 20:40:23] [INFO ] After 4211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:40:23] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:40:33] [INFO ] After 9389ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 20:40:35] [INFO ] Deduced a trap composed of 47 places in 1850 ms of which 0 ms to minimize.
[2024-05-27 20:40:37] [INFO ] Deduced a trap composed of 101 places in 1813 ms of which 1 ms to minimize.
[2024-05-27 20:40:39] [INFO ] Deduced a trap composed of 51 places in 1589 ms of which 1 ms to minimize.
[2024-05-27 20:40:42] [INFO ] Deduced a trap composed of 12 places in 1896 ms of which 1 ms to minimize.
[2024-05-27 20:40:44] [INFO ] Deduced a trap composed of 90 places in 1987 ms of which 1 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-27 20:40:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:40:44] [INFO ] After 25105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 104 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 102 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2024-05-27 20:40:44] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:40:44] [INFO ] Invariant cache hit.
[2024-05-27 20:40:45] [INFO ] Implicit Places using invariants in 910 ms returned []
Implicit Place search using SMT only with invariants took 910 ms to find 0 implicit places.
[2024-05-27 20:40:45] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:40:45] [INFO ] Invariant cache hit.
[2024-05-27 20:40:53] [INFO ] Dead Transitions using invariants and state equation in 7534 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8549 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10165 edges and 497 vertex of which 376 / 497 are part of one of the 61 SCC in 1 ms
Free SCC test removed 315 places
Drop transitions removed 10951 transitions
Ensure Unique test removed 13987 transitions
Reduce isomorphic transitions removed 24938 transitions.
Graph (complete) has 2458 edges and 182 vertex of which 175 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 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 13 rules applied. Total rules applied 15 place count 175 transition count 2505
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 173 transition count 2505
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 171 transition count 2485
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 171 transition count 2485
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 170 transition count 2473
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 170 transition count 2473
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 168 transition count 2471
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 60 place count 168 transition count 2438
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 167 transition count 2448
Drop transitions removed 1320 transitions
Redundant transition composition rules discarded 1320 transitions
Iterating global reduction 3 with 1320 rules applied. Total rules applied 1382 place count 167 transition count 1128
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1300 edges and 164 vertex of which 147 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 15 rules applied. Total rules applied 1397 place count 147 transition count 1114
Drop transitions removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 4 with 110 rules applied. Total rules applied 1507 place count 147 transition count 1004
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1508 place count 146 transition count 999
Iterating global reduction 5 with 1 rules applied. Total rules applied 1509 place count 146 transition count 999
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1510 place count 146 transition count 998
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1512 place count 145 transition count 997
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1517 place count 145 transition count 992
Free-agglomeration rule applied 9 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 9 rules applied. Total rules applied 1526 place count 145 transition count 976
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 1553 place count 136 transition count 958
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1554 place count 135 transition count 956
Iterating global reduction 7 with 1 rules applied. Total rules applied 1555 place count 135 transition count 956
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1563 place count 135 transition count 948
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 8 with 44 rules applied. Total rules applied 1607 place count 135 transition count 904
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1610 place count 135 transition count 901
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1613 place count 132 transition count 901
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1617 place count 132 transition count 995
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 1636 place count 128 transition count 980
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1637 place count 127 transition count 976
Iterating global reduction 10 with 1 rules applied. Total rules applied 1638 place count 127 transition count 976
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1647 place count 127 transition count 967
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 1668 place count 127 transition count 946
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1670 place count 127 transition count 946
Applied a total of 1670 rules in 224 ms. Remains 127 /497 variables (removed 370) and now considering 946/27456 (removed 26510) transitions.
Running SMT prover for 3 properties.
[2024-05-27 20:40:53] [INFO ] Flow matrix only has 911 transitions (discarded 35 similar events)
// Phase 1: matrix 911 rows 127 cols
[2024-05-27 20:40:53] [INFO ] Computed 0 invariants in 3 ms
[2024-05-27 20:40:53] [INFO ] After 193ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-27 20:40:53] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-27 20:40:53] [INFO ] After 32ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:40:53] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:40:53] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:40:53] [INFO ] After 84ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 20:40:54] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-27 20:40:54] [INFO ] After 514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (OR p1 p0)))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 12 factoid took 167 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 110 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2024-05-27 20:40:54] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2024-05-27 20:40:54] [INFO ] Computed 8 invariants in 57 ms
[2024-05-27 20:40:55] [INFO ] Implicit Places using invariants in 827 ms returned []
Implicit Place search using SMT only with invariants took 827 ms to find 0 implicit places.
[2024-05-27 20:40:55] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:40:55] [INFO ] Invariant cache hit.
[2024-05-27 20:41:03] [INFO ] Dead Transitions using invariants and state equation in 7841 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8780 ms. Remains : 510/510 places, 28438/28438 transitions.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 117 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-27 20:41:04] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:41:04] [INFO ] Invariant cache hit.
[2024-05-27 20:41:04] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-27 20:41:09] [INFO ] After 4794ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:41:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-27 20:41:13] [INFO ] After 4478ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:41:13] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2024-05-27 20:41:24] [INFO ] After 10330ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 20:41:26] [INFO ] Deduced a trap composed of 11 places in 1520 ms of which 1 ms to minimize.
[2024-05-27 20:41:28] [INFO ] Deduced a trap composed of 58 places in 1451 ms of which 1 ms to minimize.
[2024-05-27 20:41:30] [INFO ] Deduced a trap composed of 48 places in 1442 ms of which 0 ms to minimize.
[2024-05-27 20:41:32] [INFO ] Deduced a trap composed of 104 places in 1694 ms of which 1 ms to minimize.
[2024-05-27 20:41:34] [INFO ] Deduced a trap composed of 52 places in 1698 ms of which 1 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-27 20:41:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:41:34] [INFO ] After 25532ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 510 transition count 27376
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 510 transition count 27364
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 497 transition count 27456
Applied a total of 1176 rules in 402 ms. Remains 497 /510 variables (removed 13) and now considering 27456/28438 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 402 ms. Remains : 497/510 places, 27456/28438 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 33103 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33103 steps, saw 23623 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-27 20:41:38] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:41:38] [INFO ] Computed 8 invariants in 50 ms
[2024-05-27 20:41:38] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:41:43] [INFO ] After 4529ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:41:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:41:47] [INFO ] After 4280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:41:47] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:41:56] [INFO ] After 9043ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 20:41:59] [INFO ] Deduced a trap composed of 47 places in 1832 ms of which 4 ms to minimize.
[2024-05-27 20:42:01] [INFO ] Deduced a trap composed of 101 places in 1919 ms of which 1 ms to minimize.
[2024-05-27 20:42:03] [INFO ] Deduced a trap composed of 51 places in 1559 ms of which 0 ms to minimize.
[2024-05-27 20:42:05] [INFO ] Deduced a trap composed of 12 places in 1854 ms of which 1 ms to minimize.
[2024-05-27 20:42:08] [INFO ] Deduced a trap composed of 90 places in 1995 ms of which 0 ms to minimize.
[2024-05-27 20:42:08] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 11183 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
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-27 20:42:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:42:08] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 97 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 96 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2024-05-27 20:42:08] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:42:08] [INFO ] Invariant cache hit.
[2024-05-27 20:42:09] [INFO ] Implicit Places using invariants in 888 ms returned []
Implicit Place search using SMT only with invariants took 890 ms to find 0 implicit places.
[2024-05-27 20:42:09] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:42:09] [INFO ] Invariant cache hit.
[2024-05-27 20:42:17] [INFO ] Dead Transitions using invariants and state equation in 7680 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8670 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10165 edges and 497 vertex of which 376 / 497 are part of one of the 61 SCC in 1 ms
Free SCC test removed 315 places
Drop transitions removed 10951 transitions
Ensure Unique test removed 13987 transitions
Reduce isomorphic transitions removed 24938 transitions.
Graph (complete) has 2458 edges and 182 vertex of which 175 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 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 13 rules applied. Total rules applied 15 place count 175 transition count 2505
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 173 transition count 2505
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 171 transition count 2485
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 171 transition count 2485
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 170 transition count 2473
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 170 transition count 2473
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 168 transition count 2471
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 60 place count 168 transition count 2438
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 167 transition count 2448
Drop transitions removed 1320 transitions
Redundant transition composition rules discarded 1320 transitions
Iterating global reduction 3 with 1320 rules applied. Total rules applied 1382 place count 167 transition count 1128
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1300 edges and 164 vertex of which 147 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 15 rules applied. Total rules applied 1397 place count 147 transition count 1114
Drop transitions removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 4 with 110 rules applied. Total rules applied 1507 place count 147 transition count 1004
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1508 place count 146 transition count 999
Iterating global reduction 5 with 1 rules applied. Total rules applied 1509 place count 146 transition count 999
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1510 place count 146 transition count 998
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1512 place count 145 transition count 997
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1517 place count 145 transition count 992
Free-agglomeration rule applied 9 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 9 rules applied. Total rules applied 1526 place count 145 transition count 976
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 1553 place count 136 transition count 958
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1554 place count 135 transition count 956
Iterating global reduction 7 with 1 rules applied. Total rules applied 1555 place count 135 transition count 956
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1563 place count 135 transition count 948
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 8 with 44 rules applied. Total rules applied 1607 place count 135 transition count 904
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1610 place count 135 transition count 901
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1613 place count 132 transition count 901
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1617 place count 132 transition count 995
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 1636 place count 128 transition count 980
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1637 place count 127 transition count 976
Iterating global reduction 10 with 1 rules applied. Total rules applied 1638 place count 127 transition count 976
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1647 place count 127 transition count 967
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 1668 place count 127 transition count 946
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1670 place count 127 transition count 946
Applied a total of 1670 rules in 218 ms. Remains 127 /497 variables (removed 370) and now considering 946/27456 (removed 26510) transitions.
Running SMT prover for 3 properties.
[2024-05-27 20:42:17] [INFO ] Flow matrix only has 911 transitions (discarded 35 similar events)
// Phase 1: matrix 911 rows 127 cols
[2024-05-27 20:42:17] [INFO ] Computed 0 invariants in 5 ms
[2024-05-27 20:42:17] [INFO ] After 196ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-27 20:42:17] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-27 20:42:17] [INFO ] After 28ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:42:17] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:42:17] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:42:17] [INFO ] After 83ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 20:42:18] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-27 20:42:18] [INFO ] After 521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 p2), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 12 factoid took 170 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 2226 ms.
Product exploration explored 100000 steps with 0 reset in 1846 ms.
Built C files in :
/tmp/ltsmin17367763798612925243
[2024-05-27 20:42:22] [INFO ] Too many transitions (28438) to apply POR reductions. Disabling POR matrices.
[2024-05-27 20:42:23] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17367763798612925243
Running compilation step : cd /tmp/ltsmin17367763798612925243;'/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/ltsmin17367763798612925243;'/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/ltsmin17367763798612925243;'/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 4 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 128 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2024-05-27 20:42:26] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2024-05-27 20:42:26] [INFO ] Computed 8 invariants in 56 ms
[2024-05-27 20:42:26] [INFO ] Implicit Places using invariants in 840 ms returned []
Implicit Place search using SMT only with invariants took 841 ms to find 0 implicit places.
[2024-05-27 20:42:27] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:42:27] [INFO ] Invariant cache hit.
[2024-05-27 20:42:34] [INFO ] Dead Transitions using invariants and state equation in 7814 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8784 ms. Remains : 510/510 places, 28438/28438 transitions.
Built C files in :
/tmp/ltsmin6911121996752999986
[2024-05-27 20:42:34] [INFO ] Too many transitions (28438) to apply POR reductions. Disabling POR matrices.
[2024-05-27 20:42:34] [INFO ] Built C files in 159ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6911121996752999986
Running compilation step : cd /tmp/ltsmin6911121996752999986;'/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/ltsmin6911121996752999986;'/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/ltsmin6911121996752999986;'/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-27 20:42:39] [INFO ] Flatten gal took : 655 ms
[2024-05-27 20:42:39] [INFO ] Flatten gal took : 695 ms
[2024-05-27 20:42:39] [INFO ] Time to serialize gal into /tmp/LTL10758447121283964607.gal : 101 ms
[2024-05-27 20:42:39] [INFO ] Time to serialize properties into /tmp/LTL12628328079225455687.prop : 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/LTL10758447121283964607.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11170732988880169180.hoa' '-atoms' '/tmp/LTL12628328079225455687.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...320
Loading property file /tmp/LTL12628328079225455687.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11170732988880169180.hoa
Detected timeout of ITS tools.
[2024-05-27 20:42:55] [INFO ] Flatten gal took : 652 ms
[2024-05-27 20:42:56] [INFO ] Flatten gal took : 680 ms
[2024-05-27 20:42:56] [INFO ] Time to serialize gal into /tmp/LTL12045442421724269326.gal : 94 ms
[2024-05-27 20:42:56] [INFO ] Time to serialize properties into /tmp/LTL9738339684732647182.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/LTL12045442421724269326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9738339684732647182.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 : !((G(("((ps499==0)||(ps64==1))")U(("((ps58==0)||(ps139==1))")||(G(F("((ps58==0)||(ps139==1))")))))))
Formula 0 simplified : F(!"((ps499==0)||(ps64==1))" R (!"((ps58==0)||(ps139==1))" & FG!"((ps58==0)||(ps139==1))"))
Detected timeout of ITS tools.
[2024-05-27 20:43:12] [INFO ] Flatten gal took : 657 ms
[2024-05-27 20:43:12] [INFO ] Applying decomposition
[2024-05-27 20:43:13] [INFO ] Flatten gal took : 762 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/graph6207900062661011453.txt' '-o' '/tmp/graph6207900062661011453.bin' '-w' '/tmp/graph6207900062661011453.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6207900062661011453.bin' '-l' '-1' '-v' '-w' '/tmp/graph6207900062661011453.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:43:14] [INFO ] Decomposing Gal with order
[2024-05-27 20:43:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:43:15] [INFO ] Removed a total of 64251 redundant transitions.
[2024-05-27 20:43:16] [INFO ] Flatten gal took : 1175 ms
[2024-05-27 20:43:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 2104 labels/synchronizations in 579 ms.
[2024-05-27 20:43:17] [INFO ] Time to serialize gal into /tmp/LTL6912399376816305984.gal : 38 ms
[2024-05-27 20:43:17] [INFO ] Time to serialize properties into /tmp/LTL8539512713336743140.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/LTL6912399376816305984.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8539512713336743140.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((G(("((i2.u2.ps499==0)||(i8.u62.ps64==1))")U(("((i8.u114.ps58==0)||(i0.i2.u88.ps139==1))")||(G(F("((i8.u114.ps58==0)||(i0.i2.u88.ps1...170
Formula 0 simplified : F(!"((i2.u2.ps499==0)||(i8.u62.ps64==1))" R (!"((i8.u114.ps58==0)||(i0.i2.u88.ps139==1))" & FG!"((i8.u114.ps58==0)||(i0.i2.u88.ps139...163
Reverse transition relation is NOT exact ! Due to transitions t215, t278, t610, t626, t642, t706, t723, t739, t1024, t1032, t1040, t1063, t1375, t1439, t14...1932
Computing Next relation with stutter on 6 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9914578265148568098
[2024-05-27 20:43:32] [INFO ] Built C files in 165ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9914578265148568098
Running compilation step : cd /tmp/ltsmin9914578265148568098;'/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/ltsmin9914578265148568098;'/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/ltsmin9914578265148568098;'/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 RERS2020-PT-pb103-LTLCardinality-11 finished in 249000 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)))'
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 241 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2024-05-27 20:43:35] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:43:35] [INFO ] Invariant cache hit.
[2024-05-27 20:43:36] [INFO ] Implicit Places using invariants in 798 ms returned []
Implicit Place search using SMT only with invariants took 799 ms to find 0 implicit places.
[2024-05-27 20:43:36] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:43:36] [INFO ] Invariant cache hit.
[2024-05-27 20:43:44] [INFO ] Dead Transitions using invariants and state equation in 7918 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8960 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s241 1)], 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 92 steps with 0 reset in 2 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-13 finished in 9055 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((G(p1)||p0))&&F(G(p2))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 235 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2024-05-27 20:43:44] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:43:44] [INFO ] Invariant cache hit.
[2024-05-27 20:43:45] [INFO ] Implicit Places using invariants in 745 ms returned []
Implicit Place search using SMT only with invariants took 746 ms to find 0 implicit places.
[2024-05-27 20:43:45] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:43:45] [INFO ] Invariant cache hit.
[2024-05-27 20:43:53] [INFO ] Dead Transitions using invariants and state equation in 8041 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9025 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (AND p0 (NOT p1)), (NOT p2)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s401 1)), p1:(OR (EQ s464 0) (EQ s230 1)), p2:(OR (EQ s19 0) (EQ s401 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1964 steps with 1 reset in 43 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-14 finished in 9275 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)&&F(G(p1)))))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 254 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2024-05-27 20:43:53] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:43:53] [INFO ] Invariant cache hit.
[2024-05-27 20:43:54] [INFO ] Implicit Places using invariants in 858 ms returned []
Implicit Place search using SMT only with invariants took 859 ms to find 0 implicit places.
[2024-05-27 20:43:54] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:43:54] [INFO ] Invariant cache hit.
[2024-05-27 20:44:02] [INFO ] Dead Transitions using invariants and state equation in 8204 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9318 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s173 1), p1:(EQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 4 ms.
FORMULA RERS2020-PT-pb103-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLCardinality-15 finished in 9574 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)))'
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(X((X(F(X((F(p0) U !p0)))) U p1))))'
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((X(p0)||F(((p2&&F(p3))||p1)))))'
Found a Lengthening insensitive property : RERS2020-PT-pb103-LTLCardinality-07
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 513 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 273 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2024-05-27 20:44:03] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:44:03] [INFO ] Invariant cache hit.
[2024-05-27 20:44:04] [INFO ] Implicit Places using invariants in 825 ms returned []
Implicit Place search using SMT only with invariants took 826 ms to find 0 implicit places.
[2024-05-27 20:44:04] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:44:04] [INFO ] Invariant cache hit.
[2024-05-27 20:44:13] [INFO ] Dead Transitions using invariants and state equation in 8466 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9567 ms. Remains : 510/513 places, 28438/28429 transitions.
Running random walk in product with property : RERS2020-PT-pb103-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s78 0) (EQ s363 1)), p2:(OR (EQ s61 0) (EQ s19 1)), p3:(OR (EQ s264 0) (EQ s244 1)), p0:(AND (EQ s0 0) (EQ s397 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2966 ms.
Product exploration explored 100000 steps with 0 reset in 3085 ms.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Detected a total of 118/510 stabilizing places and 10295/28438 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p2 p3 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 144 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 34693 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34693 steps, saw 23805 distinct states, run finished after 3003 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-27 20:44:23] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:44:23] [INFO ] Invariant cache hit.
[2024-05-27 20:44:23] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:44:24] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:44:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-27 20:44:29] [INFO ] After 5489ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:44:29] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2024-05-27 20:44:35] [INFO ] After 5751ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:44:38] [INFO ] Deduced a trap composed of 11 places in 2172 ms of which 0 ms to minimize.
[2024-05-27 20:44:40] [INFO ] Deduced a trap composed of 13 places in 2226 ms of which 1 ms to minimize.
[2024-05-27 20:44:43] [INFO ] Deduced a trap composed of 95 places in 2096 ms of which 1 ms to minimize.
[2024-05-27 20:44:46] [INFO ] Deduced a trap composed of 73 places in 2150 ms of which 0 ms to minimize.
[2024-05-27 20:44:49] [INFO ] Deduced a trap composed of 49 places in 2170 ms of which 0 ms to minimize.
[2024-05-27 20:44:49] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 13094 ms
[2024-05-27 20:44:49] [INFO ] After 19139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-27 20:44:49] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 8 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 510 transition count 27376
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 510 transition count 27364
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 497 transition count 27456
Applied a total of 1176 rules in 431 ms. Remains 497 /510 variables (removed 13) and now considering 27456/28438 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 497/510 places, 27456/28438 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 32536 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 32536 steps, saw 23239 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-27 20:44:53] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:44:53] [INFO ] Computed 8 invariants in 56 ms
[2024-05-27 20:44:53] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:44:53] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:44:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-27 20:44:58] [INFO ] After 5178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:44:59] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:45:10] [INFO ] After 11909ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:45:13] [INFO ] Deduced a trap composed of 120 places in 1808 ms of which 0 ms to minimize.
[2024-05-27 20:45:16] [INFO ] Deduced a trap composed of 32 places in 2069 ms of which 1 ms to minimize.
[2024-05-27 20:45:18] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 6918 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 20:45:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:45:18] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 8 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 107 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 118 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2024-05-27 20:45:18] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:45:18] [INFO ] Invariant cache hit.
[2024-05-27 20:45:19] [INFO ] Implicit Places using invariants in 929 ms returned []
Implicit Place search using SMT only with invariants took 930 ms to find 0 implicit places.
[2024-05-27 20:45:19] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:45:19] [INFO ] Invariant cache hit.
[2024-05-27 20:45:27] [INFO ] Dead Transitions using invariants and state equation in 7772 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8824 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 9903 edges and 497 vertex of which 378 / 497 are part of one of the 62 SCC in 1 ms
Free SCC test removed 316 places
Drop transitions removed 10625 transitions
Ensure Unique test removed 14226 transitions
Reduce isomorphic transitions removed 24851 transitions.
Graph (complete) has 2518 edges and 181 vertex of which 173 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 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 14 rules applied. Total rules applied 16 place count 173 transition count 2591
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 171 transition count 2591
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 169 transition count 2589
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 169 transition count 2556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 168 transition count 2566
Drop transitions removed 1367 transitions
Redundant transition composition rules discarded 1367 transitions
Iterating global reduction 3 with 1367 rules applied. Total rules applied 1424 place count 168 transition count 1199
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1392 edges and 166 vertex of which 147 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 1434 place count 147 transition count 1189
Drop transitions removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 4 with 108 rules applied. Total rules applied 1542 place count 147 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1544 place count 145 transition count 1069
Iterating global reduction 5 with 2 rules applied. Total rules applied 1546 place count 145 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1547 place count 145 transition count 1068
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1551 place count 145 transition count 1064
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1555 place count 145 transition count 1060
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1561 place count 141 transition count 1058
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 1595 place count 141 transition count 1024
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1596 place count 141 transition count 1023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1597 place count 140 transition count 1023
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1601 place count 140 transition count 1019
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1603 place count 140 transition count 1024
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1613 place count 138 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1614 place count 137 transition count 1010
Iterating global reduction 9 with 1 rules applied. Total rules applied 1615 place count 137 transition count 1010
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1624 place count 137 transition count 1001
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1626 place count 137 transition count 1001
Applied a total of 1626 rules in 190 ms. Remains 137 /497 variables (removed 360) and now considering 1001/27456 (removed 26455) transitions.
Running SMT prover for 6 properties.
[2024-05-27 20:45:27] [INFO ] Flow matrix only has 965 transitions (discarded 36 similar events)
// Phase 1: matrix 965 rows 137 cols
[2024-05-27 20:45:27] [INFO ] Computed 0 invariants in 2 ms
[2024-05-27 20:45:28] [INFO ] After 437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:45:28] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:45:28] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-27 20:45:28] [INFO ] After 233ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:45:29] [INFO ] After 533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 246 ms.
[2024-05-27 20:45:29] [INFO ] After 1198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p1 p2 p3 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 115 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 34 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2024-05-27 20:45:30] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2024-05-27 20:45:30] [INFO ] Computed 8 invariants in 66 ms
[2024-05-27 20:45:31] [INFO ] Implicit Places using invariants in 926 ms returned []
Implicit Place search using SMT only with invariants took 928 ms to find 0 implicit places.
[2024-05-27 20:45:31] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:45:31] [INFO ] Invariant cache hit.
[2024-05-27 20:45:39] [INFO ] Dead Transitions using invariants and state equation in 8245 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9208 ms. Remains : 510/510 places, 28438/28438 transitions.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Detected a total of 118/510 stabilizing places and 10295/28438 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p2 p3 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 116 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 31350 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 31350 steps, saw 21602 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-27 20:45:43] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:45:43] [INFO ] Invariant cache hit.
[2024-05-27 20:45:43] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:45:43] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:45:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-05-27 20:45:50] [INFO ] After 6126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:45:50] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2024-05-27 20:45:56] [INFO ] After 6797ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:45:59] [INFO ] Deduced a trap composed of 11 places in 2079 ms of which 1 ms to minimize.
[2024-05-27 20:46:02] [INFO ] Deduced a trap composed of 13 places in 2083 ms of which 1 ms to minimize.
[2024-05-27 20:46:04] [INFO ] Deduced a trap composed of 95 places in 1921 ms of which 0 ms to minimize.
[2024-05-27 20:46:07] [INFO ] Deduced a trap composed of 73 places in 1954 ms of which 0 ms to minimize.
[2024-05-27 20:46:10] [INFO ] Deduced a trap composed of 49 places in 2006 ms of which 0 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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 20:46:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:46:10] [INFO ] After 26281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 8 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 510 transition count 27376
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 510 transition count 27364
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 497 transition count 27456
Applied a total of 1176 rules in 473 ms. Remains 497 /510 variables (removed 13) and now considering 27456/28438 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 497/510 places, 27456/28438 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 32415 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 32415 steps, saw 23142 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-27 20:46:14] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2024-05-27 20:46:14] [INFO ] Computed 8 invariants in 58 ms
[2024-05-27 20:46:14] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:46:14] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:46:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 20:46:20] [INFO ] After 5986ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:46:20] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2024-05-27 20:46:35] [INFO ] After 14680ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:46:38] [INFO ] Deduced a trap composed of 120 places in 1756 ms of which 1 ms to minimize.
[2024-05-27 20:46:41] [INFO ] Deduced a trap composed of 32 places in 2228 ms of which 1 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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 20:46:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 20:46:41] [INFO ] After 26477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 8 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 104 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 103 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2024-05-27 20:46:41] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:46:41] [INFO ] Invariant cache hit.
[2024-05-27 20:46:42] [INFO ] Implicit Places using invariants in 919 ms returned []
Implicit Place search using SMT only with invariants took 920 ms to find 0 implicit places.
[2024-05-27 20:46:42] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2024-05-27 20:46:42] [INFO ] Invariant cache hit.
[2024-05-27 20:46:50] [INFO ] Dead Transitions using invariants and state equation in 7776 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8803 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 9903 edges and 497 vertex of which 378 / 497 are part of one of the 62 SCC in 1 ms
Free SCC test removed 316 places
Drop transitions removed 10625 transitions
Ensure Unique test removed 14226 transitions
Reduce isomorphic transitions removed 24851 transitions.
Graph (complete) has 2518 edges and 181 vertex of which 173 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 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 14 rules applied. Total rules applied 16 place count 173 transition count 2591
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 171 transition count 2591
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 169 transition count 2589
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 169 transition count 2556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 168 transition count 2566
Drop transitions removed 1367 transitions
Redundant transition composition rules discarded 1367 transitions
Iterating global reduction 3 with 1367 rules applied. Total rules applied 1424 place count 168 transition count 1199
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1392 edges and 166 vertex of which 147 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 1434 place count 147 transition count 1189
Drop transitions removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 4 with 108 rules applied. Total rules applied 1542 place count 147 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1544 place count 145 transition count 1069
Iterating global reduction 5 with 2 rules applied. Total rules applied 1546 place count 145 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1547 place count 145 transition count 1068
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1551 place count 145 transition count 1064
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1555 place count 145 transition count 1060
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1561 place count 141 transition count 1058
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 1595 place count 141 transition count 1024
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1596 place count 141 transition count 1023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1597 place count 140 transition count 1023
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1601 place count 140 transition count 1019
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1603 place count 140 transition count 1024
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1613 place count 138 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1614 place count 137 transition count 1010
Iterating global reduction 9 with 1 rules applied. Total rules applied 1615 place count 137 transition count 1010
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1624 place count 137 transition count 1001
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1626 place count 137 transition count 1001
Applied a total of 1626 rules in 205 ms. Remains 137 /497 variables (removed 360) and now considering 1001/27456 (removed 26455) transitions.
Running SMT prover for 6 properties.
[2024-05-27 20:46:50] [INFO ] Flow matrix only has 965 transitions (discarded 36 similar events)
// Phase 1: matrix 965 rows 137 cols
[2024-05-27 20:46:50] [INFO ] Computed 0 invariants in 6 ms
[2024-05-27 20:46:50] [INFO ] After 396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-27 20:46:51] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-27 20:46:51] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-27 20:46:51] [INFO ] After 219ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-27 20:46:51] [INFO ] After 505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 229 ms.
[2024-05-27 20:46:51] [INFO ] After 1108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p1 p2 p3 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 115 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 1 reset in 2292 ms.
Product exploration explored 100000 steps with 0 reset in 2332 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 8 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 93 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2024-05-27 20:46:57] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2024-05-27 20:46:57] [INFO ] Computed 8 invariants in 55 ms
[2024-05-27 20:47:05] [INFO ] Dead Transitions using invariants and state equation in 8019 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8112 ms. Remains : 510/510 places, 28438/28438 transitions.
Built C files in :
/tmp/ltsmin17446216772617536849
[2024-05-27 20:47:05] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17446216772617536849
Running compilation step : cd /tmp/ltsmin17446216772617536849;'/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/ltsmin17446216772617536849;'/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/ltsmin17446216772617536849;'/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 8 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 31 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2024-05-27 20:47:08] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:47:08] [INFO ] Invariant cache hit.
[2024-05-27 20:47:09] [INFO ] Implicit Places using invariants in 770 ms returned []
Implicit Place search using SMT only with invariants took 771 ms to find 0 implicit places.
[2024-05-27 20:47:09] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2024-05-27 20:47:09] [INFO ] Invariant cache hit.
[2024-05-27 20:47:17] [INFO ] Dead Transitions using invariants and state equation in 7879 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8682 ms. Remains : 510/510 places, 28438/28438 transitions.
Built C files in :
/tmp/ltsmin1285540857707574051
[2024-05-27 20:47:17] [INFO ] Built C files in 158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1285540857707574051
Running compilation step : cd /tmp/ltsmin1285540857707574051;'/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/ltsmin1285540857707574051;'/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/ltsmin1285540857707574051;'/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-27 20:47:21] [INFO ] Flatten gal took : 699 ms
[2024-05-27 20:47:22] [INFO ] Flatten gal took : 705 ms
[2024-05-27 20:47:22] [INFO ] Time to serialize gal into /tmp/LTL11397043292590896145.gal : 99 ms
[2024-05-27 20:47:22] [INFO ] Time to serialize properties into /tmp/LTL2262258662478353313.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/LTL11397043292590896145.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1710687571840340942.hoa' '-atoms' '/tmp/LTL2262258662478353313.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2262258662478353313.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1710687571840340942.hoa
Detected timeout of ITS tools.
[2024-05-27 20:47:38] [INFO ] Flatten gal took : 691 ms
[2024-05-27 20:47:39] [INFO ] Flatten gal took : 708 ms
[2024-05-27 20:47:39] [INFO ] Time to serialize gal into /tmp/LTL9166843795425833056.gal : 101 ms
[2024-05-27 20:47:39] [INFO ] Time to serialize properties into /tmp/LTL6415804641795622002.ltl : 4 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/LTL9166843795425833056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6415804641795622002.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X("((ps303==0)&&(ps386==1))"))||(F(("((ps97==0)||(ps138==1))")||(("((ps494==0)||(ps468==1))")&&(F("((ps512==0)||(ps350==1))"))))...159
Formula 0 simplified : F(X!"((ps303==0)&&(ps386==1))" & G(!"((ps97==0)||(ps138==1))" & (!"((ps494==0)||(ps468==1))" | G!"((ps512==0)||(ps350==1))")))
Detected timeout of ITS tools.
[2024-05-27 20:47:55] [INFO ] Flatten gal took : 806 ms
[2024-05-27 20:47:55] [INFO ] Applying decomposition
[2024-05-27 20:47:56] [INFO ] Flatten gal took : 692 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/graph5554425605469204978.txt' '-o' '/tmp/graph5554425605469204978.bin' '-w' '/tmp/graph5554425605469204978.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5554425605469204978.bin' '-l' '-1' '-v' '-w' '/tmp/graph5554425605469204978.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:47:57] [INFO ] Decomposing Gal with order
[2024-05-27 20:47:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:47:58] [INFO ] Removed a total of 65828 redundant transitions.
[2024-05-27 20:47:59] [INFO ] Flatten gal took : 1163 ms
[2024-05-27 20:47:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2003 labels/synchronizations in 560 ms.
[2024-05-27 20:48:00] [INFO ] Time to serialize gal into /tmp/LTL16579045281222704895.gal : 39 ms
[2024-05-27 20:48:00] [INFO ] Time to serialize properties into /tmp/LTL16909313765780213739.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/LTL16579045281222704895.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16909313765780213739.ltl' '-c' '-stutter-deadlock'

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...256
Read 1 LTL properties
Checking formula 0 : !((G((X("((i6.i0.u82.ps303==0)&&(i1.i0.u72.ps386==1))"))||(F(("((i4.i1.u102.ps97==0)||(i2.i2.u103.ps138==1))")||(("((i0.i2.u108.ps494=...241
Formula 0 simplified : F(X!"((i6.i0.u82.ps303==0)&&(i1.i0.u72.ps386==1))" & G(!"((i4.i1.u102.ps97==0)||(i2.i2.u103.ps138==1))" & (!"((i0.i2.u108.ps494==0)|...231
Reverse transition relation is NOT exact ! Due to transitions t215, t278, t610, t626, t642, t706, t723, t739, t1032, t1040, t1063, t1375, t1439, t1455, t14...1973
Computing Next relation with stutter on 6 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10456335574627494331
[2024-05-27 20:48:15] [INFO ] Built C files in 173ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10456335574627494331
Running compilation step : cd /tmp/ltsmin10456335574627494331;'/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/ltsmin10456335574627494331;'/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/ltsmin10456335574627494331;'/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 RERS2020-PT-pb103-LTLCardinality-07 finished in 254891 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((p0 U (G(F(p2))||p1))))'
[2024-05-27 20:48:19] [INFO ] Flatten gal took : 682 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11606082715796137968
[2024-05-27 20:48:19] [INFO ] Too many transitions (28429) to apply POR reductions. Disabling POR matrices.
[2024-05-27 20:48:19] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11606082715796137968
Running compilation step : cd /tmp/ltsmin11606082715796137968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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-27 20:48:19] [INFO ] Applying decomposition
[2024-05-27 20:48:20] [INFO ] Flatten gal took : 683 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/graph4191166572121814966.txt' '-o' '/tmp/graph4191166572121814966.bin' '-w' '/tmp/graph4191166572121814966.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4191166572121814966.bin' '-l' '-1' '-v' '-w' '/tmp/graph4191166572121814966.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:48:22] [INFO ] Decomposing Gal with order
[2024-05-27 20:48:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:48:23] [INFO ] Removed a total of 63914 redundant transitions.
[2024-05-27 20:48:23] [INFO ] Flatten gal took : 1174 ms
[2024-05-27 20:48:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2123 labels/synchronizations in 587 ms.
[2024-05-27 20:48:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality2095337525918774342.gal : 34 ms
[2024-05-27 20:48:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality6561048275930774711.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/LTLCardinality2095337525918774342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6561048275930774711.ltl' '-c' '-stutter-deadlock'

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 4 LTL properties
Checking formula 0 : !((F(G("(i8.i1.u69.ps90==0)"))))
Formula 0 simplified : GF!"(i8.i1.u69.ps90==0)"
Reverse transition relation is NOT exact ! Due to transitions t219, t282, t614, t630, t646, t710, t727, t743, t1026, t1034, t1042, t1065, t1379, t1443, t14...1948
Computing Next relation with stutter on 6 deadlock states
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/ltsmin11606082715796137968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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 180 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11606082715796137968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' '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 180 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)
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
94560 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,946.801,3907920,1,0,1.02365e+07,60356,21118,6.06375e+06,3680,170464,13615099
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RERS2020-PT-pb103-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X((X(F(X((F("(i0.i2.u35.ps328==1)"))U("(i0.i2.u35.ps328!=1)")))))U("((i8.i2.u115.ps49==0)||(i4.u63.ps458==1))")))))
Formula 1 simplified : XF(!"((i8.i2.u115.ps49==0)||(i4.u63.ps458==1))" & X(!"((i8.i2.u115.ps49==0)||(i4.u63.ps458==1))" W XG!"(i0.i2.u35.ps328!=1)"))
Computing Next relation with stutter on 6 deadlock states
Detected timeout of ITS tools.
[2024-05-27 21:15:25] [INFO ] Applying decomposition
[2024-05-27 21:15:25] [INFO ] Flatten gal took : 694 ms
[2024-05-27 21:15:26] [INFO ] Decomposing Gal with order
[2024-05-27 21:15:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:15:33] [INFO ] Removed a total of 54565 redundant transitions.
[2024-05-27 21:15:33] [INFO ] Flatten gal took : 6795 ms
[2024-05-27 21:15:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1537 labels/synchronizations in 865 ms.
[2024-05-27 21:15:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality13659580417274707540.gal : 7 ms
[2024-05-27 21:15:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality6632941614506468027.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/LTLCardinality13659580417274707540.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6632941614506468027.ltl' '-c' '-stutter-deadlock'

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 3 LTL properties
Checking formula 0 : !((G(X((X(F(X((F("(ucomponent4.ps328==1)"))U("(ucomponent4.ps328!=1)")))))U("((ucomponent0.ps49==0)||(ucomponent6.ps458==1))")))))
Formula 0 simplified : XF(!"((ucomponent0.ps49==0)||(ucomponent6.ps458==1))" & X(!"((ucomponent0.ps49==0)||(ucomponent6.ps458==1))" W XG!"(ucomponent4.ps32...163
Reverse transition relation is NOT exact ! Due to transitions t725, t3185, t3188, t3523, t4826, t4831, t6708, t6709, t7406, t7436, t7445, t7563, t7979, t83...936
Computing Next relation with stutter on 6 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5911748 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16019204 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RERS2020-PT-pb103"
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 RERS2020-PT-pb103, 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 r329-tall-171662361800217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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