Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 23:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 23:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 23:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 25 23:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 ShieldRVt-PT-100B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679313462933

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=ShieldRVt-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 11:57:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 11:57:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:57:45] [INFO ] Load time of PNML (sax parser for PT used): 326 ms
[2023-03-20 11:57:45] [INFO ] Transformed 5003 places.
[2023-03-20 11:57:45] [INFO ] Transformed 5003 transitions.
[2023-03-20 11:57:45] [INFO ] Found NUPN structural information;
[2023-03-20 11:57:46] [INFO ] Parsed PT model containing 5003 places and 5003 transitions and 11806 arcs in 703 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-100B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 5003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Discarding 1084 places :
Symmetric choice reduction at 0 with 1084 rule applications. Total rules 1084 place count 3919 transition count 3919
Iterating global reduction 0 with 1084 rules applied. Total rules applied 2168 place count 3919 transition count 3919
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2169 place count 3918 transition count 3918
Iterating global reduction 0 with 1 rules applied. Total rules applied 2170 place count 3918 transition count 3918
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2171 place count 3917 transition count 3917
Iterating global reduction 0 with 1 rules applied. Total rules applied 2172 place count 3917 transition count 3917
Applied a total of 2172 rules in 2728 ms. Remains 3917 /5003 variables (removed 1086) and now considering 3917/5003 (removed 1086) transitions.
// Phase 1: matrix 3917 rows 3917 cols
[2023-03-20 11:57:49] [INFO ] Computed 401 place invariants in 59 ms
[2023-03-20 11:57:51] [INFO ] Implicit Places using invariants in 1705 ms returned []
[2023-03-20 11:57:51] [INFO ] Invariant cache hit.
[2023-03-20 11:57:52] [INFO ] Implicit Places using invariants and state equation in 1631 ms returned []
Implicit Place search using SMT with State Equation took 3474 ms to find 0 implicit places.
[2023-03-20 11:57:52] [INFO ] Invariant cache hit.
[2023-03-20 11:58:03] [INFO ] Dead Transitions using invariants and state equation in 10677 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3917/5003 places, 3917/5003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16900 ms. Remains : 3917/5003 places, 3917/5003 transitions.
Support contains 38 out of 3917 places after structural reductions.
[2023-03-20 11:58:03] [INFO ] Flatten gal took : 220 ms
[2023-03-20 11:58:03] [INFO ] Flatten gal took : 132 ms
[2023-03-20 11:58:04] [INFO ] Input system was already deterministic with 3917 transitions.
Support contains 36 out of 3917 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 750 ms. (steps per millisecond=13 ) properties (out of 29) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) 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 22) seen :0
Running SMT prover for 22 properties.
[2023-03-20 11:58:05] [INFO ] Invariant cache hit.
[2023-03-20 11:58:07] [INFO ] After 1778ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-20 11:58:09] [INFO ] [Nat]Absence check using 401 positive place invariants in 440 ms returned sat
[2023-03-20 11:58:16] [INFO ] After 5816ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2023-03-20 11:58:17] [INFO ] Deduced a trap composed of 40 places in 1115 ms of which 7 ms to minimize.
[2023-03-20 11:58:18] [INFO ] Deduced a trap composed of 32 places in 889 ms of which 2 ms to minimize.
[2023-03-20 11:58:21] [INFO ] Deduced a trap composed of 35 places in 3046 ms of which 2 ms to minimize.
[2023-03-20 11:58:23] [INFO ] Deduced a trap composed of 21 places in 1141 ms of which 5 ms to minimize.
[2023-03-20 11:58:24] [INFO ] Deduced a trap composed of 38 places in 1077 ms of which 4 ms to minimize.
[2023-03-20 11:58:25] [INFO ] Deduced a trap composed of 42 places in 778 ms of which 1 ms to minimize.
[2023-03-20 11:58:26] [INFO ] Deduced a trap composed of 39 places in 1017 ms of which 2 ms to minimize.
[2023-03-20 11:58:27] [INFO ] Deduced a trap composed of 24 places in 1229 ms of which 3 ms to minimize.
[2023-03-20 11:58:29] [INFO ] Deduced a trap composed of 49 places in 1476 ms of which 3 ms to minimize.
[2023-03-20 11:58:30] [INFO ] Deduced a trap composed of 36 places in 1307 ms of which 3 ms to minimize.
[2023-03-20 11:58:32] [INFO ] Deduced a trap composed of 52 places in 969 ms of which 2 ms to minimize.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-20 11:58:35] [INFO ] Deduced a trap composed of 25 places in 3085 ms of which 6 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 11:58:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 11:58:35] [INFO ] After 28151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:22
Fused 22 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 5346 ms.
Support contains 28 out of 3917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Drop transitions removed 1076 transitions
Trivial Post-agglo rules discarded 1076 transitions
Performed 1076 trivial Post agglomeration. Transition count delta: 1076
Iterating post reduction 0 with 1076 rules applied. Total rules applied 1076 place count 3917 transition count 2841
Reduce places removed 1076 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 1081 rules applied. Total rules applied 2157 place count 2841 transition count 2836
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 2162 place count 2836 transition count 2836
Performed 787 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 787 Pre rules applied. Total rules applied 2162 place count 2836 transition count 2049
Deduced a syphon composed of 787 places in 12 ms
Reduce places removed 787 places and 0 transitions.
Iterating global reduction 3 with 1574 rules applied. Total rules applied 3736 place count 2049 transition count 2049
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 3741 place count 2044 transition count 2044
Iterating global reduction 3 with 5 rules applied. Total rules applied 3746 place count 2044 transition count 2044
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 3746 place count 2044 transition count 2041
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 3752 place count 2041 transition count 2041
Performed 908 Post agglomeration using F-continuation condition.Transition count delta: 908
Deduced a syphon composed of 908 places in 1 ms
Reduce places removed 908 places and 0 transitions.
Iterating global reduction 3 with 1816 rules applied. Total rules applied 5568 place count 1133 transition count 1133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5569 place count 1133 transition count 1132
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5571 place count 1132 transition count 1131
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5773 place count 1031 transition count 1225
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 101 places in 14 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5975 place count 930 transition count 1322
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: -81
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 6147 place count 844 transition count 1403
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6148 place count 844 transition count 1402
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 6150 place count 844 transition count 1400
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 6152 place count 842 transition count 1400
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 6154 place count 842 transition count 1398
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 6155 place count 842 transition count 1398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 6156 place count 841 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 6157 place count 840 transition count 1397
Applied a total of 6157 rules in 1912 ms. Remains 840 /3917 variables (removed 3077) and now considering 1397/3917 (removed 2520) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1913 ms. Remains : 840/3917 places, 1397/3917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 43302 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 43302 steps, saw 31264 distinct states, run finished after 3004 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 1397 rows 840 cols
[2023-03-20 11:58:46] [INFO ] Computed 400 place invariants in 6 ms
[2023-03-20 11:58:46] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-20 11:58:47] [INFO ] [Nat]Absence check using 400 positive place invariants in 112 ms returned sat
[2023-03-20 11:58:49] [INFO ] After 1931ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-20 11:58:49] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 11:58:50] [INFO ] After 894ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-20 11:58:52] [INFO ] After 3305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 1088 ms.
[2023-03-20 11:58:53] [INFO ] After 7035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Fused 21 Parikh solutions to 14 different solutions.
Parikh walk visited 6 properties in 4423 ms.
Support contains 21 out of 840 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 840/840 places, 1397/1397 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 3 rules applied. Total rules applied 3 place count 840 transition count 1394
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 837 transition count 1394
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 837 transition count 1392
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 835 transition count 1392
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 834 transition count 1391
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 829 transition count 1399
Applied a total of 22 rules in 126 ms. Remains 829 /840 variables (removed 11) and now considering 1399/1397 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 829/840 places, 1399/1397 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) 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 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 54818 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54818 steps, saw 39227 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 1399 rows 829 cols
[2023-03-20 11:59:01] [INFO ] Computed 400 place invariants in 5 ms
[2023-03-20 11:59:02] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-20 11:59:02] [INFO ] [Nat]Absence check using 400 positive place invariants in 58 ms returned sat
[2023-03-20 11:59:03] [INFO ] After 966ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-20 11:59:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 11:59:04] [INFO ] After 606ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-20 11:59:05] [INFO ] After 1480ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 579 ms.
[2023-03-20 11:59:05] [INFO ] After 3511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1228 ms.
Support contains 21 out of 829 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 829/829 places, 1399/1399 transitions.
Applied a total of 0 rules in 25 ms. Remains 829 /829 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 829/829 places, 1399/1399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 829/829 places, 1399/1399 transitions.
Applied a total of 0 rules in 25 ms. Remains 829 /829 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
[2023-03-20 11:59:07] [INFO ] Invariant cache hit.
[2023-03-20 11:59:07] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-03-20 11:59:07] [INFO ] Invariant cache hit.
[2023-03-20 11:59:08] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 11:59:08] [INFO ] Implicit Places using invariants and state equation in 1087 ms returned []
Implicit Place search using SMT with State Equation took 1577 ms to find 0 implicit places.
[2023-03-20 11:59:08] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-20 11:59:08] [INFO ] Invariant cache hit.
[2023-03-20 11:59:09] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2329 ms. Remains : 829/829 places, 1399/1399 transitions.
Graph (trivial) has 378 edges and 829 vertex of which 4 / 829 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2830 edges and 827 vertex of which 825 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 375 edges and 823 vertex of which 4 / 823 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 821 transition count 1390
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 374 edges and 819 vertex of which 6 / 819 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 816 transition count 1381
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 372 edges and 813 vertex of which 8 / 813 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 809 transition count 1370
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 368 edges and 805 vertex of which 8 / 805 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 801 transition count 1356
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 364 edges and 797 vertex of which 8 / 797 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 793 transition count 1342
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 360 edges and 789 vertex of which 8 / 789 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 785 transition count 1328
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 356 edges and 781 vertex of which 8 / 781 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 777 transition count 1314
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 352 edges and 773 vertex of which 8 / 773 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 769 transition count 1300
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 348 edges and 765 vertex of which 8 / 765 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 761 transition count 1286
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 344 edges and 757 vertex of which 8 / 757 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 753 transition count 1272
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 340 edges and 749 vertex of which 8 / 749 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 745 transition count 1258
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 336 edges and 741 vertex of which 8 / 741 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 737 transition count 1244
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 332 edges and 733 vertex of which 6 / 733 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 730 transition count 1230
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 329 edges and 727 vertex of which 6 / 727 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 13 with 14 rules applied. Total rules applied 239 place count 724 transition count 1220
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 326 edges and 721 vertex of which 6 / 721 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 14 with 16 rules applied. Total rules applied 255 place count 718 transition count 1208
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 324 edges and 715 vertex of which 8 / 715 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 15 rules applied. Total rules applied 270 place count 711 transition count 1197
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 321 edges and 707 vertex of which 10 / 707 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 16 with 20 rules applied. Total rules applied 290 place count 702 transition count 1182
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 315 edges and 697 vertex of which 8 / 697 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 24 rules applied. Total rules applied 314 place count 693 transition count 1164
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 311 edges and 689 vertex of which 8 / 689 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 333 place count 685 transition count 1150
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 307 edges and 681 vertex of which 8 / 681 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 352 place count 677 transition count 1136
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 303 edges and 673 vertex of which 8 / 673 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 371 place count 669 transition count 1122
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 299 edges and 665 vertex of which 8 / 665 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 390 place count 661 transition count 1108
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 295 edges and 657 vertex of which 8 / 657 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 409 place count 653 transition count 1094
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 291 edges and 649 vertex of which 8 / 649 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 428 place count 645 transition count 1080
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 287 edges and 641 vertex of which 8 / 641 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 447 place count 637 transition count 1066
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 283 edges and 633 vertex of which 8 / 633 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 466 place count 629 transition count 1052
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 279 edges and 625 vertex of which 8 / 625 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 485 place count 621 transition count 1038
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 275 edges and 617 vertex of which 8 / 617 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 504 place count 613 transition count 1024
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 271 edges and 609 vertex of which 8 / 609 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 523 place count 605 transition count 1010
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 267 edges and 601 vertex of which 8 / 601 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 542 place count 597 transition count 996
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 263 edges and 593 vertex of which 6 / 593 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 561 place count 590 transition count 982
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 259 edges and 587 vertex of which 4 / 587 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 31 with 14 rules applied. Total rules applied 575 place count 585 transition count 972
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 256 edges and 583 vertex of which 2 / 583 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 32 with 9 rules applied. Total rules applied 584 place count 582 transition count 966
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 5 rules applied. Total rules applied 589 place count 581 transition count 962
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 34 with 2 Pre rules applied. Total rules applied 589 place count 581 transition count 960
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 34 with 5 rules applied. Total rules applied 594 place count 578 transition count 960
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 34 with 5 rules applied. Total rules applied 599 place count 575 transition count 958
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 251 edges and 575 vertex of which 2 / 575 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 34 with 5 rules applied. Total rules applied 604 place count 574 transition count 954
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 252 edges and 573 vertex of which 4 / 573 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 35 with 4 rules applied. Total rules applied 608 place count 571 transition count 952
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 250 edges and 569 vertex of which 4 / 569 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 36 with 8 rules applied. Total rules applied 616 place count 567 transition count 947
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 249 edges and 565 vertex of which 6 / 565 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 37 with 12 rules applied. Total rules applied 628 place count 562 transition count 938
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 247 edges and 559 vertex of which 8 / 559 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 15 rules applied. Total rules applied 643 place count 555 transition count 927
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 243 edges and 551 vertex of which 8 / 551 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 662 place count 547 transition count 913
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 239 edges and 543 vertex of which 8 / 543 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 681 place count 539 transition count 899
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 235 edges and 535 vertex of which 8 / 535 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 700 place count 531 transition count 885
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 231 edges and 527 vertex of which 8 / 527 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 719 place count 523 transition count 871
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 227 edges and 519 vertex of which 8 / 519 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 738 place count 515 transition count 857
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 223 edges and 511 vertex of which 8 / 511 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 757 place count 507 transition count 843
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 219 edges and 503 vertex of which 6 / 503 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 45 with 17 rules applied. Total rules applied 774 place count 500 transition count 831
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 216 edges and 497 vertex of which 6 / 497 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 46 with 17 rules applied. Total rules applied 791 place count 494 transition count 818
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 213 edges and 490 vertex of which 6 / 490 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 47 with 16 rules applied. Total rules applied 807 place count 487 transition count 807
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 210 edges and 485 vertex of which 6 / 485 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 48 with 13 rules applied. Total rules applied 820 place count 482 transition count 797
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 207 edges and 479 vertex of which 4 / 479 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 49 with 17 rules applied. Total rules applied 837 place count 477 transition count 784
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 205 edges and 475 vertex of which 2 / 475 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 50 with 10 rules applied. Total rules applied 847 place count 474 transition count 777
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 204 edges and 473 vertex of which 2 / 473 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 51 with 5 rules applied. Total rules applied 852 place count 472 transition count 774
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 52 with 6 rules applied. Total rules applied 858 place count 471 transition count 769
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 53 with 4 Pre rules applied. Total rules applied 858 place count 471 transition count 765
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 53 with 12 rules applied. Total rules applied 870 place count 463 transition count 765
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 200 edges and 463 vertex of which 2 / 463 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 53 with 2 rules applied. Total rules applied 872 place count 462 transition count 764
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 54 with 2 rules applied. Total rules applied 874 place count 462 transition count 762
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 55 with 6 rules applied. Total rules applied 880 place count 458 transition count 760
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1528 edges and 458 vertex of which 456 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 55 with 5 rules applied. Total rules applied 885 place count 456 transition count 755
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 56 with 1 rules applied. Total rules applied 886 place count 456 transition count 754
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 57 with 6 rules applied. Total rules applied 892 place count 456 transition count 748
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 57 with 1 rules applied. Total rules applied 893 place count 456 transition count 748
Applied a total of 893 rules in 310 ms. Remains 456 /829 variables (removed 373) and now considering 748/1399 (removed 651) transitions.
Running SMT prover for 15 properties.
// Phase 1: matrix 748 rows 456 cols
[2023-03-20 11:59:09] [INFO ] Computed 216 place invariants in 2 ms
[2023-03-20 11:59:09] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-20 11:59:10] [INFO ] [Nat]Absence check using 216 positive place invariants in 45 ms returned sat
[2023-03-20 11:59:10] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-20 11:59:11] [INFO ] After 865ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 264 ms.
[2023-03-20 11:59:11] [INFO ] After 1507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Computed a total of 1199 stabilizing places and 1199 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G((p1||X(p2)))))))'
Support contains 3 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3902 transition count 3902
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3902 transition count 3902
Applied a total of 30 rules in 744 ms. Remains 3902 /3917 variables (removed 15) and now considering 3902/3917 (removed 15) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-20 11:59:12] [INFO ] Computed 401 place invariants in 28 ms
[2023-03-20 11:59:13] [INFO ] Implicit Places using invariants in 970 ms returned []
[2023-03-20 11:59:13] [INFO ] Invariant cache hit.
[2023-03-20 11:59:14] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 2419 ms to find 0 implicit places.
[2023-03-20 11:59:14] [INFO ] Invariant cache hit.
[2023-03-20 11:59:18] [INFO ] Dead Transitions using invariants and state equation in 3345 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3917 places, 3902/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6511 ms. Remains : 3902/3917 places, 3902/3917 transitions.
Stuttering acceptance computed with spot in 358 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-00 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: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s830 0), p2:(EQ s3571 0), p1:(EQ s3216 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1159 ms.
Product exploration explored 100000 steps with 1 reset in 1253 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 286 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 72394 steps, run timeout after 3002 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72394 steps, saw 71433 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 11:59:25] [INFO ] Invariant cache hit.
[2023-03-20 11:59:26] [INFO ] After 692ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 11:59:27] [INFO ] [Nat]Absence check using 401 positive place invariants in 344 ms returned sat
[2023-03-20 11:59:31] [INFO ] After 4417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 11:59:34] [INFO ] Deduced a trap composed of 24 places in 1958 ms of which 4 ms to minimize.
[2023-03-20 11:59:36] [INFO ] Deduced a trap composed of 29 places in 1930 ms of which 4 ms to minimize.
[2023-03-20 11:59:37] [INFO ] Deduced a trap composed of 23 places in 1051 ms of which 2 ms to minimize.
[2023-03-20 11:59:38] [INFO ] Deduced a trap composed of 21 places in 1339 ms of which 2 ms to minimize.
[2023-03-20 11:59:40] [INFO ] Deduced a trap composed of 39 places in 1159 ms of which 1 ms to minimize.
[2023-03-20 11:59:41] [INFO ] Deduced a trap composed of 22 places in 1200 ms of which 2 ms to minimize.
[2023-03-20 11:59:42] [INFO ] Deduced a trap composed of 43 places in 1181 ms of which 2 ms to minimize.
[2023-03-20 11:59:44] [INFO ] Deduced a trap composed of 31 places in 1263 ms of which 2 ms to minimize.
[2023-03-20 11:59:45] [INFO ] Deduced a trap composed of 54 places in 1168 ms of which 2 ms to minimize.
[2023-03-20 11:59:46] [INFO ] Deduced a trap composed of 49 places in 1173 ms of which 2 ms to minimize.
[2023-03-20 11:59:48] [INFO ] Deduced a trap composed of 39 places in 978 ms of which 2 ms to minimize.
[2023-03-20 11:59:49] [INFO ] Deduced a trap composed of 28 places in 995 ms of which 1 ms to minimize.
[2023-03-20 11:59:50] [INFO ] Deduced a trap composed of 59 places in 1259 ms of which 1 ms to minimize.
[2023-03-20 11:59:51] [INFO ] Deduced a trap composed of 39 places in 1051 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 11:59:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 11:59:51] [INFO ] After 25733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 476 ms.
Support contains 2 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions removed 1095 transitions
Trivial Post-agglo rules discarded 1095 transitions
Performed 1095 trivial Post agglomeration. Transition count delta: 1095
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1095 place count 3902 transition count 2807
Reduce places removed 1095 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2191 place count 2807 transition count 2806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2806 transition count 2806
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 800 Pre rules applied. Total rules applied 2192 place count 2806 transition count 2006
Deduced a syphon composed of 800 places in 6 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 3 with 1600 rules applied. Total rules applied 3792 place count 2006 transition count 2006
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 3793 place count 2005 transition count 2005
Iterating global reduction 3 with 1 rules applied. Total rules applied 3794 place count 2005 transition count 2005
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3794 place count 2005 transition count 2004
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3796 place count 2004 transition count 2004
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 0 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 3 with 1800 rules applied. Total rules applied 5596 place count 1104 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5597 place count 1104 transition count 1103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5599 place count 1103 transition count 1102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5801 place count 1002 transition count 1202
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6003 place count 901 transition count 1303
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6193 place count 806 transition count 1396
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6194 place count 806 transition count 1395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6195 place count 805 transition count 1394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6196 place count 804 transition count 1394
Applied a total of 6196 rules in 1354 ms. Remains 804 /3902 variables (removed 3098) and now considering 1394/3902 (removed 2508) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1354 ms. Remains : 804/3902 places, 1394/3902 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1394 rows 804 cols
[2023-03-20 11:59:54] [INFO ] Computed 400 place invariants in 5 ms
[2023-03-20 11:59:54] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 11:59:54] [INFO ] [Nat]Absence check using 400 positive place invariants in 58 ms returned sat
[2023-03-20 11:59:55] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 11:59:55] [INFO ] After 654ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-20 11:59:55] [INFO ] After 956ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 3639 steps, including 173 resets, run visited all 2 properties in 83 ms. (steps per millisecond=43 )
Parikh walk visited 2 properties in 82 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (AND p2 p1))), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 4 factoid took 373 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 3902 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 412 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-20 11:59:56] [INFO ] Computed 401 place invariants in 28 ms
[2023-03-20 11:59:58] [INFO ] Implicit Places using invariants in 1374 ms returned []
[2023-03-20 11:59:58] [INFO ] Invariant cache hit.
[2023-03-20 12:00:00] [INFO ] Implicit Places using invariants and state equation in 2282 ms returned []
Implicit Place search using SMT with State Equation took 3667 ms to find 0 implicit places.
[2023-03-20 12:00:00] [INFO ] Invariant cache hit.
[2023-03-20 12:00:03] [INFO ] Dead Transitions using invariants and state equation in 3229 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7324 ms. Remains : 3902/3902 places, 3902/3902 transitions.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND p2 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 264 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 12:00:04] [INFO ] Invariant cache hit.
[2023-03-20 12:00:05] [INFO ] After 848ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:00:06] [INFO ] [Nat]Absence check using 401 positive place invariants in 249 ms returned sat
[2023-03-20 12:00:13] [INFO ] After 6794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 12:00:14] [INFO ] Deduced a trap composed of 30 places in 1408 ms of which 2 ms to minimize.
[2023-03-20 12:00:17] [INFO ] Deduced a trap composed of 22 places in 2025 ms of which 4 ms to minimize.
[2023-03-20 12:00:18] [INFO ] Deduced a trap composed of 23 places in 1244 ms of which 6 ms to minimize.
[2023-03-20 12:00:19] [INFO ] Deduced a trap composed of 39 places in 1305 ms of which 7 ms to minimize.
[2023-03-20 12:00:26] [INFO ] Deduced a trap composed of 26 places in 5956 ms of which 3 ms to minimize.
[2023-03-20 12:00:28] [INFO ] Deduced a trap composed of 37 places in 1812 ms of which 3 ms to minimize.
[2023-03-20 12:00:29] [INFO ] Deduced a trap composed of 30 places in 1103 ms of which 2 ms to minimize.
[2023-03-20 12:00:31] [INFO ] Deduced a trap composed of 22 places in 1598 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 12:00:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 12:00:31] [INFO ] After 25552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 224 ms.
Support contains 2 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions removed 1095 transitions
Trivial Post-agglo rules discarded 1095 transitions
Performed 1095 trivial Post agglomeration. Transition count delta: 1095
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1095 place count 3902 transition count 2807
Reduce places removed 1095 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2191 place count 2807 transition count 2806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2806 transition count 2806
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 800 Pre rules applied. Total rules applied 2192 place count 2806 transition count 2006
Deduced a syphon composed of 800 places in 6 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 3 with 1600 rules applied. Total rules applied 3792 place count 2006 transition count 2006
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 3793 place count 2005 transition count 2005
Iterating global reduction 3 with 1 rules applied. Total rules applied 3794 place count 2005 transition count 2005
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3794 place count 2005 transition count 2004
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3796 place count 2004 transition count 2004
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 0 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 3 with 1800 rules applied. Total rules applied 5596 place count 1104 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5597 place count 1104 transition count 1103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5599 place count 1103 transition count 1102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5801 place count 1002 transition count 1202
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6003 place count 901 transition count 1303
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6193 place count 806 transition count 1396
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6194 place count 806 transition count 1395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6195 place count 805 transition count 1394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6196 place count 804 transition count 1394
Applied a total of 6196 rules in 940 ms. Remains 804 /3902 variables (removed 3098) and now considering 1394/3902 (removed 2508) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 940 ms. Remains : 804/3902 places, 1394/3902 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Finished probabilistic random walk after 88314 steps, run visited all 2 properties in 2727 ms. (steps per millisecond=32 )
Probabilistic random walk after 88314 steps, saw 56621 distinct states, run finished after 2743 ms. (steps per millisecond=32 ) properties seen :2
Knowledge obtained : [(AND p2 p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (AND p2 p1))), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 2 factoid took 331 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 4 reset in 792 ms.
Product exploration explored 100000 steps with 1 reset in 995 ms.
Support contains 2 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 3901 transition count 3901
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3901 transition count 3901
Applied a total of 2 rules in 571 ms. Remains 3901 /3902 variables (removed 1) and now considering 3901/3902 (removed 1) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2023-03-20 12:00:39] [INFO ] Computed 401 place invariants in 11 ms
[2023-03-20 12:00:40] [INFO ] Implicit Places using invariants in 1052 ms returned []
[2023-03-20 12:00:40] [INFO ] Invariant cache hit.
[2023-03-20 12:00:41] [INFO ] Implicit Places using invariants and state equation in 1232 ms returned []
Implicit Place search using SMT with State Equation took 2288 ms to find 0 implicit places.
[2023-03-20 12:00:41] [INFO ] Invariant cache hit.
[2023-03-20 12:00:50] [INFO ] Dead Transitions using invariants and state equation in 8543 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3901/3902 places, 3901/3902 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11409 ms. Remains : 3901/3902 places, 3901/3902 transitions.
Treatment of property ShieldRVt-PT-100B-LTLFireability-00 finished in 98941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p1))||p0)))'
Support contains 3 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3901 transition count 3901
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3901 transition count 3901
Applied a total of 32 rules in 700 ms. Remains 3901 /3917 variables (removed 16) and now considering 3901/3917 (removed 16) transitions.
[2023-03-20 12:00:51] [INFO ] Invariant cache hit.
[2023-03-20 12:00:52] [INFO ] Implicit Places using invariants in 980 ms returned []
[2023-03-20 12:00:52] [INFO ] Invariant cache hit.
[2023-03-20 12:00:56] [INFO ] Implicit Places using invariants and state equation in 4643 ms returned []
Implicit Place search using SMT with State Equation took 5639 ms to find 0 implicit places.
[2023-03-20 12:00:57] [INFO ] Invariant cache hit.
[2023-03-20 12:01:00] [INFO ] Dead Transitions using invariants and state equation in 3296 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3901/3917 places, 3901/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9648 ms. Remains : 3901/3917 places, 3901/3917 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s2835 1) (EQ s138 1)), p1:(EQ s974 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 48324 steps with 0 reset in 456 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-01 finished in 10325 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 1 out of 3917 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1096 transitions
Trivial Post-agglo rules discarded 1096 transitions
Performed 1096 trivial Post agglomeration. Transition count delta: 1096
Iterating post reduction 0 with 1096 rules applied. Total rules applied 1096 place count 3916 transition count 2820
Reduce places removed 1096 places and 0 transitions.
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2192 place count 2820 transition count 2820
Performed 793 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 793 Pre rules applied. Total rules applied 2192 place count 2820 transition count 2027
Deduced a syphon composed of 793 places in 7 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 2 with 1586 rules applied. Total rules applied 3778 place count 2027 transition count 2027
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 3791 place count 2014 transition count 2014
Iterating global reduction 2 with 13 rules applied. Total rules applied 3804 place count 2014 transition count 2014
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 3804 place count 2014 transition count 2003
Deduced a syphon composed of 11 places in 6 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 3826 place count 2003 transition count 2003
Performed 898 Post agglomeration using F-continuation condition.Transition count delta: 898
Deduced a syphon composed of 898 places in 0 ms
Reduce places removed 898 places and 0 transitions.
Iterating global reduction 2 with 1796 rules applied. Total rules applied 5622 place count 1105 transition count 1105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5623 place count 1105 transition count 1104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5625 place count 1104 transition count 1103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5827 place count 1003 transition count 1203
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6029 place count 902 transition count 1304
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6223 place count 805 transition count 1401
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6225 place count 803 transition count 1399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6226 place count 802 transition count 1399
Applied a total of 6226 rules in 681 ms. Remains 802 /3917 variables (removed 3115) and now considering 1399/3917 (removed 2518) transitions.
// Phase 1: matrix 1399 rows 802 cols
[2023-03-20 12:01:01] [INFO ] Computed 400 place invariants in 3 ms
[2023-03-20 12:01:02] [INFO ] Implicit Places using invariants in 888 ms returned []
[2023-03-20 12:01:02] [INFO ] Invariant cache hit.
[2023-03-20 12:01:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 12:01:05] [INFO ] Implicit Places using invariants and state equation in 3243 ms returned []
Implicit Place search using SMT with State Equation took 4139 ms to find 0 implicit places.
[2023-03-20 12:01:05] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-20 12:01:05] [INFO ] Invariant cache hit.
[2023-03-20 12:01:06] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/3917 places, 1399/3917 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5659 ms. Remains : 802/3917 places, 1399/3917 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-02 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:(EQ s273 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-02 finished in 5820 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||G(p1)))))'
Support contains 2 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3903 transition count 3903
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3903 transition count 3903
Applied a total of 28 rules in 696 ms. Remains 3903 /3917 variables (removed 14) and now considering 3903/3917 (removed 14) transitions.
// Phase 1: matrix 3903 rows 3903 cols
[2023-03-20 12:01:07] [INFO ] Computed 401 place invariants in 11 ms
[2023-03-20 12:01:08] [INFO ] Implicit Places using invariants in 1064 ms returned []
[2023-03-20 12:01:08] [INFO ] Invariant cache hit.
[2023-03-20 12:01:16] [INFO ] Implicit Places using invariants and state equation in 7634 ms returned []
Implicit Place search using SMT with State Equation took 8705 ms to find 0 implicit places.
[2023-03-20 12:01:16] [INFO ] Invariant cache hit.
[2023-03-20 12:01:25] [INFO ] Dead Transitions using invariants and state equation in 9272 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3903/3917 places, 3903/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18681 ms. Remains : 3903/3917 places, 3903/3917 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s1501 1), p0:(EQ s241 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 51779 steps with 0 reset in 509 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-03 finished in 19341 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 1 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3902 transition count 3902
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3902 transition count 3902
Applied a total of 30 rules in 648 ms. Remains 3902 /3917 variables (removed 15) and now considering 3902/3917 (removed 15) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-20 12:01:26] [INFO ] Computed 401 place invariants in 19 ms
[2023-03-20 12:01:28] [INFO ] Implicit Places using invariants in 1536 ms returned []
[2023-03-20 12:01:28] [INFO ] Invariant cache hit.
[2023-03-20 12:01:34] [INFO ] Implicit Places using invariants and state equation in 6147 ms returned []
Implicit Place search using SMT with State Equation took 7693 ms to find 0 implicit places.
[2023-03-20 12:01:34] [INFO ] Invariant cache hit.
[2023-03-20 12:01:36] [INFO ] Dead Transitions using invariants and state equation in 2329 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3917 places, 3902/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10671 ms. Remains : 3902/3917 places, 3902/3917 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-04 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:(EQ s2861 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 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-04 finished in 10907 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)&&(X(p1) U ((!p2&&X(p1))||X(G(p1)))))))'
Support contains 4 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3905 transition count 3905
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3905 transition count 3905
Applied a total of 24 rules in 635 ms. Remains 3905 /3917 variables (removed 12) and now considering 3905/3917 (removed 12) transitions.
// Phase 1: matrix 3905 rows 3905 cols
[2023-03-20 12:01:37] [INFO ] Computed 401 place invariants in 10 ms
[2023-03-20 12:01:39] [INFO ] Implicit Places using invariants in 1466 ms returned []
[2023-03-20 12:01:39] [INFO ] Invariant cache hit.
[2023-03-20 12:01:40] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned []
Implicit Place search using SMT with State Equation took 3014 ms to find 0 implicit places.
[2023-03-20 12:01:40] [INFO ] Invariant cache hit.
[2023-03-20 12:01:42] [INFO ] Dead Transitions using invariants and state equation in 2281 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3905/3917 places, 3905/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5937 ms. Remains : 3905/3917 places, 3905/3917 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s3861 1), p2:(OR (AND (NEQ s3840 1) (NEQ s1525 1)) (EQ s1199 1)), p1:(NEQ s1199 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 125 reset in 835 ms.
Stack based approach found an accepted trace after 12482 steps with 14 reset with depth 2028 and stack size 2028 in 119 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-05 finished in 7185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3901 transition count 3901
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3901 transition count 3901
Applied a total of 32 rules in 681 ms. Remains 3901 /3917 variables (removed 16) and now considering 3901/3917 (removed 16) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2023-03-20 12:01:44] [INFO ] Computed 401 place invariants in 27 ms
[2023-03-20 12:01:46] [INFO ] Implicit Places using invariants in 1117 ms returned []
[2023-03-20 12:01:46] [INFO ] Invariant cache hit.
[2023-03-20 12:01:50] [INFO ] Implicit Places using invariants and state equation in 4263 ms returned []
Implicit Place search using SMT with State Equation took 5382 ms to find 0 implicit places.
[2023-03-20 12:01:50] [INFO ] Invariant cache hit.
[2023-03-20 12:01:52] [INFO ] Dead Transitions using invariants and state equation in 2187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3901/3917 places, 3901/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8254 ms. Remains : 3901/3917 places, 3901/3917 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s3390 1) (EQ s3404 1) (EQ s765 1) (EQ s1944 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-06 finished in 8427 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 2 out of 3917 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1096 transitions
Trivial Post-agglo rules discarded 1096 transitions
Performed 1096 trivial Post agglomeration. Transition count delta: 1096
Iterating post reduction 0 with 1096 rules applied. Total rules applied 1096 place count 3916 transition count 2820
Reduce places removed 1096 places and 0 transitions.
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2192 place count 2820 transition count 2820
Performed 791 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 791 Pre rules applied. Total rules applied 2192 place count 2820 transition count 2029
Deduced a syphon composed of 791 places in 7 ms
Reduce places removed 791 places and 0 transitions.
Iterating global reduction 2 with 1582 rules applied. Total rules applied 3774 place count 2029 transition count 2029
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 3787 place count 2016 transition count 2016
Iterating global reduction 2 with 13 rules applied. Total rules applied 3800 place count 2016 transition count 2016
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 3800 place count 2016 transition count 2005
Deduced a syphon composed of 11 places in 7 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 3822 place count 2005 transition count 2005
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 0 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 2 with 1800 rules applied. Total rules applied 5622 place count 1105 transition count 1105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5623 place count 1105 transition count 1104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5625 place count 1104 transition count 1103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5827 place count 1003 transition count 1203
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6029 place count 902 transition count 1304
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6223 place count 805 transition count 1401
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6225 place count 803 transition count 1399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6226 place count 802 transition count 1399
Applied a total of 6226 rules in 922 ms. Remains 802 /3917 variables (removed 3115) and now considering 1399/3917 (removed 2518) transitions.
// Phase 1: matrix 1399 rows 802 cols
[2023-03-20 12:01:53] [INFO ] Computed 400 place invariants in 2 ms
[2023-03-20 12:01:54] [INFO ] Implicit Places using invariants in 816 ms returned []
[2023-03-20 12:01:54] [INFO ] Invariant cache hit.
[2023-03-20 12:01:55] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 1941 ms to find 0 implicit places.
[2023-03-20 12:01:55] [INFO ] Redundant transitions in 115 ms returned []
[2023-03-20 12:01:55] [INFO ] Invariant cache hit.
[2023-03-20 12:01:56] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/3917 places, 1399/3917 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4160 ms. Remains : 802/3917 places, 1399/3917 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s422 1) (EQ s426 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-07 finished in 4275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 3917 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1096 transitions
Trivial Post-agglo rules discarded 1096 transitions
Performed 1096 trivial Post agglomeration. Transition count delta: 1096
Iterating post reduction 0 with 1096 rules applied. Total rules applied 1096 place count 3916 transition count 2820
Reduce places removed 1096 places and 0 transitions.
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2192 place count 2820 transition count 2820
Performed 791 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 791 Pre rules applied. Total rules applied 2192 place count 2820 transition count 2029
Deduced a syphon composed of 791 places in 7 ms
Reduce places removed 791 places and 0 transitions.
Iterating global reduction 2 with 1582 rules applied. Total rules applied 3774 place count 2029 transition count 2029
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 3787 place count 2016 transition count 2016
Iterating global reduction 2 with 13 rules applied. Total rules applied 3800 place count 2016 transition count 2016
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 3800 place count 2016 transition count 2005
Deduced a syphon composed of 11 places in 6 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 3822 place count 2005 transition count 2005
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 1 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 5620 place count 1106 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5621 place count 1106 transition count 1105
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5623 place count 1105 transition count 1104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5825 place count 1004 transition count 1204
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6027 place count 903 transition count 1304
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 6219 place count 807 transition count 1400
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6221 place count 805 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6222 place count 804 transition count 1398
Applied a total of 6222 rules in 941 ms. Remains 804 /3917 variables (removed 3113) and now considering 1398/3917 (removed 2519) transitions.
// Phase 1: matrix 1398 rows 804 cols
[2023-03-20 12:01:57] [INFO ] Computed 400 place invariants in 7 ms
[2023-03-20 12:01:58] [INFO ] Implicit Places using invariants in 845 ms returned []
[2023-03-20 12:01:58] [INFO ] Invariant cache hit.
[2023-03-20 12:01:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-20 12:02:00] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 2305 ms to find 0 implicit places.
[2023-03-20 12:02:00] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-20 12:02:00] [INFO ] Invariant cache hit.
[2023-03-20 12:02:01] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 804/3917 places, 1398/3917 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4199 ms. Remains : 804/3917 places, 1398/3917 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s485 1), p0:(EQ s113 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 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-08 finished in 4358 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 1 out of 3917 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1097 transitions
Trivial Post-agglo rules discarded 1097 transitions
Performed 1097 trivial Post agglomeration. Transition count delta: 1097
Iterating post reduction 0 with 1097 rules applied. Total rules applied 1097 place count 3916 transition count 2819
Reduce places removed 1097 places and 0 transitions.
Iterating post reduction 1 with 1097 rules applied. Total rules applied 2194 place count 2819 transition count 2819
Performed 792 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 792 Pre rules applied. Total rules applied 2194 place count 2819 transition count 2027
Deduced a syphon composed of 792 places in 6 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 2 with 1584 rules applied. Total rules applied 3778 place count 2027 transition count 2027
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 3790 place count 2015 transition count 2015
Iterating global reduction 2 with 12 rules applied. Total rules applied 3802 place count 2015 transition count 2015
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 3802 place count 2015 transition count 2005
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3822 place count 2005 transition count 2005
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 0 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 2 with 1802 rules applied. Total rules applied 5624 place count 1104 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5625 place count 1104 transition count 1103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5627 place count 1103 transition count 1102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5829 place count 1002 transition count 1202
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6031 place count 901 transition count 1303
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6225 place count 804 transition count 1400
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6227 place count 802 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6228 place count 801 transition count 1398
Applied a total of 6228 rules in 718 ms. Remains 801 /3917 variables (removed 3116) and now considering 1398/3917 (removed 2519) transitions.
// Phase 1: matrix 1398 rows 801 cols
[2023-03-20 12:02:02] [INFO ] Computed 400 place invariants in 2 ms
[2023-03-20 12:02:02] [INFO ] Implicit Places using invariants in 960 ms returned []
[2023-03-20 12:02:02] [INFO ] Invariant cache hit.
[2023-03-20 12:02:04] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2798 ms to find 0 implicit places.
[2023-03-20 12:02:04] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-20 12:02:04] [INFO ] Invariant cache hit.
[2023-03-20 12:02:05] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/3917 places, 1398/3917 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4430 ms. Remains : 801/3917 places, 1398/3917 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s576 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 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-09 finished in 4509 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 1 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3902 transition count 3902
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3902 transition count 3902
Applied a total of 30 rules in 683 ms. Remains 3902 /3917 variables (removed 15) and now considering 3902/3917 (removed 15) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-20 12:02:06] [INFO ] Computed 401 place invariants in 20 ms
[2023-03-20 12:02:07] [INFO ] Implicit Places using invariants in 1218 ms returned []
[2023-03-20 12:02:07] [INFO ] Invariant cache hit.
[2023-03-20 12:02:10] [INFO ] Implicit Places using invariants and state equation in 2545 ms returned []
Implicit Place search using SMT with State Equation took 3766 ms to find 0 implicit places.
[2023-03-20 12:02:10] [INFO ] Invariant cache hit.
[2023-03-20 12:02:12] [INFO ] Dead Transitions using invariants and state equation in 2522 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3917 places, 3902/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6974 ms. Remains : 3902/3917 places, 3902/3917 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-10 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:(EQ s642 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 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-10 finished in 7210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0 U (G(!p1)||G(p2))))))'
Support contains 5 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3902 transition count 3902
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3902 transition count 3902
Applied a total of 30 rules in 738 ms. Remains 3902 /3917 variables (removed 15) and now considering 3902/3917 (removed 15) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-20 12:02:13] [INFO ] Computed 401 place invariants in 20 ms
[2023-03-20 12:02:14] [INFO ] Implicit Places using invariants in 1223 ms returned []
[2023-03-20 12:02:15] [INFO ] Invariant cache hit.
[2023-03-20 12:02:19] [INFO ] Implicit Places using invariants and state equation in 4662 ms returned []
Implicit Place search using SMT with State Equation took 5891 ms to find 0 implicit places.
[2023-03-20 12:02:19] [INFO ] Invariant cache hit.
[2023-03-20 12:02:21] [INFO ] Dead Transitions using invariants and state equation in 2264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3917 places, 3902/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8897 ms. Remains : 3902/3917 places, 3902/3917 transitions.
Stuttering acceptance computed with spot in 309 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s1262 1) (EQ s1276 1)), p2:(EQ s251 1), p0:(OR (EQ s1390 1) (EQ s2106 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 1029 ms.
Product exploration explored 100000 steps with 4 reset in 1348 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 626 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 621 ms. (steps per millisecond=16 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 83514 steps, run timeout after 3005 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83514 steps, saw 82325 distinct states, run finished after 3007 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-20 12:02:30] [INFO ] Invariant cache hit.
[2023-03-20 12:02:31] [INFO ] [Real]Absence check using 401 positive place invariants in 297 ms returned sat
[2023-03-20 12:02:32] [INFO ] After 1850ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 12:02:33] [INFO ] [Nat]Absence check using 401 positive place invariants in 253 ms returned sat
[2023-03-20 12:02:41] [INFO ] After 7189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-20 12:02:43] [INFO ] Deduced a trap composed of 25 places in 1032 ms of which 3 ms to minimize.
[2023-03-20 12:02:44] [INFO ] Deduced a trap composed of 33 places in 972 ms of which 4 ms to minimize.
[2023-03-20 12:02:45] [INFO ] Deduced a trap composed of 32 places in 957 ms of which 2 ms to minimize.
[2023-03-20 12:02:46] [INFO ] Deduced a trap composed of 25 places in 965 ms of which 2 ms to minimize.
[2023-03-20 12:02:47] [INFO ] Deduced a trap composed of 35 places in 1308 ms of which 3 ms to minimize.
[2023-03-20 12:02:49] [INFO ] Deduced a trap composed of 36 places in 1326 ms of which 3 ms to minimize.
[2023-03-20 12:02:51] [INFO ] Deduced a trap composed of 65 places in 1429 ms of which 17 ms to minimize.
[2023-03-20 12:02:52] [INFO ] Deduced a trap composed of 74 places in 1141 ms of which 4 ms to minimize.
[2023-03-20 12:02:53] [INFO ] Deduced a trap composed of 59 places in 1150 ms of which 2 ms to minimize.
[2023-03-20 12:02:54] [INFO ] Deduced a trap composed of 56 places in 807 ms of which 1 ms to minimize.
[2023-03-20 12:02:55] [INFO ] Deduced a trap composed of 104 places in 984 ms of which 1 ms to minimize.
[2023-03-20 12:02:56] [INFO ] Deduced a trap composed of 60 places in 894 ms of which 1 ms to minimize.
[2023-03-20 12:03:01] [INFO ] Deduced a trap composed of 13 places in 4098 ms of which 6 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 12:03:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 12:03:01] [INFO ] After 29155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 2219 ms.
Support contains 5 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions removed 1095 transitions
Trivial Post-agglo rules discarded 1095 transitions
Performed 1095 trivial Post agglomeration. Transition count delta: 1095
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1095 place count 3902 transition count 2807
Reduce places removed 1095 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2191 place count 2807 transition count 2806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2806 transition count 2806
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 798 Pre rules applied. Total rules applied 2192 place count 2806 transition count 2008
Deduced a syphon composed of 798 places in 7 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 3 with 1596 rules applied. Total rules applied 3788 place count 2008 transition count 2008
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 1 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 5590 place count 1107 transition count 1107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5591 place count 1107 transition count 1106
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5593 place count 1106 transition count 1105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5795 place count 1005 transition count 1205
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5997 place count 904 transition count 1305
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6187 place count 809 transition count 1399
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6188 place count 809 transition count 1398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6189 place count 808 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6190 place count 807 transition count 1397
Applied a total of 6190 rules in 1605 ms. Remains 807 /3902 variables (removed 3095) and now considering 1397/3902 (removed 2505) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1605 ms. Remains : 807/3902 places, 1397/3902 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 103385 steps, run timeout after 6012 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 103385 steps, saw 63325 distinct states, run finished after 6013 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 1397 rows 807 cols
[2023-03-20 12:03:13] [INFO ] Computed 400 place invariants in 3 ms
[2023-03-20 12:03:13] [INFO ] [Real]Absence check using 400 positive place invariants in 53 ms returned sat
[2023-03-20 12:03:13] [INFO ] After 349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 12:03:14] [INFO ] [Nat]Absence check using 400 positive place invariants in 50 ms returned sat
[2023-03-20 12:03:15] [INFO ] After 830ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-20 12:03:15] [INFO ] After 1627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 544 ms.
[2023-03-20 12:03:16] [INFO ] After 2554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 5870 ms.
Support contains 5 out of 807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1397/1397 transitions.
Applied a total of 0 rules in 25 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 807/807 places, 1397/1397 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1397/1397 transitions.
Applied a total of 0 rules in 24 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2023-03-20 12:03:22] [INFO ] Invariant cache hit.
[2023-03-20 12:03:22] [INFO ] Implicit Places using invariants in 641 ms returned []
[2023-03-20 12:03:22] [INFO ] Invariant cache hit.
[2023-03-20 12:03:24] [INFO ] Implicit Places using invariants and state equation in 1832 ms returned []
Implicit Place search using SMT with State Equation took 2493 ms to find 0 implicit places.
[2023-03-20 12:03:24] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-20 12:03:24] [INFO ] Invariant cache hit.
[2023-03-20 12:03:25] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3438 ms. Remains : 807/807 places, 1397/1397 transitions.
Graph (trivial) has 396 edges and 807 vertex of which 4 / 807 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2790 edges and 805 vertex of which 803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 393 edges and 801 vertex of which 4 / 801 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 799 transition count 1388
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 392 edges and 797 vertex of which 6 / 797 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 794 transition count 1379
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 390 edges and 791 vertex of which 8 / 791 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 787 transition count 1368
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 386 edges and 783 vertex of which 8 / 783 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 779 transition count 1354
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 382 edges and 775 vertex of which 8 / 775 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 771 transition count 1340
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 378 edges and 767 vertex of which 8 / 767 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 763 transition count 1326
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 374 edges and 759 vertex of which 8 / 759 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 755 transition count 1312
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 370 edges and 751 vertex of which 8 / 751 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 747 transition count 1298
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 366 edges and 743 vertex of which 8 / 743 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 739 transition count 1284
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 362 edges and 735 vertex of which 8 / 735 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 731 transition count 1270
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 358 edges and 727 vertex of which 8 / 727 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 723 transition count 1256
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 354 edges and 719 vertex of which 8 / 719 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 715 transition count 1242
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 350 edges and 711 vertex of which 8 / 711 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 707 transition count 1228
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 346 edges and 703 vertex of which 8 / 703 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 699 transition count 1214
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 342 edges and 695 vertex of which 8 / 695 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 691 transition count 1200
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 338 edges and 687 vertex of which 8 / 687 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 683 transition count 1186
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 334 edges and 679 vertex of which 8 / 679 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 675 transition count 1172
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 330 edges and 671 vertex of which 8 / 671 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 667 transition count 1158
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 326 edges and 663 vertex of which 8 / 663 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 659 transition count 1144
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 322 edges and 655 vertex of which 8 / 655 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 651 transition count 1130
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 318 edges and 647 vertex of which 8 / 647 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 643 transition count 1116
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 314 edges and 639 vertex of which 8 / 639 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 635 transition count 1102
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 310 edges and 631 vertex of which 8 / 631 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 627 transition count 1088
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 306 edges and 623 vertex of which 8 / 623 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 619 transition count 1074
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 302 edges and 615 vertex of which 8 / 615 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 611 transition count 1060
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 298 edges and 607 vertex of which 8 / 607 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 603 transition count 1046
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 294 edges and 599 vertex of which 8 / 599 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 595 transition count 1032
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 290 edges and 591 vertex of which 8 / 591 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 587 transition count 1018
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 286 edges and 583 vertex of which 8 / 583 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 579 transition count 1004
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 282 edges and 575 vertex of which 8 / 575 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 571 transition count 990
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 278 edges and 567 vertex of which 8 / 567 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 563 transition count 976
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 274 edges and 559 vertex of which 8 / 559 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 586 place count 555 transition count 962
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 270 edges and 551 vertex of which 8 / 551 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 605 place count 547 transition count 948
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 266 edges and 543 vertex of which 8 / 543 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 624 place count 539 transition count 934
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 262 edges and 535 vertex of which 8 / 535 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 643 place count 531 transition count 920
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 258 edges and 527 vertex of which 8 / 527 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 662 place count 523 transition count 906
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 254 edges and 519 vertex of which 8 / 519 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 681 place count 515 transition count 892
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 250 edges and 511 vertex of which 8 / 511 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 700 place count 507 transition count 878
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 246 edges and 503 vertex of which 8 / 503 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 719 place count 499 transition count 864
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 242 edges and 495 vertex of which 8 / 495 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 738 place count 491 transition count 850
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 238 edges and 487 vertex of which 8 / 487 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 757 place count 483 transition count 836
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 234 edges and 479 vertex of which 8 / 479 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 776 place count 475 transition count 822
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 230 edges and 471 vertex of which 8 / 471 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 795 place count 467 transition count 808
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 226 edges and 463 vertex of which 8 / 463 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 814 place count 459 transition count 794
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 222 edges and 455 vertex of which 8 / 455 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 833 place count 451 transition count 780
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 218 edges and 447 vertex of which 6 / 447 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 852 place count 444 transition count 766
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 214 edges and 441 vertex of which 4 / 441 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 46 with 14 rules applied. Total rules applied 866 place count 439 transition count 756
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 211 edges and 437 vertex of which 2 / 437 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 47 with 9 rules applied. Total rules applied 875 place count 436 transition count 750
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 48 with 5 rules applied. Total rules applied 880 place count 435 transition count 746
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 49 with 1 Pre rules applied. Total rules applied 880 place count 435 transition count 745
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 49 with 3 rules applied. Total rules applied 883 place count 433 transition count 745
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 49 with 3 rules applied. Total rules applied 886 place count 431 transition count 744
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 49 with 3 rules applied. Total rules applied 889 place count 431 transition count 741
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 50 with 2 rules applied. Total rules applied 891 place count 431 transition count 739
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 50 with 1 rules applied. Total rules applied 892 place count 431 transition count 739
Applied a total of 892 rules in 311 ms. Remains 431 /807 variables (removed 376) and now considering 739/1397 (removed 658) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 739 rows 431 cols
[2023-03-20 12:03:26] [INFO ] Computed 212 place invariants in 1 ms
[2023-03-20 12:03:26] [INFO ] [Real]Absence check using 212 positive place invariants in 24 ms returned sat
[2023-03-20 12:03:26] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 12:03:26] [INFO ] [Nat]Absence check using 212 positive place invariants in 25 ms returned sat
[2023-03-20 12:03:27] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-20 12:03:27] [INFO ] After 918ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 246 ms.
[2023-03-20 12:03:27] [INFO ] After 1421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 842 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 261 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Support contains 5 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 317 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-20 12:03:29] [INFO ] Computed 401 place invariants in 24 ms
[2023-03-20 12:03:30] [INFO ] Implicit Places using invariants in 890 ms returned []
[2023-03-20 12:03:30] [INFO ] Invariant cache hit.
[2023-03-20 12:03:34] [INFO ] Implicit Places using invariants and state equation in 4467 ms returned []
Implicit Place search using SMT with State Equation took 5357 ms to find 0 implicit places.
[2023-03-20 12:03:34] [INFO ] Invariant cache hit.
[2023-03-20 12:03:37] [INFO ] Dead Transitions using invariants and state equation in 2275 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7952 ms. Remains : 3902/3902 places, 3902/3902 transitions.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 417 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 80647 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80647 steps, saw 79524 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-20 12:03:42] [INFO ] Invariant cache hit.
[2023-03-20 12:03:43] [INFO ] [Real]Absence check using 401 positive place invariants in 202 ms returned sat
[2023-03-20 12:03:43] [INFO ] After 1365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 12:03:44] [INFO ] [Nat]Absence check using 401 positive place invariants in 205 ms returned sat
[2023-03-20 12:03:50] [INFO ] After 5345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-20 12:03:51] [INFO ] Deduced a trap composed of 25 places in 984 ms of which 1 ms to minimize.
[2023-03-20 12:03:53] [INFO ] Deduced a trap composed of 33 places in 1277 ms of which 3 ms to minimize.
[2023-03-20 12:03:54] [INFO ] Deduced a trap composed of 32 places in 1456 ms of which 4 ms to minimize.
[2023-03-20 12:03:56] [INFO ] Deduced a trap composed of 25 places in 1453 ms of which 2 ms to minimize.
[2023-03-20 12:03:58] [INFO ] Deduced a trap composed of 35 places in 1445 ms of which 3 ms to minimize.
[2023-03-20 12:03:58] [INFO ] Deduced a trap composed of 36 places in 774 ms of which 1 ms to minimize.
[2023-03-20 12:03:59] [INFO ] Deduced a trap composed of 65 places in 783 ms of which 2 ms to minimize.
[2023-03-20 12:04:01] [INFO ] Deduced a trap composed of 74 places in 1286 ms of which 3 ms to minimize.
[2023-03-20 12:04:02] [INFO ] Deduced a trap composed of 59 places in 992 ms of which 2 ms to minimize.
[2023-03-20 12:04:03] [INFO ] Deduced a trap composed of 56 places in 755 ms of which 2 ms to minimize.
[2023-03-20 12:04:04] [INFO ] Deduced a trap composed of 104 places in 739 ms of which 3 ms to minimize.
[2023-03-20 12:04:05] [INFO ] Deduced a trap composed of 60 places in 1275 ms of which 9 ms to minimize.
[2023-03-20 12:04:06] [INFO ] Deduced a trap composed of 68 places in 704 ms of which 1 ms to minimize.
[2023-03-20 12:04:07] [INFO ] Deduced a trap composed of 67 places in 740 ms of which 14 ms to minimize.
[2023-03-20 12:04:08] [INFO ] Deduced a trap composed of 75 places in 730 ms of which 11 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 12:04:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 12:04:08] [INFO ] After 25091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 1679 ms.
Support contains 5 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions removed 1095 transitions
Trivial Post-agglo rules discarded 1095 transitions
Performed 1095 trivial Post agglomeration. Transition count delta: 1095
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1095 place count 3902 transition count 2807
Reduce places removed 1095 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2191 place count 2807 transition count 2806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2806 transition count 2806
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 798 Pre rules applied. Total rules applied 2192 place count 2806 transition count 2008
Deduced a syphon composed of 798 places in 8 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 3 with 1596 rules applied. Total rules applied 3788 place count 2008 transition count 2008
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 0 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 5590 place count 1107 transition count 1107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5591 place count 1107 transition count 1106
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5593 place count 1106 transition count 1105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5795 place count 1005 transition count 1205
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5997 place count 904 transition count 1305
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6187 place count 809 transition count 1399
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6188 place count 809 transition count 1398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6189 place count 808 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6190 place count 807 transition count 1397
Applied a total of 6190 rules in 545 ms. Remains 807 /3902 variables (removed 3095) and now considering 1397/3902 (removed 2505) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 546 ms. Remains : 807/3902 places, 1397/3902 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 56228 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56228 steps, saw 34729 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 1397 rows 807 cols
[2023-03-20 12:04:15] [INFO ] Computed 400 place invariants in 2 ms
[2023-03-20 12:04:15] [INFO ] [Real]Absence check using 400 positive place invariants in 52 ms returned sat
[2023-03-20 12:04:15] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 12:04:16] [INFO ] [Nat]Absence check using 400 positive place invariants in 51 ms returned sat
[2023-03-20 12:04:17] [INFO ] After 816ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-20 12:04:17] [INFO ] After 1560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 508 ms.
[2023-03-20 12:04:18] [INFO ] After 2529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 3977 ms.
Support contains 5 out of 807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1397/1397 transitions.
Applied a total of 0 rules in 34 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 807/807 places, 1397/1397 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1397/1397 transitions.
Applied a total of 0 rules in 22 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2023-03-20 12:04:22] [INFO ] Invariant cache hit.
[2023-03-20 12:04:23] [INFO ] Implicit Places using invariants in 798 ms returned []
[2023-03-20 12:04:23] [INFO ] Invariant cache hit.
[2023-03-20 12:04:24] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 1964 ms to find 0 implicit places.
[2023-03-20 12:04:24] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-20 12:04:24] [INFO ] Invariant cache hit.
[2023-03-20 12:04:25] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2669 ms. Remains : 807/807 places, 1397/1397 transitions.
Graph (trivial) has 396 edges and 807 vertex of which 4 / 807 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2790 edges and 805 vertex of which 803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 393 edges and 801 vertex of which 4 / 801 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 799 transition count 1388
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 392 edges and 797 vertex of which 6 / 797 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 794 transition count 1379
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 390 edges and 791 vertex of which 8 / 791 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 787 transition count 1368
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 386 edges and 783 vertex of which 8 / 783 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 779 transition count 1354
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 382 edges and 775 vertex of which 8 / 775 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 771 transition count 1340
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 378 edges and 767 vertex of which 8 / 767 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 763 transition count 1326
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 374 edges and 759 vertex of which 8 / 759 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 755 transition count 1312
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 370 edges and 751 vertex of which 8 / 751 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 747 transition count 1298
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 366 edges and 743 vertex of which 8 / 743 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 739 transition count 1284
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 362 edges and 735 vertex of which 8 / 735 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 731 transition count 1270
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 358 edges and 727 vertex of which 8 / 727 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 723 transition count 1256
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 354 edges and 719 vertex of which 8 / 719 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 715 transition count 1242
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 350 edges and 711 vertex of which 8 / 711 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 707 transition count 1228
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 346 edges and 703 vertex of which 8 / 703 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 699 transition count 1214
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 342 edges and 695 vertex of which 8 / 695 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 691 transition count 1200
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 338 edges and 687 vertex of which 8 / 687 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 683 transition count 1186
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 334 edges and 679 vertex of which 8 / 679 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 675 transition count 1172
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 330 edges and 671 vertex of which 8 / 671 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 667 transition count 1158
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 326 edges and 663 vertex of which 8 / 663 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 659 transition count 1144
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 322 edges and 655 vertex of which 8 / 655 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 651 transition count 1130
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 318 edges and 647 vertex of which 8 / 647 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 643 transition count 1116
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 314 edges and 639 vertex of which 8 / 639 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 635 transition count 1102
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 310 edges and 631 vertex of which 8 / 631 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 627 transition count 1088
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 306 edges and 623 vertex of which 8 / 623 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 619 transition count 1074
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 302 edges and 615 vertex of which 8 / 615 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 611 transition count 1060
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 298 edges and 607 vertex of which 8 / 607 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 603 transition count 1046
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 294 edges and 599 vertex of which 8 / 599 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 595 transition count 1032
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 290 edges and 591 vertex of which 8 / 591 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 587 transition count 1018
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 286 edges and 583 vertex of which 8 / 583 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 579 transition count 1004
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 282 edges and 575 vertex of which 8 / 575 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 571 transition count 990
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 278 edges and 567 vertex of which 8 / 567 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 563 transition count 976
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 274 edges and 559 vertex of which 8 / 559 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 586 place count 555 transition count 962
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 270 edges and 551 vertex of which 8 / 551 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 605 place count 547 transition count 948
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 266 edges and 543 vertex of which 8 / 543 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 624 place count 539 transition count 934
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 262 edges and 535 vertex of which 8 / 535 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 643 place count 531 transition count 920
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 258 edges and 527 vertex of which 8 / 527 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 662 place count 523 transition count 906
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 254 edges and 519 vertex of which 8 / 519 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 681 place count 515 transition count 892
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 250 edges and 511 vertex of which 8 / 511 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 700 place count 507 transition count 878
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 246 edges and 503 vertex of which 8 / 503 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 719 place count 499 transition count 864
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 242 edges and 495 vertex of which 8 / 495 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 738 place count 491 transition count 850
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 238 edges and 487 vertex of which 8 / 487 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 757 place count 483 transition count 836
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 234 edges and 479 vertex of which 8 / 479 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 776 place count 475 transition count 822
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 230 edges and 471 vertex of which 8 / 471 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 795 place count 467 transition count 808
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 226 edges and 463 vertex of which 8 / 463 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 814 place count 459 transition count 794
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 222 edges and 455 vertex of which 8 / 455 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 833 place count 451 transition count 780
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 218 edges and 447 vertex of which 6 / 447 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 852 place count 444 transition count 766
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 214 edges and 441 vertex of which 4 / 441 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 46 with 14 rules applied. Total rules applied 866 place count 439 transition count 756
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 211 edges and 437 vertex of which 2 / 437 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 47 with 9 rules applied. Total rules applied 875 place count 436 transition count 750
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 48 with 5 rules applied. Total rules applied 880 place count 435 transition count 746
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 49 with 1 Pre rules applied. Total rules applied 880 place count 435 transition count 745
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 49 with 3 rules applied. Total rules applied 883 place count 433 transition count 745
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 49 with 3 rules applied. Total rules applied 886 place count 431 transition count 744
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 49 with 3 rules applied. Total rules applied 889 place count 431 transition count 741
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 50 with 2 rules applied. Total rules applied 891 place count 431 transition count 739
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 50 with 1 rules applied. Total rules applied 892 place count 431 transition count 739
Applied a total of 892 rules in 239 ms. Remains 431 /807 variables (removed 376) and now considering 739/1397 (removed 658) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 739 rows 431 cols
[2023-03-20 12:04:25] [INFO ] Computed 212 place invariants in 2 ms
[2023-03-20 12:04:25] [INFO ] [Real]Absence check using 212 positive place invariants in 42 ms returned sat
[2023-03-20 12:04:25] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 12:04:25] [INFO ] [Nat]Absence check using 212 positive place invariants in 29 ms returned sat
[2023-03-20 12:04:26] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-20 12:04:26] [INFO ] After 911ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 299 ms.
[2023-03-20 12:04:27] [INFO ] After 1497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 405 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 235 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 256 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 2 reset in 1133 ms.
Product exploration explored 100000 steps with 1 reset in 1201 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 328 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Support contains 5 out of 3902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Performed 1096 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1096 rules applied. Total rules applied 1096 place count 3902 transition count 3902
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 400 Pre rules applied. Total rules applied 1096 place count 3902 transition count 4302
Deduced a syphon composed of 1496 places in 15 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 1496 place count 3902 transition count 4302
Performed 1200 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2696 places in 15 ms
Iterating global reduction 1 with 1200 rules applied. Total rules applied 2696 place count 3902 transition count 4303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2697 place count 3902 transition count 4302
Renaming transitions due to excessive name length > 1024 char.
Discarding 800 places :
Symmetric choice reduction at 2 with 800 rule applications. Total rules 3497 place count 3102 transition count 3501
Deduced a syphon composed of 1896 places in 9 ms
Iterating global reduction 2 with 800 rules applied. Total rules applied 4297 place count 3102 transition count 3501
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1897 places in 7 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 4298 place count 3102 transition count 3501
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4300 place count 3100 transition count 3499
Deduced a syphon composed of 1895 places in 10 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 4302 place count 3100 transition count 3499
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -725
Deduced a syphon composed of 1996 places in 9 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4403 place count 3100 transition count 4224
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4504 place count 2999 transition count 4022
Deduced a syphon composed of 1895 places in 8 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4605 place count 2999 transition count 4022
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -743
Deduced a syphon composed of 1996 places in 9 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4706 place count 2999 transition count 4765
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4807 place count 2898 transition count 4563
Deduced a syphon composed of 1895 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4908 place count 2898 transition count 4563
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -721
Deduced a syphon composed of 1996 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5009 place count 2898 transition count 5284
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5110 place count 2797 transition count 5082
Deduced a syphon composed of 1895 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5211 place count 2797 transition count 5082
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: -674
Deduced a syphon composed of 1988 places in 1 ms
Iterating global reduction 2 with 93 rules applied. Total rules applied 5304 place count 2797 transition count 5756
Discarding 93 places :
Symmetric choice reduction at 2 with 93 rule applications. Total rules 5397 place count 2704 transition count 5570
Deduced a syphon composed of 1895 places in 1 ms
Iterating global reduction 2 with 93 rules applied. Total rules applied 5490 place count 2704 transition count 5570
Deduced a syphon composed of 1895 places in 2 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 5493 place count 2704 transition count 5567
Deduced a syphon composed of 1895 places in 1 ms
Applied a total of 5493 rules in 5482 ms. Remains 2704 /3902 variables (removed 1198) and now considering 5567/3902 (removed -1665) transitions.
[2023-03-20 12:04:36] [INFO ] Redundant transitions in 396 ms returned []
// Phase 1: matrix 5567 rows 2704 cols
[2023-03-20 12:04:37] [INFO ] Computed 401 place invariants in 109 ms
[2023-03-20 12:04:40] [INFO ] Dead Transitions using invariants and state equation in 3089 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2704/3902 places, 5567/3902 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8990 ms. Remains : 2704/3902 places, 5567/3902 transitions.
Support contains 5 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 324 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-20 12:04:40] [INFO ] Computed 401 place invariants in 23 ms
[2023-03-20 12:04:41] [INFO ] Implicit Places using invariants in 911 ms returned []
[2023-03-20 12:04:41] [INFO ] Invariant cache hit.
[2023-03-20 12:04:42] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 2540 ms to find 0 implicit places.
[2023-03-20 12:04:42] [INFO ] Invariant cache hit.
[2023-03-20 12:04:45] [INFO ] Dead Transitions using invariants and state equation in 2876 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5748 ms. Remains : 3902/3902 places, 3902/3902 transitions.
Treatment of property ShieldRVt-PT-100B-LTLFireability-11 finished in 152998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(p1))))))'
Support contains 1 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3902 transition count 3902
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3902 transition count 3902
Applied a total of 30 rules in 683 ms. Remains 3902 /3917 variables (removed 15) and now considering 3902/3917 (removed 15) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-20 12:04:46] [INFO ] Computed 401 place invariants in 13 ms
[2023-03-20 12:04:47] [INFO ] Implicit Places using invariants in 1049 ms returned []
[2023-03-20 12:04:47] [INFO ] Invariant cache hit.
[2023-03-20 12:04:49] [INFO ] Implicit Places using invariants and state equation in 1367 ms returned []
Implicit Place search using SMT with State Equation took 2418 ms to find 0 implicit places.
[2023-03-20 12:04:49] [INFO ] Invariant cache hit.
[2023-03-20 12:04:51] [INFO ] Dead Transitions using invariants and state equation in 2161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3917 places, 3902/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5276 ms. Remains : 3902/3917 places, 3902/3917 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s2681 1), p1:(EQ s2681 0)], 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]]
Product exploration explored 100000 steps with 20011 reset in 1401 ms.
Product exploration explored 100000 steps with 19966 reset in 1419 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 184754 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 184754 steps, saw 173867 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 12:04:58] [INFO ] Invariant cache hit.
[2023-03-20 12:04:58] [INFO ] [Real]Absence check using 401 positive place invariants in 206 ms returned sat
[2023-03-20 12:05:01] [INFO ] After 3480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:05:02] [INFO ] [Nat]Absence check using 401 positive place invariants in 218 ms returned sat
[2023-03-20 12:05:05] [INFO ] After 2643ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 12:05:06] [INFO ] Deduced a trap composed of 34 places in 1187 ms of which 2 ms to minimize.
[2023-03-20 12:05:07] [INFO ] Deduced a trap composed of 31 places in 1042 ms of which 2 ms to minimize.
[2023-03-20 12:05:08] [INFO ] Deduced a trap composed of 31 places in 1202 ms of which 2 ms to minimize.
[2023-03-20 12:05:10] [INFO ] Deduced a trap composed of 25 places in 1134 ms of which 2 ms to minimize.
[2023-03-20 12:05:11] [INFO ] Deduced a trap composed of 32 places in 1468 ms of which 5 ms to minimize.
[2023-03-20 12:05:13] [INFO ] Deduced a trap composed of 54 places in 1870 ms of which 3 ms to minimize.
[2023-03-20 12:05:15] [INFO ] Deduced a trap composed of 25 places in 1794 ms of which 3 ms to minimize.
[2023-03-20 12:05:17] [INFO ] Deduced a trap composed of 38 places in 1822 ms of which 4 ms to minimize.
[2023-03-20 12:05:19] [INFO ] Deduced a trap composed of 32 places in 1778 ms of which 3 ms to minimize.
[2023-03-20 12:05:21] [INFO ] Deduced a trap composed of 23 places in 1694 ms of which 3 ms to minimize.
[2023-03-20 12:05:23] [INFO ] Deduced a trap composed of 44 places in 1577 ms of which 6 ms to minimize.
[2023-03-20 12:05:25] [INFO ] Deduced a trap composed of 44 places in 1661 ms of which 3 ms to minimize.
[2023-03-20 12:05:26] [INFO ] Deduced a trap composed of 52 places in 1629 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 12:05:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 12:05:26] [INFO ] After 25196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 189 ms.
Support contains 1 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions removed 1099 transitions
Trivial Post-agglo rules discarded 1099 transitions
Performed 1099 trivial Post agglomeration. Transition count delta: 1099
Iterating post reduction 0 with 1099 rules applied. Total rules applied 1099 place count 3902 transition count 2803
Reduce places removed 1099 places and 0 transitions.
Iterating post reduction 1 with 1099 rules applied. Total rules applied 2198 place count 2803 transition count 2803
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2198 place count 2803 transition count 2004
Deduced a syphon composed of 799 places in 5 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3796 place count 2004 transition count 2004
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 1 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 2 with 1802 rules applied. Total rules applied 5598 place count 1103 transition count 1103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5599 place count 1103 transition count 1102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5601 place count 1102 transition count 1101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5803 place count 1001 transition count 1201
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6005 place count 900 transition count 1302
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 6197 place count 804 transition count 1397
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6198 place count 804 transition count 1396
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6199 place count 804 transition count 1395
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6200 place count 803 transition count 1395
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 6201 place count 803 transition count 1394
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6202 place count 802 transition count 1393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6203 place count 801 transition count 1393
Applied a total of 6203 rules in 853 ms. Remains 801 /3902 variables (removed 3101) and now considering 1393/3902 (removed 2509) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 853 ms. Remains : 801/3902 places, 1393/3902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 137239 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137239 steps, saw 86899 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1393 rows 801 cols
[2023-03-20 12:05:31] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-20 12:05:31] [INFO ] [Real]Absence check using 400 positive place invariants in 70 ms returned sat
[2023-03-20 12:05:32] [INFO ] After 832ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:05:32] [INFO ] [Nat]Absence check using 400 positive place invariants in 55 ms returned sat
[2023-03-20 12:05:32] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 12:05:32] [INFO ] After 530ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-20 12:05:32] [INFO ] After 875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 310 ms.
Support contains 1 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1393/1393 transitions.
Applied a total of 0 rules in 29 ms. Remains 801 /801 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 801/801 places, 1393/1393 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1393/1393 transitions.
Applied a total of 0 rules in 52 ms. Remains 801 /801 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
[2023-03-20 12:05:33] [INFO ] Invariant cache hit.
[2023-03-20 12:05:33] [INFO ] Implicit Places using invariants in 540 ms returned []
[2023-03-20 12:05:33] [INFO ] Invariant cache hit.
[2023-03-20 12:05:35] [INFO ] Implicit Places using invariants and state equation in 1338 ms returned []
Implicit Place search using SMT with State Equation took 1894 ms to find 0 implicit places.
[2023-03-20 12:05:35] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-20 12:05:35] [INFO ] Invariant cache hit.
[2023-03-20 12:05:35] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2603 ms. Remains : 801/801 places, 1393/1393 transitions.
Graph (trivial) has 398 edges and 801 vertex of which 4 / 801 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2781 edges and 799 vertex of which 797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 395 edges and 795 vertex of which 4 / 795 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 793 transition count 1384
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 394 edges and 791 vertex of which 6 / 791 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 788 transition count 1375
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 392 edges and 785 vertex of which 8 / 785 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 781 transition count 1364
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 388 edges and 777 vertex of which 8 / 777 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 773 transition count 1350
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 384 edges and 769 vertex of which 8 / 769 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 765 transition count 1336
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 380 edges and 761 vertex of which 8 / 761 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 757 transition count 1322
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 376 edges and 753 vertex of which 8 / 753 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 749 transition count 1308
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 372 edges and 745 vertex of which 8 / 745 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 741 transition count 1294
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 368 edges and 737 vertex of which 8 / 737 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 733 transition count 1280
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 364 edges and 729 vertex of which 8 / 729 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 725 transition count 1266
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 360 edges and 721 vertex of which 8 / 721 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 717 transition count 1252
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 356 edges and 713 vertex of which 8 / 713 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 709 transition count 1238
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 352 edges and 705 vertex of which 8 / 705 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 701 transition count 1224
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 348 edges and 697 vertex of which 8 / 697 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 693 transition count 1210
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 344 edges and 689 vertex of which 8 / 689 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 685 transition count 1196
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 340 edges and 681 vertex of which 8 / 681 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 677 transition count 1182
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 336 edges and 673 vertex of which 8 / 673 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 669 transition count 1168
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 332 edges and 665 vertex of which 8 / 665 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 661 transition count 1154
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 328 edges and 657 vertex of which 8 / 657 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 653 transition count 1140
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 324 edges and 649 vertex of which 8 / 649 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 645 transition count 1126
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 320 edges and 641 vertex of which 8 / 641 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 637 transition count 1112
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 316 edges and 633 vertex of which 8 / 633 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 629 transition count 1098
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 312 edges and 625 vertex of which 8 / 625 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 621 transition count 1084
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 308 edges and 617 vertex of which 8 / 617 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 613 transition count 1070
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 304 edges and 609 vertex of which 8 / 609 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 605 transition count 1056
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 300 edges and 601 vertex of which 8 / 601 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 597 transition count 1042
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 296 edges and 593 vertex of which 8 / 593 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 589 transition count 1028
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 292 edges and 585 vertex of which 8 / 585 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 581 transition count 1014
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 288 edges and 577 vertex of which 8 / 577 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 573 transition count 1000
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 284 edges and 569 vertex of which 8 / 569 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 565 transition count 986
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 280 edges and 561 vertex of which 6 / 561 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 558 transition count 972
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 276 edges and 555 vertex of which 4 / 555 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 31 with 14 rules applied. Total rules applied 581 place count 553 transition count 962
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 273 edges and 551 vertex of which 2 / 551 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 32 with 9 rules applied. Total rules applied 590 place count 550 transition count 956
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 5 rules applied. Total rules applied 595 place count 549 transition count 952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 34 with 1 Pre rules applied. Total rules applied 595 place count 549 transition count 951
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 34 with 3 rules applied. Total rules applied 598 place count 547 transition count 951
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 34 with 3 rules applied. Total rules applied 601 place count 545 transition count 950
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 34 with 3 rules applied. Total rules applied 604 place count 545 transition count 947
Applied a total of 604 rules in 156 ms. Remains 545 /801 variables (removed 256) and now considering 947/1393 (removed 446) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 947 rows 545 cols
[2023-03-20 12:05:36] [INFO ] Computed 272 place invariants in 1 ms
[2023-03-20 12:05:36] [INFO ] [Real]Absence check using 272 positive place invariants in 32 ms returned sat
[2023-03-20 12:05:36] [INFO ] After 411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:05:36] [INFO ] [Nat]Absence check using 272 positive place invariants in 30 ms returned sat
[2023-03-20 12:05:36] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 12:05:36] [INFO ] After 327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-20 12:05:37] [INFO ] After 515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 401 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-20 12:05:37] [INFO ] Computed 401 place invariants in 11 ms
[2023-03-20 12:05:39] [INFO ] Implicit Places using invariants in 1200 ms returned []
[2023-03-20 12:05:39] [INFO ] Invariant cache hit.
[2023-03-20 12:05:44] [INFO ] Implicit Places using invariants and state equation in 5537 ms returned []
Implicit Place search using SMT with State Equation took 6755 ms to find 0 implicit places.
[2023-03-20 12:05:44] [INFO ] Invariant cache hit.
[2023-03-20 12:05:47] [INFO ] Dead Transitions using invariants and state equation in 2576 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9736 ms. Remains : 3902/3902 places, 3902/3902 transitions.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 103956 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103956 steps, saw 97961 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 12:05:51] [INFO ] Invariant cache hit.
[2023-03-20 12:05:52] [INFO ] [Real]Absence check using 401 positive place invariants in 254 ms returned sat
[2023-03-20 12:05:55] [INFO ] After 4170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:05:56] [INFO ] [Nat]Absence check using 401 positive place invariants in 232 ms returned sat
[2023-03-20 12:05:58] [INFO ] After 2751ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 12:06:01] [INFO ] Deduced a trap composed of 34 places in 2208 ms of which 4 ms to minimize.
[2023-03-20 12:06:02] [INFO ] Deduced a trap composed of 31 places in 1382 ms of which 4 ms to minimize.
[2023-03-20 12:06:04] [INFO ] Deduced a trap composed of 31 places in 1806 ms of which 4 ms to minimize.
[2023-03-20 12:06:12] [INFO ] Deduced a trap composed of 25 places in 7520 ms of which 2 ms to minimize.
[2023-03-20 12:06:15] [INFO ] Deduced a trap composed of 32 places in 2977 ms of which 3 ms to minimize.
[2023-03-20 12:06:17] [INFO ] Deduced a trap composed of 54 places in 1868 ms of which 3 ms to minimize.
[2023-03-20 12:06:19] [INFO ] Deduced a trap composed of 25 places in 1790 ms of which 3 ms to minimize.
[2023-03-20 12:06:21] [INFO ] Deduced a trap composed of 38 places in 1851 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 12:06:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 12:06:21] [INFO ] After 26469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 298 ms.
Support contains 1 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions removed 1099 transitions
Trivial Post-agglo rules discarded 1099 transitions
Performed 1099 trivial Post agglomeration. Transition count delta: 1099
Iterating post reduction 0 with 1099 rules applied. Total rules applied 1099 place count 3902 transition count 2803
Reduce places removed 1099 places and 0 transitions.
Iterating post reduction 1 with 1099 rules applied. Total rules applied 2198 place count 2803 transition count 2803
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2198 place count 2803 transition count 2004
Deduced a syphon composed of 799 places in 6 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3796 place count 2004 transition count 2004
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 1 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 2 with 1802 rules applied. Total rules applied 5598 place count 1103 transition count 1103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5599 place count 1103 transition count 1102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5601 place count 1102 transition count 1101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5803 place count 1001 transition count 1201
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6005 place count 900 transition count 1302
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 6197 place count 804 transition count 1397
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6198 place count 804 transition count 1396
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6199 place count 804 transition count 1395
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6200 place count 803 transition count 1395
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 6201 place count 803 transition count 1394
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6202 place count 802 transition count 1393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6203 place count 801 transition count 1393
Applied a total of 6203 rules in 823 ms. Remains 801 /3902 variables (removed 3101) and now considering 1393/3902 (removed 2509) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 823 ms. Remains : 801/3902 places, 1393/3902 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 105380 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105380 steps, saw 65758 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1393 rows 801 cols
[2023-03-20 12:06:26] [INFO ] Computed 400 place invariants in 5 ms
[2023-03-20 12:06:26] [INFO ] [Real]Absence check using 400 positive place invariants in 85 ms returned sat
[2023-03-20 12:06:27] [INFO ] After 1072ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:06:27] [INFO ] [Nat]Absence check using 400 positive place invariants in 58 ms returned sat
[2023-03-20 12:06:28] [INFO ] After 496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 12:06:28] [INFO ] After 684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-20 12:06:28] [INFO ] After 994ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 553 ms.
Support contains 1 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1393/1393 transitions.
Applied a total of 0 rules in 23 ms. Remains 801 /801 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 801/801 places, 1393/1393 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1393/1393 transitions.
Applied a total of 0 rules in 23 ms. Remains 801 /801 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
[2023-03-20 12:06:29] [INFO ] Invariant cache hit.
[2023-03-20 12:06:29] [INFO ] Implicit Places using invariants in 782 ms returned []
[2023-03-20 12:06:29] [INFO ] Invariant cache hit.
[2023-03-20 12:06:30] [INFO ] Implicit Places using invariants and state equation in 1090 ms returned []
Implicit Place search using SMT with State Equation took 1876 ms to find 0 implicit places.
[2023-03-20 12:06:30] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-20 12:06:30] [INFO ] Invariant cache hit.
[2023-03-20 12:06:31] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2703 ms. Remains : 801/801 places, 1393/1393 transitions.
Graph (trivial) has 398 edges and 801 vertex of which 4 / 801 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2781 edges and 799 vertex of which 797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 395 edges and 795 vertex of which 4 / 795 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 793 transition count 1384
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 394 edges and 791 vertex of which 6 / 791 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 788 transition count 1375
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 392 edges and 785 vertex of which 8 / 785 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 781 transition count 1364
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 388 edges and 777 vertex of which 8 / 777 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 773 transition count 1350
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 384 edges and 769 vertex of which 8 / 769 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 765 transition count 1336
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 380 edges and 761 vertex of which 8 / 761 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 757 transition count 1322
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 376 edges and 753 vertex of which 8 / 753 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 749 transition count 1308
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 372 edges and 745 vertex of which 8 / 745 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 741 transition count 1294
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 368 edges and 737 vertex of which 8 / 737 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 733 transition count 1280
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 364 edges and 729 vertex of which 8 / 729 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 725 transition count 1266
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 360 edges and 721 vertex of which 8 / 721 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 717 transition count 1252
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 356 edges and 713 vertex of which 8 / 713 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 709 transition count 1238
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 352 edges and 705 vertex of which 8 / 705 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 701 transition count 1224
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 348 edges and 697 vertex of which 8 / 697 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 693 transition count 1210
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 344 edges and 689 vertex of which 8 / 689 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 685 transition count 1196
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 340 edges and 681 vertex of which 8 / 681 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 677 transition count 1182
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 336 edges and 673 vertex of which 8 / 673 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 669 transition count 1168
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 332 edges and 665 vertex of which 8 / 665 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 661 transition count 1154
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 328 edges and 657 vertex of which 8 / 657 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 653 transition count 1140
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 324 edges and 649 vertex of which 8 / 649 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 645 transition count 1126
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 320 edges and 641 vertex of which 8 / 641 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 637 transition count 1112
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 316 edges and 633 vertex of which 8 / 633 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 629 transition count 1098
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 312 edges and 625 vertex of which 8 / 625 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 621 transition count 1084
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 308 edges and 617 vertex of which 8 / 617 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 613 transition count 1070
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 304 edges and 609 vertex of which 8 / 609 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 605 transition count 1056
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 300 edges and 601 vertex of which 8 / 601 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 597 transition count 1042
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 296 edges and 593 vertex of which 8 / 593 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 589 transition count 1028
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 292 edges and 585 vertex of which 8 / 585 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 581 transition count 1014
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 288 edges and 577 vertex of which 8 / 577 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 573 transition count 1000
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 284 edges and 569 vertex of which 8 / 569 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 565 transition count 986
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 280 edges and 561 vertex of which 6 / 561 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 558 transition count 972
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 276 edges and 555 vertex of which 4 / 555 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 31 with 14 rules applied. Total rules applied 581 place count 553 transition count 962
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 273 edges and 551 vertex of which 2 / 551 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 32 with 9 rules applied. Total rules applied 590 place count 550 transition count 956
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 5 rules applied. Total rules applied 595 place count 549 transition count 952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 34 with 1 Pre rules applied. Total rules applied 595 place count 549 transition count 951
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 34 with 3 rules applied. Total rules applied 598 place count 547 transition count 951
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 34 with 3 rules applied. Total rules applied 601 place count 545 transition count 950
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 34 with 3 rules applied. Total rules applied 604 place count 545 transition count 947
Applied a total of 604 rules in 181 ms. Remains 545 /801 variables (removed 256) and now considering 947/1393 (removed 446) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 947 rows 545 cols
[2023-03-20 12:06:31] [INFO ] Computed 272 place invariants in 3 ms
[2023-03-20 12:06:32] [INFO ] [Real]Absence check using 272 positive place invariants in 47 ms returned sat
[2023-03-20 12:06:32] [INFO ] After 470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:06:32] [INFO ] [Nat]Absence check using 272 positive place invariants in 44 ms returned sat
[2023-03-20 12:06:32] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 12:06:32] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-20 12:06:32] [INFO ] After 574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 20030 reset in 1316 ms.
Product exploration explored 100000 steps with 20041 reset in 1344 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 3902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Performed 1099 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1099 rules applied. Total rules applied 1099 place count 3902 transition count 3902
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 400 Pre rules applied. Total rules applied 1099 place count 3902 transition count 4302
Deduced a syphon composed of 1499 places in 17 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 1499 place count 3902 transition count 4302
Performed 1200 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2699 places in 13 ms
Iterating global reduction 1 with 1200 rules applied. Total rules applied 2699 place count 3902 transition count 4302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2700 place count 3902 transition count 4301
Renaming transitions due to excessive name length > 1024 char.
Discarding 800 places :
Symmetric choice reduction at 2 with 800 rule applications. Total rules 3500 place count 3102 transition count 3501
Deduced a syphon composed of 1899 places in 8 ms
Iterating global reduction 2 with 800 rules applied. Total rules applied 4300 place count 3102 transition count 3501
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1900 places in 7 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 4301 place count 3102 transition count 3501
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4303 place count 3100 transition count 3499
Deduced a syphon composed of 1898 places in 11 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 4305 place count 3100 transition count 3499
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 1999 places in 8 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4406 place count 3100 transition count 4231
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4507 place count 2999 transition count 4029
Deduced a syphon composed of 1898 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4608 place count 2999 transition count 4029
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -727
Deduced a syphon composed of 1999 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4709 place count 2999 transition count 4756
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4810 place count 2898 transition count 4554
Deduced a syphon composed of 1898 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4911 place count 2898 transition count 4554
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -736
Deduced a syphon composed of 1999 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5012 place count 2898 transition count 5290
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5113 place count 2797 transition count 5088
Deduced a syphon composed of 1898 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5214 place count 2797 transition count 5088
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -683
Deduced a syphon composed of 1993 places in 1 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 5309 place count 2797 transition count 5771
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 5404 place count 2702 transition count 5581
Deduced a syphon composed of 1898 places in 1 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 5499 place count 2702 transition count 5581
Deduced a syphon composed of 1898 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 5502 place count 2702 transition count 5578
Deduced a syphon composed of 1898 places in 2 ms
Applied a total of 5502 rules in 3763 ms. Remains 2702 /3902 variables (removed 1200) and now considering 5578/3902 (removed -1676) transitions.
[2023-03-20 12:06:40] [INFO ] Redundant transitions in 311 ms returned []
// Phase 1: matrix 5578 rows 2702 cols
[2023-03-20 12:06:41] [INFO ] Computed 401 place invariants in 73 ms
[2023-03-20 12:06:44] [INFO ] Dead Transitions using invariants and state equation in 3087 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2702/3902 places, 5578/3902 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7189 ms. Remains : 2702/3902 places, 5578/3902 transitions.
Support contains 1 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 338 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-20 12:06:44] [INFO ] Computed 401 place invariants in 11 ms
[2023-03-20 12:06:45] [INFO ] Implicit Places using invariants in 1523 ms returned []
[2023-03-20 12:06:45] [INFO ] Invariant cache hit.
[2023-03-20 12:06:46] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 2557 ms to find 0 implicit places.
[2023-03-20 12:06:46] [INFO ] Invariant cache hit.
[2023-03-20 12:06:49] [INFO ] Dead Transitions using invariants and state equation in 2252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5148 ms. Remains : 3902/3902 places, 3902/3902 transitions.
Treatment of property ShieldRVt-PT-100B-LTLFireability-12 finished in 123397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((G(F(p1)) U p2))))))'
Support contains 3 out of 3917 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1095 transitions
Trivial Post-agglo rules discarded 1095 transitions
Performed 1095 trivial Post agglomeration. Transition count delta: 1095
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1095 place count 3916 transition count 2821
Reduce places removed 1095 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2191 place count 2821 transition count 2820
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2820 transition count 2820
Performed 792 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 792 Pre rules applied. Total rules applied 2192 place count 2820 transition count 2028
Deduced a syphon composed of 792 places in 5 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 3 with 1584 rules applied. Total rules applied 3776 place count 2028 transition count 2028
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 3788 place count 2016 transition count 2016
Iterating global reduction 3 with 12 rules applied. Total rules applied 3800 place count 2016 transition count 2016
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 3800 place count 2016 transition count 2006
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 3820 place count 2006 transition count 2006
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 0 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 3 with 1798 rules applied. Total rules applied 5618 place count 1107 transition count 1107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5619 place count 1107 transition count 1106
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5621 place count 1106 transition count 1105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5823 place count 1005 transition count 1205
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6025 place count 904 transition count 1305
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 6217 place count 808 transition count 1400
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 6219 place count 806 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6220 place count 805 transition count 1398
Applied a total of 6220 rules in 772 ms. Remains 805 /3917 variables (removed 3112) and now considering 1398/3917 (removed 2519) transitions.
// Phase 1: matrix 1398 rows 805 cols
[2023-03-20 12:06:50] [INFO ] Computed 400 place invariants in 5 ms
[2023-03-20 12:06:50] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-20 12:06:50] [INFO ] Invariant cache hit.
[2023-03-20 12:06:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-20 12:06:52] [INFO ] Implicit Places using invariants and state equation in 2034 ms returned []
Implicit Place search using SMT with State Equation took 2556 ms to find 0 implicit places.
[2023-03-20 12:06:52] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-20 12:06:52] [INFO ] Invariant cache hit.
[2023-03-20 12:07:03] [INFO ] Dead Transitions using invariants and state equation in 10248 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 805/3917 places, 1398/3917 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13624 ms. Remains : 805/3917 places, 1398/3917 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s796 1), p2:(EQ s39 1), p1:(NEQ s426 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-13 finished in 14005 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((F(p1)&&X(p2)&&p0))))'
Support contains 3 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3902 transition count 3902
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3902 transition count 3902
Applied a total of 30 rules in 701 ms. Remains 3902 /3917 variables (removed 15) and now considering 3902/3917 (removed 15) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-20 12:07:04] [INFO ] Computed 401 place invariants in 23 ms
[2023-03-20 12:07:05] [INFO ] Implicit Places using invariants in 938 ms returned []
[2023-03-20 12:07:05] [INFO ] Invariant cache hit.
[2023-03-20 12:07:06] [INFO ] Implicit Places using invariants and state equation in 1444 ms returned []
Implicit Place search using SMT with State Equation took 2410 ms to find 0 implicit places.
[2023-03-20 12:07:06] [INFO ] Invariant cache hit.
[2023-03-20 12:07:09] [INFO ] Dead Transitions using invariants and state equation in 2630 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3917 places, 3902/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5743 ms. Remains : 3902/3917 places, 3902/3917 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s826 0) (EQ s2316 1)), p1:(EQ s2224 1), p2:(EQ s2316 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 9777 steps with 0 reset in 123 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-14 finished in 6179 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&&X(G((p1||X(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0 U (G(!p1)||G(p2))))))'
Found a Lengthening insensitive property : ShieldRVt-PT-100B-LTLFireability-11
Stuttering acceptance computed with spot in 242 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Support contains 5 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1093 transitions
Trivial Post-agglo rules discarded 1093 transitions
Performed 1093 trivial Post agglomeration. Transition count delta: 1093
Iterating post reduction 0 with 1093 rules applied. Total rules applied 1093 place count 3916 transition count 2823
Reduce places removed 1093 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1094 rules applied. Total rules applied 2187 place count 2823 transition count 2822
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2188 place count 2822 transition count 2822
Performed 791 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 791 Pre rules applied. Total rules applied 2188 place count 2822 transition count 2031
Deduced a syphon composed of 791 places in 7 ms
Reduce places removed 791 places and 0 transitions.
Iterating global reduction 3 with 1582 rules applied. Total rules applied 3770 place count 2031 transition count 2031
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 3782 place count 2019 transition count 2019
Iterating global reduction 3 with 12 rules applied. Total rules applied 3794 place count 2019 transition count 2019
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 3794 place count 2019 transition count 2009
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 3814 place count 2009 transition count 2009
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 0 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 5616 place count 1108 transition count 1108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5617 place count 1108 transition count 1107
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5619 place count 1107 transition count 1106
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5821 place count 1006 transition count 1206
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6023 place count 905 transition count 1306
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6213 place count 810 transition count 1400
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 6215 place count 808 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6216 place count 807 transition count 1398
Applied a total of 6216 rules in 707 ms. Remains 807 /3917 variables (removed 3110) and now considering 1398/3917 (removed 2519) transitions.
// Phase 1: matrix 1398 rows 807 cols
[2023-03-20 12:07:10] [INFO ] Computed 400 place invariants in 3 ms
[2023-03-20 12:07:11] [INFO ] Implicit Places using invariants in 642 ms returned []
[2023-03-20 12:07:11] [INFO ] Invariant cache hit.
[2023-03-20 12:07:12] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1704 ms to find 0 implicit places.
[2023-03-20 12:07:12] [INFO ] Invariant cache hit.
[2023-03-20 12:07:13] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 807/3917 places, 1398/3917 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3018 ms. Remains : 807/3917 places, 1398/3917 transitions.
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s248 1) (EQ s252 1)), p2:(EQ s35 1), p0:(OR (EQ s276 1) (EQ s430 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 26 reset in 931 ms.
Product exploration explored 100000 steps with 16 reset in 1052 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 463 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 89237 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{2=1, 5=1}
Probabilistic random walk after 89237 steps, saw 52606 distinct states, run finished after 3002 ms. (steps per millisecond=29 ) properties seen :2
Running SMT prover for 12 properties.
[2023-03-20 12:07:20] [INFO ] Invariant cache hit.
[2023-03-20 12:07:21] [INFO ] [Real]Absence check using 400 positive place invariants in 52 ms returned sat
[2023-03-20 12:07:21] [INFO ] After 915ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 12:07:21] [INFO ] [Nat]Absence check using 400 positive place invariants in 49 ms returned sat
[2023-03-20 12:07:22] [INFO ] After 809ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 12:07:23] [INFO ] After 1561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 455 ms.
[2023-03-20 12:07:24] [INFO ] After 2381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 3014 ms.
Support contains 5 out of 807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1398/1398 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 807 transition count 1397
Applied a total of 1 rules in 32 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1398 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 807/807 places, 1397/1398 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 82521 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82521 steps, saw 49046 distinct states, run finished after 3005 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1397 rows 807 cols
[2023-03-20 12:07:31] [INFO ] Computed 400 place invariants in 3 ms
[2023-03-20 12:07:31] [INFO ] [Real]Absence check using 400 positive place invariants in 50 ms returned sat
[2023-03-20 12:07:31] [INFO ] After 349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 12:07:32] [INFO ] [Nat]Absence check using 400 positive place invariants in 50 ms returned sat
[2023-03-20 12:07:33] [INFO ] After 873ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 12:07:34] [INFO ] After 1772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 478 ms.
[2023-03-20 12:07:34] [INFO ] After 2601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 2834 ms.
Support contains 5 out of 807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1397/1397 transitions.
Applied a total of 0 rules in 27 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 807/807 places, 1397/1397 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1397/1397 transitions.
Applied a total of 0 rules in 25 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2023-03-20 12:07:37] [INFO ] Invariant cache hit.
[2023-03-20 12:07:38] [INFO ] Implicit Places using invariants in 800 ms returned []
[2023-03-20 12:07:38] [INFO ] Invariant cache hit.
[2023-03-20 12:07:39] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1858 ms to find 0 implicit places.
[2023-03-20 12:07:39] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-20 12:07:39] [INFO ] Invariant cache hit.
[2023-03-20 12:07:40] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2640 ms. Remains : 807/807 places, 1397/1397 transitions.
Graph (trivial) has 396 edges and 807 vertex of which 4 / 807 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2790 edges and 805 vertex of which 803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 393 edges and 801 vertex of which 4 / 801 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 799 transition count 1388
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 392 edges and 797 vertex of which 6 / 797 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 794 transition count 1379
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 390 edges and 791 vertex of which 8 / 791 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 787 transition count 1368
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 386 edges and 783 vertex of which 8 / 783 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 779 transition count 1354
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 382 edges and 775 vertex of which 8 / 775 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 771 transition count 1340
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 378 edges and 767 vertex of which 8 / 767 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 763 transition count 1326
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 374 edges and 759 vertex of which 8 / 759 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 755 transition count 1312
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 370 edges and 751 vertex of which 8 / 751 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 747 transition count 1298
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 366 edges and 743 vertex of which 8 / 743 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 739 transition count 1284
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 362 edges and 735 vertex of which 8 / 735 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 731 transition count 1270
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 358 edges and 727 vertex of which 8 / 727 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 723 transition count 1256
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 354 edges and 719 vertex of which 8 / 719 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 715 transition count 1242
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 350 edges and 711 vertex of which 8 / 711 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 707 transition count 1228
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 346 edges and 703 vertex of which 8 / 703 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 699 transition count 1214
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 342 edges and 695 vertex of which 8 / 695 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 691 transition count 1200
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 338 edges and 687 vertex of which 8 / 687 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 683 transition count 1186
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 334 edges and 679 vertex of which 8 / 679 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 675 transition count 1172
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 330 edges and 671 vertex of which 8 / 671 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 667 transition count 1158
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 326 edges and 663 vertex of which 8 / 663 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 659 transition count 1144
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 322 edges and 655 vertex of which 8 / 655 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 651 transition count 1130
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 318 edges and 647 vertex of which 8 / 647 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 643 transition count 1116
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 314 edges and 639 vertex of which 8 / 639 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 635 transition count 1102
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 310 edges and 631 vertex of which 8 / 631 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 627 transition count 1088
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 306 edges and 623 vertex of which 8 / 623 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 619 transition count 1074
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 302 edges and 615 vertex of which 8 / 615 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 611 transition count 1060
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 298 edges and 607 vertex of which 8 / 607 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 603 transition count 1046
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 294 edges and 599 vertex of which 8 / 599 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 595 transition count 1032
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 290 edges and 591 vertex of which 8 / 591 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 587 transition count 1018
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 286 edges and 583 vertex of which 8 / 583 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 579 transition count 1004
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 282 edges and 575 vertex of which 8 / 575 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 571 transition count 990
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 278 edges and 567 vertex of which 8 / 567 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 563 transition count 976
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 274 edges and 559 vertex of which 8 / 559 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 586 place count 555 transition count 962
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 270 edges and 551 vertex of which 8 / 551 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 605 place count 547 transition count 948
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 266 edges and 543 vertex of which 8 / 543 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 624 place count 539 transition count 934
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 262 edges and 535 vertex of which 8 / 535 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 643 place count 531 transition count 920
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 258 edges and 527 vertex of which 8 / 527 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 662 place count 523 transition count 906
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 254 edges and 519 vertex of which 8 / 519 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 681 place count 515 transition count 892
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 250 edges and 511 vertex of which 8 / 511 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 700 place count 507 transition count 878
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 246 edges and 503 vertex of which 8 / 503 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 719 place count 499 transition count 864
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 242 edges and 495 vertex of which 8 / 495 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 738 place count 491 transition count 850
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 238 edges and 487 vertex of which 8 / 487 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 757 place count 483 transition count 836
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 234 edges and 479 vertex of which 8 / 479 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 776 place count 475 transition count 822
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 230 edges and 471 vertex of which 8 / 471 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 795 place count 467 transition count 808
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 226 edges and 463 vertex of which 8 / 463 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 814 place count 459 transition count 794
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 222 edges and 455 vertex of which 8 / 455 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 833 place count 451 transition count 780
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 218 edges and 447 vertex of which 6 / 447 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 852 place count 444 transition count 766
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 214 edges and 441 vertex of which 4 / 441 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 46 with 14 rules applied. Total rules applied 866 place count 439 transition count 756
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 211 edges and 437 vertex of which 2 / 437 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 47 with 9 rules applied. Total rules applied 875 place count 436 transition count 750
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 48 with 5 rules applied. Total rules applied 880 place count 435 transition count 746
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 49 with 1 Pre rules applied. Total rules applied 880 place count 435 transition count 745
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 49 with 3 rules applied. Total rules applied 883 place count 433 transition count 745
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 49 with 3 rules applied. Total rules applied 886 place count 431 transition count 744
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 49 with 3 rules applied. Total rules applied 889 place count 431 transition count 741
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 50 with 2 rules applied. Total rules applied 891 place count 431 transition count 739
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 50 with 1 rules applied. Total rules applied 892 place count 431 transition count 739
Applied a total of 892 rules in 244 ms. Remains 431 /807 variables (removed 376) and now considering 739/1397 (removed 658) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 739 rows 431 cols
[2023-03-20 12:07:40] [INFO ] Computed 212 place invariants in 1 ms
[2023-03-20 12:07:40] [INFO ] [Real]Absence check using 212 positive place invariants in 29 ms returned sat
[2023-03-20 12:07:40] [INFO ] After 550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 12:07:41] [INFO ] [Nat]Absence check using 212 positive place invariants in 26 ms returned sat
[2023-03-20 12:07:41] [INFO ] After 385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 12:07:41] [INFO ] After 732ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-03-20 12:07:42] [INFO ] After 1153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 458 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 299 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Support contains 5 out of 807 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 807/807 places, 1398/1398 transitions.
Applied a total of 0 rules in 20 ms. Remains 807 /807 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 807 cols
[2023-03-20 12:07:43] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-20 12:07:43] [INFO ] Implicit Places using invariants in 463 ms returned []
[2023-03-20 12:07:43] [INFO ] Invariant cache hit.
[2023-03-20 12:07:44] [INFO ] Implicit Places using invariants and state equation in 1075 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
[2023-03-20 12:07:44] [INFO ] Invariant cache hit.
[2023-03-20 12:07:45] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2192 ms. Remains : 807/807 places, 1398/1398 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 585 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 751 ms. (steps per millisecond=13 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 147103 steps, run timeout after 6001 ms. (steps per millisecond=24 ) properties seen :{2=1, 5=1}
Probabilistic random walk after 147103 steps, saw 88123 distinct states, run finished after 6002 ms. (steps per millisecond=24 ) properties seen :2
Running SMT prover for 12 properties.
[2023-03-20 12:07:54] [INFO ] Invariant cache hit.
[2023-03-20 12:07:54] [INFO ] [Real]Absence check using 400 positive place invariants in 52 ms returned sat
[2023-03-20 12:07:55] [INFO ] After 872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 12:07:55] [INFO ] [Nat]Absence check using 400 positive place invariants in 62 ms returned sat
[2023-03-20 12:07:56] [INFO ] After 809ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 12:07:57] [INFO ] After 1558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 475 ms.
[2023-03-20 12:07:57] [INFO ] After 2485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 3337 ms.
Support contains 5 out of 807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1398/1398 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 807 transition count 1397
Applied a total of 1 rules in 30 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1398 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 807/807 places, 1397/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 83660 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83660 steps, saw 49859 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1397 rows 807 cols
[2023-03-20 12:08:05] [INFO ] Computed 400 place invariants in 5 ms
[2023-03-20 12:08:05] [INFO ] [Real]Absence check using 400 positive place invariants in 52 ms returned sat
[2023-03-20 12:08:05] [INFO ] After 341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 12:08:06] [INFO ] [Nat]Absence check using 400 positive place invariants in 52 ms returned sat
[2023-03-20 12:08:07] [INFO ] After 848ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 12:08:07] [INFO ] After 1513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 433 ms.
[2023-03-20 12:08:08] [INFO ] After 2305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 3364 ms.
Support contains 5 out of 807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1397/1397 transitions.
Applied a total of 0 rules in 28 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 807/807 places, 1397/1397 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1397/1397 transitions.
Applied a total of 0 rules in 24 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2023-03-20 12:08:11] [INFO ] Invariant cache hit.
[2023-03-20 12:08:12] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-20 12:08:12] [INFO ] Invariant cache hit.
[2023-03-20 12:08:13] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
[2023-03-20 12:08:13] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-20 12:08:13] [INFO ] Invariant cache hit.
[2023-03-20 12:08:14] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2436 ms. Remains : 807/807 places, 1397/1397 transitions.
Graph (trivial) has 396 edges and 807 vertex of which 4 / 807 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2790 edges and 805 vertex of which 803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 393 edges and 801 vertex of which 4 / 801 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 799 transition count 1388
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 392 edges and 797 vertex of which 6 / 797 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 794 transition count 1379
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 390 edges and 791 vertex of which 8 / 791 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 787 transition count 1368
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 386 edges and 783 vertex of which 8 / 783 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 779 transition count 1354
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 382 edges and 775 vertex of which 8 / 775 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 771 transition count 1340
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 378 edges and 767 vertex of which 8 / 767 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 763 transition count 1326
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 374 edges and 759 vertex of which 8 / 759 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 755 transition count 1312
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 370 edges and 751 vertex of which 8 / 751 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 747 transition count 1298
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 366 edges and 743 vertex of which 8 / 743 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 739 transition count 1284
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 362 edges and 735 vertex of which 8 / 735 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 731 transition count 1270
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 358 edges and 727 vertex of which 8 / 727 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 723 transition count 1256
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 354 edges and 719 vertex of which 8 / 719 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 715 transition count 1242
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 350 edges and 711 vertex of which 8 / 711 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 707 transition count 1228
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 346 edges and 703 vertex of which 8 / 703 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 699 transition count 1214
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 342 edges and 695 vertex of which 8 / 695 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 691 transition count 1200
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 338 edges and 687 vertex of which 8 / 687 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 683 transition count 1186
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 334 edges and 679 vertex of which 8 / 679 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 675 transition count 1172
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 330 edges and 671 vertex of which 8 / 671 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 667 transition count 1158
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 326 edges and 663 vertex of which 8 / 663 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 659 transition count 1144
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 322 edges and 655 vertex of which 8 / 655 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 651 transition count 1130
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 318 edges and 647 vertex of which 8 / 647 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 643 transition count 1116
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 314 edges and 639 vertex of which 8 / 639 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 635 transition count 1102
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 310 edges and 631 vertex of which 8 / 631 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 627 transition count 1088
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 306 edges and 623 vertex of which 8 / 623 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 619 transition count 1074
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 302 edges and 615 vertex of which 8 / 615 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 611 transition count 1060
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 298 edges and 607 vertex of which 8 / 607 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 603 transition count 1046
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 294 edges and 599 vertex of which 8 / 599 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 595 transition count 1032
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 290 edges and 591 vertex of which 8 / 591 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 587 transition count 1018
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 286 edges and 583 vertex of which 8 / 583 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 579 transition count 1004
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 282 edges and 575 vertex of which 8 / 575 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 571 transition count 990
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 278 edges and 567 vertex of which 8 / 567 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 563 transition count 976
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 274 edges and 559 vertex of which 8 / 559 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 586 place count 555 transition count 962
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 270 edges and 551 vertex of which 8 / 551 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 605 place count 547 transition count 948
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 266 edges and 543 vertex of which 8 / 543 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 624 place count 539 transition count 934
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 262 edges and 535 vertex of which 8 / 535 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 643 place count 531 transition count 920
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 258 edges and 527 vertex of which 8 / 527 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 662 place count 523 transition count 906
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 254 edges and 519 vertex of which 8 / 519 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 681 place count 515 transition count 892
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 250 edges and 511 vertex of which 8 / 511 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 700 place count 507 transition count 878
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 246 edges and 503 vertex of which 8 / 503 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 719 place count 499 transition count 864
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 242 edges and 495 vertex of which 8 / 495 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 738 place count 491 transition count 850
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 238 edges and 487 vertex of which 8 / 487 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 757 place count 483 transition count 836
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 234 edges and 479 vertex of which 8 / 479 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 776 place count 475 transition count 822
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 230 edges and 471 vertex of which 8 / 471 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 795 place count 467 transition count 808
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 226 edges and 463 vertex of which 8 / 463 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 814 place count 459 transition count 794
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 222 edges and 455 vertex of which 8 / 455 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 833 place count 451 transition count 780
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 218 edges and 447 vertex of which 6 / 447 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 852 place count 444 transition count 766
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 214 edges and 441 vertex of which 4 / 441 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 46 with 14 rules applied. Total rules applied 866 place count 439 transition count 756
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 211 edges and 437 vertex of which 2 / 437 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 47 with 9 rules applied. Total rules applied 875 place count 436 transition count 750
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 48 with 5 rules applied. Total rules applied 880 place count 435 transition count 746
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 49 with 1 Pre rules applied. Total rules applied 880 place count 435 transition count 745
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 49 with 3 rules applied. Total rules applied 883 place count 433 transition count 745
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 49 with 3 rules applied. Total rules applied 886 place count 431 transition count 744
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 49 with 3 rules applied. Total rules applied 889 place count 431 transition count 741
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 50 with 2 rules applied. Total rules applied 891 place count 431 transition count 739
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 50 with 1 rules applied. Total rules applied 892 place count 431 transition count 739
Applied a total of 892 rules in 186 ms. Remains 431 /807 variables (removed 376) and now considering 739/1397 (removed 658) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 739 rows 431 cols
[2023-03-20 12:08:14] [INFO ] Computed 212 place invariants in 3 ms
[2023-03-20 12:08:14] [INFO ] [Real]Absence check using 212 positive place invariants in 25 ms returned sat
[2023-03-20 12:08:14] [INFO ] After 453ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 12:08:14] [INFO ] [Nat]Absence check using 212 positive place invariants in 33 ms returned sat
[2023-03-20 12:08:15] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 12:08:15] [INFO ] After 758ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 203 ms.
[2023-03-20 12:08:16] [INFO ] After 1228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 462 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 292 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 342 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 26 reset in 1007 ms.
Product exploration explored 100000 steps with 23 reset in 1139 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 327 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Support contains 5 out of 807 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 807/807 places, 1398/1398 transitions.
Applied a total of 0 rules in 33 ms. Remains 807 /807 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2023-03-20 12:08:20] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 1398 rows 807 cols
[2023-03-20 12:08:20] [INFO ] Computed 400 place invariants in 3 ms
[2023-03-20 12:08:20] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 766 ms. Remains : 807/807 places, 1398/1398 transitions.
Support contains 5 out of 807 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 807/807 places, 1398/1398 transitions.
Applied a total of 0 rules in 17 ms. Remains 807 /807 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2023-03-20 12:08:20] [INFO ] Invariant cache hit.
[2023-03-20 12:08:21] [INFO ] Implicit Places using invariants in 535 ms returned []
[2023-03-20 12:08:21] [INFO ] Invariant cache hit.
[2023-03-20 12:08:22] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1594 ms to find 0 implicit places.
[2023-03-20 12:08:22] [INFO ] Invariant cache hit.
[2023-03-20 12:08:23] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2214 ms. Remains : 807/807 places, 1398/1398 transitions.
Treatment of property ShieldRVt-PT-100B-LTLFireability-11 finished in 73367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(p1))))))'
[2023-03-20 12:08:23] [INFO ] Flatten gal took : 101 ms
[2023-03-20 12:08:23] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 12:08:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3917 places, 3917 transitions and 9634 arcs took 22 ms.
Total runtime 638149 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2603/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2603/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2603/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVt-PT-100B-LTLFireability-00
Could not compute solution for formula : ShieldRVt-PT-100B-LTLFireability-11
Could not compute solution for formula : ShieldRVt-PT-100B-LTLFireability-12

BK_STOP 1679314110108

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ShieldRVt-PT-100B-LTLFireability-00
ltl formula formula --ltl=/tmp/2603/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 3917 places, 3917 transitions and 9634 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 0.530 real 0.140 user 0.200 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2603/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2603/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2603/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2603/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** 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:
malloc_consolidate(): invalid chunk size
ltl formula name ShieldRVt-PT-100B-LTLFireability-11
ltl formula formula --ltl=/tmp/2603/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 3917 places, 3917 transitions and 9634 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 0.570 real 0.120 user 0.200 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2603/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2603/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2603/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2603/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 9 states
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:
ltl formula name ShieldRVt-PT-100B-LTLFireability-12
ltl formula formula --ltl=/tmp/2603/ltl_2_
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 3917 places, 3917 transitions and 9634 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 0.520 real 0.120 user 0.200 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2603/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2603/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2603/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2603/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 9 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="ShieldRVt-PT-100B"
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 ShieldRVt-PT-100B, 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 r425-tajo-167905978100348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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