Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 6.1K Feb 25 13:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 13:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 69M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RERS17pb115-PT-2-LTLCardinality-00
FORMULA_NAME RERS17pb115-PT-2-LTLCardinality-01
FORMULA_NAME RERS17pb115-PT-2-LTLCardinality-02
FORMULA_NAME RERS17pb115-PT-2-LTLCardinality-03
FORMULA_NAME RERS17pb115-PT-2-LTLCardinality-04
FORMULA_NAME RERS17pb115-PT-2-LTLCardinality-05
FORMULA_NAME RERS17pb115-PT-2-LTLCardinality-06
FORMULA_NAME RERS17pb115-PT-2-LTLCardinality-07
FORMULA_NAME RERS17pb115-PT-2-LTLCardinality-08
FORMULA_NAME RERS17pb115-PT-2-LTLCardinality-09
FORMULA_NAME RERS17pb115-PT-2-LTLCardinality-10
FORMULA_NAME RERS17pb115-PT-2-LTLCardinality-11
FORMULA_NAME RERS17pb115-PT-2-LTLCardinality-12
FORMULA_NAME RERS17pb115-PT-2-LTLCardinality-13
FORMULA_NAME RERS17pb115-PT-2-LTLCardinality-14
FORMULA_NAME RERS17pb115-PT-2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679046953331

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb115-PT-2
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 09:55:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 09:55:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 09:55:56] [INFO ] Load time of PNML (sax parser for PT used): 1854 ms
[2023-03-17 09:55:57] [INFO ] Transformed 1399 places.
[2023-03-17 09:55:57] [INFO ] Transformed 144369 transitions.
[2023-03-17 09:55:57] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2256 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RERS17pb115-PT-2-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb115-PT-2-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 1399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Ensure Unique test removed 18 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1381 transition count 144369
Applied a total of 18 rules in 786 ms. Remains 1381 /1399 variables (removed 18) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 09:55:59] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 09:55:59] [INFO ] Computed 19 place invariants in 417 ms
[2023-03-17 09:56:07] [INFO ] Implicit Places using invariants in 8563 ms returned []
Implicit Place search using SMT only with invariants took 8590 ms to find 0 implicit places.
[2023-03-17 09:56:07] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 09:56:07] [INFO ] Invariant cache hit.
[2023-03-17 09:56:37] [INFO ] Performed 92202/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 09:56:54] [INFO ] Dead Transitions using invariants and state equation in 47047 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1381/1399 places, 144369/144369 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56441 ms. Remains : 1381/1399 places, 144369/144369 transitions.
Support contains 53 out of 1381 places after structural reductions.
[2023-03-17 09:56:59] [INFO ] Flatten gal took : 3695 ms
[2023-03-17 09:57:03] [INFO ] Flatten gal took : 3684 ms
[2023-03-17 09:57:10] [INFO ] Input system was already deterministic with 144369 transitions.
Support contains 51 out of 1381 places (down from 53) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1365 ms. (steps per millisecond=7 ) properties (out of 35) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-17 09:57:13] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 09:57:13] [INFO ] Invariant cache hit.
[2023-03-17 09:57:14] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-17 09:57:14] [INFO ] After 530ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:9
[2023-03-17 09:57:14] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-03-17 09:57:39] [INFO ] After 24659ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2023-03-17 09:57:41] [INFO ] State equation strengthened by 2277 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 09:57:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 09:57:41] [INFO ] After 27177ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:9
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1380 transition count 144368
Applied a total of 1 rules in 2531 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2551 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1440 ms. (steps per millisecond=6 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-17 09:57:46] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 09:57:46] [INFO ] Computed 19 place invariants in 268 ms
[2023-03-17 09:57:47] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-03-17 09:58:12] [INFO ] After 24898ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-17 09:58:13] [INFO ] State equation strengthened by 741 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-17 09:58:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 09:58:13] [INFO ] After 26199ms 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 6 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1003 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1003 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1274 ms. (steps per millisecond=7 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 3026 steps, run timeout after 3006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3026 steps, saw 2568 distinct states, run finished after 3009 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 09:58:19] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 09:58:19] [INFO ] Invariant cache hit.
[2023-03-17 09:58:19] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2023-03-17 09:58:43] [INFO ] After 23374ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-17 09:58:43] [INFO ] State equation strengthened by 741 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 09:58:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 09:58:44] [INFO ] After 25022ms 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 6 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 921 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 921 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 966 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 09:58:46] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 09:58:46] [INFO ] Invariant cache hit.
[2023-03-17 09:58:54] [INFO ] Implicit Places using invariants in 7878 ms returned []
Implicit Place search using SMT only with invariants took 7885 ms to find 0 implicit places.
[2023-03-17 09:58:54] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 09:58:54] [INFO ] Invariant cache hit.
[2023-03-17 09:59:24] [INFO ] Performed 94358/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 09:59:40] [INFO ] Dead Transitions using invariants and state equation in 46369 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55232 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA RERS17pb115-PT-2-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 944 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
[2023-03-17 09:59:42] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 09:59:42] [INFO ] Invariant cache hit.
[2023-03-17 09:59:50] [INFO ] Implicit Places using invariants in 8048 ms returned []
Implicit Place search using SMT only with invariants took 8050 ms to find 0 implicit places.
[2023-03-17 09:59:50] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 09:59:50] [INFO ] Invariant cache hit.
[2023-03-17 10:00:20] [INFO ] Performed 94688/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:00:36] [INFO ] Dead Transitions using invariants and state equation in 46243 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55244 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RERS17pb115-PT-2-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s1250 s650), p1:(LEQ s857 s317)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 8333 ms.
Product exploration explored 100000 steps with 0 reset in 8530 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 8517 steps, including 2 resets, run visited all 2 properties in 732 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 831 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 10:00:57] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:00:57] [INFO ] Invariant cache hit.
[2023-03-17 10:01:05] [INFO ] Implicit Places using invariants in 8111 ms returned []
Implicit Place search using SMT only with invariants took 8115 ms to find 0 implicit places.
[2023-03-17 10:01:05] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:01:05] [INFO ] Invariant cache hit.
[2023-03-17 10:01:36] [INFO ] Performed 90690/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:01:53] [INFO ] Dead Transitions using invariants and state equation in 47511 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56462 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 4951 steps, including 1 resets, run visited all 2 properties in 507 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 8430 ms.
Product exploration explored 100000 steps with 0 reset in 8452 ms.
Support contains 4 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 828 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 10:02:13] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:02:13] [INFO ] Invariant cache hit.
[2023-03-17 10:02:21] [INFO ] Implicit Places using invariants in 7657 ms returned []
Implicit Place search using SMT only with invariants took 7660 ms to find 0 implicit places.
[2023-03-17 10:02:21] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:02:21] [INFO ] Invariant cache hit.
[2023-03-17 10:02:51] [INFO ] Performed 92409/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:03:08] [INFO ] Dead Transitions using invariants and state equation in 47665 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56158 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Treatment of property RERS17pb115-PT-2-LTLCardinality-00 finished in 213664 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(G(p0)))'
Support contains 1 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 951 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
[2023-03-17 10:03:16] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:03:16] [INFO ] Invariant cache hit.
[2023-03-17 10:03:23] [INFO ] Implicit Places using invariants in 7589 ms returned []
Implicit Place search using SMT only with invariants took 7590 ms to find 0 implicit places.
[2023-03-17 10:03:23] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:03:23] [INFO ] Invariant cache hit.
[2023-03-17 10:03:53] [INFO ] Performed 91960/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:04:10] [INFO ] Dead Transitions using invariants and state equation in 46901 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55449 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : RERS17pb115-PT-2-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s554)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 8909 ms.
Product exploration explored 100000 steps with 0 reset in 8752 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 830 steps, including 0 resets, run visited all 1 properties in 59 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-17 10:04:30] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:04:30] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 837 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 10:04:46] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:04:46] [INFO ] Invariant cache hit.
[2023-03-17 10:04:54] [INFO ] Implicit Places using invariants in 7795 ms returned []
Implicit Place search using SMT only with invariants took 7796 ms to find 0 implicit places.
[2023-03-17 10:04:54] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:04:54] [INFO ] Invariant cache hit.
[2023-03-17 10:05:24] [INFO ] Performed 96802/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:05:39] [INFO ] Dead Transitions using invariants and state equation in 45234 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53872 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 5263 steps, including 1 resets, run visited all 1 properties in 496 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2023-03-17 10:05:41] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:05:41] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 8159 ms.
Product exploration explored 100000 steps with 0 reset in 8267 ms.
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 811 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 10:06:14] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:06:14] [INFO ] Invariant cache hit.
[2023-03-17 10:06:21] [INFO ] Implicit Places using invariants in 7485 ms returned []
Implicit Place search using SMT only with invariants took 7495 ms to find 0 implicit places.
[2023-03-17 10:06:21] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:06:21] [INFO ] Invariant cache hit.
[2023-03-17 10:06:51] [INFO ] Performed 96140/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:07:06] [INFO ] Dead Transitions using invariants and state equation in 45064 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53375 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Treatment of property RERS17pb115-PT-2-LTLCardinality-01 finished in 236958 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)))'
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 428 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:07:12] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 10:07:12] [INFO ] Computed 19 place invariants in 248 ms
[2023-03-17 10:07:20] [INFO ] Implicit Places using invariants in 7912 ms returned []
Implicit Place search using SMT only with invariants took 7914 ms to find 0 implicit places.
[2023-03-17 10:07:20] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:07:20] [INFO ] Invariant cache hit.
[2023-03-17 10:07:50] [INFO ] Performed 89234/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:08:09] [INFO ] Dead Transitions using invariants and state equation in 48923 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57270 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RERS17pb115-PT-2-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GT 2 s196) (GT s1195 s922))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA RERS17pb115-PT-2-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb115-PT-2-LTLCardinality-02 finished in 57875 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(X((p0||F(p1))))))'
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 475 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:08:10] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:08:10] [INFO ] Invariant cache hit.
[2023-03-17 10:08:18] [INFO ] Implicit Places using invariants in 7989 ms returned []
Implicit Place search using SMT only with invariants took 7990 ms to find 0 implicit places.
[2023-03-17 10:08:18] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:08:18] [INFO ] Invariant cache hit.
[2023-03-17 10:08:48] [INFO ] Performed 94648/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:09:04] [INFO ] Dead Transitions using invariants and state equation in 45667 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54135 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RERS17pb115-PT-2-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(LEQ 2 s467), p0:(LEQ s513 s705)], 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 65600 steps with 16400 reset in 10001 ms.
Product exploration timeout after 69220 steps with 17305 reset in 10001 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1112 steps, including 0 resets, run visited all 2 properties in 64 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 395 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:09:26] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:09:26] [INFO ] Invariant cache hit.
[2023-03-17 10:09:34] [INFO ] Implicit Places using invariants in 7459 ms returned []
Implicit Place search using SMT only with invariants took 7460 ms to find 0 implicit places.
[2023-03-17 10:09:34] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:09:34] [INFO ] Invariant cache hit.
[2023-03-17 10:10:04] [INFO ] Performed 96965/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:10:20] [INFO ] Dead Transitions using invariants and state equation in 45688 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53547 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 885 steps, including 0 resets, run visited all 2 properties in 57 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration timeout after 64780 steps with 16195 reset in 10002 ms.
Product exploration timeout after 68670 steps with 17167 reset in 10002 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 997 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:10:43] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:10:43] [INFO ] Invariant cache hit.
[2023-03-17 10:11:13] [INFO ] Performed 94817/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:11:29] [INFO ] Dead Transitions using invariants and state equation in 45789 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46792 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 436 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:11:29] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:11:29] [INFO ] Invariant cache hit.
[2023-03-17 10:11:37] [INFO ] Implicit Places using invariants in 7670 ms returned []
Implicit Place search using SMT only with invariants took 7671 ms to find 0 implicit places.
[2023-03-17 10:11:37] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:11:37] [INFO ] Invariant cache hit.
[2023-03-17 10:12:07] [INFO ] Performed 95888/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:12:23] [INFO ] Dead Transitions using invariants and state equation in 45758 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53869 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Treatment of property RERS17pb115-PT-2-LTLCardinality-04 finished in 258508 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((G(F(p2))&&p1)))))'
Support contains 5 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 454 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:12:29] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:12:29] [INFO ] Invariant cache hit.
[2023-03-17 10:12:36] [INFO ] Implicit Places using invariants in 7848 ms returned []
Implicit Place search using SMT only with invariants took 7854 ms to find 0 implicit places.
[2023-03-17 10:12:36] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:12:36] [INFO ] Invariant cache hit.
[2023-03-17 10:13:07] [INFO ] Performed 90682/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:13:24] [INFO ] Dead Transitions using invariants and state equation in 47981 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56294 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : RERS17pb115-PT-2-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT 1 s33), p2:(GT s1023 s964), p1:(AND (GT s644 s151) (GT 1 s33))], 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]]
Product exploration timeout after 84940 steps with 19 reset in 10001 ms.
Product exploration timeout after 85360 steps with 23 reset in 10002 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (AND p0 (NOT p2))), (X p0), (X (AND p0 (NOT p1))), true, (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 306 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Finished random walk after 2327 steps, including 0 resets, run visited all 2 properties in 256 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (AND p0 (NOT p2))), (X p0), (X (AND p0 (NOT p1))), true, (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F p1)]
Knowledge based reduction with 7 factoid took 300 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
[2023-03-17 10:13:47] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:13:48] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
[2023-03-17 10:14:03] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:14:03] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 5 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 405 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:14:19] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:14:19] [INFO ] Invariant cache hit.
[2023-03-17 10:14:26] [INFO ] Implicit Places using invariants in 7755 ms returned []
Implicit Place search using SMT only with invariants took 7756 ms to find 0 implicit places.
[2023-03-17 10:14:26] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:14:26] [INFO ] Invariant cache hit.
[2023-03-17 10:14:57] [INFO ] Performed 88596/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:15:15] [INFO ] Dead Transitions using invariants and state equation in 48906 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57071 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p1)), (X (NOT p2)), true, (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 252 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Finished random walk after 4142 steps, including 1 resets, run visited all 2 properties in 439 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p1)), (X (NOT p2)), true, (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F p1)]
Knowledge based reduction with 6 factoid took 254 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
[2023-03-17 10:15:18] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:15:18] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
[2023-03-17 10:15:33] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:15:34] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 27 reset in 8727 ms.
Product exploration explored 100000 steps with 34 reset in 8612 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Support contains 5 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 961 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:16:08] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:16:08] [INFO ] Invariant cache hit.
[2023-03-17 10:16:38] [INFO ] Performed 94474/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:16:53] [INFO ] Dead Transitions using invariants and state equation in 45640 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46605 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Support contains 5 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 398 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:16:54] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:16:54] [INFO ] Invariant cache hit.
[2023-03-17 10:17:02] [INFO ] Implicit Places using invariants in 7757 ms returned []
Implicit Place search using SMT only with invariants took 7757 ms to find 0 implicit places.
[2023-03-17 10:17:02] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:17:02] [INFO ] Invariant cache hit.
[2023-03-17 10:17:32] [INFO ] Performed 95105/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:17:47] [INFO ] Dead Transitions using invariants and state equation in 45778 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53937 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Treatment of property RERS17pb115-PT-2-LTLCardinality-06 finished in 325122 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(G((p0&&(p1||X(F((p2 U (p3||G(p2))))))))))'
Support contains 4 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 902 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:17:54] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:17:54] [INFO ] Invariant cache hit.
[2023-03-17 10:18:02] [INFO ] Implicit Places using invariants in 7904 ms returned []
Implicit Place search using SMT only with invariants took 7906 ms to find 0 implicit places.
[2023-03-17 10:18:02] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:18:02] [INFO ] Invariant cache hit.
[2023-03-17 10:18:32] [INFO ] Performed 94428/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:18:48] [INFO ] Dead Transitions using invariants and state equation in 45884 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54697 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : RERS17pb115-PT-2-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p3) p2) (AND (NOT p0) (NOT p3) p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p3) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 1 s88) (AND (GT 1 s88) (GT 2 s753))), p1:(LEQ 1 s88), p3:(AND (GT 2 s753) (GT s482 s1297)), p2:(GT s482 s1297)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10 reset in 8581 ms.
Product exploration explored 100000 steps with 2 reset in 8369 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p3 p2), (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND p1 p0 (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND (NOT p0) (NOT p3) p2)))), (X (NOT (AND p1 p0 (NOT p3) (NOT p2)))), (X (AND (NOT p1) p0)), (X p0), (X (X (NOT (AND p1 p0 (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND (NOT p0) (NOT p3) p2))))), (X (X (NOT (AND p1 p0 (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))))]
Knowledge based reduction with 12 factoid took 545 ms. Reduced automaton from 2 states, 7 edges and 4 AP (stutter insensitive) to 2 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 873 ms. (steps per millisecond=11 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 10:19:08] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:19:08] [INFO ] Invariant cache hit.
[2023-03-17 10:19:08] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-17 10:19:08] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 10:19:08] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-17 10:19:28] [INFO ] After 19805ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-17 10:19:29] [INFO ] State equation strengthened by 2277 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-17 10:19:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 10:19:33] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1380 transition count 144368
Applied a total of 1 rules in 1750 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1753 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 871 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3476 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3476 steps, saw 2955 distinct states, run finished after 3001 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 10:19:39] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 10:19:40] [INFO ] Computed 19 place invariants in 226 ms
[2023-03-17 10:19:40] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2023-03-17 10:20:00] [INFO ] After 19870ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 10:20:00] [INFO ] State equation strengthened by 741 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 10:20:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 10:20:05] [INFO ] After 25015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 886 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 889 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 952 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 10:20:06] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:20:06] [INFO ] Invariant cache hit.
[2023-03-17 10:20:14] [INFO ] Implicit Places using invariants in 7714 ms returned []
Implicit Place search using SMT only with invariants took 7716 ms to find 0 implicit places.
[2023-03-17 10:20:14] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:20:14] [INFO ] Invariant cache hit.
[2023-03-17 10:20:44] [INFO ] Performed 93579/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:21:00] [INFO ] Dead Transitions using invariants and state equation in 46380 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55061 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p3 p2), (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND p1 p0 (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND (NOT p0) (NOT p3) p2)))), (X (NOT (AND p1 p0 (NOT p3) (NOT p2)))), (X (AND (NOT p1) p0)), (X p0), (X (X (NOT (AND p1 p0 (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND (NOT p0) (NOT p3) p2))))), (X (X (NOT (AND p1 p0 (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (G (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND p2 (NOT p0) (NOT p3))))), (G (NOT (AND p1 p2 p0 (NOT p3))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (F (AND p1 (NOT p2) p0 (NOT p3))), (F (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 14 factoid took 736 ms. Reduced automaton from 2 states, 7 edges and 4 AP (stutter insensitive) to 2 states, 5 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Support contains 4 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 869 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:21:03] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 10:21:03] [INFO ] Computed 19 place invariants in 230 ms
[2023-03-17 10:21:10] [INFO ] Implicit Places using invariants in 7922 ms returned []
Implicit Place search using SMT only with invariants took 7926 ms to find 0 implicit places.
[2023-03-17 10:21:11] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:21:11] [INFO ] Invariant cache hit.
[2023-03-17 10:21:41] [INFO ] Performed 96259/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:21:55] [INFO ] Dead Transitions using invariants and state equation in 44607 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53406 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2 p3 (NOT p1)), (X (NOT (AND p1 p0 (NOT p3)))), (X p0), (X (OR (AND p0 (NOT p2)) (AND p0 p3))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X p0)), (X (X (OR (AND p0 (NOT p2)) (AND p0 p3)))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))))))]
Knowledge based reduction with 10 factoid took 456 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter insensitive) to 2 states, 5 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 866 ms. (steps per millisecond=11 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 10:21:58] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:21:58] [INFO ] Invariant cache hit.
[2023-03-17 10:21:58] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 10:21:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-17 10:22:19] [INFO ] After 20293ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 10:22:20] [INFO ] State equation strengthened by 2277 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-17 10:22:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 10:22:23] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 903 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 907 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 924 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3497 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3497 steps, saw 2972 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 10:22:28] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:22:28] [INFO ] Invariant cache hit.
[2023-03-17 10:22:29] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 10:22:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-17 10:22:49] [INFO ] After 20305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 10:22:50] [INFO ] State equation strengthened by 2277 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.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-17 10:22:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 10:22:54] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 1054 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1054 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 971 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:22:56] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:22:56] [INFO ] Invariant cache hit.
[2023-03-17 10:23:04] [INFO ] Implicit Places using invariants in 7907 ms returned []
Implicit Place search using SMT only with invariants took 7908 ms to find 0 implicit places.
[2023-03-17 10:23:04] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:23:04] [INFO ] Invariant cache hit.
[2023-03-17 10:23:34] [INFO ] Performed 89329/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:23:52] [INFO ] Dead Transitions using invariants and state equation in 48334 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57234 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Knowledge obtained : [(AND p0 p2 p3 (NOT p1)), (X (NOT (AND p1 p0 (NOT p3)))), (X p0), (X (OR (AND p0 (NOT p2)) (AND p0 p3))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))))), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X p0)), (X (X (OR (AND p0 (NOT p2)) (AND p0 p3)))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))))), (F (OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1)))), (F (AND (NOT p3) p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 477 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter insensitive) to 2 states, 5 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Product exploration explored 100000 steps with 4 reset in 8421 ms.
Product exploration explored 100000 steps with 5 reset in 8633 ms.
Support contains 4 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 841 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:24:11] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:24:11] [INFO ] Invariant cache hit.
[2023-03-17 10:24:19] [INFO ] Implicit Places using invariants in 7763 ms returned []
Implicit Place search using SMT only with invariants took 7764 ms to find 0 implicit places.
[2023-03-17 10:24:19] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:24:19] [INFO ] Invariant cache hit.
[2023-03-17 10:24:49] [INFO ] Performed 87063/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:25:09] [INFO ] Dead Transitions using invariants and state equation in 49985 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58603 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Treatment of property RERS17pb115-PT-2-LTLCardinality-07 finished in 440596 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' '!((p0 U G(p1)))'
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1039 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
[2023-03-17 10:25:15] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 10:25:15] [INFO ] Computed 19 place invariants in 376 ms
[2023-03-17 10:25:23] [INFO ] Implicit Places using invariants in 8279 ms returned []
Implicit Place search using SMT only with invariants took 8282 ms to find 0 implicit places.
[2023-03-17 10:25:23] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:25:23] [INFO ] Invariant cache hit.
[2023-03-17 10:25:53] [INFO ] Performed 86244/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:26:15] [INFO ] Dead Transitions using invariants and state equation in 51456 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60782 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : RERS17pb115-PT-2-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s1230 s285), p0:(LEQ 2 s34)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 321 steps with 0 reset in 31 ms.
FORMULA RERS17pb115-PT-2-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb115-PT-2-LTLCardinality-08 finished in 61401 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(X(F((p0&&F(G(p1))))))))'
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 449 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:26:16] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 10:26:16] [INFO ] Computed 19 place invariants in 244 ms
[2023-03-17 10:26:24] [INFO ] Implicit Places using invariants in 8436 ms returned []
Implicit Place search using SMT only with invariants took 8438 ms to find 0 implicit places.
[2023-03-17 10:26:24] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:26:24] [INFO ] Invariant cache hit.
[2023-03-17 10:26:54] [INFO ] Performed 92740/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:27:11] [INFO ] Dead Transitions using invariants and state equation in 46714 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55607 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : RERS17pb115-PT-2-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT 1 s478), p1:(GT s51 s843)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 9209 ms.
Product exploration explored 100000 steps with 0 reset in 8867 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 7424 steps, including 2 resets, run visited all 2 properties in 676 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2023-03-17 10:27:32] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:27:32] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 400 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:27:48] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:27:48] [INFO ] Invariant cache hit.
[2023-03-17 10:27:55] [INFO ] Implicit Places using invariants in 7689 ms returned []
Implicit Place search using SMT only with invariants took 7690 ms to find 0 implicit places.
[2023-03-17 10:27:56] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:27:56] [INFO ] Invariant cache hit.
[2023-03-17 10:28:26] [INFO ] Performed 92233/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:28:42] [INFO ] Dead Transitions using invariants and state equation in 46929 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55021 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 4123 steps, including 1 resets, run visited all 2 properties in 345 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2023-03-17 10:28:45] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:28:45] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 9615 ms.
Product exploration explored 100000 steps with 0 reset in 8673 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 856 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:29:20] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:29:20] [INFO ] Invariant cache hit.
[2023-03-17 10:29:50] [INFO ] Performed 96037/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:30:06] [INFO ] Dead Transitions using invariants and state equation in 45395 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46257 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 420 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:30:06] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:30:06] [INFO ] Invariant cache hit.
[2023-03-17 10:30:14] [INFO ] Implicit Places using invariants in 7524 ms returned []
Implicit Place search using SMT only with invariants took 7525 ms to find 0 implicit places.
[2023-03-17 10:30:14] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:30:14] [INFO ] Invariant cache hit.
[2023-03-17 10:30:44] [INFO ] Performed 98056/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:30:58] [INFO ] Dead Transitions using invariants and state equation in 44326 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52274 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Treatment of property RERS17pb115-PT-2-LTLCardinality-09 finished in 287950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 415 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:31:04] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:31:04] [INFO ] Invariant cache hit.
[2023-03-17 10:31:12] [INFO ] Implicit Places using invariants in 7808 ms returned []
Implicit Place search using SMT only with invariants took 7811 ms to find 0 implicit places.
[2023-03-17 10:31:12] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:31:12] [INFO ] Invariant cache hit.
[2023-03-17 10:31:42] [INFO ] Performed 90394/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:31:59] [INFO ] Dead Transitions using invariants and state equation in 47925 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56156 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : RERS17pb115-PT-2-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s664)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA RERS17pb115-PT-2-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS17pb115-PT-2-LTLCardinality-10 finished in 56730 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) U (G(!p1) U X(p2))))'
Support contains 5 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 588 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:32:01] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:32:01] [INFO ] Invariant cache hit.
[2023-03-17 10:32:08] [INFO ] Implicit Places using invariants in 7841 ms returned []
Implicit Place search using SMT only with invariants took 7842 ms to find 0 implicit places.
[2023-03-17 10:32:08] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:32:08] [INFO ] Invariant cache hit.
[2023-03-17 10:32:39] [INFO ] Performed 95163/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:32:54] [INFO ] Dead Transitions using invariants and state equation in 45693 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54129 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Stuttering acceptance computed with spot in 337 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), true, p1, (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : RERS17pb115-PT-2-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}, { cond=(AND p1 p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p2), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 7}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 9}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 6}, { cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 6}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 7}, { cond=(AND p1 p0), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(OR (LEQ s790 s769) (LEQ 2 s905)), p0:(LEQ s790 s769), p2:(LEQ s863 s176)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 56060 steps with 28030 reset in 10002 ms.
Product exploration timeout after 56290 steps with 28145 reset in 10002 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 26 factoid took 379 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS17pb115-PT-2-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS17pb115-PT-2-LTLCardinality-11 finished in 75571 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((p0 U p1))))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 872 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
[2023-03-17 10:33:16] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 10:33:17] [INFO ] Computed 19 place invariants in 248 ms
[2023-03-17 10:33:25] [INFO ] Implicit Places using invariants in 8225 ms returned []
Implicit Place search using SMT only with invariants took 8226 ms to find 0 implicit places.
[2023-03-17 10:33:25] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:33:25] [INFO ] Invariant cache hit.
[2023-03-17 10:33:55] [INFO ] Performed 93615/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:34:11] [INFO ] Dead Transitions using invariants and state equation in 46257 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55358 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : RERS17pb115-PT-2-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s425), p1:(LEQ 1 s908)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 8376 ms.
Product exploration explored 100000 steps with 0 reset in 8603 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 334 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 531 steps, including 0 resets, run visited all 1 properties in 31 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 factoid took 323 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2023-03-17 10:34:30] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:34:30] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 1 out of 1380 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 819 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 10:34:46] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:34:46] [INFO ] Invariant cache hit.
[2023-03-17 10:34:54] [INFO ] Implicit Places using invariants in 7634 ms returned []
Implicit Place search using SMT only with invariants took 7635 ms to find 0 implicit places.
[2023-03-17 10:34:54] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:34:54] [INFO ] Invariant cache hit.
[2023-03-17 10:35:24] [INFO ] Performed 96926/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:35:38] [INFO ] Dead Transitions using invariants and state equation in 44486 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52943 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3745 steps, including 1 resets, run visited all 1 properties in 304 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2023-03-17 10:35:40] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:35:41] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 8406 ms.
Product exploration explored 100000 steps with 0 reset in 8576 ms.
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 828 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 10:36:14] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:36:14] [INFO ] Invariant cache hit.
[2023-03-17 10:36:22] [INFO ] Implicit Places using invariants in 7910 ms returned []
Implicit Place search using SMT only with invariants took 7911 ms to find 0 implicit places.
[2023-03-17 10:36:22] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:36:22] [INFO ] Invariant cache hit.
[2023-03-17 10:36:52] [INFO ] Performed 95809/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:37:07] [INFO ] Dead Transitions using invariants and state equation in 45828 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54570 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Treatment of property RERS17pb115-PT-2-LTLCardinality-13 finished in 237145 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(G(p0)))||(X(X(p0))&&(X(p1) U (G((X(p1)||G(p2)))||(p3&&(X(p1)||G(p2)))))))))'
Support contains 7 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 441 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:37:13] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 10:37:13] [INFO ] Computed 19 place invariants in 236 ms
[2023-03-17 10:37:22] [INFO ] Implicit Places using invariants in 8921 ms returned []
Implicit Place search using SMT only with invariants took 8922 ms to find 0 implicit places.
[2023-03-17 10:37:22] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:37:22] [INFO ] Invariant cache hit.
[2023-03-17 10:37:52] [INFO ] Performed 91039/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:38:10] [INFO ] Dead Transitions using invariants and state equation in 47828 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57195 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Stuttering acceptance computed with spot in 857 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : RERS17pb115-PT-2-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}, { cond=p2, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 11}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 2} source=3 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=3 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1, 2} source=3 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0, 2} source=4 dest: 4}, { cond=(AND p2 p0), acceptance={1} source=4 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={1, 2} source=4 dest: 5}, { cond=(NOT p2), acceptance={} source=4 dest: 6}, { cond=(NOT p3), acceptance={} source=4 dest: 7}, { cond=p2, acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 2} source=5 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=5 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1, 2} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 9}, { cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={} source=5 dest: 10}, { cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={2} source=5 dest: 10}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}], [{ cond=(NOT p2), acceptance={} source=7 dest: 12}, { cond=(NOT p3), acceptance={} source=7 dest: 13}, { cond=p2, acceptance={} source=7 dest: 14}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 15}], [{ cond=(NOT p2), acceptance={} source=9 dest: 2}, { cond=p2, acceptance={} source=9 dest: 15}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=10 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1, 2} source=10 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p1 p0), acceptance={0} source=10 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p1 (NOT p0)), acceptance={0, 2} source=10 dest: 4}, { cond=(AND p2 p1 p0), acceptance={1} source=10 dest: 5}, { cond=(AND p2 p1 (NOT p0)), acceptance={1, 2} source=10 dest: 5}, { cond=(NOT p2), acceptance={} source=10 dest: 6}, { cond=(NOT p3), acceptance={} source=10 dest: 7}, { cond=p2, acceptance={} source=10 dest: 8}, { cond=(AND p2 (NOT p3) p1 p0), acceptance={} source=10 dest: 10}, { cond=(AND p2 (NOT p3) p1 (NOT p0)), acceptance={2} source=10 dest: 10}], [{ cond=true, acceptance={0, 1, 2} source=11 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=12 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=13 dest: 16}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=13 dest: 17}, { cond=(AND p2 (NOT p0)), acceptance={} source=13 dest: 18}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=14 dest: 11}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=14 dest: 19}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=15 dest: 11}, { cond=(AND p2 (NOT p0)), acceptance={} source=15 dest: 19}], [{ cond=(NOT p1), acceptance={} source=16 dest: 11}], [{ cond=(NOT p2), acceptance={} source=17 dest: 16}, { cond=(NOT p3), acceptance={} source=17 dest: 17}, { cond=p2, acceptance={} source=17 dest: 18}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=18 dest: 11}, { cond=(AND p2 (NOT p1)), acceptance={} source=18 dest: 19}], [{ cond=(NOT p2), acceptance={} source=19 dest: 11}, { cond=p2, acceptance={} source=19 dest: 19}]], initial=0, aps=[p2:(GT s103 s1084), p3:(GT s807 s1192), p0:(LEQ s356 s152), p1:(LEQ 1 s475)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 72290 steps with 15695 reset in 10001 ms.
Product exploration timeout after 73150 steps with 15918 reset in 10001 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) p0 (NOT p1)), (X (NOT p1)), (X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p3)), (X (NOT (AND p2 (NOT p1) p0))), (X (AND (NOT p2) (NOT p3) (NOT p1) p0)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X (AND (NOT p3) (NOT p1) p0)), (X (AND (NOT p3) p0)), (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p2) p0)), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3) p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p3) p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p3) (NOT p1) p0))), (X (X (AND (NOT p2) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 53 factoid took 8089 ms. Reduced automaton from 20 states, 68 edges and 4 AP (stutter sensitive) to 20 states, 66 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 764 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1422 ms. (steps per millisecond=7 ) properties (out of 31) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-17 10:38:43] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:38:43] [INFO ] Invariant cache hit.
[2023-03-17 10:38:43] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 10:38:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-17 10:39:07] [INFO ] After 23736ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-17 10:39:08] [INFO ] State equation strengthened by 2277 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-17 10:39:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 10:39:08] [INFO ] After 25072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1380 transition count 144368
Applied a total of 1 rules in 2887 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2896 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1547 ms. (steps per millisecond=6 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 5847 steps, run timeout after 6005 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 5847 steps, saw 4952 distinct states, run finished after 6006 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 10:39:20] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 10:39:20] [INFO ] Computed 19 place invariants in 248 ms
[2023-03-17 10:39:20] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 10:39:20] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-17 10:39:43] [INFO ] After 22548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-17 10:39:44] [INFO ] State equation strengthened by 741 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 10:39:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 10:39:45] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 898 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 898 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 913 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 10:39:47] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:39:47] [INFO ] Invariant cache hit.
[2023-03-17 10:39:55] [INFO ] Implicit Places using invariants in 7778 ms returned []
Implicit Place search using SMT only with invariants took 7778 ms to find 0 implicit places.
[2023-03-17 10:39:55] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:39:55] [INFO ] Invariant cache hit.
[2023-03-17 10:40:25] [INFO ] Performed 94470/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:40:41] [INFO ] Dead Transitions using invariants and state equation in 46026 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54730 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p3) p0 (NOT p1)), (X (NOT p1)), (X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p3)), (X (NOT (AND p2 (NOT p1) p0))), (X (AND (NOT p2) (NOT p3) (NOT p1) p0)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X (AND (NOT p3) (NOT p1) p0)), (X (AND (NOT p3) p0)), (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p2) p0)), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3) p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p3) p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p3) (NOT p1) p0))), (X (X (AND (NOT p2) p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3) p0))), (F (AND p1 (NOT p3) (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 (NOT p3) p0 (NOT p2))), (F (AND (NOT p1) p0 p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p3) (NOT p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F p1), (F (AND p1 p0 (NOT p2))), (F (AND (NOT p1) (NOT p3) (NOT p0) p2)), (F (AND (NOT p1) (NOT p3) p0 p2)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p0) (NOT p2))), (F p3), (F p2), (F (AND (NOT p0) p2)), (F (AND p0 p2)), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p3) p0 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p3) (NOT p0))), (F (NOT (AND (NOT p3) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 53 factoid took 9778 ms. Reduced automaton from 20 states, 66 edges and 4 AP (stutter sensitive) to 20 states, 66 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 698 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 667 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 7 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 396 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:40:53] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 10:40:53] [INFO ] Computed 19 place invariants in 228 ms
[2023-03-17 10:41:00] [INFO ] Implicit Places using invariants in 7724 ms returned []
Implicit Place search using SMT only with invariants took 7726 ms to find 0 implicit places.
[2023-03-17 10:41:00] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:41:00] [INFO ] Invariant cache hit.
[2023-03-17 10:41:31] [INFO ] Performed 92134/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:41:48] [INFO ] Dead Transitions using invariants and state equation in 47801 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55930 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (AND (NOT p3) p0)), (X (AND (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), true, (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (AND (NOT p1) (NOT p3) p0 (NOT p2)))), (X (X (AND (NOT p3) p0))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 38 factoid took 6512 ms. Reduced automaton from 20 states, 66 edges and 4 AP (stutter sensitive) to 20 states, 66 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 853 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1594 ms. (steps per millisecond=6 ) properties (out of 31) seen :26
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-17 10:41:59] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:41:59] [INFO ] Invariant cache hit.
[2023-03-17 10:42:00] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 10:42:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-17 10:42:25] [INFO ] After 24777ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 10:42:26] [INFO ] State equation strengthened by 2277 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-17 10:42:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 10:42:26] [INFO ] After 26363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1380 transition count 144368
Applied a total of 1 rules in 2488 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2492 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1465 ms. (steps per millisecond=6 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 6286 steps, run timeout after 6002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 6286 steps, saw 5338 distinct states, run finished after 6003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 10:42:37] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 10:42:37] [INFO ] Computed 19 place invariants in 258 ms
[2023-03-17 10:42:37] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 10:42:38] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-17 10:43:03] [INFO ] After 24736ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 10:43:03] [INFO ] State equation strengthened by 741 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-17 10:43:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 10:43:03] [INFO ] After 25839ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1136 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1136 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 922 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 10:43:05] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:43:05] [INFO ] Invariant cache hit.
[2023-03-17 10:43:14] [INFO ] Implicit Places using invariants in 8315 ms returned []
Implicit Place search using SMT only with invariants took 8319 ms to find 0 implicit places.
[2023-03-17 10:43:14] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:43:14] [INFO ] Invariant cache hit.
[2023-03-17 10:43:44] [INFO ] Performed 91085/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:44:01] [INFO ] Dead Transitions using invariants and state equation in 47254 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56509 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (AND (NOT p3) p0)), (X (AND (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), true, (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (AND (NOT p1) (NOT p3) p0 (NOT p2)))), (X (X (AND (NOT p3) p0))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 p0 p2)), (F (NOT (AND (NOT p1) (NOT p3) p0))), (F (AND p1 (NOT p3) (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 (NOT p3) p0 (NOT p2))), (F (AND (NOT p1) p0 p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p3) (NOT p0))), (F (NOT p0)), (F (AND p1 (NOT p3) p0 p2)), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F p1), (F (AND p1 p0 (NOT p2))), (F (AND (NOT p1) (NOT p3) p0 p2)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2))), (F p3), (F p2), (F (AND p0 p2)), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p3) p0 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p3) (NOT p0))), (F (NOT (AND (NOT p3) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 38 factoid took 7297 ms. Reduced automaton from 20 states, 66 edges and 4 AP (stutter sensitive) to 20 states, 66 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 773 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 734 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 700 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration timeout after 73380 steps with 13649 reset in 10002 ms.
Product exploration timeout after 74940 steps with 13816 reset in 10001 ms.
Applying partial POR strategy [false, false, true, false, false, false, false, false, false, false, false, true, true, false, true, true, true, false, true, true]
Stuttering acceptance computed with spot in 713 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 7 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 968 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:44:33] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 10:44:33] [INFO ] Computed 19 place invariants in 224 ms
[2023-03-17 10:45:03] [INFO ] Performed 96227/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:45:18] [INFO ] Dead Transitions using invariants and state equation in 45559 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46532 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Support contains 7 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 475 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:45:19] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:45:19] [INFO ] Invariant cache hit.
[2023-03-17 10:45:27] [INFO ] Implicit Places using invariants in 8301 ms returned []
Implicit Place search using SMT only with invariants took 8303 ms to find 0 implicit places.
[2023-03-17 10:45:27] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:45:27] [INFO ] Invariant cache hit.
[2023-03-17 10:45:57] [INFO ] Performed 94423/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:46:13] [INFO ] Dead Transitions using invariants and state equation in 46113 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54896 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Treatment of property RERS17pb115-PT-2-LTLCardinality-14 finished in 545872 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((G(p1)||p0))))'
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 566 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2023-03-17 10:46:19] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:46:19] [INFO ] Invariant cache hit.
[2023-03-17 10:46:27] [INFO ] Implicit Places using invariants in 8241 ms returned []
Implicit Place search using SMT only with invariants took 8243 ms to find 0 implicit places.
[2023-03-17 10:46:27] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:46:27] [INFO ] Invariant cache hit.
[2023-03-17 10:46:57] [INFO ] Performed 91381/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:47:15] [INFO ] Dead Transitions using invariants and state equation in 47806 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56622 ms. Remains : 1381/1381 places, 144369/144369 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RERS17pb115-PT-2-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ 2 s1298), p0:(OR (LEQ 2 s1298) (LEQ 3 s63))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 8808 ms.
Product exploration explored 100000 steps with 0 reset in 8522 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 938 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3275 steps, run timeout after 3006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3275 steps, saw 2782 distinct states, run finished after 3006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 10:47:38] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
[2023-03-17 10:47:38] [INFO ] Invariant cache hit.
[2023-03-17 10:47:38] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-17 10:47:58] [INFO ] After 19755ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2023-03-17 10:47:59] [INFO ] State equation strengthened by 2277 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-17 10:48:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 10:48:03] [INFO ] After 25027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1380 transition count 144368
Applied a total of 1 rules in 1943 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1946 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 959 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3214 steps, run timeout after 3004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3214 steps, saw 2731 distinct states, run finished after 3005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 10:48:09] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 10:48:10] [INFO ] Computed 19 place invariants in 246 ms
[2023-03-17 10:48:10] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-17 10:48:30] [INFO ] After 19623ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 10:48:30] [INFO ] State equation strengthened by 741 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 10:48:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 10:48:35] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1180 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1180 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 962 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 10:48:37] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:48:37] [INFO ] Invariant cache hit.
[2023-03-17 10:48:45] [INFO ] Implicit Places using invariants in 7762 ms returned []
Implicit Place search using SMT only with invariants took 7765 ms to find 0 implicit places.
[2023-03-17 10:48:45] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:48:45] [INFO ] Invariant cache hit.
[2023-03-17 10:49:15] [INFO ] Performed 95929/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:49:31] [INFO ] Dead Transitions using invariants and state equation in 45989 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54728 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 249 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-17 10:49:31] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2023-03-17 10:49:32] [INFO ] Computed 19 place invariants in 253 ms
Could not prove EG (NOT p0)
Support contains 2 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 976 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
[2023-03-17 10:49:48] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 10:49:48] [INFO ] Computed 19 place invariants in 276 ms
[2023-03-17 10:49:56] [INFO ] Implicit Places using invariants in 8221 ms returned []
Implicit Place search using SMT only with invariants took 8224 ms to find 0 implicit places.
[2023-03-17 10:49:56] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:49:56] [INFO ] Invariant cache hit.
[2023-03-17 10:50:26] [INFO ] Performed 94487/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:50:43] [INFO ] Dead Transitions using invariants and state equation in 46706 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55912 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 936 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3207 steps, run timeout after 3006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3207 steps, saw 2725 distinct states, run finished after 3006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 10:50:48] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:50:48] [INFO ] Invariant cache hit.
[2023-03-17 10:50:49] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-17 10:51:09] [INFO ] After 20127ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 10:51:10] [INFO ] State equation strengthened by 741 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java: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-17 10:51:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 10:51:13] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1070 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1075 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1192 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2953 steps, run timeout after 3001 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 2953 steps, saw 2505 distinct states, run finished after 3001 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 10:51:19] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:51:19] [INFO ] Invariant cache hit.
[2023-03-17 10:51:19] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-17 10:51:39] [INFO ] After 19862ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 10:51:40] [INFO ] State equation strengthened by 741 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-17 10:51:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 10:51:44] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1125 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1126 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 948 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 10:51:46] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:51:46] [INFO ] Invariant cache hit.
[2023-03-17 10:51:55] [INFO ] Implicit Places using invariants in 8795 ms returned []
Implicit Place search using SMT only with invariants took 8797 ms to find 0 implicit places.
[2023-03-17 10:51:55] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:51:55] [INFO ] Invariant cache hit.
[2023-03-17 10:52:25] [INFO ] Performed 94179/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:52:42] [INFO ] Dead Transitions using invariants and state equation in 46641 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56397 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-17 10:52:42] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:52:43] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 9330 ms.
Product exploration explored 100000 steps with 0 reset in 9031 ms.
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 838 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-17 10:53:17] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:53:17] [INFO ] Invariant cache hit.
[2023-03-17 10:53:26] [INFO ] Implicit Places using invariants in 8561 ms returned []
Implicit Place search using SMT only with invariants took 8564 ms to find 0 implicit places.
[2023-03-17 10:53:26] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:53:26] [INFO ] Invariant cache hit.
[2023-03-17 10:53:56] [INFO ] Performed 93725/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:54:12] [INFO ] Dead Transitions using invariants and state equation in 46710 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56116 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Treatment of property RERS17pb115-PT-2-LTLCardinality-15 finished in 479243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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(X((p0||F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((G(F(p2))&&p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||X(F((p2 U (p3||G(p2))))))))))'
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(X(F((p0&&F(G(p1))))))))'
Found a Shortening insensitive property : RERS17pb115-PT-2-LTLCardinality-09
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1304 ms. Remains 1380 /1381 variables (removed 1) and now considering 144368/144369 (removed 1) transitions.
[2023-03-17 10:54:20] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:54:20] [INFO ] Invariant cache hit.
[2023-03-17 10:54:28] [INFO ] Implicit Places using invariants in 8461 ms returned []
Implicit Place search using SMT only with invariants took 8465 ms to find 0 implicit places.
[2023-03-17 10:54:28] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:54:28] [INFO ] Invariant cache hit.
[2023-03-17 10:54:58] [INFO ] Performed 89073/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 10:55:17] [INFO ] Dead Transitions using invariants and state equation in 48541 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 58316 ms. Remains : 1380/1381 places, 144368/144369 transitions.
Running random walk in product with property : RERS17pb115-PT-2-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT 1 s478), p1:(GT s51 s842)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 9293 ms.
Product exploration explored 100000 steps with 0 reset in 9195 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 1598 steps, including 0 resets, run visited all 2 properties in 115 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2023-03-17 10:55:38] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-17 10:55:38] [INFO ] Invariant cache hit.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9156224 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15993532 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is RERS17pb115-PT-2, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889201700155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb115-PT-2.tgz
mv RERS17pb115-PT-2 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;