About the Execution of LTSMin+red for RERS2020-PT-pb105
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15248.207 | 2162406.00 | 2567115.00 | 4566.80 | FFFFFFFTTFFFF?T? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r329-tall-167889201800252.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 RERS2020-PT-pb105, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889201800252
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 87M
-rw-r--r-- 1 mcc users 7.7K Feb 26 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 08:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 08:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 09:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 09:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 86M 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 RERS2020-PT-pb105-LTLFireability-00
FORMULA_NAME RERS2020-PT-pb105-LTLFireability-01
FORMULA_NAME RERS2020-PT-pb105-LTLFireability-02
FORMULA_NAME RERS2020-PT-pb105-LTLFireability-03
FORMULA_NAME RERS2020-PT-pb105-LTLFireability-04
FORMULA_NAME RERS2020-PT-pb105-LTLFireability-05
FORMULA_NAME RERS2020-PT-pb105-LTLFireability-06
FORMULA_NAME RERS2020-PT-pb105-LTLFireability-07
FORMULA_NAME RERS2020-PT-pb105-LTLFireability-08
FORMULA_NAME RERS2020-PT-pb105-LTLFireability-09
FORMULA_NAME RERS2020-PT-pb105-LTLFireability-10
FORMULA_NAME RERS2020-PT-pb105-LTLFireability-11
FORMULA_NAME RERS2020-PT-pb105-LTLFireability-12
FORMULA_NAME RERS2020-PT-pb105-LTLFireability-13
FORMULA_NAME RERS2020-PT-pb105-LTLFireability-14
FORMULA_NAME RERS2020-PT-pb105-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679093742432
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb105
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 22:55:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 22:55:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 22:55:46] [INFO ] Load time of PNML (sax parser for PT used): 2423 ms
[2023-03-17 22:55:46] [INFO ] Transformed 1982 places.
[2023-03-17 22:55:47] [INFO ] Transformed 153412 transitions.
[2023-03-17 22:55:47] [INFO ] Found NUPN structural information;
[2023-03-17 22:55:47] [INFO ] Parsed PT model containing 1982 places and 153412 transitions and 610156 arcs in 3071 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 3773 transitions
Reduce redundant transitions removed 3773 transitions.
FORMULA RERS2020-PT-pb105-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb105-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb105-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 1982 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1982/1982 places, 149639/149639 transitions.
Ensure Unique test removed 10 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 1971 transition count 149639
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 1968 transition count 149588
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 1968 transition count 149588
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 1968 transition count 149585
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 1967 transition count 149583
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 1967 transition count 149583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 1967 transition count 149582
Applied a total of 23 rules in 1645 ms. Remains 1967 /1982 variables (removed 15) and now considering 149582/149639 (removed 57) transitions.
[2023-03-17 22:55:49] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2023-03-17 22:55:50] [INFO ] Computed 10 place invariants in 535 ms
[2023-03-17 22:55:59] [INFO ] Implicit Places using invariants in 9465 ms returned []
Implicit Place search using SMT only with invariants took 9501 ms to find 0 implicit places.
[2023-03-17 22:55:59] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 22:55:59] [INFO ] Invariant cache hit.
[2023-03-17 22:56:29] [INFO ] Performed 82099/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:56:53] [INFO ] Dead Transitions using invariants and state equation in 54318 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1967/1982 places, 149582/149639 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65488 ms. Remains : 1967/1982 places, 149582/149639 transitions.
Support contains 66 out of 1967 places after structural reductions.
[2023-03-17 22:56:58] [INFO ] Flatten gal took : 3949 ms
[2023-03-17 22:57:02] [INFO ] Flatten gal took : 4128 ms
[2023-03-17 22:57:10] [INFO ] Input system was already deterministic with 149582 transitions.
Support contains 63 out of 1967 places (down from 66) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 2090 ms. (steps per millisecond=4 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 7656 steps, run timeout after 6003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 7656 steps, saw 5711 distinct states, run finished after 6008 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 28 properties.
[2023-03-17 22:57:20] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 22:57:20] [INFO ] Invariant cache hit.
[2023-03-17 22:57:21] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-17 22:57:21] [INFO ] After 1669ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-03-17 22:57:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-17 22:57:46] [INFO ] After 23111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-17 22:57:48] [INFO ] State equation strengthened by 5248 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 22:57:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 22:57:48] [INFO ] After 26946ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:28
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 61 out of 1967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1620 edges and 1967 vertex of which 112 / 1967 are part of one of the 42 SCC in 27 ms
Free SCC test removed 70 places
Drop transitions removed 3832 transitions
Ensure Unique test removed 402 transitions
Reduce isomorphic transitions removed 4234 transitions.
Graph (complete) has 126302 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.115 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 1896 transition count 145342
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 1891 transition count 145342
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 1891 transition count 145339
Deduced a syphon composed of 3 places in 118 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 1888 transition count 145339
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 1881 transition count 145332
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 1881 transition count 145332
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 42 place count 1881 transition count 145323
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 48 place count 1875 transition count 145311
Iterating global reduction 3 with 6 rules applied. Total rules applied 54 place count 1875 transition count 145311
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 60 place count 1875 transition count 145305
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 63 place count 1872 transition count 145299
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 1872 transition count 145299
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 69 place count 1872 transition count 145296
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 145 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 121 place count 1846 transition count 145270
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 128 place count 1846 transition count 145263
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 27 places in 89 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 182 place count 1819 transition count 145358
Drop transitions removed 4 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 205 place count 1819 transition count 145335
Free-agglomeration rule applied 24 times with reduction of 5 identical transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 229 place count 1819 transition count 145306
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 589 transitions
Reduce isomorphic transitions removed 597 transitions.
Iterating post reduction 7 with 621 rules applied. Total rules applied 850 place count 1795 transition count 144709
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 853 place count 1795 transition count 144706
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 8 with 56 rules applied. Total rules applied 909 place count 1792 transition count 144653
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 912 place count 1792 transition count 144650
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 918 place count 1789 transition count 144647
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 919 place count 1789 transition count 144646
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 920 place count 1788 transition count 144646
Free-agglomeration rule (complex) applied 109 times with reduction of 2118 identical transitions.
Iterating global reduction 11 with 109 rules applied. Total rules applied 1029 place count 1788 transition count 167912
Reduce places removed 109 places and 0 transitions.
Drop transitions removed 131 transitions
Ensure Unique test removed 4937 transitions
Reduce isomorphic transitions removed 5068 transitions.
Iterating post reduction 11 with 5177 rules applied. Total rules applied 6206 place count 1679 transition count 162844
Applied a total of 6206 rules in 13747 ms. Remains 1679 /1967 variables (removed 288) and now considering 162844/149582 (removed -13262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13759 ms. Remains : 1679/1967 places, 162844/149582 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1494 ms. (steps per millisecond=6 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 27) seen :0
Interrupted probabilistic random walk after 8496 steps, run timeout after 6002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 8496 steps, saw 6985 distinct states, run finished after 6002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 27 properties.
[2023-03-17 22:58:10] [INFO ] Flow matrix only has 120142 transitions (discarded 42702 similar events)
// Phase 1: matrix 120142 rows 1679 cols
[2023-03-17 22:58:11] [INFO ] Computed 10 place invariants in 548 ms
[2023-03-17 22:58:12] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-17 22:58:12] [INFO ] After 1121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-17 22:58:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 28 ms returned sat
[2023-03-17 22:58:37] [INFO ] After 23532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-17 22:58:40] [INFO ] State equation strengthened by 5992 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 22:58:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 22:58:40] [INFO ] After 27623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:27
Fused 27 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 59 out of 1679 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1679/1679 places, 162844/162844 transitions.
Applied a total of 0 rules in 931 ms. Remains 1679 /1679 variables (removed 0) and now considering 162844/162844 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 931 ms. Remains : 1679/1679 places, 162844/162844 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1744 ms. (steps per millisecond=5 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :0
Interrupted probabilistic random walk after 8591 steps, run timeout after 6001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 8591 steps, saw 7069 distinct states, run finished after 6002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 27 properties.
[2023-03-17 22:58:49] [INFO ] Flow matrix only has 120142 transitions (discarded 42702 similar events)
[2023-03-17 22:58:49] [INFO ] Invariant cache hit.
[2023-03-17 22:58:50] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-17 22:58:50] [INFO ] After 1060ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-17 22:58:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-17 22:59:15] [INFO ] After 23576ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-17 22:59:18] [INFO ] State equation strengthened by 5992 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 22:59:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 22:59:18] [INFO ] After 27372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:27
Fused 27 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 59 out of 1679 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1679/1679 places, 162844/162844 transitions.
Applied a total of 0 rules in 719 ms. Remains 1679 /1679 variables (removed 0) and now considering 162844/162844 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 721 ms. Remains : 1679/1679 places, 162844/162844 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1679/1679 places, 162844/162844 transitions.
Applied a total of 0 rules in 836 ms. Remains 1679 /1679 variables (removed 0) and now considering 162844/162844 (removed 0) transitions.
[2023-03-17 22:59:19] [INFO ] Flow matrix only has 120142 transitions (discarded 42702 similar events)
[2023-03-17 22:59:19] [INFO ] Invariant cache hit.
[2023-03-17 22:59:28] [INFO ] Implicit Places using invariants in 8582 ms returned []
Implicit Place search using SMT only with invariants took 8586 ms to find 0 implicit places.
[2023-03-17 22:59:28] [INFO ] Flow matrix only has 120142 transitions (discarded 42702 similar events)
[2023-03-17 22:59:28] [INFO ] Invariant cache hit.
[2023-03-17 22:59:58] [INFO ] Performed 88518/162844 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:00:22] [INFO ] Dead Transitions using invariants and state equation in 54465 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63919 ms. Remains : 1679/1679 places, 162844/162844 transitions.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.460 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)) U G((F(p1)||G(p2)))))'
Support contains 6 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1663 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 6 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.141 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1893 transition count 148992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1891 transition count 148992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1891 transition count 148989
Deduced a syphon composed of 3 places in 72 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1888 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1882 transition count 148977
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1882 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1882 transition count 148971
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1876 transition count 148959
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1876 transition count 148959
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 61 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 91 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 60 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 148 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 167 place count 1828 transition count 149003
Applied a total of 167 rules in 5507 ms. Remains 1828 /1967 variables (removed 139) and now considering 149003/149582 (removed 579) transitions.
[2023-03-17 23:00:29] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-17 23:00:29] [INFO ] Computed 10 place invariants in 422 ms
[2023-03-17 23:00:37] [INFO ] Implicit Places using invariants in 8802 ms returned []
Implicit Place search using SMT only with invariants took 8817 ms to find 0 implicit places.
[2023-03-17 23:00:38] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:00:38] [INFO ] Invariant cache hit.
[2023-03-17 23:01:08] [INFO ] Performed 81866/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:01:31] [INFO ] Dead Transitions using invariants and state equation in 53760 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1967 places, 149003/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68092 ms. Remains : 1828/1967 places, 149003/149582 transitions.
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s10 1) (EQ s152 1)), p2:(AND (EQ s138 1) (EQ s979 1)), p0:(AND (EQ s206 1) (EQ s848 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 9461 ms.
Stuttering criterion allowed to conclude after 3095 steps with 1 reset in 292 ms.
FORMULA RERS2020-PT-pb105-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLFireability-00 finished in 78465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((G(F(!p1))||(!p2&&F(!p1))))))'
Support contains 6 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1666 edges and 1967 vertex of which 112 / 1967 are part of one of the 42 SCC in 5 ms
Free SCC test removed 70 places
Ensure Unique test removed 482 transitions
Reduce isomorphic transitions removed 482 transitions.
Graph (complete) has 143667 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.85 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1895 transition count 149096
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1893 transition count 149096
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1893 transition count 149093
Deduced a syphon composed of 3 places in 59 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1890 transition count 149093
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1884 transition count 149081
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1884 transition count 149081
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 32 place count 1884 transition count 149073
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 38 place count 1878 transition count 149061
Iterating global reduction 3 with 6 rules applied. Total rules applied 44 place count 1878 transition count 149061
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 50 place count 1878 transition count 149055
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 53 place count 1875 transition count 149049
Iterating global reduction 4 with 3 rules applied. Total rules applied 56 place count 1875 transition count 149049
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 59 place count 1875 transition count 149046
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 66 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 93 place count 1858 transition count 149029
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 94 place count 1858 transition count 149028
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 66 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 150 place count 1830 transition count 149124
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 169 place count 1830 transition count 149105
Applied a total of 169 rules in 5526 ms. Remains 1830 /1967 variables (removed 137) and now considering 149105/149582 (removed 477) transitions.
[2023-03-17 23:01:47] [INFO ] Flow matrix only has 104789 transitions (discarded 44316 similar events)
// Phase 1: matrix 104789 rows 1830 cols
[2023-03-17 23:01:48] [INFO ] Computed 10 place invariants in 542 ms
[2023-03-17 23:01:56] [INFO ] Implicit Places using invariants in 9147 ms returned []
Implicit Place search using SMT only with invariants took 9153 ms to find 0 implicit places.
[2023-03-17 23:01:56] [INFO ] Flow matrix only has 104789 transitions (discarded 44316 similar events)
[2023-03-17 23:01:56] [INFO ] Invariant cache hit.
[2023-03-17 23:02:27] [INFO ] Performed 84539/149105 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:02:48] [INFO ] Dead Transitions using invariants and state equation in 52180 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1830/1967 places, 149105/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66865 ms. Remains : 1830/1967 places, 149105/149582 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s317 1) (EQ s950 1)), p2:(AND (EQ s549 1) (EQ s1200 1)), p1:(AND (EQ s85 1) (EQ s1020 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 14 ms.
FORMULA RERS2020-PT-pb105-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLFireability-01 finished in 67349 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 U (p1||G(!p0)))&&(p0||X(p2)))))'
Support contains 6 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 215 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-17 23:02:49] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2023-03-17 23:02:50] [INFO ] Computed 10 place invariants in 419 ms
[2023-03-17 23:02:58] [INFO ] Implicit Places using invariants in 9231 ms returned []
Implicit Place search using SMT only with invariants took 9232 ms to find 0 implicit places.
[2023-03-17 23:02:58] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:02:58] [INFO ] Invariant cache hit.
[2023-03-17 23:03:29] [INFO ] Performed 82819/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:03:53] [INFO ] Dead Transitions using invariants and state equation in 54564 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64017 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1))), true, (NOT p2), (AND p0 (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s549 1) (EQ s788 1)), p1:(AND (NOT (AND (EQ s778 1) (EQ s1439 1))) (NOT (AND (EQ s549 1) (EQ s788 1)))), p2:(AND (EQ s286 1) (EQ s1321 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA RERS2020-PT-pb105-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLFireability-02 finished in 64471 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)) U p1))'
Support contains 4 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1670 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 5 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.93 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1893 transition count 148992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1891 transition count 148992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1891 transition count 148989
Deduced a syphon composed of 3 places in 59 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1888 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1882 transition count 148977
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1882 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1882 transition count 148971
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1876 transition count 148959
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1876 transition count 148959
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 59 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 91 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 59 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 148 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 167 place count 1828 transition count 149003
Applied a total of 167 rules in 4857 ms. Remains 1828 /1967 variables (removed 139) and now considering 149003/149582 (removed 579) transitions.
[2023-03-17 23:03:58] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-17 23:03:59] [INFO ] Computed 10 place invariants in 420 ms
[2023-03-17 23:04:07] [INFO ] Implicit Places using invariants in 8922 ms returned []
Implicit Place search using SMT only with invariants took 8939 ms to find 0 implicit places.
[2023-03-17 23:04:07] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:04:07] [INFO ] Invariant cache hit.
[2023-03-17 23:04:37] [INFO ] Performed 83519/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:05:01] [INFO ] Dead Transitions using invariants and state equation in 53809 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1967 places, 149003/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67613 ms. Remains : 1828/1967 places, 149003/149582 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s422 1) (EQ s1173 1)), p0:(AND (EQ s900 1) (EQ s1818 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 10 ms.
FORMULA RERS2020-PT-pb105-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLFireability-04 finished in 67910 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)||G(!p1)) U X(p2)))'
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 221 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-17 23:05:02] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2023-03-17 23:05:02] [INFO ] Computed 10 place invariants in 448 ms
[2023-03-17 23:05:11] [INFO ] Implicit Places using invariants in 9089 ms returned []
Implicit Place search using SMT only with invariants took 9106 ms to find 0 implicit places.
[2023-03-17 23:05:11] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:05:11] [INFO ] Invariant cache hit.
[2023-03-17 23:05:41] [INFO ] Performed 83608/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:06:05] [INFO ] Dead Transitions using invariants and state equation in 54035 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63377 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Stuttering acceptance computed with spot in 228 ms :[p1, (OR (NOT p2) p1), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(AND (EQ s305 1) (EQ s396 1) (EQ s14 1) (EQ s1305 1)), p2:(AND (EQ s1079 1) (EQ s1695 1)), p0:(AND (EQ s1164 1) (EQ s1914 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 5 ms.
FORMULA RERS2020-PT-pb105-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLFireability-05 finished in 63849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 248 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-17 23:06:06] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:06:06] [INFO ] Invariant cache hit.
[2023-03-17 23:06:14] [INFO ] Implicit Places using invariants in 8629 ms returned []
Implicit Place search using SMT only with invariants took 8634 ms to find 0 implicit places.
[2023-03-17 23:06:14] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:06:14] [INFO ] Invariant cache hit.
[2023-03-17 23:06:44] [INFO ] Performed 84454/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:07:06] [INFO ] Dead Transitions using invariants and state equation in 52073 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60958 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s461 1) (EQ s1614 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA RERS2020-PT-pb105-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLFireability-06 finished in 61328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 209 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-17 23:07:07] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:07:07] [INFO ] Invariant cache hit.
[2023-03-17 23:07:16] [INFO ] Implicit Places using invariants in 9194 ms returned []
Implicit Place search using SMT only with invariants took 9196 ms to find 0 implicit places.
[2023-03-17 23:07:16] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:07:16] [INFO ] Invariant cache hit.
[2023-03-17 23:07:46] [INFO ] Performed 85388/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:08:09] [INFO ] Dead Transitions using invariants and state equation in 52747 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62180 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1139 0) (EQ s1687 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 51330 steps with 25665 reset in 10002 ms.
Product exploration timeout after 55450 steps with 27725 reset in 10002 ms.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.308 ms
Computed a total of 188 stabilizing places and 32921 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb105-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb105-LTLFireability-07 finished in 83162 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 p1)||X((!p2 U (p3||G(!p2))))))'
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 206 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-17 23:08:30] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:08:30] [INFO ] Invariant cache hit.
[2023-03-17 23:08:38] [INFO ] Implicit Places using invariants in 8320 ms returned []
Implicit Place search using SMT only with invariants took 8322 ms to find 0 implicit places.
[2023-03-17 23:08:38] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:08:38] [INFO ] Invariant cache hit.
[2023-03-17 23:09:08] [INFO ] Performed 82154/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:09:33] [INFO ] Dead Transitions using invariants and state equation in 55033 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63564 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p1), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s174 1) (EQ s925 1)), p0:(AND (EQ s33 1) (EQ s581 1)), p3:(AND (NOT (AND (EQ s985 1) (EQ s1911 1))) (NOT (AND (EQ s809 1) (EQ s914 1)))), p2:(...], 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 45240 steps with 22620 reset in 10002 ms.
Product exploration timeout after 52800 steps with 26400 reset in 10002 ms.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.339 ms
Computed a total of 188 stabilizing places and 32921 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p3) p2)))
Knowledge based reduction with 16 factoid took 284 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb105-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb105-LTLFireability-08 finished in 84920 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)||(F(G(!p0)) U G(p1)))))'
Support contains 4 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1671 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 5 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.85 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1893 transition count 148992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1891 transition count 148992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1891 transition count 148989
Deduced a syphon composed of 3 places in 61 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1888 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1882 transition count 148977
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1882 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1882 transition count 148971
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1876 transition count 148959
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1876 transition count 148959
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 59 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 91 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 59 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 148 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 167 place count 1828 transition count 149003
Applied a total of 167 rules in 4949 ms. Remains 1828 /1967 variables (removed 139) and now considering 149003/149582 (removed 579) transitions.
[2023-03-17 23:10:00] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-17 23:10:00] [INFO ] Computed 10 place invariants in 430 ms
[2023-03-17 23:10:09] [INFO ] Implicit Places using invariants in 9145 ms returned []
Implicit Place search using SMT only with invariants took 9155 ms to find 0 implicit places.
[2023-03-17 23:10:09] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:10:09] [INFO ] Invariant cache hit.
[2023-03-17 23:10:39] [INFO ] Performed 88182/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:11:00] [INFO ] Dead Transitions using invariants and state equation in 51244 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1967 places, 149003/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65363 ms. Remains : 1828/1967 places, 149003/149582 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s186 1) (EQ s346 1)), p1:(AND (EQ s1021 1) (EQ s1538 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 7 ms.
FORMULA RERS2020-PT-pb105-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLFireability-09 finished in 65652 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(p1)&&X(p2)&&p0)))'
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 234 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-17 23:11:01] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2023-03-17 23:11:01] [INFO ] Computed 10 place invariants in 382 ms
[2023-03-17 23:11:09] [INFO ] Implicit Places using invariants in 8858 ms returned []
Implicit Place search using SMT only with invariants took 8861 ms to find 0 implicit places.
[2023-03-17 23:11:09] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:11:09] [INFO ] Invariant cache hit.
[2023-03-17 23:11:40] [INFO ] Performed 83417/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:12:04] [INFO ] Dead Transitions using invariants and state equation in 54433 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63532 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 2}]], initial=1, aps=[p1:(AND (EQ s549 1) (EQ s631 1)), p0:(AND (EQ s518 1) (EQ s833 1) (OR (EQ s751 0) (EQ s1626 0)) (OR (EQ s929 0) (EQ s1769 0))), p2:(AND (EQ s518 1) (EQ s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA RERS2020-PT-pb105-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLFireability-10 finished in 63974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1669 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 5 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.84 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1893 transition count 148992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1891 transition count 148992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1891 transition count 148989
Deduced a syphon composed of 3 places in 59 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1888 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1882 transition count 148977
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1882 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1882 transition count 148971
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1876 transition count 148959
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1876 transition count 148959
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 57 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 91 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 58 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 148 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 167 place count 1828 transition count 149003
Applied a total of 167 rules in 4748 ms. Remains 1828 /1967 variables (removed 139) and now considering 149003/149582 (removed 579) transitions.
[2023-03-17 23:12:09] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-17 23:12:09] [INFO ] Computed 10 place invariants in 347 ms
[2023-03-17 23:12:18] [INFO ] Implicit Places using invariants in 8804 ms returned []
Implicit Place search using SMT only with invariants took 8805 ms to find 0 implicit places.
[2023-03-17 23:12:18] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:12:18] [INFO ] Invariant cache hit.
[2023-03-17 23:12:48] [INFO ] Performed 83456/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:13:11] [INFO ] Dead Transitions using invariants and state equation in 53547 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1967 places, 149003/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67110 ms. Remains : 1828/1967 places, 149003/149582 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s26 1) (EQ s568 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 13 ms.
FORMULA RERS2020-PT-pb105-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLFireability-12 finished in 67404 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&&F(G(p1)))))'
Support contains 4 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1669 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 5 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.92 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1893 transition count 148992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1891 transition count 148992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1891 transition count 148989
Deduced a syphon composed of 3 places in 69 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1888 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1882 transition count 148977
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1882 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1882 transition count 148971
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1876 transition count 148959
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1876 transition count 148959
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 64 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 91 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 65 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 148 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 167 place count 1828 transition count 149003
Applied a total of 167 rules in 5494 ms. Remains 1828 /1967 variables (removed 139) and now considering 149003/149582 (removed 579) transitions.
[2023-03-17 23:13:17] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:13:17] [INFO ] Invariant cache hit.
[2023-03-17 23:13:26] [INFO ] Implicit Places using invariants in 8990 ms returned []
Implicit Place search using SMT only with invariants took 8992 ms to find 0 implicit places.
[2023-03-17 23:13:26] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:13:26] [INFO ] Invariant cache hit.
[2023-03-17 23:13:56] [INFO ] Performed 83534/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:14:20] [INFO ] Dead Transitions using invariants and state equation in 54144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1967 places, 149003/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68638 ms. Remains : 1828/1967 places, 149003/149582 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, 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:(OR (EQ s18 0) (EQ s1305 0)), p1:(OR (EQ s223 0) (EQ s914 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 94570 steps with 0 reset in 10002 ms.
Product exploration explored 100000 steps with 0 reset in 8786 ms.
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 282 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 73 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 998 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 5725 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5725 steps, saw 4195 distinct states, run finished after 3005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 23:14:45] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:14:45] [INFO ] Invariant cache hit.
[2023-03-17 23:14:45] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 23:14:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-17 23:15:10] [INFO ] After 24714ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 23:15:11] [INFO ] State equation strengthened by 5200 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 23:15:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 23:15:11] [INFO ] After 26224ms 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 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Drop transitions removed 3751 transitions
Reduce isomorphic transitions removed 3751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3754 rules applied. Total rules applied 3754 place count 1828 transition count 145249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3757 place count 1825 transition count 145249
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 64 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3777 place count 1815 transition count 145239
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3782 place count 1815 transition count 145234
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3807 place count 1815 transition count 145203
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 3 with 611 rules applied. Total rules applied 4418 place count 1790 transition count 144617
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4421 place count 1790 transition count 144614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4477 place count 1787 transition count 144561
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4480 place count 1787 transition count 144558
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4486 place count 1784 transition count 144555
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4487 place count 1784 transition count 144554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4488 place count 1783 transition count 144554
Free-agglomeration rule (complex) applied 116 times with reduction of 3658 identical transitions.
Iterating global reduction 7 with 116 rules applied. Total rules applied 4604 place count 1783 transition count 172995
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 7636 transitions
Reduce isomorphic transitions removed 7774 transitions.
Iterating post reduction 7 with 7890 rules applied. Total rules applied 12494 place count 1667 transition count 165221
Applied a total of 12494 rules in 8638 ms. Remains 1667 /1828 variables (removed 161) and now considering 165221/149003 (removed -16218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8643 ms. Remains : 1667/1828 places, 165221/149003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1014 ms. (steps per millisecond=9 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 4606 steps, run timeout after 3004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4606 steps, saw 3822 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 23:15:25] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
// Phase 1: matrix 122274 rows 1667 cols
[2023-03-17 23:15:25] [INFO ] Computed 10 place invariants in 565 ms
[2023-03-17 23:15:26] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 23:15:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-17 23:15:51] [INFO ] After 24735ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 23:15:52] [INFO ] State equation strengthened by 6068 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 23:15:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 23:15:52] [INFO ] After 25987ms 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 4 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 715 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 716 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 722 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
[2023-03-17 23:15:53] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-17 23:15:53] [INFO ] Invariant cache hit.
[2023-03-17 23:16:02] [INFO ] Implicit Places using invariants in 9082 ms returned []
Implicit Place search using SMT only with invariants took 9083 ms to find 0 implicit places.
[2023-03-17 23:16:02] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-17 23:16:02] [INFO ] Invariant cache hit.
[2023-03-17 23:16:32] [INFO ] Performed 89601/165221 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:16:57] [INFO ] Dead Transitions using invariants and state equation in 55279 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65101 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 374 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 100 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Applied a total of 0 rules in 670 ms. Remains 1828 /1828 variables (removed 0) and now considering 149003/149003 (removed 0) transitions.
[2023-03-17 23:16:59] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-17 23:16:59] [INFO ] Computed 10 place invariants in 419 ms
[2023-03-17 23:17:08] [INFO ] Implicit Places using invariants in 8932 ms returned []
Implicit Place search using SMT only with invariants took 8936 ms to find 0 implicit places.
[2023-03-17 23:17:08] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:17:08] [INFO ] Invariant cache hit.
[2023-03-17 23:17:38] [INFO ] Performed 80627/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:18:03] [INFO ] Dead Transitions using invariants and state equation in 54919 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64530 ms. Remains : 1828/1828 places, 149003/149003 transitions.
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 260 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 72 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1119 ms. (steps per millisecond=8 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 4664 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4664 steps, saw 3479 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 23:18:09] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:18:09] [INFO ] Invariant cache hit.
[2023-03-17 23:18:09] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 23:18:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-17 23:18:34] [INFO ] After 24686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 23:18:35] [INFO ] State equation strengthened by 5200 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 23:18:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 23:18:35] [INFO ] After 25799ms 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 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Drop transitions removed 3751 transitions
Reduce isomorphic transitions removed 3751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3754 rules applied. Total rules applied 3754 place count 1828 transition count 145249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3757 place count 1825 transition count 145249
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 59 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3777 place count 1815 transition count 145239
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3782 place count 1815 transition count 145234
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3807 place count 1815 transition count 145203
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 3 with 611 rules applied. Total rules applied 4418 place count 1790 transition count 144617
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4421 place count 1790 transition count 144614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4477 place count 1787 transition count 144561
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4480 place count 1787 transition count 144558
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4486 place count 1784 transition count 144555
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4487 place count 1784 transition count 144554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4488 place count 1783 transition count 144554
Free-agglomeration rule (complex) applied 116 times with reduction of 3658 identical transitions.
Iterating global reduction 7 with 116 rules applied. Total rules applied 4604 place count 1783 transition count 172995
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 7636 transitions
Reduce isomorphic transitions removed 7774 transitions.
Iterating post reduction 7 with 7890 rules applied. Total rules applied 12494 place count 1667 transition count 165221
Applied a total of 12494 rules in 8514 ms. Remains 1667 /1828 variables (removed 161) and now considering 165221/149003 (removed -16218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8522 ms. Remains : 1667/1828 places, 165221/149003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1577 ms. (steps per millisecond=6 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 9315 steps, run timeout after 6006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 9315 steps, saw 7642 distinct states, run finished after 6006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 23:18:51] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
// Phase 1: matrix 122274 rows 1667 cols
[2023-03-17 23:18:52] [INFO ] Computed 10 place invariants in 679 ms
[2023-03-17 23:18:52] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 23:18:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-17 23:19:17] [INFO ] After 24704ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 23:19:19] [INFO ] State equation strengthened by 6068 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 23:19:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 23:19:19] [INFO ] After 27061ms 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 4 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 1074 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1074 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 884 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
[2023-03-17 23:19:21] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-17 23:19:21] [INFO ] Invariant cache hit.
[2023-03-17 23:19:31] [INFO ] Implicit Places using invariants in 9576 ms returned []
Implicit Place search using SMT only with invariants took 9577 ms to find 0 implicit places.
[2023-03-17 23:19:31] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-17 23:19:31] [INFO ] Invariant cache hit.
[2023-03-17 23:20:01] [INFO ] Performed 86120/165221 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:20:28] [INFO ] Dead Transitions using invariants and state equation in 57363 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67844 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 431 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 71 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 7434 ms.
Product exploration explored 100000 steps with 1 reset in 9305 ms.
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Applied a total of 0 rules in 709 ms. Remains 1828 /1828 variables (removed 0) and now considering 149003/149003 (removed 0) transitions.
[2023-03-17 23:20:47] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-17 23:20:47] [INFO ] Computed 10 place invariants in 500 ms
[2023-03-17 23:20:56] [INFO ] Implicit Places using invariants in 9478 ms returned []
Implicit Place search using SMT only with invariants took 9492 ms to find 0 implicit places.
[2023-03-17 23:20:56] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:20:56] [INFO ] Invariant cache hit.
[2023-03-17 23:21:26] [INFO ] Performed 81152/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:21:51] [INFO ] Dead Transitions using invariants and state equation in 54628 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64844 ms. Remains : 1828/1828 places, 149003/149003 transitions.
Treatment of property RERS2020-PT-pb105-LTLFireability-13 finished in 524905 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)))'
Support contains 4 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1671 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 7 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.91 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1893 transition count 148992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1891 transition count 148992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1891 transition count 148989
Deduced a syphon composed of 3 places in 73 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1888 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1882 transition count 148977
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1882 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1882 transition count 148971
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1876 transition count 148959
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1876 transition count 148959
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 76 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 91 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 90 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 148 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 167 place count 1828 transition count 149003
Applied a total of 167 rules in 6823 ms. Remains 1828 /1967 variables (removed 139) and now considering 149003/149582 (removed 579) transitions.
[2023-03-17 23:22:03] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:22:03] [INFO ] Invariant cache hit.
[2023-03-17 23:22:12] [INFO ] Implicit Places using invariants in 8638 ms returned []
Implicit Place search using SMT only with invariants took 8644 ms to find 0 implicit places.
[2023-03-17 23:22:12] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:22:12] [INFO ] Invariant cache hit.
[2023-03-17 23:22:42] [INFO ] Performed 85738/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:23:03] [INFO ] Dead Transitions using invariants and state equation in 51408 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1967 places, 149003/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66882 ms. Remains : 1828/1967 places, 149003/149582 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s283 0) (EQ s482 0) (EQ s23 0) (EQ s1333 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 7982 ms.
Product exploration explored 100000 steps with 0 reset in 8578 ms.
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 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 90 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1037 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5323 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5323 steps, saw 3971 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 23:23:26] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:23:26] [INFO ] Invariant cache hit.
[2023-03-17 23:23:26] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 23:23:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-17 23:23:51] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Drop transitions removed 3751 transitions
Reduce isomorphic transitions removed 3751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3754 rules applied. Total rules applied 3754 place count 1828 transition count 145249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3757 place count 1825 transition count 145249
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 58 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3777 place count 1815 transition count 145239
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3782 place count 1815 transition count 145234
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3807 place count 1815 transition count 145203
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 3 with 611 rules applied. Total rules applied 4418 place count 1790 transition count 144617
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4421 place count 1790 transition count 144614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4477 place count 1787 transition count 144561
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4480 place count 1787 transition count 144558
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4486 place count 1784 transition count 144555
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4487 place count 1784 transition count 144554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4488 place count 1783 transition count 144554
Free-agglomeration rule (complex) applied 116 times with reduction of 3658 identical transitions.
Iterating global reduction 7 with 116 rules applied. Total rules applied 4604 place count 1783 transition count 172995
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 7636 transitions
Reduce isomorphic transitions removed 7774 transitions.
Iterating post reduction 7 with 7890 rules applied. Total rules applied 12494 place count 1667 transition count 165221
Applied a total of 12494 rules in 7808 ms. Remains 1667 /1828 variables (removed 161) and now considering 165221/149003 (removed -16218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7813 ms. Remains : 1667/1828 places, 165221/149003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1732 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4410 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4410 steps, saw 3659 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 23:24:04] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
// Phase 1: matrix 122274 rows 1667 cols
[2023-03-17 23:24:05] [INFO ] Computed 10 place invariants in 721 ms
[2023-03-17 23:24:05] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 23:24:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-17 23:24:30] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 724 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 724 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 659 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
[2023-03-17 23:24:31] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-17 23:24:31] [INFO ] Invariant cache hit.
[2023-03-17 23:24:40] [INFO ] Implicit Places using invariants in 8936 ms returned []
Implicit Place search using SMT only with invariants took 8940 ms to find 0 implicit places.
[2023-03-17 23:24:40] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-17 23:24:40] [INFO ] Invariant cache hit.
[2023-03-17 23:25:11] [INFO ] Performed 91631/165221 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:25:34] [INFO ] Dead Transitions using invariants and state equation in 53516 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63132 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Knowledge obtained : [p0, (X p0), (X (X 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Applied a total of 0 rules in 639 ms. Remains 1828 /1828 variables (removed 0) and now considering 149003/149003 (removed 0) transitions.
[2023-03-17 23:25:35] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-17 23:25:35] [INFO ] Computed 10 place invariants in 364 ms
[2023-03-17 23:25:43] [INFO ] Implicit Places using invariants in 8550 ms returned []
Implicit Place search using SMT only with invariants took 8563 ms to find 0 implicit places.
[2023-03-17 23:25:43] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:25:43] [INFO ] Invariant cache hit.
[2023-03-17 23:26:14] [INFO ] Performed 84936/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:26:36] [INFO ] Dead Transitions using invariants and state equation in 52721 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61945 ms. Remains : 1828/1828 places, 149003/149003 transitions.
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 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 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1039 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5656 steps, run timeout after 3004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5656 steps, saw 4150 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 23:26:42] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:26:42] [INFO ] Invariant cache hit.
[2023-03-17 23:26:42] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 23:26:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2023-03-17 23:27:07] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Drop transitions removed 3751 transitions
Reduce isomorphic transitions removed 3751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3754 rules applied. Total rules applied 3754 place count 1828 transition count 145249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3757 place count 1825 transition count 145249
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 69 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3777 place count 1815 transition count 145239
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3782 place count 1815 transition count 145234
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3807 place count 1815 transition count 145203
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 3 with 611 rules applied. Total rules applied 4418 place count 1790 transition count 144617
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4421 place count 1790 transition count 144614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4477 place count 1787 transition count 144561
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4480 place count 1787 transition count 144558
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4486 place count 1784 transition count 144555
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4487 place count 1784 transition count 144554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4488 place count 1783 transition count 144554
Free-agglomeration rule (complex) applied 116 times with reduction of 3658 identical transitions.
Iterating global reduction 7 with 116 rules applied. Total rules applied 4604 place count 1783 transition count 172995
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 7636 transitions
Reduce isomorphic transitions removed 7774 transitions.
Iterating post reduction 7 with 7890 rules applied. Total rules applied 12494 place count 1667 transition count 165221
Applied a total of 12494 rules in 8445 ms. Remains 1667 /1828 variables (removed 161) and now considering 165221/149003 (removed -16218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8450 ms. Remains : 1667/1828 places, 165221/149003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1269 ms. (steps per millisecond=7 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 4786 steps, run timeout after 3004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4786 steps, saw 3973 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 23:27:20] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
// Phase 1: matrix 122274 rows 1667 cols
[2023-03-17 23:27:21] [INFO ] Computed 10 place invariants in 676 ms
[2023-03-17 23:27:21] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 23:27:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-17 23:27:46] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 893 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 893 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 902 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
[2023-03-17 23:27:48] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-17 23:27:48] [INFO ] Invariant cache hit.
[2023-03-17 23:27:57] [INFO ] Implicit Places using invariants in 9151 ms returned []
Implicit Place search using SMT only with invariants took 9155 ms to find 0 implicit places.
[2023-03-17 23:27:57] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-17 23:27:57] [INFO ] Invariant cache hit.
[2023-03-17 23:28:27] [INFO ] Performed 87537/165221 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:28:53] [INFO ] Dead Transitions using invariants and state equation in 55901 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66010 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 8162 ms.
Product exploration explored 100000 steps with 0 reset in 8962 ms.
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Applied a total of 0 rules in 653 ms. Remains 1828 /1828 variables (removed 0) and now considering 149003/149003 (removed 0) transitions.
[2023-03-17 23:29:11] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-17 23:29:12] [INFO ] Computed 10 place invariants in 407 ms
[2023-03-17 23:29:20] [INFO ] Implicit Places using invariants in 8960 ms returned []
Implicit Place search using SMT only with invariants took 8962 ms to find 0 implicit places.
[2023-03-17 23:29:20] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:29:20] [INFO ] Invariant cache hit.
[2023-03-17 23:29:50] [INFO ] Performed 85568/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:30:14] [INFO ] Dead Transitions using invariants and state equation in 53609 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63231 ms. Remains : 1828/1828 places, 149003/149003 transitions.
Treatment of property RERS2020-PT-pb105-LTLFireability-15 finished in 502651 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&&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' '!(G(F(p0)))'
[2023-03-17 23:30:24] [INFO ] Flatten gal took : 3959 ms
[2023-03-17 23:30:24] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-17 23:30:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1967 places, 149582 transitions and 594939 arcs took 279 ms.
Total runtime 2080449 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1299/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1299/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : RERS2020-PT-pb105-LTLFireability-13
Could not compute solution for formula : RERS2020-PT-pb105-LTLFireability-15
BK_STOP 1679095904838
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name RERS2020-PT-pb105-LTLFireability-13
ltl formula formula --ltl=/tmp/1299/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1967 places, 149582 transitions and 594939 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 14.990 real 5.360 user 4.550 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1299/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1299/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1299/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1299/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name RERS2020-PT-pb105-LTLFireability-15
ltl formula formula --ltl=/tmp/1299/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1967 places, 149582 transitions and 594939 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 15.760 real 5.200 user 4.660 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1299/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1299/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1299/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1299/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RERS2020-PT-pb105"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is RERS2020-PT-pb105, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889201800252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS2020-PT-pb105.tgz
mv RERS2020-PT-pb105 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;