About the Execution of LTSMin+red for TokenRing-PT-040
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5863.132 | 1058787.00 | 1260310.00 | 3268.80 | FTTTFTFTFF?TFTF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r489-tall-167912707100691.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is TokenRing-PT-040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707100691
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 442M
-rw-r--r-- 1 mcc users 1.2M Feb 25 21:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.3M Feb 25 21:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31M Feb 25 19:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 105M Feb 25 19:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 838K Feb 25 17:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.7M Feb 25 17:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16M Feb 25 17:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 41M Feb 25 17:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4M Feb 26 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16M Feb 26 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43M Feb 26 15:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 147M Feb 26 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 180K Feb 25 17:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 457K Feb 25 17:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 32M Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME TokenRing-PT-040-LTLCardinality-00
FORMULA_NAME TokenRing-PT-040-LTLCardinality-01
FORMULA_NAME TokenRing-PT-040-LTLCardinality-02
FORMULA_NAME TokenRing-PT-040-LTLCardinality-03
FORMULA_NAME TokenRing-PT-040-LTLCardinality-04
FORMULA_NAME TokenRing-PT-040-LTLCardinality-05
FORMULA_NAME TokenRing-PT-040-LTLCardinality-06
FORMULA_NAME TokenRing-PT-040-LTLCardinality-07
FORMULA_NAME TokenRing-PT-040-LTLCardinality-08
FORMULA_NAME TokenRing-PT-040-LTLCardinality-09
FORMULA_NAME TokenRing-PT-040-LTLCardinality-10
FORMULA_NAME TokenRing-PT-040-LTLCardinality-11
FORMULA_NAME TokenRing-PT-040-LTLCardinality-12
FORMULA_NAME TokenRing-PT-040-LTLCardinality-13
FORMULA_NAME TokenRing-PT-040-LTLCardinality-14
FORMULA_NAME TokenRing-PT-040-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679301753210
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-040
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 08:42:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 08:42:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 08:42:37] [INFO ] Load time of PNML (sax parser for PT used): 1994 ms
[2023-03-20 08:42:37] [INFO ] Transformed 1681 places.
[2023-03-20 08:42:37] [INFO ] Transformed 65641 transitions.
[2023-03-20 08:42:37] [INFO ] Parsed PT model containing 1681 places and 65641 transitions and 262564 arcs in 2416 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 716 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA TokenRing-PT-040-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-040-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-040-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-040-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-040-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-040-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-040-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-040-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-040-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-040-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 1681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 5220 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
// Phase 1: matrix 65641 rows 1681 cols
[2023-03-20 08:42:44] [INFO ] Computed 41 place invariants in 317 ms
[2023-03-20 08:42:49] [INFO ] Implicit Places using invariants in 4880 ms returned []
Implicit Place search using SMT only with invariants took 4911 ms to find 0 implicit places.
[2023-03-20 08:42:49] [INFO ] Invariant cache hit.
[2023-03-20 08:43:11] [INFO ] Dead Transitions using invariants and state equation in 22525 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32684 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Support contains 22 out of 1681 places after structural reductions.
[2023-03-20 08:43:13] [INFO ] Flatten gal took : 1693 ms
[2023-03-20 08:43:15] [INFO ] Flatten gal took : 1624 ms
[2023-03-20 08:43:18] [INFO ] Input system was already deterministic with 65641 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 944 ms. (steps per millisecond=10 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-20 08:43:21] [INFO ] Invariant cache hit.
[2023-03-20 08:43:21] [INFO ] [Real]Absence check using 41 positive place invariants in 41 ms returned sat
[2023-03-20 08:43:21] [INFO ] After 539ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:1
[2023-03-20 08:43:22] [INFO ] [Nat]Absence check using 41 positive place invariants in 142 ms returned sat
[2023-03-20 08:43:43] [INFO ] After 20864ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2023-03-20 08:43:44] [INFO ] State equation strengthened by 64040 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 08:43:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:43:46] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0 real:1
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 5562 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5566 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3803 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3803 steps, saw 2606 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 08:43:56] [INFO ] Invariant cache hit.
[2023-03-20 08:43:56] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:43:56] [INFO ] [Nat]Absence check using 41 positive place invariants in 20 ms returned sat
[2023-03-20 08:44:18] [INFO ] After 21438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:44:18] [INFO ] State equation strengthened by 64040 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 08:44:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:44:21] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 31 ms.
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3781 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3783 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3725 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
[2023-03-20 08:44:28] [INFO ] Invariant cache hit.
[2023-03-20 08:44:33] [INFO ] Implicit Places using invariants in 4279 ms returned []
Implicit Place search using SMT only with invariants took 4280 ms to find 0 implicit places.
[2023-03-20 08:44:33] [INFO ] Invariant cache hit.
[2023-03-20 08:44:55] [INFO ] Dead Transitions using invariants and state equation in 22041 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30067 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Graph (trivial) has 65321 edges and 1681 vertex of which 1677 / 1681 are part of one of the 41 SCC in 61 ms
Free SCC test removed 1636 places
Drop transitions removed 65321 transitions
Ensure Unique test removed 312 transitions
Reduce isomorphic transitions removed 65633 transitions.
Graph (complete) has 8 edges and 45 vertex of which 8 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 171 ms. Remains 8 /1681 variables (removed 1673) and now considering 8/65641 (removed 65633) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-03-20 08:44:55] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 08:44:55] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:44:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-20 08:44:55] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:44:55] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-20 08:44:55] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
FORMULA TokenRing-PT-040-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-040-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 4361 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
// Phase 1: matrix 65641 rows 1681 cols
[2023-03-20 08:45:00] [INFO ] Computed 41 place invariants in 206 ms
[2023-03-20 08:45:04] [INFO ] Implicit Places using invariants in 3917 ms returned []
Implicit Place search using SMT only with invariants took 3918 ms to find 0 implicit places.
[2023-03-20 08:45:04] [INFO ] Invariant cache hit.
[2023-03-20 08:45:26] [INFO ] Dead Transitions using invariants and state equation in 22548 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30831 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0)]
Running random walk in product with property : TokenRing-PT-040-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s671 s1049)], 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 4323 ms.
Stack based approach found an accepted trace after 1866 steps with 0 reset with depth 1867 and stack size 1867 in 70 ms.
FORMULA TokenRing-PT-040-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TokenRing-PT-040-LTLCardinality-09 finished in 35687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 1681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3748 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
[2023-03-20 08:45:35] [INFO ] Invariant cache hit.
[2023-03-20 08:45:39] [INFO ] Implicit Places using invariants in 4001 ms returned []
Implicit Place search using SMT only with invariants took 4007 ms to find 0 implicit places.
[2023-03-20 08:45:39] [INFO ] Invariant cache hit.
[2023-03-20 08:46:01] [INFO ] Dead Transitions using invariants and state equation in 22525 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30285 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : TokenRing-PT-040-LTLCardinality-10 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s433), p1:(LEQ s48 s1426)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 78 reset in 4376 ms.
Product exploration explored 100000 steps with 78 reset in 4281 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 1278 steps, including 0 resets, run visited all 2 properties in 65 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-20 08:46:12] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 3 out of 1681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3686 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
[2023-03-20 08:46:31] [INFO ] Invariant cache hit.
[2023-03-20 08:46:35] [INFO ] Implicit Places using invariants in 3871 ms returned []
Implicit Place search using SMT only with invariants took 3872 ms to find 0 implicit places.
[2023-03-20 08:46:35] [INFO ] Invariant cache hit.
[2023-03-20 08:46:57] [INFO ] Dead Transitions using invariants and state equation in 22872 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30437 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 1299 steps, including 0 resets, run visited all 2 properties in 99 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 239 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-20 08:46:59] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 78 reset in 4229 ms.
Product exploration explored 100000 steps with 78 reset in 4210 ms.
Support contains 3 out of 1681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3686 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
[2023-03-20 08:47:26] [INFO ] Invariant cache hit.
[2023-03-20 08:47:30] [INFO ] Implicit Places using invariants in 4024 ms returned []
Implicit Place search using SMT only with invariants took 4037 ms to find 0 implicit places.
[2023-03-20 08:47:30] [INFO ] Invariant cache hit.
[2023-03-20 08:47:54] [INFO ] Dead Transitions using invariants and state equation in 23215 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30944 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Treatment of property TokenRing-PT-040-LTLCardinality-10 finished in 145574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 1681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3571 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
[2023-03-20 08:48:00] [INFO ] Invariant cache hit.
[2023-03-20 08:48:04] [INFO ] Implicit Places using invariants in 3789 ms returned []
Implicit Place search using SMT only with invariants took 3803 ms to find 0 implicit places.
[2023-03-20 08:48:04] [INFO ] Invariant cache hit.
[2023-03-20 08:48:27] [INFO ] Dead Transitions using invariants and state equation in 23176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30565 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : TokenRing-PT-040-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s550 s341)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4568 ms.
Product exploration explored 100000 steps with 50000 reset in 4454 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TokenRing-PT-040-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TokenRing-PT-040-LTLCardinality-13 finished in 40032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3529 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
[2023-03-20 08:48:40] [INFO ] Invariant cache hit.
[2023-03-20 08:48:44] [INFO ] Implicit Places using invariants in 3979 ms returned []
Implicit Place search using SMT only with invariants took 4001 ms to find 0 implicit places.
[2023-03-20 08:48:44] [INFO ] Invariant cache hit.
[2023-03-20 08:49:08] [INFO ] Dead Transitions using invariants and state equation in 23626 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31176 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TokenRing-PT-040-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (LEQ s1591 s109) (LEQ s1432 s322)), p0:(LEQ s1591 s109)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3506 ms.
Product exploration explored 100000 steps with 0 reset in 3537 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 283 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 08:49:17] [INFO ] Invariant cache hit.
[2023-03-20 08:49:17] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:49:17] [INFO ] [Nat]Absence check using 41 positive place invariants in 23 ms returned sat
[2023-03-20 08:49:38] [INFO ] After 20850ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:49:39] [INFO ] State equation strengthened by 64040 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 08:49:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:49:42] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3624 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3625 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3457 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3457 steps, saw 2433 distinct states, run finished after 3001 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 08:49:50] [INFO ] Invariant cache hit.
[2023-03-20 08:49:50] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:49:50] [INFO ] [Nat]Absence check using 41 positive place invariants in 19 ms returned sat
[2023-03-20 08:50:11] [INFO ] After 20943ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:50:12] [INFO ] State equation strengthened by 64040 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 08:50:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:50:15] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3578 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3579 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3915 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
[2023-03-20 08:50:22] [INFO ] Invariant cache hit.
[2023-03-20 08:50:26] [INFO ] Implicit Places using invariants in 3978 ms returned []
Implicit Place search using SMT only with invariants took 4002 ms to find 0 implicit places.
[2023-03-20 08:50:26] [INFO ] Invariant cache hit.
[2023-03-20 08:50:49] [INFO ] Dead Transitions using invariants and state equation in 22834 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30766 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Graph (trivial) has 65321 edges and 1681 vertex of which 1677 / 1681 are part of one of the 41 SCC in 13 ms
Free SCC test removed 1636 places
Drop transitions removed 65321 transitions
Ensure Unique test removed 312 transitions
Reduce isomorphic transitions removed 65633 transitions.
Graph (complete) has 8 edges and 45 vertex of which 8 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.0 ms
Discarding 37 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 77 ms. Remains 8 /1681 variables (removed 1673) and now considering 8/65641 (removed 65633) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-03-20 08:50:50] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 08:50:50] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:50:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-20 08:50:50] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:50:50] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-20 08:50:50] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 360 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3469 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
// Phase 1: matrix 65641 rows 1681 cols
[2023-03-20 08:50:54] [INFO ] Computed 41 place invariants in 140 ms
[2023-03-20 08:50:58] [INFO ] Implicit Places using invariants in 4083 ms returned []
Implicit Place search using SMT only with invariants took 4097 ms to find 0 implicit places.
[2023-03-20 08:50:58] [INFO ] Invariant cache hit.
[2023-03-20 08:51:20] [INFO ] Dead Transitions using invariants and state equation in 22586 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30169 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 292 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 493 ms. (steps per millisecond=20 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 08:51:22] [INFO ] Invariant cache hit.
[2023-03-20 08:51:22] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:51:23] [INFO ] [Nat]Absence check using 41 positive place invariants in 30 ms returned sat
[2023-03-20 08:51:44] [INFO ] After 21536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:51:45] [INFO ] State equation strengthened by 64040 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 08:51:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:51:47] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 4193 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4197 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3531 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3531 steps, saw 2470 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 08:51:56] [INFO ] Invariant cache hit.
[2023-03-20 08:51:56] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:51:56] [INFO ] [Nat]Absence check using 41 positive place invariants in 18 ms returned sat
[2023-03-20 08:52:17] [INFO ] After 21164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:52:18] [INFO ] State equation strengthened by 64040 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 08:52:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:52:21] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3363 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3365 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3388 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
[2023-03-20 08:52:28] [INFO ] Invariant cache hit.
[2023-03-20 08:52:31] [INFO ] Implicit Places using invariants in 3830 ms returned []
Implicit Place search using SMT only with invariants took 3841 ms to find 0 implicit places.
[2023-03-20 08:52:31] [INFO ] Invariant cache hit.
[2023-03-20 08:52:52] [INFO ] Dead Transitions using invariants and state equation in 20641 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27890 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Graph (trivial) has 65321 edges and 1681 vertex of which 1677 / 1681 are part of one of the 41 SCC in 12 ms
Free SCC test removed 1636 places
Drop transitions removed 65321 transitions
Ensure Unique test removed 312 transitions
Reduce isomorphic transitions removed 65633 transitions.
Graph (complete) has 8 edges and 45 vertex of which 8 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.0 ms
Discarding 37 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 70 ms. Remains 8 /1681 variables (removed 1673) and now considering 8/65641 (removed 65633) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-03-20 08:52:52] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 08:52:52] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:52:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 08:52:52] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:52:52] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-20 08:52:52] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 358 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 4006 ms.
Product exploration explored 100000 steps with 0 reset in 3462 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 7989 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
// Phase 1: matrix 65641 rows 1681 cols
[2023-03-20 08:53:09] [INFO ] Computed 41 place invariants in 144 ms
[2023-03-20 08:53:32] [INFO ] Dead Transitions using invariants and state equation in 22818 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30812 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3228 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
[2023-03-20 08:53:35] [INFO ] Invariant cache hit.
[2023-03-20 08:53:39] [INFO ] Implicit Places using invariants in 4209 ms returned []
Implicit Place search using SMT only with invariants took 4219 ms to find 0 implicit places.
[2023-03-20 08:53:39] [INFO ] Invariant cache hit.
[2023-03-20 08:54:02] [INFO ] Dead Transitions using invariants and state equation in 23209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30671 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Treatment of property TokenRing-PT-040-LTLCardinality-15 finished in 327859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Found a Lengthening insensitive property : TokenRing-PT-040-LTLCardinality-15
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 4037 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
[2023-03-20 08:54:09] [INFO ] Invariant cache hit.
[2023-03-20 08:54:13] [INFO ] Implicit Places using invariants in 3937 ms returned []
Implicit Place search using SMT only with invariants took 3938 ms to find 0 implicit places.
[2023-03-20 08:54:13] [INFO ] Invariant cache hit.
[2023-03-20 08:54:36] [INFO ] Dead Transitions using invariants and state equation in 22978 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 30958 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Running random walk in product with property : TokenRing-PT-040-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (LEQ s1591 s109) (LEQ s1432 s322)), p0:(LEQ s1591 s109)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3456 ms.
Product exploration explored 100000 steps with 0 reset in 3405 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 347 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 561 ms. (steps per millisecond=17 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 08:54:45] [INFO ] Invariant cache hit.
[2023-03-20 08:54:45] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:54:45] [INFO ] [Nat]Absence check using 41 positive place invariants in 17 ms returned sat
[2023-03-20 08:55:06] [INFO ] After 21102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:55:07] [INFO ] State equation strengthened by 64040 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 08:55:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:55:10] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 5928 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5930 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 707 ms. (steps per millisecond=14 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3485 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3485 steps, saw 2447 distinct states, run finished after 3005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 08:55:20] [INFO ] Invariant cache hit.
[2023-03-20 08:55:20] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:55:21] [INFO ] [Nat]Absence check using 41 positive place invariants in 21 ms returned sat
[2023-03-20 08:55:44] [INFO ] After 23188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:55:45] [INFO ] State equation strengthened by 64040 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 08:55:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:55:46] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 4150 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4150 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 4314 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
[2023-03-20 08:55:54] [INFO ] Invariant cache hit.
[2023-03-20 08:55:58] [INFO ] Implicit Places using invariants in 4125 ms returned []
Implicit Place search using SMT only with invariants took 4126 ms to find 0 implicit places.
[2023-03-20 08:55:58] [INFO ] Invariant cache hit.
[2023-03-20 08:56:21] [INFO ] Dead Transitions using invariants and state equation in 22628 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31078 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Graph (trivial) has 65321 edges and 1681 vertex of which 1677 / 1681 are part of one of the 41 SCC in 12 ms
Free SCC test removed 1636 places
Drop transitions removed 65321 transitions
Ensure Unique test removed 312 transitions
Reduce isomorphic transitions removed 65633 transitions.
Graph (complete) has 8 edges and 45 vertex of which 8 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 64 ms. Remains 8 /1681 variables (removed 1673) and now considering 8/65641 (removed 65633) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-03-20 08:56:21] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 08:56:21] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-20 08:56:21] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:21] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-20 08:56:21] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 356 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3244 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
// Phase 1: matrix 65641 rows 1681 cols
[2023-03-20 08:56:25] [INFO ] Computed 41 place invariants in 191 ms
[2023-03-20 08:56:29] [INFO ] Implicit Places using invariants in 4153 ms returned []
Implicit Place search using SMT only with invariants took 4154 ms to find 0 implicit places.
[2023-03-20 08:56:29] [INFO ] Invariant cache hit.
[2023-03-20 08:56:51] [INFO ] Dead Transitions using invariants and state equation in 22446 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29850 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 322 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 08:56:53] [INFO ] Invariant cache hit.
[2023-03-20 08:56:53] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:54] [INFO ] [Nat]Absence check using 41 positive place invariants in 17 ms returned sat
[2023-03-20 08:57:15] [INFO ] After 21693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:57:16] [INFO ] State equation strengthened by 64040 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 08:57:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:57:18] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3826 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3828 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3433 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3433 steps, saw 2421 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 08:57:26] [INFO ] Invariant cache hit.
[2023-03-20 08:57:26] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:57:27] [INFO ] [Nat]Absence check using 41 positive place invariants in 22 ms returned sat
[2023-03-20 08:57:48] [INFO ] After 21550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:57:49] [INFO ] State equation strengthened by 64040 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 08:57:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:57:51] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3407 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3407 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3400 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
[2023-03-20 08:57:58] [INFO ] Invariant cache hit.
[2023-03-20 08:58:02] [INFO ] Implicit Places using invariants in 3776 ms returned []
Implicit Place search using SMT only with invariants took 3777 ms to find 0 implicit places.
[2023-03-20 08:58:02] [INFO ] Invariant cache hit.
[2023-03-20 08:58:25] [INFO ] Dead Transitions using invariants and state equation in 23047 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30230 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Graph (trivial) has 65321 edges and 1681 vertex of which 1677 / 1681 are part of one of the 41 SCC in 13 ms
Free SCC test removed 1636 places
Drop transitions removed 65321 transitions
Ensure Unique test removed 312 transitions
Reduce isomorphic transitions removed 65633 transitions.
Graph (complete) has 8 edges and 45 vertex of which 8 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.0 ms
Discarding 37 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 73 ms. Remains 8 /1681 variables (removed 1673) and now considering 8/65641 (removed 65633) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-03-20 08:58:25] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 08:58:25] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:58:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-20 08:58:25] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:58:25] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-20 08:58:25] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 309 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 3560 ms.
Product exploration explored 100000 steps with 0 reset in 3628 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 3754 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
// Phase 1: matrix 65641 rows 1681 cols
[2023-03-20 08:58:37] [INFO ] Computed 41 place invariants in 169 ms
[2023-03-20 08:59:00] [INFO ] Dead Transitions using invariants and state equation in 23035 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26798 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Support contains 4 out of 1681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1681/1681 places, 65641/65641 transitions.
Applied a total of 0 rules in 4711 ms. Remains 1681 /1681 variables (removed 0) and now considering 65641/65641 (removed 0) transitions.
[2023-03-20 08:59:05] [INFO ] Invariant cache hit.
[2023-03-20 08:59:09] [INFO ] Implicit Places using invariants in 4124 ms returned []
Implicit Place search using SMT only with invariants took 4128 ms to find 0 implicit places.
[2023-03-20 08:59:09] [INFO ] Invariant cache hit.
[2023-03-20 08:59:32] [INFO ] Dead Transitions using invariants and state equation in 22998 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31841 ms. Remains : 1681/1681 places, 65641/65641 transitions.
Treatment of property TokenRing-PT-040-LTLCardinality-15 finished in 329916 ms.
[2023-03-20 08:59:36] [INFO ] Flatten gal took : 1450 ms
[2023-03-20 08:59:36] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 08:59:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1681 places, 65641 transitions and 262564 arcs took 279 ms.
Total runtime 1021968 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1441/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1441/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : TokenRing-PT-040-LTLCardinality-10
Could not compute solution for formula : TokenRing-PT-040-LTLCardinality-15
BK_STOP 1679302811997
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name TokenRing-PT-040-LTLCardinality-10
ltl formula formula --ltl=/tmp/1441/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1681 places, 65641 transitions and 262564 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.950 real 2.550 user 2.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1441/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1441/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1441/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1441/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name TokenRing-PT-040-LTLCardinality-15
ltl formula formula --ltl=/tmp/1441/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1681 places, 65641 transitions and 262564 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.930 real 2.470 user 2.250 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1441/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1441/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1441/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1441/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
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="TokenRing-PT-040"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is TokenRing-PT-040, 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 r489-tall-167912707100691"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-040.tgz
mv TokenRing-PT-040 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 '
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 ;