Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695200780.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695200780
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 61M
-rw-r--r-- 1 mcc users 8.8K Feb 26 00:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 00:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 00:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 00:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 00:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 00:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 00:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 60M Mar 5 18:22 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 CANInsertWithFailure-PT-100-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678667263079

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 00:27:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 00:27:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:27:46] [INFO ] Load time of PNML (sax parser for PT used): 1217 ms
[2023-03-13 00:27:46] [INFO ] Transformed 21204 places.
[2023-03-13 00:27:46] [INFO ] Transformed 60600 transitions.
[2023-03-13 00:27:46] [INFO ] Parsed PT model containing 21204 places and 60600 transitions and 162000 arcs in 1666 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-100-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-100-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 21204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21204/21204 places, 60600/60600 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21203 transition count 60600
Applied a total of 1 rules in 6286 ms. Remains 21203 /21204 variables (removed 1) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-13 00:28:23] [INFO ] Computed 102 place invariants in 29743 ms
[2023-03-13 00:28:25] [INFO ] Implicit Places using invariants in 32322 ms returned []
Implicit Place search using SMT only with invariants took 32362 ms to find 0 implicit places.
[2023-03-13 00:28:26] [INFO ] Invariant cache hit.
[2023-03-13 00:28:28] [INFO ] Dead Transitions using invariants and state equation in 2280 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21203/21204 places, 60600/60600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40941 ms. Remains : 21203/21204 places, 60600/60600 transitions.
Support contains 41 out of 21203 places after structural reductions.
[2023-03-13 00:28:30] [INFO ] Flatten gal took : 1853 ms
[2023-03-13 00:28:31] [INFO ] Flatten gal took : 1264 ms
[2023-03-13 00:28:34] [INFO ] Input system was already deterministic with 60600 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1170 ms. (steps per millisecond=8 ) properties (out of 31) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-13 00:28:36] [INFO ] Invariant cache hit.
[2023-03-13 00:28:47] [INFO ] [Real]Absence check using 100 positive place invariants in 307 ms returned sat
[2023-03-13 00:28:47] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 664 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 00:29:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:29:01] [INFO ] After 25015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 25 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 694 transitions
Trivial Post-agglo rules discarded 694 transitions
Performed 694 trivial Post agglomeration. Transition count delta: 694
Iterating post reduction 0 with 694 rules applied. Total rules applied 694 place count 21203 transition count 59906
Reduce places removed 694 places and 0 transitions.
Iterating post reduction 1 with 694 rules applied. Total rules applied 1388 place count 20509 transition count 59906
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1388 place count 20509 transition count 59904
Deduced a syphon composed of 2 places in 34 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1392 place count 20507 transition count 59904
Performed 9880 Post agglomeration using F-continuation condition.Transition count delta: 9880
Deduced a syphon composed of 9880 places in 55 ms
Reduce places removed 9880 places and 0 transitions.
Iterating global reduction 2 with 19760 rules applied. Total rules applied 21152 place count 10627 transition count 50024
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 21157 place count 10627 transition count 50019
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 21162 place count 10622 transition count 50019
Partial Free-agglomeration rule applied 10097 times.
Drop transitions removed 10097 transitions
Iterating global reduction 3 with 10097 rules applied. Total rules applied 31259 place count 10622 transition count 50019
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 3 with 200 rules applied. Total rules applied 31459 place count 10622 transition count 50019
Applied a total of 31459 rules in 35368 ms. Remains 10622 /21203 variables (removed 10581) and now considering 50019/60600 (removed 10581) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35372 ms. Remains : 10622/21203 places, 50019/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 934 ms. (steps per millisecond=10 ) properties (out of 25) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-13 00:29:37] [INFO ] Flow matrix only has 50013 transitions (discarded 6 similar events)
// Phase 1: matrix 50013 rows 10622 cols
[2023-03-13 00:29:47] [INFO ] Computed 102 place invariants in 9547 ms
[2023-03-13 00:29:52] [INFO ] [Real]Absence check using 100 positive place invariants in 148 ms returned sat
[2023-03-13 00:29:52] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 227 ms returned sat
[2023-03-13 00:30:12] [INFO ] After 15887ms SMT Verify possible using state equation in real domain returned unsat :0 sat :18 real:1
[2023-03-13 00:30:13] [INFO ] State equation strengthened by 49652 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 00:30:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:30:13] [INFO ] After 25712ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 22 out of 10622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10622/10622 places, 50019/50019 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 10619 transition count 50016
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 10619 transition count 50016
Applied a total of 8 rules in 14864 ms. Remains 10619 /10622 variables (removed 3) and now considering 50016/50019 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14866 ms. Remains : 10619/10622 places, 50016/50019 transitions.
Computed a total of 402 stabilizing places and 700 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((X(p0)||F(p1)))))'
Support contains 2 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 41 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 2 with 19796 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Applied a total of 21196 rules in 17681 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
[2023-03-13 00:30:46] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-13 00:30:56] [INFO ] Computed 102 place invariants in 9803 ms
[2023-03-13 00:30:57] [INFO ] Implicit Places using invariants in 10779 ms returned []
Implicit Place search using SMT only with invariants took 10781 ms to find 0 implicit places.
[2023-03-13 00:30:57] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 00:30:57] [INFO ] Invariant cache hit.
[2023-03-13 00:30:58] [INFO ] Dead Transitions using invariants and state equation in 1187 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10605/21203 places, 50002/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29655 ms. Remains : 10605/21203 places, 50002/60600 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s7700 1) (GEQ s6660 1)), p1:(GEQ s7700 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 482 steps with 0 reset in 40 ms.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-00 finished in 30131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||(p1&&G(p2)))))'
Support contains 5 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 4657 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-13 00:31:22] [INFO ] Computed 102 place invariants in 19008 ms
[2023-03-13 00:31:24] [INFO ] Implicit Places using invariants in 21121 ms returned []
Implicit Place search using SMT only with invariants took 21122 ms to find 0 implicit places.
[2023-03-13 00:31:24] [INFO ] Invariant cache hit.
[2023-03-13 00:31:26] [INFO ] Dead Transitions using invariants and state equation in 2042 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27828 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 325 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p2), acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (LT s1281 1) (LT s9899 1)), p2:(AND (GEQ s133 1) (GEQ s264 1)), p1:(GEQ s12876 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 41 reset in 4659 ms.
Entered a terminal (fully accepting) state of product in 39737 steps with 16 reset in 1797 ms.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-01 finished in 34783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0))) U (p0||X(G(p1)))))'
Support contains 4 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 4421 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-13 00:31:38] [INFO ] Invariant cache hit.
[2023-03-13 00:31:39] [INFO ] Implicit Places using invariants in 1657 ms returned []
Implicit Place search using SMT only with invariants took 1659 ms to find 0 implicit places.
[2023-03-13 00:31:39] [INFO ] Invariant cache hit.
[2023-03-13 00:31:41] [INFO ] Dead Transitions using invariants and state equation in 2063 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8146 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s553 1) (GEQ s1300 1)), p0:(AND (GEQ s273 1) (GEQ s922 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2292 steps with 0 reset in 125 ms.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-02 finished in 8653 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)||F((p1&&X(X(G(p2)))))))'
Support contains 5 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 6124 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-13 00:31:48] [INFO ] Invariant cache hit.
[2023-03-13 00:31:50] [INFO ] Implicit Places using invariants in 1982 ms returned []
Implicit Place search using SMT only with invariants took 1985 ms to find 0 implicit places.
[2023-03-13 00:31:50] [INFO ] Invariant cache hit.
[2023-03-13 00:31:52] [INFO ] Dead Transitions using invariants and state equation in 2084 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10198 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 387 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 5}, { cond=p1, acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s19282 1), p0:(AND (LT s5195 1) (LT s17480 1)), p2:(AND (GEQ s1104 1) (GEQ s1239 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 70690 steps with 35345 reset in 10002 ms.
Product exploration timeout after 72970 steps with 36485 reset in 10001 ms.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 8 factoid took 133 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-100-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-03 finished in 31163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 4415 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-13 00:32:17] [INFO ] Invariant cache hit.
[2023-03-13 00:32:19] [INFO ] Implicit Places using invariants in 2147 ms returned []
Implicit Place search using SMT only with invariants took 2149 ms to find 0 implicit places.
[2023-03-13 00:32:19] [INFO ] Invariant cache hit.
[2023-03-13 00:32:22] [INFO ] Dead Transitions using invariants and state equation in 2108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8681 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s9806 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 75740 steps with 37870 reset in 10001 ms.
Product exploration timeout after 80460 steps with 40230 reset in 10001 ms.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-100-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-04 finished in 29274 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||G(F(p1))))&&F(G((p2&&(p3||G(F(p1)))))))))'
Support contains 5 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 21203 transition count 59902
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 20505 transition count 59902
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1396 place count 20505 transition count 59901
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1398 place count 20504 transition count 59901
Performed 9897 Post agglomeration using F-continuation condition.Transition count delta: 9897
Deduced a syphon composed of 9897 places in 31 ms
Reduce places removed 9897 places and 0 transitions.
Iterating global reduction 2 with 19794 rules applied. Total rules applied 21192 place count 10607 transition count 50004
Applied a total of 21192 rules in 16889 ms. Remains 10607 /21203 variables (removed 10596) and now considering 50004/60600 (removed 10596) transitions.
[2023-03-13 00:32:59] [INFO ] Flow matrix only has 40304 transitions (discarded 9700 similar events)
// Phase 1: matrix 40304 rows 10607 cols
[2023-03-13 00:33:08] [INFO ] Computed 102 place invariants in 8866 ms
[2023-03-13 00:33:09] [INFO ] Implicit Places using invariants in 10124 ms returned []
Implicit Place search using SMT only with invariants took 10125 ms to find 0 implicit places.
[2023-03-13 00:33:09] [INFO ] Flow matrix only has 40304 transitions (discarded 9700 similar events)
[2023-03-13 00:33:09] [INFO ] Invariant cache hit.
[2023-03-13 00:33:10] [INFO ] Dead Transitions using invariants and state equation in 1140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10607/21203 places, 50004/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28162 ms. Remains : 10607/21203 places, 50004/60600 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p3 p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (LT s186 1) (LT s264 1)), p0:(GEQ s2894 1), p1:(GEQ s6130 1), p3:(GEQ s5515 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 549 steps with 0 reset in 35 ms.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-05 finished in 28511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p0 U p1)||X(p1))))))'
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 4630 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-13 00:33:36] [INFO ] Computed 102 place invariants in 20242 ms
[2023-03-13 00:33:38] [INFO ] Implicit Places using invariants in 22350 ms returned []
Implicit Place search using SMT only with invariants took 22352 ms to find 0 implicit places.
[2023-03-13 00:33:38] [INFO ] Invariant cache hit.
[2023-03-13 00:33:40] [INFO ] Dead Transitions using invariants and state equation in 2032 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29018 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s259 1) (GEQ s12923 1)), p0:(GEQ s2314 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-06 finished in 29493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0 U X((X(p1) U G(p2)))))))'
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 5119 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-13 00:33:45] [INFO ] Invariant cache hit.
[2023-03-13 00:33:47] [INFO ] Implicit Places using invariants in 2019 ms returned []
Implicit Place search using SMT only with invariants took 2021 ms to find 0 implicit places.
[2023-03-13 00:33:47] [INFO ] Invariant cache hit.
[2023-03-13 00:33:49] [INFO ] Dead Transitions using invariants and state equation in 2074 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9220 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 347 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), true, (AND (NOT p2) p1)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(AND p2 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(GEQ s8650 1), p0:(AND (GEQ s1880 1) (GEQ s20291 1)), p1:(GEQ s20291 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2284 steps with 0 reset in 87 ms.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-08 finished in 9808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&(p1||X((G(p2) U (p1&&G(p2))))))))'
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 4641 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-13 00:33:55] [INFO ] Invariant cache hit.
[2023-03-13 00:33:57] [INFO ] Implicit Places using invariants in 2088 ms returned []
Implicit Place search using SMT only with invariants took 2090 ms to find 0 implicit places.
[2023-03-13 00:33:57] [INFO ] Invariant cache hit.
[2023-03-13 00:33:59] [INFO ] Dead Transitions using invariants and state equation in 1998 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8734 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s7346 1), p0:(LT s14094 1), p2:(GEQ s18784 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 94530 steps with 31549 reset in 10001 ms.
Product exploration timeout after 96900 steps with 32278 reset in 10002 ms.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X p0), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 567 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 71440 steps, run timeout after 3004 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71440 steps, saw 70520 distinct states, run finished after 3007 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-13 00:34:24] [INFO ] Invariant cache hit.
[2023-03-13 00:34:28] [INFO ] [Real]Absence check using 100 positive place invariants in 202 ms returned sat
[2023-03-13 00:34:29] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 486 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-13 00:34:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:34:49] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9897 Post agglomeration using F-continuation condition.Transition count delta: 9897
Deduced a syphon composed of 9897 places in 47 ms
Reduce places removed 9897 places and 0 transitions.
Iterating global reduction 2 with 19794 rules applied. Total rules applied 21194 place count 10606 transition count 50003
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21195 place count 10606 transition count 50002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 3 with 10101 rules applied. Total rules applied 31297 place count 10605 transition count 50002
Applied a total of 31297 rules in 26351 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26352 ms. Remains : 10605/21203 places, 50002/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 765 ms. (steps per millisecond=13 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 94976 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94976 steps, saw 92640 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 50002 rows 10605 cols
[2023-03-13 00:35:28] [INFO ] Computed 102 place invariants in 8732 ms
[2023-03-13 00:35:31] [INFO ] [Real]Absence check using 100 positive place invariants in 137 ms returned sat
[2023-03-13 00:35:31] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 221 ms returned sat
[2023-03-13 00:35:53] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 00:35:55] [INFO ] [Nat]Absence check using 100 positive place invariants in 192 ms returned sat
[2023-03-13 00:35:56] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 239 ms returned sat
[2023-03-13 00:36:18] [INFO ] After 21363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 00:36:19] [INFO ] State equation strengthened by 49694 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-13 00:36:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:36:19] [INFO ] After 25838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 5595 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5596 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 6050 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-13 00:36:31] [INFO ] Invariant cache hit.
[2023-03-13 00:36:32] [INFO ] Implicit Places using invariants in 993 ms returned []
Implicit Place search using SMT only with invariants took 995 ms to find 0 implicit places.
[2023-03-13 00:36:32] [INFO ] Invariant cache hit.
[2023-03-13 00:36:33] [INFO ] Dead Transitions using invariants and state equation in 1198 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8257 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X p0), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 748 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-13 00:37:00] [INFO ] Computed 102 place invariants in 25702 ms
Could not prove EG (NOT p1)
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 4537 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-13 00:37:20] [INFO ] Invariant cache hit.
[2023-03-13 00:37:22] [INFO ] Implicit Places using invariants in 2051 ms returned []
Implicit Place search using SMT only with invariants took 2052 ms to find 0 implicit places.
[2023-03-13 00:37:22] [INFO ] Invariant cache hit.
[2023-03-13 00:37:24] [INFO ] Dead Transitions using invariants and state equation in 2125 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8719 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 552 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 828 ms. (steps per millisecond=12 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 82883 steps, run timeout after 3002 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82883 steps, saw 81796 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-13 00:37:29] [INFO ] Invariant cache hit.
[2023-03-13 00:37:34] [INFO ] [Real]Absence check using 100 positive place invariants in 285 ms returned sat
[2023-03-13 00:37:35] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 667 ms returned sat
[2023-03-13 00:37:54] [INFO ] After 18020ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2023-03-13 00:37:55] [INFO ] State equation strengthened by 19900 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-13 00:37:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:37:55] [INFO ] After 25327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9897 Post agglomeration using F-continuation condition.Transition count delta: 9897
Deduced a syphon composed of 9897 places in 53 ms
Reduce places removed 9897 places and 0 transitions.
Iterating global reduction 2 with 19794 rules applied. Total rules applied 21194 place count 10606 transition count 50003
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21195 place count 10606 transition count 50002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 3 with 10101 rules applied. Total rules applied 31297 place count 10605 transition count 50002
Applied a total of 31297 rules in 30023 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30026 ms. Remains : 10605/21203 places, 50002/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 830 ms. (steps per millisecond=12 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 69127 steps, run timeout after 3005 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69127 steps, saw 67678 distinct states, run finished after 3006 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 50002 rows 10605 cols
[2023-03-13 00:38:37] [INFO ] Computed 102 place invariants in 8116 ms
[2023-03-13 00:38:39] [INFO ] [Real]Absence check using 100 positive place invariants in 156 ms returned sat
[2023-03-13 00:38:39] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 243 ms returned sat
[2023-03-13 00:39:02] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 00:39:04] [INFO ] [Nat]Absence check using 100 positive place invariants in 164 ms returned sat
[2023-03-13 00:39:05] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 245 ms returned sat
[2023-03-13 00:39:27] [INFO ] After 21339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 00:39:28] [INFO ] State equation strengthened by 49694 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-13 00:39:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:39:28] [INFO ] After 25734ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 5073 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5073 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 5599 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-13 00:39:38] [INFO ] Invariant cache hit.
[2023-03-13 00:39:39] [INFO ] Implicit Places using invariants in 881 ms returned []
Implicit Place search using SMT only with invariants took 883 ms to find 0 implicit places.
[2023-03-13 00:39:39] [INFO ] Invariant cache hit.
[2023-03-13 00:39:40] [INFO ] Dead Transitions using invariants and state equation in 887 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7383 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 532 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-13 00:40:01] [INFO ] Computed 102 place invariants in 19538 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 24872 reset in 9461 ms.
Product exploration explored 100000 steps with 25063 reset in 9136 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Performed 500 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 21203 transition count 60600
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 500 place count 21203 transition count 60600
Deduced a syphon composed of 600 places in 24 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 600 place count 21203 transition count 60600
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 800 place count 21003 transition count 60400
Deduced a syphon composed of 400 places in 36 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 1000 place count 21003 transition count 60400
Performed 9997 Post agglomeration using F-continuation condition.Transition count delta: -19594
Deduced a syphon composed of 10397 places in 34 ms
Iterating global reduction 1 with 9997 rules applied. Total rules applied 10997 place count 21003 transition count 79994
Discarding 400 places :
Symmetric choice reduction at 1 with 400 rule applications. Total rules 11397 place count 20603 transition count 79594
Deduced a syphon composed of 9997 places in 18 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 11797 place count 20603 transition count 79594
Deduced a syphon composed of 9997 places in 17 ms
Applied a total of 11797 rules in 46056 ms. Remains 20603 /21203 variables (removed 600) and now considering 79594/60600 (removed -18994) transitions.
[2023-03-13 00:41:21] [INFO ] Flow matrix only has 69895 transitions (discarded 9699 similar events)
// Phase 1: matrix 69895 rows 20603 cols
[2023-03-13 00:41:46] [INFO ] Computed 102 place invariants in 24950 ms
[2023-03-13 00:41:49] [INFO ] Dead Transitions using invariants and state equation in 27069 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20603/21203 places, 79594/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73135 ms. Remains : 20603/21203 places, 79594/60600 transitions.
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 7252 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-13 00:42:16] [INFO ] Computed 102 place invariants in 20333 ms
[2023-03-13 00:42:18] [INFO ] Implicit Places using invariants in 22101 ms returned []
Implicit Place search using SMT only with invariants took 22110 ms to find 0 implicit places.
[2023-03-13 00:42:18] [INFO ] Invariant cache hit.
[2023-03-13 00:42:20] [INFO ] Dead Transitions using invariants and state equation in 1557 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30929 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-09 finished in 511951 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)||(p0&&F(p1)))))'
Support contains 2 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 7123 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-13 00:42:29] [INFO ] Invariant cache hit.
[2023-03-13 00:42:31] [INFO ] Implicit Places using invariants in 2009 ms returned []
Implicit Place search using SMT only with invariants took 2015 ms to find 0 implicit places.
[2023-03-13 00:42:31] [INFO ] Invariant cache hit.
[2023-03-13 00:42:33] [INFO ] Dead Transitions using invariants and state equation in 1906 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11061 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LT s4315 1), p0:(LT s4714 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 77230 steps with 38615 reset in 10001 ms.
Product exploration timeout after 74670 steps with 37335 reset in 10001 ms.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 154 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-100-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-10 finished in 31760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1||(!p0&&X(!p0)))))))'
Support contains 2 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 8115 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-13 00:43:02] [INFO ] Invariant cache hit.
[2023-03-13 00:43:04] [INFO ] Implicit Places using invariants in 2093 ms returned []
Implicit Place search using SMT only with invariants took 2100 ms to find 0 implicit places.
[2023-03-13 00:43:04] [INFO ] Invariant cache hit.
[2023-03-13 00:43:06] [INFO ] Dead Transitions using invariants and state equation in 2057 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12280 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, false, (AND p0 (NOT p1)), p0]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LT s6554 1), p1:(LT s9126 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 40 reset in 4578 ms.
Product exploration explored 100000 steps with 41 reset in 3376 ms.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 515 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, false, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 75157 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75157 steps, saw 74186 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 00:43:19] [INFO ] Invariant cache hit.
[2023-03-13 00:43:23] [INFO ] [Real]Absence check using 100 positive place invariants in 260 ms returned sat
[2023-03-13 00:43:24] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 633 ms returned sat
[2023-03-13 00:43:44] [INFO ] After 19475ms SMT Verify possible using state equation in real domain returned unsat :0 sat :0 real:4
[2023-03-13 00:43:44] [INFO ] State equation strengthened by 19900 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-13 00:43:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:43:44] [INFO ] After 25314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 52 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 2 with 19796 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21197 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21198 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 3 with 10101 rules applied. Total rules applied 31299 place count 10604 transition count 50001
Applied a total of 31299 rules in 49872 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49873 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 710 ms. (steps per millisecond=14 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 84420 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84420 steps, saw 82584 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50001 rows 10604 cols
[2023-03-13 00:44:47] [INFO ] Computed 102 place invariants in 8411 ms
[2023-03-13 00:44:49] [INFO ] [Real]Absence check using 100 positive place invariants in 146 ms returned sat
[2023-03-13 00:44:49] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 260 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-13 00:45:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:45:12] [INFO ] After 25052ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 9545 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9546 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 9657 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-13 00:45:31] [INFO ] Invariant cache hit.
[2023-03-13 00:45:32] [INFO ] Implicit Places using invariants in 1141 ms returned []
Implicit Place search using SMT only with invariants took 1145 ms to find 0 implicit places.
[2023-03-13 00:45:32] [INFO ] Invariant cache hit.
[2023-03-13 00:45:33] [INFO ] Dead Transitions using invariants and state equation in 1088 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11917 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 608 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[true, false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 223 ms :[true, false, p0, (AND p0 (NOT p1))]
Support contains 2 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 6842 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-13 00:46:01] [INFO ] Computed 102 place invariants in 19733 ms
[2023-03-13 00:46:03] [INFO ] Implicit Places using invariants in 22085 ms returned []
Implicit Place search using SMT only with invariants took 22087 ms to find 0 implicit places.
[2023-03-13 00:46:03] [INFO ] Invariant cache hit.
[2023-03-13 00:46:05] [INFO ] Dead Transitions using invariants and state equation in 1807 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30757 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Computed a total of 402 stabilizing places and 700 stable transitions
Computed a total of 402 stabilizing places and 700 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 640 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, false, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 642 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 93860 steps, run timeout after 3003 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93860 steps, saw 92605 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 00:46:10] [INFO ] Invariant cache hit.
[2023-03-13 00:46:14] [INFO ] [Real]Absence check using 100 positive place invariants in 258 ms returned sat
[2023-03-13 00:46:15] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 637 ms returned sat
[2023-03-13 00:46:35] [INFO ] After 25012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 00:46:39] [INFO ] [Nat]Absence check using 100 positive place invariants in 248 ms returned sat
[2023-03-13 00:46:40] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 640 ms returned sat
[2023-03-13 00:47:00] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 44 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 2 with 19796 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21197 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21198 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 3 with 10101 rules applied. Total rules applied 31299 place count 10604 transition count 50001
Applied a total of 31299 rules in 40420 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40421 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 718 ms. (steps per millisecond=13 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 79457 steps, run timeout after 3003 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79457 steps, saw 77746 distinct states, run finished after 3004 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50001 rows 10604 cols
[2023-03-13 00:47:53] [INFO ] Computed 102 place invariants in 8012 ms
[2023-03-13 00:47:55] [INFO ] [Real]Absence check using 100 positive place invariants in 144 ms returned sat
[2023-03-13 00:47:55] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 224 ms returned sat
[2023-03-13 00:48:18] [INFO ] After 22416ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-13 00:48:18] [INFO ] State equation strengthened by 49696 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-13 00:48:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:48:18] [INFO ] After 25555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 11700 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11701 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 9135 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-13 00:48:39] [INFO ] Invariant cache hit.
[2023-03-13 00:48:40] [INFO ] Implicit Places using invariants in 1260 ms returned []
Implicit Place search using SMT only with invariants took 1262 ms to find 0 implicit places.
[2023-03-13 00:48:40] [INFO ] Invariant cache hit.
[2023-03-13 00:48:41] [INFO ] Dead Transitions using invariants and state equation in 1193 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11599 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 615 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[true, false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 188 ms :[true, false, p0, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 41 reset in 3619 ms.
Product exploration explored 100000 steps with 40 reset in 3838 ms.
Support contains 2 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 6532 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2023-03-13 00:49:16] [INFO ] Computed 102 place invariants in 19204 ms
[2023-03-13 00:49:18] [INFO ] Implicit Places using invariants in 21137 ms returned []
Implicit Place search using SMT only with invariants took 21138 ms to find 0 implicit places.
[2023-03-13 00:49:18] [INFO ] Invariant cache hit.
[2023-03-13 00:49:20] [INFO ] Dead Transitions using invariants and state equation in 1706 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29380 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-12 finished in 387539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&F(p1)) U X(p2)))'
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 7143 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-13 00:49:28] [INFO ] Invariant cache hit.
[2023-03-13 00:49:30] [INFO ] Implicit Places using invariants in 1675 ms returned []
Implicit Place search using SMT only with invariants took 1680 ms to find 0 implicit places.
[2023-03-13 00:49:30] [INFO ] Invariant cache hit.
[2023-03-13 00:49:32] [INFO ] Dead Transitions using invariants and state equation in 1536 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10362 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 340 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LT s17142 1), p1:(GEQ s18128 1), p2:(GEQ s11041 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2284 steps with 0 reset in 103 ms.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-13 finished in 10998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Applied a total of 0 rules in 6770 ms. Remains 21203 /21203 variables (removed 0) and now considering 60600/60600 (removed 0) transitions.
[2023-03-13 00:49:39] [INFO ] Invariant cache hit.
[2023-03-13 00:49:41] [INFO ] Implicit Places using invariants in 1937 ms returned []
Implicit Place search using SMT only with invariants took 1958 ms to find 0 implicit places.
[2023-03-13 00:49:41] [INFO ] Invariant cache hit.
[2023-03-13 00:49:43] [INFO ] Dead Transitions using invariants and state equation in 1697 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10444 ms. Remains : 21203/21203 places, 60600/60600 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s623 1) (GEQ s16539 1) (GEQ s13784 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2316 steps with 0 reset in 145 ms.
FORMULA CANInsertWithFailure-PT-100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-15 finished in 10951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&(p1||X((G(p2) U (p1&&G(p2))))))))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-100-LTLFireability-09
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9897 Post agglomeration using F-continuation condition.Transition count delta: 9897
Deduced a syphon composed of 9897 places in 56 ms
Reduce places removed 9897 places and 0 transitions.
Iterating global reduction 2 with 19794 rules applied. Total rules applied 21194 place count 10606 transition count 50003
Applied a total of 21194 rules in 25584 ms. Remains 10606 /21203 variables (removed 10597) and now considering 50003/60600 (removed 10597) transitions.
[2023-03-13 00:50:09] [INFO ] Flow matrix only has 40304 transitions (discarded 9699 similar events)
// Phase 1: matrix 40304 rows 10606 cols
[2023-03-13 00:50:19] [INFO ] Computed 102 place invariants in 9722 ms
[2023-03-13 00:50:20] [INFO ] Implicit Places using invariants in 10858 ms returned []
Implicit Place search using SMT only with invariants took 10868 ms to find 0 implicit places.
[2023-03-13 00:50:20] [INFO ] Flow matrix only has 40304 transitions (discarded 9699 similar events)
[2023-03-13 00:50:20] [INFO ] Invariant cache hit.
[2023-03-13 00:50:21] [INFO ] Dead Transitions using invariants and state equation in 1241 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 10606/21203 places, 50003/60600 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 37698 ms. Remains : 10606/21203 places, 50003/60600 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s3605 1), p0:(LT s7014 1), p2:(GEQ s9383 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33438 reset in 9759 ms.
Product exploration explored 100000 steps with 33328 reset in 8470 ms.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X p0), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 547 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 767 ms. (steps per millisecond=13 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 65847 steps, run timeout after 3008 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65847 steps, saw 64498 distinct states, run finished after 3008 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-13 00:50:44] [INFO ] Flow matrix only has 40304 transitions (discarded 9699 similar events)
[2023-03-13 00:50:44] [INFO ] Invariant cache hit.
[2023-03-13 00:50:47] [INFO ] [Real]Absence check using 100 positive place invariants in 115 ms returned sat
[2023-03-13 00:50:47] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 229 ms returned sat
[2023-03-13 00:51:09] [INFO ] After 21622ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2023-03-13 00:51:10] [INFO ] State equation strengthened by 29895 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-13 00:51:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:51:10] [INFO ] After 25472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10606 transition count 50002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10605 transition count 50002
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10605 transition count 50002
Applied a total of 10103 rules in 27149 ms. Remains 10605 /10606 variables (removed 1) and now considering 50002/50003 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27150 ms. Remains : 10605/10606 places, 50002/50003 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 1087 ms. (steps per millisecond=9 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 37423 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37423 steps, saw 36782 distinct states, run finished after 3004 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 50002 rows 10605 cols
[2023-03-13 00:51:51] [INFO ] Computed 102 place invariants in 9406 ms
[2023-03-13 00:51:53] [INFO ] [Real]Absence check using 100 positive place invariants in 145 ms returned sat
[2023-03-13 00:51:54] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 225 ms returned sat
[2023-03-13 00:52:16] [INFO ] After 21458ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2023-03-13 00:52:16] [INFO ] State equation strengthened by 49694 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-13 00:52:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:52:16] [INFO ] After 25623ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 9817 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9817 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 9955 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-13 00:52:36] [INFO ] Invariant cache hit.
[2023-03-13 00:52:37] [INFO ] Implicit Places using invariants in 959 ms returned []
Implicit Place search using SMT only with invariants took 973 ms to find 0 implicit places.
[2023-03-13 00:52:37] [INFO ] Invariant cache hit.
[2023-03-13 00:52:39] [INFO ] Dead Transitions using invariants and state equation in 1939 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12874 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X p0), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 550 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-13 00:52:40] [INFO ] Flow matrix only has 40304 transitions (discarded 9699 similar events)
// Phase 1: matrix 40304 rows 10606 cols
[2023-03-13 00:52:50] [INFO ] Computed 102 place invariants in 9089 ms
Could not prove EG (NOT p1)
Support contains 3 out of 10606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 8132 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
[2023-03-13 00:53:13] [INFO ] Flow matrix only has 40304 transitions (discarded 9699 similar events)
[2023-03-13 00:53:13] [INFO ] Invariant cache hit.
[2023-03-13 00:53:14] [INFO ] Implicit Places using invariants in 856 ms returned []
Implicit Place search using SMT only with invariants took 871 ms to find 0 implicit places.
[2023-03-13 00:53:14] [INFO ] Flow matrix only has 40304 transitions (discarded 9699 similar events)
[2023-03-13 00:53:14] [INFO ] Invariant cache hit.
[2023-03-13 00:53:14] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9883 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 396 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 729 ms. (steps per millisecond=13 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-13 00:53:16] [INFO ] Flow matrix only has 40304 transitions (discarded 9699 similar events)
[2023-03-13 00:53:16] [INFO ] Invariant cache hit.
[2023-03-13 00:53:18] [INFO ] [Real]Absence check using 100 positive place invariants in 137 ms returned sat
[2023-03-13 00:53:18] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 226 ms returned sat
[2023-03-13 00:53:41] [INFO ] After 22396ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2023-03-13 00:53:42] [INFO ] State equation strengthened by 29895 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-13 00:53:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:53:42] [INFO ] After 25391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10606 transition count 50002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10605 transition count 50002
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10605 transition count 50002
Applied a total of 10103 rules in 25757 ms. Remains 10605 /10606 variables (removed 1) and now considering 50002/50003 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25757 ms. Remains : 10605/10606 places, 50002/50003 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 657 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 52716 steps, run timeout after 3002 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 52716 steps, saw 51687 distinct states, run finished after 3002 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50002 rows 10605 cols
[2023-03-13 00:54:20] [INFO ] Computed 102 place invariants in 8382 ms
[2023-03-13 00:54:22] [INFO ] [Real]Absence check using 100 positive place invariants in 152 ms returned sat
[2023-03-13 00:54:22] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 259 ms returned sat
[2023-03-13 00:54:45] [INFO ] After 22081ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2023-03-13 00:54:45] [INFO ] State equation strengthened by 49694 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-13 00:54:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:54:45] [INFO ] After 25691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 9358 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9358 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 9485 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-13 00:55:04] [INFO ] Invariant cache hit.
[2023-03-13 00:55:05] [INFO ] Implicit Places using invariants in 991 ms returned []
Implicit Place search using SMT only with invariants took 1020 ms to find 0 implicit places.
[2023-03-13 00:55:05] [INFO ] Invariant cache hit.
[2023-03-13 00:55:06] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11364 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 10 factoid took 451 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-13 00:55:07] [INFO ] Flow matrix only has 40304 transitions (discarded 9699 similar events)
// Phase 1: matrix 40304 rows 10606 cols
[2023-03-13 00:55:17] [INFO ] Computed 102 place invariants in 10141 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25020 reset in 7087 ms.
Product exploration explored 100000 steps with 24992 reset in 6436 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 10606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 8192 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
[2023-03-13 00:55:54] [INFO ] Flow matrix only has 40304 transitions (discarded 9699 similar events)
[2023-03-13 00:55:54] [INFO ] Invariant cache hit.
[2023-03-13 00:55:55] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9232 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Support contains 3 out of 10606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10606/10606 places, 50003/50003 transitions.
Applied a total of 0 rules in 7677 ms. Remains 10606 /10606 variables (removed 0) and now considering 50003/50003 (removed 0) transitions.
[2023-03-13 00:56:03] [INFO ] Flow matrix only has 40304 transitions (discarded 9699 similar events)
[2023-03-13 00:56:03] [INFO ] Invariant cache hit.
[2023-03-13 00:56:04] [INFO ] Implicit Places using invariants in 1017 ms returned []
Implicit Place search using SMT only with invariants took 1020 ms to find 0 implicit places.
[2023-03-13 00:56:04] [INFO ] Flow matrix only has 40304 transitions (discarded 9699 similar events)
[2023-03-13 00:56:04] [INFO ] Invariant cache hit.
[2023-03-13 00:56:05] [INFO ] Dead Transitions using invariants and state equation in 891 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9599 ms. Remains : 10606/10606 places, 50003/50003 transitions.
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-09 finished in 383090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1||(!p0&&X(!p0)))))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-100-LTLFireability-12
Stuttering acceptance computed with spot in 111 ms :[true, false, (AND p0 (NOT p1)), p0]
Support contains 2 out of 21203 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 25 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 2 with 19796 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Applied a total of 21196 rules in 21859 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
[2023-03-13 00:56:28] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-13 00:56:36] [INFO ] Computed 102 place invariants in 8084 ms
[2023-03-13 00:56:37] [INFO ] Implicit Places using invariants in 9051 ms returned []
Implicit Place search using SMT only with invariants took 9081 ms to find 0 implicit places.
[2023-03-13 00:56:37] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 00:56:37] [INFO ] Invariant cache hit.
[2023-03-13 00:56:38] [INFO ] Dead Transitions using invariants and state equation in 864 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 10605/21203 places, 50002/60600 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 31834 ms. Remains : 10605/21203 places, 50002/60600 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LT s3205 1), p1:(LT s4505 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 199 reset in 4851 ms.
Product exploration explored 100000 steps with 198 reset in 4732 ms.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 508 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, false, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 878 ms. (steps per millisecond=11 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 68072 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68072 steps, saw 64872 distinct states, run finished after 3003 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 00:56:53] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 00:56:53] [INFO ] Invariant cache hit.
[2023-03-13 00:56:55] [INFO ] [Real]Absence check using 100 positive place invariants in 146 ms returned sat
[2023-03-13 00:56:55] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 224 ms returned sat
[2023-03-13 00:57:18] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 00:57:20] [INFO ] [Nat]Absence check using 100 positive place invariants in 149 ms returned sat
[2023-03-13 00:57:20] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 222 ms returned sat
[2023-03-13 00:57:43] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10604 transition count 50001
Applied a total of 10103 rules in 26736 ms. Remains 10604 /10605 variables (removed 1) and now considering 50001/50002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26737 ms. Remains : 10604/10605 places, 50001/50002 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 953 ms. (steps per millisecond=10 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 45525 steps, run timeout after 3007 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 45525 steps, saw 44678 distinct states, run finished after 3007 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50001 rows 10604 cols
[2023-03-13 00:58:23] [INFO ] Computed 102 place invariants in 9229 ms
[2023-03-13 00:58:25] [INFO ] [Real]Absence check using 100 positive place invariants in 124 ms returned sat
[2023-03-13 00:58:25] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 234 ms returned sat
[2023-03-13 00:58:48] [INFO ] After 25016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 00:58:50] [INFO ] [Nat]Absence check using 100 positive place invariants in 149 ms returned sat
[2023-03-13 00:58:50] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 223 ms returned sat
[2023-03-13 00:59:13] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 9736 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9737 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 9851 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-13 00:59:33] [INFO ] Invariant cache hit.
[2023-03-13 00:59:34] [INFO ] Implicit Places using invariants in 966 ms returned []
Implicit Place search using SMT only with invariants took 967 ms to find 0 implicit places.
[2023-03-13 00:59:34] [INFO ] Invariant cache hit.
[2023-03-13 00:59:34] [INFO ] Dead Transitions using invariants and state equation in 877 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11719 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 406 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[true, false, p0, (AND p0 (NOT p1))]
Support contains 2 out of 10605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 8368 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-13 00:59:44] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-13 00:59:54] [INFO ] Computed 102 place invariants in 10164 ms
[2023-03-13 00:59:55] [INFO ] Implicit Places using invariants in 11152 ms returned []
Implicit Place search using SMT only with invariants took 11169 ms to find 0 implicit places.
[2023-03-13 00:59:55] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 00:59:55] [INFO ] Invariant cache hit.
[2023-03-13 00:59:56] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20449 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 491 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, false, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 985 ms. (steps per millisecond=10 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 70633 steps, run timeout after 3002 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70633 steps, saw 65269 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 01:00:01] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 01:00:01] [INFO ] Invariant cache hit.
[2023-03-13 01:00:02] [INFO ] [Real]Absence check using 100 positive place invariants in 87 ms returned sat
[2023-03-13 01:00:02] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 158 ms returned sat
[2023-03-13 01:00:26] [INFO ] After 22937ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2023-03-13 01:00:26] [INFO ] State equation strengthened by 29896 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-13 01:00:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 01:00:26] [INFO ] After 25386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10605 transition count 50001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10604 transition count 50001
Partial Free-agglomeration rule applied 10101 times.
Drop transitions removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10604 transition count 50001
Applied a total of 10103 rules in 26326 ms. Remains 10604 /10605 variables (removed 1) and now considering 50001/50002 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26328 ms. Remains : 10604/10605 places, 50001/50002 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 677 ms. (steps per millisecond=14 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 54742 steps, run timeout after 3006 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54742 steps, saw 53661 distinct states, run finished after 3006 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 50001 rows 10604 cols
[2023-03-13 01:01:05] [INFO ] Computed 102 place invariants in 9024 ms
[2023-03-13 01:01:07] [INFO ] [Real]Absence check using 100 positive place invariants in 115 ms returned sat
[2023-03-13 01:01:07] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 224 ms returned sat
[2023-03-13 01:01:30] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 01:01:32] [INFO ] [Nat]Absence check using 100 positive place invariants in 150 ms returned sat
[2023-03-13 01:01:32] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 261 ms returned sat
[2023-03-13 01:01:55] [INFO ] After 22016ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 01:01:56] [INFO ] State equation strengthened by 49696 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.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-13 01:01:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 01:01:56] [INFO ] After 25692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 9486 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9487 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 9413 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2023-03-13 01:02:15] [INFO ] Invariant cache hit.
[2023-03-13 01:02:16] [INFO ] Implicit Places using invariants in 927 ms returned []
Implicit Place search using SMT only with invariants took 941 ms to find 0 implicit places.
[2023-03-13 01:02:16] [INFO ] Invariant cache hit.
[2023-03-13 01:02:17] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11252 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 412 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[true, false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[true, false, p0, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 198 reset in 4165 ms.
Product exploration explored 100000 steps with 198 reset in 4133 ms.
Support contains 2 out of 10605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10605/10605 places, 50002/50002 transitions.
Applied a total of 0 rules in 7763 ms. Remains 10605 /10605 variables (removed 0) and now considering 50002/50002 (removed 0) transitions.
[2023-03-13 01:02:34] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2023-03-13 01:02:42] [INFO ] Computed 102 place invariants in 8861 ms
[2023-03-13 01:02:43] [INFO ] Implicit Places using invariants in 9876 ms returned []
Implicit Place search using SMT only with invariants took 9878 ms to find 0 implicit places.
[2023-03-13 01:02:44] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2023-03-13 01:02:44] [INFO ] Invariant cache hit.
[2023-03-13 01:02:44] [INFO ] Dead Transitions using invariants and state equation in 879 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18542 ms. Remains : 10605/10605 places, 50002/50002 transitions.
Treatment of property CANInsertWithFailure-PT-100-LTLFireability-12 finished in 399383 ms.
[2023-03-13 01:02:48] [INFO ] Flatten gal took : 1795 ms
[2023-03-13 01:02:48] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-13 01:02:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 21203 places, 60600 transitions and 161800 arcs took 169 ms.
Total runtime 2103182 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2302/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2302/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANInsertWithFailure-PT-100-LTLFireability-09
Could not compute solution for formula : CANInsertWithFailure-PT-100-LTLFireability-12

BK_STOP 1678669633147

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name CANInsertWithFailure-PT-100-LTLFireability-09
ltl formula formula --ltl=/tmp/2302/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 21203 places, 60600 transitions and 161800 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 8.380 real 1.840 user 2.170 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2302/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2302/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2302/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2302/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 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 CANInsertWithFailure-PT-100-LTLFireability-12
ltl formula formula --ltl=/tmp/2302/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: =============================================================================
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 21203 places, 60600 transitions and 161800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2302/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2302/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 13.940 real 2.510 user 3.580 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2302/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2302/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 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)

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="CANInsertWithFailure-PT-100"
export BK_EXAMINATION="LTLFireability"
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 CANInsertWithFailure-PT-100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695200780"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-100.tgz
mv CANInsertWithFailure-PT-100 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;