Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903716900348.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPt-PT-100B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716900348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.5K Feb 25 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 17:12 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.9K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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.7M 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 ShieldIIPt-PT-100B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679442742260

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=ShieldIIPt-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 23:52:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 23:52:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 23:52:25] [INFO ] Load time of PNML (sax parser for PT used): 283 ms
[2023-03-21 23:52:25] [INFO ] Transformed 7003 places.
[2023-03-21 23:52:25] [INFO ] Transformed 6503 transitions.
[2023-03-21 23:52:25] [INFO ] Found NUPN structural information;
[2023-03-21 23:52:25] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 645 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-100B-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 7003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Discarding 1091 places :
Symmetric choice reduction at 0 with 1091 rule applications. Total rules 1091 place count 5912 transition count 5412
Iterating global reduction 0 with 1091 rules applied. Total rules applied 2182 place count 5912 transition count 5412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2183 place count 5911 transition count 5411
Iterating global reduction 0 with 1 rules applied. Total rules applied 2184 place count 5911 transition count 5411
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2185 place count 5910 transition count 5410
Iterating global reduction 0 with 1 rules applied. Total rules applied 2186 place count 5910 transition count 5410
Applied a total of 2186 rules in 4293 ms. Remains 5910 /7003 variables (removed 1093) and now considering 5410/6503 (removed 1093) transitions.
// Phase 1: matrix 5410 rows 5910 cols
[2023-03-21 23:52:30] [INFO ] Computed 901 place invariants in 94 ms
[2023-03-21 23:52:34] [INFO ] Implicit Places using invariants in 3361 ms returned []
[2023-03-21 23:52:34] [INFO ] Invariant cache hit.
[2023-03-21 23:52:36] [INFO ] Implicit Places using invariants and state equation in 2768 ms returned []
Implicit Place search using SMT with State Equation took 6191 ms to find 0 implicit places.
[2023-03-21 23:52:36] [INFO ] Invariant cache hit.
[2023-03-21 23:52:40] [INFO ] Dead Transitions using invariants and state equation in 3880 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5910/7003 places, 5410/6503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14369 ms. Remains : 5910/7003 places, 5410/6503 transitions.
Support contains 43 out of 5910 places after structural reductions.
[2023-03-21 23:52:41] [INFO ] Flatten gal took : 348 ms
[2023-03-21 23:52:41] [INFO ] Flatten gal took : 300 ms
[2023-03-21 23:52:42] [INFO ] Input system was already deterministic with 5410 transitions.
Support contains 42 out of 5910 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 596 ms. (steps per millisecond=16 ) properties (out of 28) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-21 23:52:42] [INFO ] Invariant cache hit.
[2023-03-21 23:52:46] [INFO ] [Real]Absence check using 901 positive place invariants in 918 ms returned sat
[2023-03-21 23:52:46] [INFO ] After 3757ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-21 23:52:49] [INFO ] [Nat]Absence check using 901 positive place invariants in 799 ms returned sat
[2023-03-21 23:53:00] [INFO ] After 8671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-21 23:53:02] [INFO ] Deduced a trap composed of 30 places in 2032 ms of which 6 ms to minimize.
[2023-03-21 23:53:05] [INFO ] Deduced a trap composed of 17 places in 2616 ms of which 3 ms to minimize.
[2023-03-21 23:53:07] [INFO ] Deduced a trap composed of 18 places in 2034 ms of which 20 ms to minimize.
[2023-03-21 23:53:09] [INFO ] Deduced a trap composed of 17 places in 1636 ms of which 2 ms to minimize.
[2023-03-21 23:53:12] [INFO ] Deduced a trap composed of 17 places in 2264 ms of which 29 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-21 23:53:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:53:12] [INFO ] After 25224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:18
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 6745 ms.
Support contains 29 out of 5910 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Drop transitions removed 1189 transitions
Trivial Post-agglo rules discarded 1189 transitions
Performed 1189 trivial Post agglomeration. Transition count delta: 1189
Iterating post reduction 0 with 1189 rules applied. Total rules applied 1189 place count 5910 transition count 4221
Reduce places removed 1189 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1191 rules applied. Total rules applied 2380 place count 4721 transition count 4219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2382 place count 4719 transition count 4219
Performed 794 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 794 Pre rules applied. Total rules applied 2382 place count 4719 transition count 3425
Deduced a syphon composed of 794 places in 10 ms
Reduce places removed 794 places and 0 transitions.
Iterating global reduction 3 with 1588 rules applied. Total rules applied 3970 place count 3925 transition count 3425
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 3972 place count 3923 transition count 3423
Iterating global reduction 3 with 2 rules applied. Total rules applied 3974 place count 3923 transition count 3423
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 3974 place count 3923 transition count 3421
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 3978 place count 3921 transition count 3421
Performed 1690 Post agglomeration using F-continuation condition.Transition count delta: 1690
Deduced a syphon composed of 1690 places in 11 ms
Reduce places removed 1690 places and 0 transitions.
Iterating global reduction 3 with 3380 rules applied. Total rules applied 7358 place count 2231 transition count 1731
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7359 place count 2231 transition count 1730
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 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7361 place count 2230 transition count 1729
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7563 place count 2129 transition count 1795
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7765 place count 2028 transition count 1862
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 94 places in 6 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 7953 place count 1934 transition count 1922
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7954 place count 1934 transition count 1921
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 7956 place count 1934 transition count 1919
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 7958 place count 1932 transition count 1919
Partial Free-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 6 with 98 rules applied. Total rules applied 8056 place count 1932 transition count 1919
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 8057 place count 1931 transition count 1918
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 8059 place count 1929 transition count 1918
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 8059 place count 1929 transition count 1917
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 8061 place count 1928 transition count 1917
Applied a total of 8061 rules in 1892 ms. Remains 1928 /5910 variables (removed 3982) and now considering 1917/5410 (removed 3493) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1893 ms. Remains : 1928/5910 places, 1917/5410 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 18) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) 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 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 164 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 1917 rows 1928 cols
[2023-03-21 23:53:24] [INFO ] Computed 899 place invariants in 7 ms
[2023-03-21 23:53:25] [INFO ] [Real]Absence check using 899 positive place invariants in 281 ms returned sat
[2023-03-21 23:53:25] [INFO ] After 1107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-21 23:53:26] [INFO ] [Nat]Absence check using 899 positive place invariants in 253 ms returned sat
[2023-03-21 23:53:28] [INFO ] After 2304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-21 23:53:28] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-21 23:53:30] [INFO ] After 1177ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-21 23:53:31] [INFO ] After 2866ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1094 ms.
[2023-03-21 23:53:32] [INFO ] After 7640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 1036 ms.
Support contains 23 out of 1928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1928/1928 places, 1917/1917 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1928 transition count 1916
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1927 transition count 1916
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1927 transition count 1914
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1925 transition count 1914
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 1923 transition count 1912
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1922 transition count 1914
Applied a total of 12 rules in 173 ms. Remains 1922 /1928 variables (removed 6) and now considering 1914/1917 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 1922/1928 places, 1914/1917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 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 161 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 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 174 ms. (steps per millisecond=57 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 95781 steps, run timeout after 6001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 95781 steps, saw 60776 distinct states, run finished after 6003 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 1914 rows 1922 cols
[2023-03-21 23:53:42] [INFO ] Computed 899 place invariants in 5 ms
[2023-03-21 23:53:43] [INFO ] [Real]Absence check using 899 positive place invariants in 209 ms returned sat
[2023-03-21 23:53:44] [INFO ] After 1198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-21 23:53:45] [INFO ] [Nat]Absence check using 899 positive place invariants in 195 ms returned sat
[2023-03-21 23:53:48] [INFO ] After 2425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-21 23:53:48] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-21 23:53:49] [INFO ] After 1584ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-21 23:53:50] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 14 ms to minimize.
[2023-03-21 23:53:50] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
[2023-03-21 23:53:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 481 ms
[2023-03-21 23:53:52] [INFO ] After 4354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1501 ms.
[2023-03-21 23:53:54] [INFO ] After 10067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 928 ms.
Support contains 23 out of 1922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1922/1922 places, 1914/1914 transitions.
Applied a total of 0 rules in 47 ms. Remains 1922 /1922 variables (removed 0) and now considering 1914/1914 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1922/1922 places, 1914/1914 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1922/1922 places, 1914/1914 transitions.
Applied a total of 0 rules in 47 ms. Remains 1922 /1922 variables (removed 0) and now considering 1914/1914 (removed 0) transitions.
[2023-03-21 23:53:55] [INFO ] Invariant cache hit.
[2023-03-21 23:53:56] [INFO ] Implicit Places using invariants in 1453 ms returned [1911]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1461 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1921/1922 places, 1914/1914 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1920 transition count 1913
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1920 transition count 1913
Applied a total of 2 rules in 89 ms. Remains 1920 /1921 variables (removed 1) and now considering 1913/1914 (removed 1) transitions.
// Phase 1: matrix 1913 rows 1920 cols
[2023-03-21 23:53:56] [INFO ] Computed 898 place invariants in 9 ms
[2023-03-21 23:53:58] [INFO ] Implicit Places using invariants in 1622 ms returned []
[2023-03-21 23:53:58] [INFO ] Invariant cache hit.
[2023-03-21 23:53:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-21 23:54:02] [INFO ] Implicit Places using invariants and state equation in 3913 ms returned []
Implicit Place search using SMT with State Equation took 5553 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1920/1922 places, 1913/1914 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7151 ms. Remains : 1920/1922 places, 1913/1914 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 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 146 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 181 ms. (steps per millisecond=55 ) 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 191 ms. (steps per millisecond=52 ) 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 143 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 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 146 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 146 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
Interrupted probabilistic random walk after 103095 steps, run timeout after 6001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 103095 steps, saw 65844 distinct states, run finished after 6001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-21 23:54:10] [INFO ] Invariant cache hit.
[2023-03-21 23:54:11] [INFO ] [Real]Absence check using 898 positive place invariants in 244 ms returned sat
[2023-03-21 23:54:11] [INFO ] After 998ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-21 23:54:12] [INFO ] [Nat]Absence check using 898 positive place invariants in 263 ms returned sat
[2023-03-21 23:54:15] [INFO ] After 2339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-21 23:54:15] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-21 23:54:17] [INFO ] After 1589ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-21 23:54:17] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2023-03-21 23:54:17] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 1 ms to minimize.
[2023-03-21 23:54:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 643 ms
[2023-03-21 23:54:19] [INFO ] After 4185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1494 ms.
[2023-03-21 23:54:21] [INFO ] After 9464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 1961 ms.
Support contains 23 out of 1920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1920/1920 places, 1913/1913 transitions.
Applied a total of 0 rules in 47 ms. Remains 1920 /1920 variables (removed 0) and now considering 1913/1913 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1920/1920 places, 1913/1913 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1920/1920 places, 1913/1913 transitions.
Applied a total of 0 rules in 47 ms. Remains 1920 /1920 variables (removed 0) and now considering 1913/1913 (removed 0) transitions.
[2023-03-21 23:54:23] [INFO ] Invariant cache hit.
[2023-03-21 23:54:24] [INFO ] Implicit Places using invariants in 1388 ms returned []
[2023-03-21 23:54:24] [INFO ] Invariant cache hit.
[2023-03-21 23:54:25] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-21 23:54:28] [INFO ] Implicit Places using invariants and state equation in 3500 ms returned []
Implicit Place search using SMT with State Equation took 4908 ms to find 0 implicit places.
[2023-03-21 23:54:28] [INFO ] Redundant transitions in 146 ms returned []
[2023-03-21 23:54:28] [INFO ] Invariant cache hit.
[2023-03-21 23:54:29] [INFO ] Dead Transitions using invariants and state equation in 1090 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6211 ms. Remains : 1920/1920 places, 1913/1913 transitions.
Computed a total of 1600 stabilizing places and 1600 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p1)||p0))))'
Support contains 4 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 5902 transition count 5402
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 5902 transition count 5402
Applied a total of 16 rules in 1395 ms. Remains 5902 /5910 variables (removed 8) and now considering 5402/5410 (removed 8) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-21 23:54:31] [INFO ] Computed 901 place invariants in 61 ms
[2023-03-21 23:54:33] [INFO ] Implicit Places using invariants in 2342 ms returned []
[2023-03-21 23:54:33] [INFO ] Invariant cache hit.
[2023-03-21 23:54:36] [INFO ] Implicit Places using invariants and state equation in 2318 ms returned []
Implicit Place search using SMT with State Equation took 4678 ms to find 0 implicit places.
[2023-03-21 23:54:36] [INFO ] Invariant cache hit.
[2023-03-21 23:54:40] [INFO ] Dead Transitions using invariants and state equation in 4837 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5910 places, 5402/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10914 ms. Remains : 5902/5910 places, 5402/5410 transitions.
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s1263 1) (AND (EQ s4767 1) (EQ s4792 1) (EQ s4801 1))), p1:(AND (EQ s4767 1) (EQ s4792 1) (EQ s4801 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 1799 ms.
Stack based approach found an accepted trace after 5139 steps with 0 reset with depth 5140 and stack size 5140 in 87 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-00 finished in 13187 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||(!p1&&X(F(!p1)))||G(F(!p1)))))'
Support contains 4 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 5901 transition count 5401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 5901 transition count 5401
Applied a total of 18 rules in 1556 ms. Remains 5901 /5910 variables (removed 9) and now considering 5401/5410 (removed 9) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2023-03-21 23:54:44] [INFO ] Computed 901 place invariants in 45 ms
[2023-03-21 23:54:47] [INFO ] Implicit Places using invariants in 2688 ms returned []
[2023-03-21 23:54:47] [INFO ] Invariant cache hit.
[2023-03-21 23:54:50] [INFO ] Implicit Places using invariants and state equation in 2975 ms returned []
Implicit Place search using SMT with State Equation took 5667 ms to find 0 implicit places.
[2023-03-21 23:54:50] [INFO ] Invariant cache hit.
[2023-03-21 23:54:55] [INFO ] Dead Transitions using invariants and state equation in 5368 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5910 places, 5401/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12594 ms. Remains : 5901/5910 places, 5401/5410 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s3842 1) (EQ s3891 1)), p1:(AND (EQ s234 1) (EQ s236 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1684 ms.
Product exploration explored 100000 steps with 50000 reset in 2030 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100B-LTLFireability-01 finished in 16754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 5902 transition count 5402
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 5902 transition count 5402
Applied a total of 16 rules in 1441 ms. Remains 5902 /5910 variables (removed 8) and now considering 5402/5410 (removed 8) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-21 23:55:01] [INFO ] Computed 901 place invariants in 19 ms
[2023-03-21 23:55:03] [INFO ] Implicit Places using invariants in 2291 ms returned []
[2023-03-21 23:55:03] [INFO ] Invariant cache hit.
[2023-03-21 23:55:05] [INFO ] Implicit Places using invariants and state equation in 2049 ms returned []
Implicit Place search using SMT with State Equation took 4342 ms to find 0 implicit places.
[2023-03-21 23:55:05] [INFO ] Invariant cache hit.
[2023-03-21 23:55:09] [INFO ] Dead Transitions using invariants and state equation in 4171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5910 places, 5402/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9963 ms. Remains : 5902/5910 places, 5402/5410 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2066 0) (OR (EQ s1806 0) (EQ s1887 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1882 ms.
Product exploration explored 100000 steps with 50000 reset in 1875 ms.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Computed a total of 1599 stabilizing places and 1599 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100B-LTLFireability-02 finished in 14117 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 5910 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5909 transition count 4210
Reduce places removed 1199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2399 place count 4710 transition count 4209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2400 place count 4709 transition count 4209
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 796 Pre rules applied. Total rules applied 2400 place count 4709 transition count 3413
Deduced a syphon composed of 796 places in 10 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 3 with 1592 rules applied. Total rules applied 3992 place count 3913 transition count 3413
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 3999 place count 3906 transition count 3406
Iterating global reduction 3 with 7 rules applied. Total rules applied 4006 place count 3906 transition count 3406
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 4006 place count 3906 transition count 3400
Deduced a syphon composed of 6 places in 8 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 4018 place count 3900 transition count 3400
Performed 1696 Post agglomeration using F-continuation condition.Transition count delta: 1696
Deduced a syphon composed of 1696 places in 5 ms
Reduce places removed 1696 places and 0 transitions.
Iterating global reduction 3 with 3392 rules applied. Total rules applied 7410 place count 2204 transition count 1704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7411 place count 2204 transition count 1703
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7413 place count 2203 transition count 1702
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7615 place count 2102 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7817 place count 2001 transition count 1836
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8011 place count 1904 transition count 1901
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8013 place count 1902 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8015 place count 1900 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8015 place count 1900 transition count 1898
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8017 place count 1899 transition count 1898
Applied a total of 8017 rules in 1567 ms. Remains 1899 /5910 variables (removed 4011) and now considering 1898/5410 (removed 3512) transitions.
// Phase 1: matrix 1898 rows 1899 cols
[2023-03-21 23:55:15] [INFO ] Computed 899 place invariants in 3 ms
[2023-03-21 23:55:16] [INFO ] Implicit Places using invariants in 1234 ms returned [1888]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1236 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1898/5910 places, 1898/5410 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1897 transition count 1897
Applied a total of 2 rules in 86 ms. Remains 1897 /1898 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1897 cols
[2023-03-21 23:55:16] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-21 23:55:18] [INFO ] Implicit Places using invariants in 1586 ms returned []
[2023-03-21 23:55:18] [INFO ] Invariant cache hit.
[2023-03-21 23:55:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-21 23:55:21] [INFO ] Implicit Places using invariants and state equation in 3357 ms returned []
Implicit Place search using SMT with State Equation took 4972 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/5910 places, 1897/5410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7874 ms. Remains : 1897/5910 places, 1897/5410 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-03 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 s911 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 ShieldIIPt-PT-100B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-03 finished in 8017 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(((X(p0) U p1)&&p2))))'
Support contains 3 out of 5910 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1200 rules applied. Total rules applied 1200 place count 5909 transition count 4209
Reduce places removed 1200 places and 0 transitions.
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2400 place count 4709 transition count 4209
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 795 Pre rules applied. Total rules applied 2400 place count 4709 transition count 3414
Deduced a syphon composed of 795 places in 10 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 2 with 1590 rules applied. Total rules applied 3990 place count 3914 transition count 3414
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 3995 place count 3909 transition count 3409
Iterating global reduction 2 with 5 rules applied. Total rules applied 4000 place count 3909 transition count 3409
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4000 place count 3909 transition count 3405
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4008 place count 3905 transition count 3405
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 5 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7404 place count 2207 transition count 1707
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7405 place count 2207 transition count 1706
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 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7407 place count 2206 transition count 1705
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7609 place count 2105 transition count 1771
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 11 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7811 place count 2004 transition count 1839
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8005 place count 1907 transition count 1904
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8007 place count 1905 transition count 1902
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8008 place count 1904 transition count 1902
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8008 place count 1904 transition count 1901
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8010 place count 1903 transition count 1901
Applied a total of 8010 rules in 1618 ms. Remains 1903 /5910 variables (removed 4007) and now considering 1901/5410 (removed 3509) transitions.
// Phase 1: matrix 1901 rows 1903 cols
[2023-03-21 23:55:23] [INFO ] Computed 900 place invariants in 6 ms
[2023-03-21 23:55:25] [INFO ] Implicit Places using invariants in 1589 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1591 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1902/5910 places, 1901/5410 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1901 transition count 1900
Applied a total of 2 rules in 83 ms. Remains 1901 /1902 variables (removed 1) and now considering 1900/1901 (removed 1) transitions.
// Phase 1: matrix 1900 rows 1901 cols
[2023-03-21 23:55:25] [INFO ] Computed 899 place invariants in 4 ms
[2023-03-21 23:55:26] [INFO ] Implicit Places using invariants in 1563 ms returned []
[2023-03-21 23:55:26] [INFO ] Invariant cache hit.
[2023-03-21 23:55:30] [INFO ] Implicit Places using invariants and state equation in 3196 ms returned []
Implicit Place search using SMT with State Equation took 4772 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1901/5910 places, 1900/5410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8064 ms. Remains : 1901/5910 places, 1900/5410 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s1892 1), p1:(EQ s1176 1), p0:(EQ s1686 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1387 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-04 finished in 9740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 5901 transition count 5401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 5901 transition count 5401
Applied a total of 18 rules in 1369 ms. Remains 5901 /5910 variables (removed 9) and now considering 5401/5410 (removed 9) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2023-03-21 23:55:33] [INFO ] Computed 901 place invariants in 16 ms
[2023-03-21 23:55:35] [INFO ] Implicit Places using invariants in 2346 ms returned []
[2023-03-21 23:55:35] [INFO ] Invariant cache hit.
[2023-03-21 23:55:37] [INFO ] Implicit Places using invariants and state equation in 2240 ms returned []
Implicit Place search using SMT with State Equation took 4595 ms to find 0 implicit places.
[2023-03-21 23:55:37] [INFO ] Invariant cache hit.
[2023-03-21 23:55:42] [INFO ] Dead Transitions using invariants and state equation in 5041 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5910 places, 5401/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11011 ms. Remains : 5901/5910 places, 5401/5410 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-05 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s362 1) (NEQ s411 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1408 ms.
Product exploration explored 100000 steps with 0 reset in 1878 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 219282 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219282 steps, saw 209896 distinct states, run finished after 3014 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:55:50] [INFO ] Invariant cache hit.
[2023-03-21 23:55:51] [INFO ] [Real]Absence check using 901 positive place invariants in 593 ms returned sat
[2023-03-21 23:55:55] [INFO ] After 5737ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:55:57] [INFO ] [Nat]Absence check using 901 positive place invariants in 670 ms returned sat
[2023-03-21 23:56:02] [INFO ] After 4699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:56:04] [INFO ] Deduced a trap composed of 27 places in 2153 ms of which 4 ms to minimize.
[2023-03-21 23:56:06] [INFO ] Deduced a trap composed of 17 places in 2333 ms of which 26 ms to minimize.
[2023-03-21 23:56:09] [INFO ] Deduced a trap composed of 22 places in 2551 ms of which 9 ms to minimize.
[2023-03-21 23:56:12] [INFO ] Deduced a trap composed of 23 places in 2338 ms of which 3 ms to minimize.
[2023-03-21 23:56:14] [INFO ] Deduced a trap composed of 22 places in 2222 ms of which 3 ms to minimize.
[2023-03-21 23:56:16] [INFO ] Deduced a trap composed of 20 places in 1913 ms of which 3 ms to minimize.
[2023-03-21 23:56:19] [INFO ] Deduced a trap composed of 24 places in 2163 ms of which 2 ms to minimize.
[2023-03-21 23:56:22] [INFO ] Deduced a trap composed of 25 places in 2774 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-21 23:56:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:56:22] [INFO ] After 26383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 118 ms.
Support contains 2 out of 5901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5901/5901 places, 5401/5401 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5901 transition count 4203
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4703 transition count 4203
Performed 801 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 801 Pre rules applied. Total rules applied 2396 place count 4703 transition count 3402
Deduced a syphon composed of 801 places in 10 ms
Reduce places removed 801 places and 0 transitions.
Iterating global reduction 2 with 1602 rules applied. Total rules applied 3998 place count 3902 transition count 3402
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7394 place count 2204 transition count 1704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7395 place count 2204 transition count 1703
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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7397 place count 2203 transition count 1702
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7599 place count 2102 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7801 place count 2001 transition count 1836
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 7995 place count 1904 transition count 1901
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7996 place count 1904 transition count 1900
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 8096 place count 1904 transition count 1900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8097 place count 1903 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8099 place count 1901 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8099 place count 1901 transition count 1898
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8101 place count 1900 transition count 1898
Applied a total of 8101 rules in 1136 ms. Remains 1900 /5901 variables (removed 4001) and now considering 1898/5401 (removed 3503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1136 ms. Remains : 1900/5901 places, 1898/5401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 96403 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96403 steps, saw 61277 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1898 rows 1900 cols
[2023-03-21 23:56:26] [INFO ] Computed 899 place invariants in 3 ms
[2023-03-21 23:56:27] [INFO ] [Real]Absence check using 899 positive place invariants in 179 ms returned sat
[2023-03-21 23:56:28] [INFO ] After 1407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:56:28] [INFO ] [Nat]Absence check using 899 positive place invariants in 183 ms returned sat
[2023-03-21 23:56:29] [INFO ] After 947ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:56:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:56:29] [INFO ] After 123ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:56:29] [INFO ] After 289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-21 23:56:29] [INFO ] After 1823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 61 ms.
Support contains 2 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1898/1898 transitions.
Applied a total of 0 rules in 44 ms. Remains 1900 /1900 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1900/1900 places, 1898/1898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1898/1898 transitions.
Applied a total of 0 rules in 43 ms. Remains 1900 /1900 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2023-03-21 23:56:30] [INFO ] Invariant cache hit.
[2023-03-21 23:56:31] [INFO ] Implicit Places using invariants in 1414 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1417 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1900 places, 1898/1898 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1898 transition count 1897
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1897
Applied a total of 2 rules in 78 ms. Remains 1898 /1899 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-21 23:56:31] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-21 23:56:32] [INFO ] Implicit Places using invariants in 1048 ms returned []
[2023-03-21 23:56:32] [INFO ] Invariant cache hit.
[2023-03-21 23:56:36] [INFO ] Implicit Places using invariants and state equation in 3525 ms returned []
Implicit Place search using SMT with State Equation took 4577 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1898/1900 places, 1897/1898 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6116 ms. Remains : 1898/1900 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 99527 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99527 steps, saw 62938 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:56:39] [INFO ] Invariant cache hit.
[2023-03-21 23:56:39] [INFO ] [Real]Absence check using 898 positive place invariants in 141 ms returned sat
[2023-03-21 23:56:40] [INFO ] After 1335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:56:41] [INFO ] [Nat]Absence check using 898 positive place invariants in 180 ms returned sat
[2023-03-21 23:56:42] [INFO ] After 938ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:56:42] [INFO ] After 1096ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-21 23:56:42] [INFO ] After 1714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 60 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 43 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 42 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-21 23:56:42] [INFO ] Invariant cache hit.
[2023-03-21 23:56:44] [INFO ] Implicit Places using invariants in 1413 ms returned []
[2023-03-21 23:56:44] [INFO ] Invariant cache hit.
[2023-03-21 23:56:47] [INFO ] Implicit Places using invariants and state equation in 3432 ms returned []
Implicit Place search using SMT with State Equation took 4851 ms to find 0 implicit places.
[2023-03-21 23:56:47] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-21 23:56:47] [INFO ] Invariant cache hit.
[2023-03-21 23:56:48] [INFO ] Dead Transitions using invariants and state equation in 1335 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6330 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 202 times.
Drop transitions removed 202 transitions
Iterating global reduction 0 with 202 rules applied. Total rules applied 202 place count 1898 transition count 1897
Applied a total of 202 rules in 83 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-21 23:56:49] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-21 23:56:49] [INFO ] [Real]Absence check using 898 positive place invariants in 155 ms returned sat
[2023-03-21 23:56:50] [INFO ] After 1354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:56:51] [INFO ] [Nat]Absence check using 898 positive place invariants in 191 ms returned sat
[2023-03-21 23:56:52] [INFO ] After 1133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:56:52] [INFO ] State equation strengthened by 199 read => feed constraints.
[2023-03-21 23:56:52] [INFO ] After 460ms SMT Verify possible using 199 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:56:52] [INFO ] After 630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-21 23:56:53] [INFO ] After 2589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 692 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5901/5901 places, 5401/5401 transitions.
Applied a total of 0 rules in 827 ms. Remains 5901 /5901 variables (removed 0) and now considering 5401/5401 (removed 0) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2023-03-21 23:56:55] [INFO ] Computed 901 place invariants in 38 ms
[2023-03-21 23:56:57] [INFO ] Implicit Places using invariants in 2234 ms returned []
[2023-03-21 23:56:57] [INFO ] Invariant cache hit.
[2023-03-21 23:56:59] [INFO ] Implicit Places using invariants and state equation in 2014 ms returned []
Implicit Place search using SMT with State Equation took 4266 ms to find 0 implicit places.
[2023-03-21 23:56:59] [INFO ] Invariant cache hit.
[2023-03-21 23:57:04] [INFO ] Dead Transitions using invariants and state equation in 5509 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10623 ms. Remains : 5901/5901 places, 5401/5401 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 222665 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 222665 steps, saw 211799 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:57:08] [INFO ] Invariant cache hit.
[2023-03-21 23:57:10] [INFO ] [Real]Absence check using 901 positive place invariants in 558 ms returned sat
[2023-03-21 23:57:14] [INFO ] After 6001ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:57:16] [INFO ] [Nat]Absence check using 901 positive place invariants in 584 ms returned sat
[2023-03-21 23:57:20] [INFO ] After 4651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:57:23] [INFO ] Deduced a trap composed of 27 places in 2209 ms of which 4 ms to minimize.
[2023-03-21 23:57:26] [INFO ] Deduced a trap composed of 17 places in 2645 ms of which 3 ms to minimize.
[2023-03-21 23:57:28] [INFO ] Deduced a trap composed of 22 places in 2259 ms of which 9 ms to minimize.
[2023-03-21 23:57:31] [INFO ] Deduced a trap composed of 23 places in 2373 ms of which 3 ms to minimize.
[2023-03-21 23:57:34] [INFO ] Deduced a trap composed of 22 places in 2530 ms of which 4 ms to minimize.
[2023-03-21 23:57:36] [INFO ] Deduced a trap composed of 20 places in 2258 ms of which 3 ms to minimize.
[2023-03-21 23:57:38] [INFO ] Deduced a trap composed of 24 places in 2175 ms of which 3 ms to minimize.
[2023-03-21 23:57:41] [INFO ] Deduced a trap composed of 25 places in 2529 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: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-21 23:57:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:57:41] [INFO ] After 26795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 100 ms.
Support contains 2 out of 5901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5901/5901 places, 5401/5401 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5901 transition count 4203
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4703 transition count 4203
Performed 801 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 801 Pre rules applied. Total rules applied 2396 place count 4703 transition count 3402
Deduced a syphon composed of 801 places in 9 ms
Reduce places removed 801 places and 0 transitions.
Iterating global reduction 2 with 1602 rules applied. Total rules applied 3998 place count 3902 transition count 3402
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 3 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7394 place count 2204 transition count 1704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7395 place count 2204 transition count 1703
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7397 place count 2203 transition count 1702
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7599 place count 2102 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7801 place count 2001 transition count 1836
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 7995 place count 1904 transition count 1901
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7996 place count 1904 transition count 1900
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 8096 place count 1904 transition count 1900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8097 place count 1903 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8099 place count 1901 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8099 place count 1901 transition count 1898
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8101 place count 1900 transition count 1898
Applied a total of 8101 rules in 1196 ms. Remains 1900 /5901 variables (removed 4001) and now considering 1898/5401 (removed 3503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1209 ms. Remains : 1900/5901 places, 1898/5401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 99156 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99156 steps, saw 63195 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1898 rows 1900 cols
[2023-03-21 23:57:46] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-21 23:57:46] [INFO ] [Real]Absence check using 899 positive place invariants in 152 ms returned sat
[2023-03-21 23:57:47] [INFO ] After 1505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:57:48] [INFO ] [Nat]Absence check using 899 positive place invariants in 148 ms returned sat
[2023-03-21 23:57:49] [INFO ] After 927ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:57:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:57:49] [INFO ] After 91ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:57:49] [INFO ] After 289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-21 23:57:49] [INFO ] After 1785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 68 ms.
Support contains 2 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1898/1898 transitions.
Applied a total of 0 rules in 42 ms. Remains 1900 /1900 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1900/1900 places, 1898/1898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1898/1898 transitions.
Applied a total of 0 rules in 41 ms. Remains 1900 /1900 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2023-03-21 23:57:49] [INFO ] Invariant cache hit.
[2023-03-21 23:57:51] [INFO ] Implicit Places using invariants in 1749 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1765 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1900 places, 1898/1898 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1898 transition count 1897
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1897
Applied a total of 2 rules in 77 ms. Remains 1898 /1899 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-21 23:57:51] [INFO ] Computed 898 place invariants in 5 ms
[2023-03-21 23:57:53] [INFO ] Implicit Places using invariants in 1839 ms returned []
[2023-03-21 23:57:53] [INFO ] Invariant cache hit.
[2023-03-21 23:57:56] [INFO ] Implicit Places using invariants and state equation in 3281 ms returned []
Implicit Place search using SMT with State Equation took 5151 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1898/1900 places, 1897/1898 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7035 ms. Remains : 1898/1900 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 100830 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100830 steps, saw 63776 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:57:59] [INFO ] Invariant cache hit.
[2023-03-21 23:58:00] [INFO ] [Real]Absence check using 898 positive place invariants in 194 ms returned sat
[2023-03-21 23:58:01] [INFO ] After 1387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:58:01] [INFO ] [Nat]Absence check using 898 positive place invariants in 168 ms returned sat
[2023-03-21 23:58:02] [INFO ] After 867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:58:02] [INFO ] After 997ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-21 23:58:02] [INFO ] After 1524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 51 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 42 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 41 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-21 23:58:03] [INFO ] Invariant cache hit.
[2023-03-21 23:58:04] [INFO ] Implicit Places using invariants in 1300 ms returned []
[2023-03-21 23:58:04] [INFO ] Invariant cache hit.
[2023-03-21 23:58:07] [INFO ] Implicit Places using invariants and state equation in 3069 ms returned []
Implicit Place search using SMT with State Equation took 4384 ms to find 0 implicit places.
[2023-03-21 23:58:07] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-21 23:58:07] [INFO ] Invariant cache hit.
[2023-03-21 23:58:09] [INFO ] Dead Transitions using invariants and state equation in 1668 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6195 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 202 times.
Drop transitions removed 202 transitions
Iterating global reduction 0 with 202 rules applied. Total rules applied 202 place count 1898 transition count 1897
Applied a total of 202 rules in 98 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-21 23:58:09] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-21 23:58:09] [INFO ] [Real]Absence check using 898 positive place invariants in 177 ms returned sat
[2023-03-21 23:58:10] [INFO ] After 1573ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:58:11] [INFO ] [Nat]Absence check using 898 positive place invariants in 154 ms returned sat
[2023-03-21 23:58:12] [INFO ] After 1536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:58:12] [INFO ] State equation strengthened by 199 read => feed constraints.
[2023-03-21 23:58:13] [INFO ] After 425ms SMT Verify possible using 199 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:58:13] [INFO ] After 554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-21 23:58:13] [INFO ] After 2643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 281 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1480 ms.
Product exploration explored 100000 steps with 0 reset in 1912 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5901 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5901/5901 places, 5401/5401 transitions.
Performed 1198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5901 transition count 5401
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 401 Pre rules applied. Total rules applied 1198 place count 5901 transition count 5702
Deduced a syphon composed of 1599 places in 17 ms
Iterating global reduction 1 with 401 rules applied. Total rules applied 1599 place count 5901 transition count 5702
Performed 1998 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3597 places in 12 ms
Iterating global reduction 1 with 1998 rules applied. Total rules applied 3597 place count 5901 transition count 5702
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3598 place count 5901 transition count 5701
Renaming transitions due to excessive name length > 1024 char.
Discarding 800 places :
Symmetric choice reduction at 2 with 800 rule applications. Total rules 4398 place count 5101 transition count 4901
Deduced a syphon composed of 2797 places in 9 ms
Iterating global reduction 2 with 800 rules applied. Total rules applied 5198 place count 5101 transition count 4901
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2798 places in 10 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5199 place count 5101 transition count 4901
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5201 place count 5099 transition count 4899
Deduced a syphon composed of 2796 places in 9 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5203 place count 5099 transition count 4899
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 2897 places in 15 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5304 place count 5099 transition count 5429
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5405 place count 4998 transition count 5227
Deduced a syphon composed of 2796 places in 15 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5506 place count 4998 transition count 5227
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -527
Deduced a syphon composed of 2897 places in 17 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5607 place count 4998 transition count 5754
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5708 place count 4897 transition count 5552
Deduced a syphon composed of 2796 places in 16 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5809 place count 4897 transition count 5552
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 2897 places in 13 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5910 place count 4897 transition count 6082
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6011 place count 4796 transition count 5880
Deduced a syphon composed of 2796 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6112 place count 4796 transition count 5880
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -512
Deduced a syphon composed of 2892 places in 13 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6208 place count 4796 transition count 6392
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 6304 place count 4700 transition count 6200
Deduced a syphon composed of 2796 places in 13 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6400 place count 4700 transition count 6200
Deduced a syphon composed of 2796 places in 12 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 6409 place count 4700 transition count 6191
Deduced a syphon composed of 2796 places in 12 ms
Applied a total of 6409 rules in 7777 ms. Remains 4700 /5901 variables (removed 1201) and now considering 6191/5401 (removed -790) transitions.
[2023-03-21 23:58:26] [INFO ] Redundant transitions in 267 ms returned []
// Phase 1: matrix 6191 rows 4700 cols
[2023-03-21 23:58:26] [INFO ] Computed 901 place invariants in 149 ms
[2023-03-21 23:58:30] [INFO ] Dead Transitions using invariants and state equation in 4278 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4700/5901 places, 6191/5401 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12358 ms. Remains : 4700/5901 places, 6191/5401 transitions.
Support contains 2 out of 5901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5901/5901 places, 5401/5401 transitions.
Applied a total of 0 rules in 846 ms. Remains 5901 /5901 variables (removed 0) and now considering 5401/5401 (removed 0) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2023-03-21 23:58:31] [INFO ] Computed 901 place invariants in 17 ms
[2023-03-21 23:58:34] [INFO ] Implicit Places using invariants in 2304 ms returned []
[2023-03-21 23:58:34] [INFO ] Invariant cache hit.
[2023-03-21 23:58:36] [INFO ] Implicit Places using invariants and state equation in 2270 ms returned []
Implicit Place search using SMT with State Equation took 4588 ms to find 0 implicit places.
[2023-03-21 23:58:36] [INFO ] Invariant cache hit.
[2023-03-21 23:58:41] [INFO ] Dead Transitions using invariants and state equation in 4904 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10345 ms. Remains : 5901/5901 places, 5401/5401 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLFireability-05 finished in 190002 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 3 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 5902 transition count 5402
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 5902 transition count 5402
Applied a total of 16 rules in 1531 ms. Remains 5902 /5910 variables (removed 8) and now considering 5402/5410 (removed 8) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-21 23:58:43] [INFO ] Computed 901 place invariants in 39 ms
[2023-03-21 23:58:45] [INFO ] Implicit Places using invariants in 2132 ms returned []
[2023-03-21 23:58:45] [INFO ] Invariant cache hit.
[2023-03-21 23:58:47] [INFO ] Implicit Places using invariants and state equation in 2285 ms returned []
Implicit Place search using SMT with State Equation took 4431 ms to find 0 implicit places.
[2023-03-21 23:58:47] [INFO ] Invariant cache hit.
[2023-03-21 23:58:52] [INFO ] Dead Transitions using invariants and state equation in 5017 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5910 places, 5402/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10999 ms. Remains : 5902/5910 places, 5402/5410 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s5242 1), p1:(AND (EQ s5270 1) (EQ s97 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4 reset in 1389 ms.
Stack based approach found an accepted trace after 3895 steps with 0 reset with depth 3896 and stack size 863 in 67 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-06 finished in 12736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 2 out of 5910 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1200 rules applied. Total rules applied 1200 place count 5909 transition count 4209
Reduce places removed 1200 places and 0 transitions.
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2400 place count 4709 transition count 4209
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2400 place count 4709 transition count 3413
Deduced a syphon composed of 796 places in 10 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 3992 place count 3913 transition count 3413
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 3999 place count 3906 transition count 3406
Iterating global reduction 2 with 7 rules applied. Total rules applied 4006 place count 3906 transition count 3406
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4006 place count 3906 transition count 3400
Deduced a syphon composed of 6 places in 10 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 4018 place count 3900 transition count 3400
Performed 1695 Post agglomeration using F-continuation condition.Transition count delta: 1695
Deduced a syphon composed of 1695 places in 4 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 2 with 3390 rules applied. Total rules applied 7408 place count 2205 transition count 1705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7409 place count 2205 transition count 1704
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7411 place count 2204 transition count 1703
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7613 place count 2103 transition count 1769
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7815 place count 2002 transition count 1837
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8009 place count 1905 transition count 1902
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8011 place count 1903 transition count 1900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8013 place count 1901 transition count 1900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8013 place count 1901 transition count 1899
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8015 place count 1900 transition count 1899
Applied a total of 8015 rules in 1437 ms. Remains 1900 /5910 variables (removed 4010) and now considering 1899/5410 (removed 3511) transitions.
// Phase 1: matrix 1899 rows 1900 cols
[2023-03-21 23:58:55] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-21 23:58:57] [INFO ] Implicit Places using invariants in 1270 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1283 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/5910 places, 1899/5410 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1898
Applied a total of 2 rules in 93 ms. Remains 1898 /1899 variables (removed 1) and now considering 1898/1899 (removed 1) transitions.
// Phase 1: matrix 1898 rows 1898 cols
[2023-03-21 23:58:57] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-21 23:58:58] [INFO ] Implicit Places using invariants in 1427 ms returned []
[2023-03-21 23:58:58] [INFO ] Invariant cache hit.
[2023-03-21 23:58:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 23:59:01] [INFO ] Implicit Places using invariants and state equation in 2944 ms returned []
Implicit Place search using SMT with State Equation took 4387 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1898/5910 places, 1898/5410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7200 ms. Remains : 1898/5910 places, 1898/5410 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-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 s821 0), p0:(EQ s202 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1404 ms.
Product exploration explored 100000 steps with 0 reset in 1979 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1898 stabilizing places and 2/1898 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 440 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 93078 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93078 steps, saw 56930 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 23:59:09] [INFO ] Invariant cache hit.
[2023-03-21 23:59:09] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:59:09] [INFO ] [Nat]Absence check using 898 positive place invariants in 138 ms returned sat
[2023-03-21 23:59:10] [INFO ] After 1064ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 23:59:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 23:59:11] [INFO ] After 173ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 23:59:11] [INFO ] After 464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-21 23:59:11] [INFO ] After 2099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 185 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1898/1898 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 1898 transition count 1897
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1897
Applied a total of 2 rules in 95 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1898 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 1898/1898 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 92821 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92821 steps, saw 57581 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-21 23:59:15] [INFO ] Computed 898 place invariants in 2 ms
[2023-03-21 23:59:15] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:59:15] [INFO ] [Nat]Absence check using 898 positive place invariants in 156 ms returned sat
[2023-03-21 23:59:17] [INFO ] After 1051ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 23:59:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 23:59:17] [INFO ] After 123ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 23:59:17] [INFO ] After 432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-21 23:59:17] [INFO ] After 2154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 219 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 45 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 46 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-21 23:59:18] [INFO ] Invariant cache hit.
[2023-03-21 23:59:19] [INFO ] Implicit Places using invariants in 1515 ms returned []
[2023-03-21 23:59:19] [INFO ] Invariant cache hit.
[2023-03-21 23:59:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 23:59:22] [INFO ] Implicit Places using invariants and state equation in 3350 ms returned []
Implicit Place search using SMT with State Equation took 4886 ms to find 0 implicit places.
[2023-03-21 23:59:23] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-21 23:59:23] [INFO ] Invariant cache hit.
[2023-03-21 23:59:24] [INFO ] Dead Transitions using invariants and state equation in 1351 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6347 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 203 times.
Drop transitions removed 203 transitions
Iterating global reduction 0 with 203 rules applied. Total rules applied 203 place count 1898 transition count 1897
Applied a total of 203 rules in 91 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-21 23:59:24] [INFO ] Computed 898 place invariants in 5 ms
[2023-03-21 23:59:24] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:59:25] [INFO ] [Nat]Absence check using 898 positive place invariants in 155 ms returned sat
[2023-03-21 23:59:26] [INFO ] After 1066ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 23:59:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-21 23:59:26] [INFO ] After 160ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 23:59:26] [INFO ] After 528ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 216 ms.
[2023-03-21 23:59:27] [INFO ] After 2334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 461 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Applied a total of 0 rules in 75 ms. Remains 1898 /1898 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
// Phase 1: matrix 1898 rows 1898 cols
[2023-03-21 23:59:27] [INFO ] Computed 898 place invariants in 4 ms
[2023-03-21 23:59:29] [INFO ] Implicit Places using invariants in 1532 ms returned []
[2023-03-21 23:59:29] [INFO ] Invariant cache hit.
[2023-03-21 23:59:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 23:59:32] [INFO ] Implicit Places using invariants and state equation in 3069 ms returned []
Implicit Place search using SMT with State Equation took 4609 ms to find 0 implicit places.
[2023-03-21 23:59:32] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-21 23:59:32] [INFO ] Invariant cache hit.
[2023-03-21 23:59:33] [INFO ] Dead Transitions using invariants and state equation in 1111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5824 ms. Remains : 1898/1898 places, 1898/1898 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1898 stabilizing places and 2/1898 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 97433 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97433 steps, saw 59800 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 23:59:37] [INFO ] Invariant cache hit.
[2023-03-21 23:59:37] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:59:38] [INFO ] [Nat]Absence check using 898 positive place invariants in 152 ms returned sat
[2023-03-21 23:59:39] [INFO ] After 924ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 23:59:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 23:59:39] [INFO ] After 99ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 23:59:39] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-21 23:59:39] [INFO ] After 1756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 108 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1898/1898 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 1898 transition count 1897
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1897
Applied a total of 2 rules in 94 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1898 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 1898/1898 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 89063 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89063 steps, saw 55262 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-21 23:59:43] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-21 23:59:43] [INFO ] After 396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:59:44] [INFO ] [Nat]Absence check using 898 positive place invariants in 155 ms returned sat
[2023-03-21 23:59:45] [INFO ] After 1076ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 23:59:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 23:59:45] [INFO ] After 188ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 23:59:45] [INFO ] After 449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 193 ms.
[2023-03-21 23:59:45] [INFO ] After 2250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 214 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 45 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 46 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-21 23:59:46] [INFO ] Invariant cache hit.
[2023-03-21 23:59:47] [INFO ] Implicit Places using invariants in 1666 ms returned []
[2023-03-21 23:59:47] [INFO ] Invariant cache hit.
[2023-03-21 23:59:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 23:59:51] [INFO ] Implicit Places using invariants and state equation in 3368 ms returned []
Implicit Place search using SMT with State Equation took 5050 ms to find 0 implicit places.
[2023-03-21 23:59:51] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-21 23:59:51] [INFO ] Invariant cache hit.
[2023-03-21 23:59:52] [INFO ] Dead Transitions using invariants and state equation in 1297 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6459 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 203 times.
Drop transitions removed 203 transitions
Iterating global reduction 0 with 203 rules applied. Total rules applied 203 place count 1898 transition count 1897
Applied a total of 203 rules in 92 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-21 23:59:52] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-21 23:59:52] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:59:53] [INFO ] [Nat]Absence check using 898 positive place invariants in 214 ms returned sat
[2023-03-21 23:59:54] [INFO ] After 1329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 23:59:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-21 23:59:55] [INFO ] After 180ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 23:59:55] [INFO ] After 515ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 237 ms.
[2023-03-21 23:59:55] [INFO ] After 2665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 411 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1546 ms.
Product exploration explored 100000 steps with 0 reset in 1831 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Applied a total of 0 rules in 59 ms. Remains 1898 /1898 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
// Phase 1: matrix 1898 rows 1898 cols
[2023-03-21 23:59:59] [INFO ] Computed 898 place invariants in 2 ms
[2023-03-22 00:00:01] [INFO ] Implicit Places using invariants in 1271 ms returned []
[2023-03-22 00:00:01] [INFO ] Invariant cache hit.
[2023-03-22 00:00:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 00:00:04] [INFO ] Implicit Places using invariants and state equation in 3224 ms returned []
Implicit Place search using SMT with State Equation took 4498 ms to find 0 implicit places.
[2023-03-22 00:00:04] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-22 00:00:04] [INFO ] Invariant cache hit.
[2023-03-22 00:00:05] [INFO ] Dead Transitions using invariants and state equation in 1313 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5948 ms. Remains : 1898/1898 places, 1898/1898 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLFireability-08 finished in 71430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&G(p1))))'
Support contains 5 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 5901 transition count 5401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 5901 transition count 5401
Applied a total of 18 rules in 1530 ms. Remains 5901 /5910 variables (removed 9) and now considering 5401/5410 (removed 9) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2023-03-22 00:00:07] [INFO ] Computed 901 place invariants in 18 ms
[2023-03-22 00:00:09] [INFO ] Implicit Places using invariants in 2383 ms returned []
[2023-03-22 00:00:09] [INFO ] Invariant cache hit.
[2023-03-22 00:00:10] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 3137 ms to find 0 implicit places.
[2023-03-22 00:00:10] [INFO ] Invariant cache hit.
[2023-03-22 00:00:15] [INFO ] Dead Transitions using invariants and state equation in 5104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5910 places, 5401/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9773 ms. Remains : 5901/5910 places, 5401/5410 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s3726 1) (EQ s3775 1) (EQ s501 0)), p0:(OR (EQ s2031 0) (EQ s2048 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1434 ms.
Stack based approach found an accepted trace after 5184 steps with 0 reset with depth 5185 and stack size 5185 in 89 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-09 finished in 11623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U X(p1)))))'
Support contains 4 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 5903 transition count 5403
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 5903 transition count 5403
Applied a total of 14 rules in 1555 ms. Remains 5903 /5910 variables (removed 7) and now considering 5403/5410 (removed 7) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2023-03-22 00:00:19] [INFO ] Computed 901 place invariants in 32 ms
[2023-03-22 00:00:21] [INFO ] Implicit Places using invariants in 2154 ms returned []
[2023-03-22 00:00:21] [INFO ] Invariant cache hit.
[2023-03-22 00:00:23] [INFO ] Implicit Places using invariants and state equation in 2295 ms returned []
Implicit Place search using SMT with State Equation took 4463 ms to find 0 implicit places.
[2023-03-22 00:00:23] [INFO ] Invariant cache hit.
[2023-03-22 00:00:28] [INFO ] Dead Transitions using invariants and state equation in 5203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5903/5910 places, 5403/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11232 ms. Remains : 5903/5910 places, 5403/5410 transitions.
Stuttering acceptance computed with spot in 451 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s5082 1) (EQ s129 1)), p1:(AND (EQ s3715 1) (EQ s3717 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-10 finished in 11785 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((G(p0)||(F(p2)&&p1))))'
Support contains 3 out of 5910 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5909 transition count 4211
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4711 transition count 4211
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 797 Pre rules applied. Total rules applied 2396 place count 4711 transition count 3414
Deduced a syphon composed of 797 places in 10 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 2 with 1594 rules applied. Total rules applied 3990 place count 3914 transition count 3414
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 3996 place count 3908 transition count 3408
Iterating global reduction 2 with 6 rules applied. Total rules applied 4002 place count 3908 transition count 3408
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4002 place count 3908 transition count 3403
Deduced a syphon composed of 5 places in 10 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 4012 place count 3903 transition count 3403
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 4 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 2 with 3394 rules applied. Total rules applied 7406 place count 2206 transition count 1706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7407 place count 2206 transition count 1705
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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7409 place count 2205 transition count 1704
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7611 place count 2104 transition count 1769
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7813 place count 2003 transition count 1837
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8005 place count 1907 transition count 1900
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8007 place count 1905 transition count 1898
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8009 place count 1903 transition count 1898
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8009 place count 1903 transition count 1897
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8011 place count 1902 transition count 1897
Applied a total of 8011 rules in 1456 ms. Remains 1902 /5910 variables (removed 4008) and now considering 1897/5410 (removed 3513) transitions.
// Phase 1: matrix 1897 rows 1902 cols
[2023-03-22 00:00:30] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-22 00:00:33] [INFO ] Implicit Places using invariants in 2512 ms returned [1891]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2532 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1901/5910 places, 1897/5410 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1900 transition count 1896
Applied a total of 2 rules in 113 ms. Remains 1900 /1901 variables (removed 1) and now considering 1896/1897 (removed 1) transitions.
// Phase 1: matrix 1896 rows 1900 cols
[2023-03-22 00:00:33] [INFO ] Computed 898 place invariants in 2 ms
[2023-03-22 00:00:34] [INFO ] Implicit Places using invariants in 1433 ms returned []
[2023-03-22 00:00:34] [INFO ] Invariant cache hit.
[2023-03-22 00:00:35] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 00:00:37] [INFO ] Implicit Places using invariants and state equation in 3014 ms returned []
Implicit Place search using SMT with State Equation took 4449 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1900/5910 places, 1896/5410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8550 ms. Remains : 1900/5910 places, 1896/5410 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s226 1) (EQ s98 1)), p0:(EQ s1602 0), p2:(EQ s226 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2665 steps with 0 reset in 78 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-11 finished in 8948 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 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 5901 transition count 5401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 5901 transition count 5401
Applied a total of 18 rules in 1620 ms. Remains 5901 /5910 variables (removed 9) and now considering 5401/5410 (removed 9) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2023-03-22 00:00:39] [INFO ] Computed 901 place invariants in 19 ms
[2023-03-22 00:00:41] [INFO ] Implicit Places using invariants in 2086 ms returned []
[2023-03-22 00:00:41] [INFO ] Invariant cache hit.
[2023-03-22 00:00:44] [INFO ] Implicit Places using invariants and state equation in 2280 ms returned []
Implicit Place search using SMT with State Equation took 4383 ms to find 0 implicit places.
[2023-03-22 00:00:44] [INFO ] Invariant cache hit.
[2023-03-22 00:00:49] [INFO ] Dead Transitions using invariants and state equation in 5007 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5910 places, 5401/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11024 ms. Remains : 5901/5910 places, 5401/5410 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-12 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 s3897 0)], 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 823 steps with 0 reset in 14 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-12 finished in 11359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 2 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 5902 transition count 5402
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 5902 transition count 5402
Applied a total of 16 rules in 1674 ms. Remains 5902 /5910 variables (removed 8) and now considering 5402/5410 (removed 8) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-22 00:00:51] [INFO ] Computed 901 place invariants in 20 ms
[2023-03-22 00:00:53] [INFO ] Implicit Places using invariants in 2441 ms returned []
[2023-03-22 00:00:53] [INFO ] Invariant cache hit.
[2023-03-22 00:00:55] [INFO ] Implicit Places using invariants and state equation in 2248 ms returned []
Implicit Place search using SMT with State Equation took 4716 ms to find 0 implicit places.
[2023-03-22 00:00:56] [INFO ] Invariant cache hit.
[2023-03-22 00:01:01] [INFO ] Dead Transitions using invariants and state equation in 5263 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5910 places, 5402/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11665 ms. Remains : 5902/5910 places, 5402/5410 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(NEQ s2606 1), p0:(NEQ s2872 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]]
Product exploration explored 100000 steps with 0 reset in 1501 ms.
Product exploration explored 100000 steps with 0 reset in 1884 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 430 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 4) 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 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 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 128854 steps, run timeout after 3002 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128854 steps, saw 127005 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 00:01:09] [INFO ] Invariant cache hit.
[2023-03-22 00:01:10] [INFO ] [Real]Absence check using 901 positive place invariants in 668 ms returned sat
[2023-03-22 00:01:16] [INFO ] After 7337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 00:01:17] [INFO ] [Nat]Absence check using 901 positive place invariants in 565 ms returned sat
[2023-03-22 00:01:23] [INFO ] After 5046ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 00:01:25] [INFO ] Deduced a trap composed of 23 places in 2058 ms of which 3 ms to minimize.
[2023-03-22 00:01:28] [INFO ] Deduced a trap composed of 19 places in 2013 ms of which 4 ms to minimize.
[2023-03-22 00:01:30] [INFO ] Deduced a trap composed of 24 places in 2182 ms of which 5 ms to minimize.
[2023-03-22 00:01:32] [INFO ] Deduced a trap composed of 17 places in 2052 ms of which 3 ms to minimize.
[2023-03-22 00:01:34] [INFO ] Deduced a trap composed of 17 places in 2025 ms of which 4 ms to minimize.
[2023-03-22 00:01:37] [INFO ] Deduced a trap composed of 31 places in 2360 ms of which 7 ms to minimize.
[2023-03-22 00:01:39] [INFO ] Deduced a trap composed of 21 places in 2020 ms of which 3 ms to minimize.
[2023-03-22 00:01:42] [INFO ] Deduced a trap composed of 32 places in 2139 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-22 00:01:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:01:42] [INFO ] After 25648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 496 ms.
Support contains 2 out of 5902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5902 transition count 4203
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4703 transition count 4203
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2398 place count 4703 transition count 3403
Deduced a syphon composed of 800 places in 11 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 3998 place count 3903 transition count 3403
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 4 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 2 with 3400 rules applied. Total rules applied 7398 place count 2203 transition count 1703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7399 place count 2203 transition count 1702
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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7401 place count 2202 transition count 1701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7603 place count 2101 transition count 1767
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7805 place count 2000 transition count 1834
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 7997 place count 1904 transition count 1899
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7998 place count 1904 transition count 1898
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 7999 place count 1904 transition count 1897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8000 place count 1903 transition count 1897
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 8100 place count 1903 transition count 1897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8101 place count 1902 transition count 1896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 8103 place count 1900 transition count 1896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 8103 place count 1900 transition count 1895
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 8105 place count 1899 transition count 1895
Applied a total of 8105 rules in 1230 ms. Remains 1899 /5902 variables (removed 4003) and now considering 1895/5402 (removed 3507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1230 ms. Remains : 1899/5902 places, 1895/5402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 71026 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71026 steps, saw 45138 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1895 rows 1899 cols
[2023-03-22 00:01:47] [INFO ] Computed 899 place invariants in 3 ms
[2023-03-22 00:01:48] [INFO ] [Real]Absence check using 899 positive place invariants in 179 ms returned sat
[2023-03-22 00:01:49] [INFO ] After 1717ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 00:01:49] [INFO ] [Nat]Absence check using 899 positive place invariants in 204 ms returned sat
[2023-03-22 00:01:51] [INFO ] After 1189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 00:01:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:01:51] [INFO ] After 392ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 00:01:52] [INFO ] After 1149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 390 ms.
[2023-03-22 00:01:52] [INFO ] After 3484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 436 ms.
Support contains 2 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1895/1895 transitions.
Applied a total of 0 rules in 63 ms. Remains 1899 /1899 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1899/1899 places, 1895/1895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1895/1895 transitions.
Applied a total of 0 rules in 46 ms. Remains 1899 /1899 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
[2023-03-22 00:01:53] [INFO ] Invariant cache hit.
[2023-03-22 00:01:54] [INFO ] Implicit Places using invariants in 1315 ms returned [1888]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1321 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1898/1899 places, 1895/1895 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1897 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1897 transition count 1894
Applied a total of 2 rules in 84 ms. Remains 1897 /1898 variables (removed 1) and now considering 1894/1895 (removed 1) transitions.
// Phase 1: matrix 1894 rows 1897 cols
[2023-03-22 00:01:54] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-22 00:01:56] [INFO ] Implicit Places using invariants in 1317 ms returned []
[2023-03-22 00:01:56] [INFO ] Invariant cache hit.
[2023-03-22 00:01:59] [INFO ] Implicit Places using invariants and state equation in 2981 ms returned []
Implicit Place search using SMT with State Equation took 4299 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1897/1899 places, 1894/1895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5750 ms. Remains : 1897/1899 places, 1894/1895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 70151 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70151 steps, saw 44420 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 00:02:03] [INFO ] Invariant cache hit.
[2023-03-22 00:02:03] [INFO ] [Real]Absence check using 898 positive place invariants in 207 ms returned sat
[2023-03-22 00:02:04] [INFO ] After 1904ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 00:02:05] [INFO ] [Nat]Absence check using 898 positive place invariants in 250 ms returned sat
[2023-03-22 00:02:06] [INFO ] After 1287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 00:02:07] [INFO ] After 1673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 374 ms.
[2023-03-22 00:02:07] [INFO ] After 2714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 338 ms.
Support contains 2 out of 1897 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 48 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1897/1897 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 46 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-22 00:02:08] [INFO ] Invariant cache hit.
[2023-03-22 00:02:09] [INFO ] Implicit Places using invariants in 1378 ms returned []
[2023-03-22 00:02:09] [INFO ] Invariant cache hit.
[2023-03-22 00:02:12] [INFO ] Implicit Places using invariants and state equation in 3056 ms returned []
Implicit Place search using SMT with State Equation took 4450 ms to find 0 implicit places.
[2023-03-22 00:02:12] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-22 00:02:12] [INFO ] Invariant cache hit.
[2023-03-22 00:02:13] [INFO ] Dead Transitions using invariants and state equation in 1191 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5718 ms. Remains : 1897/1897 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1897 transition count 1894
Applied a total of 199 rules in 123 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1894 rows 1897 cols
[2023-03-22 00:02:13] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-22 00:02:14] [INFO ] [Real]Absence check using 898 positive place invariants in 161 ms returned sat
[2023-03-22 00:02:15] [INFO ] After 1964ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 00:02:16] [INFO ] [Nat]Absence check using 898 positive place invariants in 169 ms returned sat
[2023-03-22 00:02:17] [INFO ] After 1111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 00:02:17] [INFO ] State equation strengthened by 197 read => feed constraints.
[2023-03-22 00:02:18] [INFO ] After 1038ms SMT Verify possible using 197 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 00:02:19] [INFO ] After 1699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 455 ms.
[2023-03-22 00:02:19] [INFO ] After 3887ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 503 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 5902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Applied a total of 0 rules in 772 ms. Remains 5902 /5902 variables (removed 0) and now considering 5402/5402 (removed 0) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-22 00:02:21] [INFO ] Computed 901 place invariants in 39 ms
[2023-03-22 00:02:23] [INFO ] Implicit Places using invariants in 2447 ms returned []
[2023-03-22 00:02:23] [INFO ] Invariant cache hit.
[2023-03-22 00:02:26] [INFO ] Implicit Places using invariants and state equation in 2305 ms returned []
Implicit Place search using SMT with State Equation took 4777 ms to find 0 implicit places.
[2023-03-22 00:02:26] [INFO ] Invariant cache hit.
[2023-03-22 00:02:30] [INFO ] Dead Transitions using invariants and state equation in 4869 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10423 ms. Remains : 5902/5902 places, 5402/5402 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 359 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 112707 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112707 steps, saw 111028 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 00:02:35] [INFO ] Invariant cache hit.
[2023-03-22 00:02:36] [INFO ] [Real]Absence check using 901 positive place invariants in 654 ms returned sat
[2023-03-22 00:02:41] [INFO ] After 6701ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 00:02:43] [INFO ] [Nat]Absence check using 901 positive place invariants in 561 ms returned sat
[2023-03-22 00:02:48] [INFO ] After 4960ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 00:02:51] [INFO ] Deduced a trap composed of 23 places in 2162 ms of which 2 ms to minimize.
[2023-03-22 00:02:53] [INFO ] Deduced a trap composed of 19 places in 2139 ms of which 3 ms to minimize.
[2023-03-22 00:02:56] [INFO ] Deduced a trap composed of 24 places in 2617 ms of which 4 ms to minimize.
[2023-03-22 00:02:58] [INFO ] Deduced a trap composed of 17 places in 2192 ms of which 28 ms to minimize.
[2023-03-22 00:03:01] [INFO ] Deduced a trap composed of 17 places in 2117 ms of which 3 ms to minimize.
[2023-03-22 00:03:03] [INFO ] Deduced a trap composed of 31 places in 2221 ms of which 3 ms to minimize.
[2023-03-22 00:03:05] [INFO ] Deduced a trap composed of 21 places in 2139 ms of which 3 ms to minimize.
[2023-03-22 00:03:08] [INFO ] Deduced a trap composed of 32 places in 2048 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: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-22 00:03:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 00:03:08] [INFO ] After 26233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 637 ms.
Support contains 2 out of 5902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5902 transition count 4203
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4703 transition count 4203
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2398 place count 4703 transition count 3403
Deduced a syphon composed of 800 places in 13 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 3998 place count 3903 transition count 3403
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 4 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 2 with 3400 rules applied. Total rules applied 7398 place count 2203 transition count 1703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7399 place count 2203 transition count 1702
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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7401 place count 2202 transition count 1701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7603 place count 2101 transition count 1767
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7805 place count 2000 transition count 1834
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 7997 place count 1904 transition count 1899
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7998 place count 1904 transition count 1898
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 7999 place count 1904 transition count 1897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8000 place count 1903 transition count 1897
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 8100 place count 1903 transition count 1897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8101 place count 1902 transition count 1896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 8103 place count 1900 transition count 1896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 8103 place count 1900 transition count 1895
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 8105 place count 1899 transition count 1895
Applied a total of 8105 rules in 1330 ms. Remains 1899 /5902 variables (removed 4003) and now considering 1895/5402 (removed 3507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1330 ms. Remains : 1899/5902 places, 1895/5402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 69079 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69079 steps, saw 43926 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1895 rows 1899 cols
[2023-03-22 00:03:13] [INFO ] Computed 899 place invariants in 5 ms
[2023-03-22 00:03:14] [INFO ] [Real]Absence check using 899 positive place invariants in 196 ms returned sat
[2023-03-22 00:03:15] [INFO ] After 1660ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 00:03:16] [INFO ] [Nat]Absence check using 899 positive place invariants in 228 ms returned sat
[2023-03-22 00:03:17] [INFO ] After 1271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 00:03:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:03:18] [INFO ] After 448ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 00:03:18] [INFO ] After 1190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 467 ms.
[2023-03-22 00:03:19] [INFO ] After 3667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 565 ms.
Support contains 2 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1895/1895 transitions.
Applied a total of 0 rules in 45 ms. Remains 1899 /1899 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1899/1899 places, 1895/1895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1895/1895 transitions.
Applied a total of 0 rules in 45 ms. Remains 1899 /1899 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
[2023-03-22 00:03:19] [INFO ] Invariant cache hit.
[2023-03-22 00:03:21] [INFO ] Implicit Places using invariants in 1333 ms returned [1888]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1336 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1898/1899 places, 1895/1895 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1897 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1897 transition count 1894
Applied a total of 2 rules in 86 ms. Remains 1897 /1898 variables (removed 1) and now considering 1894/1895 (removed 1) transitions.
// Phase 1: matrix 1894 rows 1897 cols
[2023-03-22 00:03:21] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-22 00:03:22] [INFO ] Implicit Places using invariants in 1371 ms returned []
[2023-03-22 00:03:22] [INFO ] Invariant cache hit.
[2023-03-22 00:03:26] [INFO ] Implicit Places using invariants and state equation in 3342 ms returned []
Implicit Place search using SMT with State Equation took 4753 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1897/1899 places, 1894/1895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6220 ms. Remains : 1897/1899 places, 1894/1895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 68543 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68543 steps, saw 43457 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 00:03:29] [INFO ] Invariant cache hit.
[2023-03-22 00:03:30] [INFO ] [Real]Absence check using 898 positive place invariants in 190 ms returned sat
[2023-03-22 00:03:31] [INFO ] After 1745ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 00:03:32] [INFO ] [Nat]Absence check using 898 positive place invariants in 174 ms returned sat
[2023-03-22 00:03:33] [INFO ] After 1267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 00:03:34] [INFO ] After 1855ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 339 ms.
[2023-03-22 00:03:34] [INFO ] After 2840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 372 ms.
Support contains 2 out of 1897 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 45 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1897/1897 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 46 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-22 00:03:34] [INFO ] Invariant cache hit.
[2023-03-22 00:03:36] [INFO ] Implicit Places using invariants in 1328 ms returned []
[2023-03-22 00:03:36] [INFO ] Invariant cache hit.
[2023-03-22 00:03:39] [INFO ] Implicit Places using invariants and state equation in 3033 ms returned []
Implicit Place search using SMT with State Equation took 4371 ms to find 0 implicit places.
[2023-03-22 00:03:39] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-22 00:03:39] [INFO ] Invariant cache hit.
[2023-03-22 00:03:40] [INFO ] Dead Transitions using invariants and state equation in 1287 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5734 ms. Remains : 1897/1897 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1897 transition count 1894
Applied a total of 199 rules in 90 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1894 rows 1897 cols
[2023-03-22 00:03:40] [INFO ] Computed 898 place invariants in 9 ms
[2023-03-22 00:03:41] [INFO ] [Real]Absence check using 898 positive place invariants in 264 ms returned sat
[2023-03-22 00:03:42] [INFO ] After 1601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 00:03:43] [INFO ] [Nat]Absence check using 898 positive place invariants in 238 ms returned sat
[2023-03-22 00:03:44] [INFO ] After 1210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 00:03:44] [INFO ] State equation strengthened by 197 read => feed constraints.
[2023-03-22 00:03:45] [INFO ] After 1082ms SMT Verify possible using 197 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 00:03:46] [INFO ] After 1740ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 457 ms.
[2023-03-22 00:03:46] [INFO ] After 4362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 494 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1402 ms.
Product exploration explored 100000 steps with 0 reset in 1809 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 5902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Performed 1199 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5902 transition count 5402
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 401 Pre rules applied. Total rules applied 1199 place count 5902 transition count 5704
Deduced a syphon composed of 1600 places in 16 ms
Iterating global reduction 1 with 401 rules applied. Total rules applied 1600 place count 5902 transition count 5704
Performed 1999 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3599 places in 12 ms
Iterating global reduction 1 with 1999 rules applied. Total rules applied 3599 place count 5902 transition count 5704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3600 place count 5902 transition count 5703
Renaming transitions due to excessive name length > 1024 char.
Discarding 800 places :
Symmetric choice reduction at 2 with 800 rule applications. Total rules 4400 place count 5102 transition count 4903
Deduced a syphon composed of 2799 places in 10 ms
Iterating global reduction 2 with 800 rules applied. Total rules applied 5200 place count 5102 transition count 4903
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2800 places in 39 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5201 place count 5102 transition count 4903
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5203 place count 5100 transition count 4901
Deduced a syphon composed of 2798 places in 9 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5205 place count 5100 transition count 4901
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 2899 places in 10 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5306 place count 5100 transition count 5431
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5407 place count 4999 transition count 5229
Deduced a syphon composed of 2798 places in 10 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5508 place count 4999 transition count 5229
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -531
Deduced a syphon composed of 2899 places in 13 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5609 place count 4999 transition count 5760
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5710 place count 4898 transition count 5558
Deduced a syphon composed of 2798 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5811 place count 4898 transition count 5558
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -534
Deduced a syphon composed of 2899 places in 13 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5912 place count 4898 transition count 6092
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6013 place count 4797 transition count 5890
Deduced a syphon composed of 2798 places in 13 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6114 place count 4797 transition count 5890
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -503
Deduced a syphon composed of 2893 places in 20 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6209 place count 4797 transition count 6393
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 6304 place count 4702 transition count 6203
Deduced a syphon composed of 2798 places in 12 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6399 place count 4702 transition count 6203
Deduced a syphon composed of 2798 places in 13 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 6408 place count 4702 transition count 6194
Deduced a syphon composed of 2798 places in 13 ms
Applied a total of 6408 rules in 6823 ms. Remains 4702 /5902 variables (removed 1200) and now considering 6194/5402 (removed -792) transitions.
[2023-03-22 00:03:58] [INFO ] Redundant transitions in 278 ms returned []
// Phase 1: matrix 6194 rows 4702 cols
[2023-03-22 00:03:58] [INFO ] Computed 901 place invariants in 190 ms
[2023-03-22 00:04:02] [INFO ] Dead Transitions using invariants and state equation in 4572 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4702/5902 places, 6194/5402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11690 ms. Remains : 4702/5902 places, 6194/5402 transitions.
Support contains 2 out of 5902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Applied a total of 0 rules in 728 ms. Remains 5902 /5902 variables (removed 0) and now considering 5402/5402 (removed 0) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-22 00:04:03] [INFO ] Computed 901 place invariants in 55 ms
[2023-03-22 00:04:06] [INFO ] Implicit Places using invariants in 2432 ms returned []
[2023-03-22 00:04:06] [INFO ] Invariant cache hit.
[2023-03-22 00:04:08] [INFO ] Implicit Places using invariants and state equation in 2418 ms returned []
Implicit Place search using SMT with State Equation took 4889 ms to find 0 implicit places.
[2023-03-22 00:04:08] [INFO ] Invariant cache hit.
[2023-03-22 00:04:13] [INFO ] Dead Transitions using invariants and state equation in 5163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10797 ms. Remains : 5902/5902 places, 5402/5402 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLFireability-13 finished in 204443 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) U p1))'
Support contains 3 out of 5910 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5909 transition count 4211
Reduce places removed 1198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2397 place count 4711 transition count 4210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2398 place count 4710 transition count 4210
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 796 Pre rules applied. Total rules applied 2398 place count 4710 transition count 3414
Deduced a syphon composed of 796 places in 12 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 3 with 1592 rules applied. Total rules applied 3990 place count 3914 transition count 3414
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 3997 place count 3907 transition count 3407
Iterating global reduction 3 with 7 rules applied. Total rules applied 4004 place count 3907 transition count 3407
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 4004 place count 3907 transition count 3401
Deduced a syphon composed of 6 places in 12 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 4016 place count 3901 transition count 3401
Performed 1694 Post agglomeration using F-continuation condition.Transition count delta: 1694
Deduced a syphon composed of 1694 places in 3 ms
Reduce places removed 1694 places and 0 transitions.
Iterating global reduction 3 with 3388 rules applied. Total rules applied 7404 place count 2207 transition count 1707
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7405 place count 2207 transition count 1706
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7407 place count 2206 transition count 1705
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7609 place count 2105 transition count 1771
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7811 place count 2004 transition count 1839
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8005 place count 1907 transition count 1904
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8007 place count 1905 transition count 1902
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8009 place count 1903 transition count 1902
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8009 place count 1903 transition count 1901
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8011 place count 1902 transition count 1901
Applied a total of 8011 rules in 1650 ms. Remains 1902 /5910 variables (removed 4008) and now considering 1901/5410 (removed 3509) transitions.
// Phase 1: matrix 1901 rows 1902 cols
[2023-03-22 00:04:15] [INFO ] Computed 899 place invariants in 7 ms
[2023-03-22 00:04:19] [INFO ] Implicit Places using invariants in 3918 ms returned [1891]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3923 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1901/5910 places, 1901/5410 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1900 transition count 1900
Applied a total of 2 rules in 107 ms. Remains 1900 /1901 variables (removed 1) and now considering 1900/1901 (removed 1) transitions.
// Phase 1: matrix 1900 rows 1900 cols
[2023-03-22 00:04:19] [INFO ] Computed 898 place invariants in 4 ms
[2023-03-22 00:04:21] [INFO ] Implicit Places using invariants in 1332 ms returned []
[2023-03-22 00:04:21] [INFO ] Invariant cache hit.
[2023-03-22 00:04:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 00:04:24] [INFO ] Implicit Places using invariants and state equation in 3040 ms returned []
Implicit Place search using SMT with State Equation took 4428 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1900/5910 places, 1900/5410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10108 ms. Remains : 1900/5910 places, 1900/5410 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s839 1) (EQ s858 1)), p0:(EQ s1216 1)], nbAcceptance=0, 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 ShieldIIPt-PT-100B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-14 finished in 10258 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(F(p0)) U G(p1)))))'
Support contains 2 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 5901 transition count 5401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 5901 transition count 5401
Applied a total of 18 rules in 1625 ms. Remains 5901 /5910 variables (removed 9) and now considering 5401/5410 (removed 9) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2023-03-22 00:04:25] [INFO ] Computed 901 place invariants in 19 ms
[2023-03-22 00:04:28] [INFO ] Implicit Places using invariants in 2317 ms returned []
[2023-03-22 00:04:28] [INFO ] Invariant cache hit.
[2023-03-22 00:04:30] [INFO ] Implicit Places using invariants and state equation in 2513 ms returned []
Implicit Place search using SMT with State Equation took 4836 ms to find 0 implicit places.
[2023-03-22 00:04:30] [INFO ] Invariant cache hit.
[2023-03-22 00:04:35] [INFO ] Dead Transitions using invariants and state equation in 5010 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5910 places, 5401/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11478 ms. Remains : 5901/5910 places, 5401/5410 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s5658 1), p0:(EQ s4129 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 277 reset in 722 ms.
Product exploration explored 100000 steps with 283 reset in 733 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/5901 stabilizing places and 1598/5401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 288 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 2258 steps, including 0 resets, run visited all 4 properties in 53 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 429 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
[2023-03-22 00:04:39] [INFO ] Invariant cache hit.
[2023-03-22 00:04:46] [INFO ] [Real]Absence check using 901 positive place invariants in 2697 ms returned unsat
Proved EG (NOT p1)
[2023-03-22 00:04:47] [INFO ] Invariant cache hit.
[2023-03-22 00:04:57] [INFO ] [Real]Absence check using 901 positive place invariants in 4608 ms returned sat
[2023-03-22 00:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:05:02] [INFO ] [Real]Absence check using state equation in 4109 ms returned unknown
Could not prove EG (NOT p0)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 289 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100B-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100B-LTLFireability-15 finished in 38040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-100B-LTLFireability-05
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5909 transition count 4210
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4710 transition count 4210
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2398 place count 4710 transition count 3414
Deduced a syphon composed of 796 places in 11 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 3990 place count 3914 transition count 3414
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 3997 place count 3907 transition count 3407
Iterating global reduction 2 with 7 rules applied. Total rules applied 4004 place count 3907 transition count 3407
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4004 place count 3907 transition count 3401
Deduced a syphon composed of 6 places in 10 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 4016 place count 3901 transition count 3401
Performed 1696 Post agglomeration using F-continuation condition.Transition count delta: 1696
Deduced a syphon composed of 1696 places in 5 ms
Reduce places removed 1696 places and 0 transitions.
Iterating global reduction 2 with 3392 rules applied. Total rules applied 7408 place count 2205 transition count 1705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7409 place count 2205 transition count 1704
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7411 place count 2204 transition count 1703
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7613 place count 2103 transition count 1769
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7815 place count 2002 transition count 1837
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 6 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8009 place count 1905 transition count 1902
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8011 place count 1903 transition count 1900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8013 place count 1901 transition count 1900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8013 place count 1901 transition count 1899
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8015 place count 1900 transition count 1899
Applied a total of 8015 rules in 1693 ms. Remains 1900 /5910 variables (removed 4010) and now considering 1899/5410 (removed 3511) transitions.
// Phase 1: matrix 1899 rows 1900 cols
[2023-03-22 00:05:04] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-22 00:05:05] [INFO ] Implicit Places using invariants in 1385 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1389 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1899/5910 places, 1899/5410 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1898
Applied a total of 2 rules in 91 ms. Remains 1898 /1899 variables (removed 1) and now considering 1898/1899 (removed 1) transitions.
// Phase 1: matrix 1898 rows 1898 cols
[2023-03-22 00:05:05] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-22 00:05:07] [INFO ] Implicit Places using invariants in 1170 ms returned []
[2023-03-22 00:05:07] [INFO ] Invariant cache hit.
[2023-03-22 00:05:10] [INFO ] Implicit Places using invariants and state equation in 3240 ms returned []
Implicit Place search using SMT with State Equation took 4425 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1898/5910 places, 1898/5410 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 7601 ms. Remains : 1898/5910 places, 1898/5410 transitions.
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-05 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s90 1) (NEQ s106 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, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1386 ms.
Product exploration explored 100000 steps with 0 reset in 1809 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 108991 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108991 steps, saw 67971 distinct states, run finished after 3003 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:05:17] [INFO ] Invariant cache hit.
[2023-03-22 00:05:17] [INFO ] [Real]Absence check using 898 positive place invariants in 180 ms returned sat
[2023-03-22 00:05:18] [INFO ] After 1341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:05:18] [INFO ] [Nat]Absence check using 898 positive place invariants in 140 ms returned sat
[2023-03-22 00:05:19] [INFO ] After 905ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:05:19] [INFO ] After 999ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-22 00:05:19] [INFO ] After 1442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 67 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1898/1898 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 1898 transition count 1897
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1897
Applied a total of 2 rules in 108 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1898 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 1898/1898 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 110402 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110402 steps, saw 69991 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-22 00:05:23] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-22 00:05:23] [INFO ] [Real]Absence check using 898 positive place invariants in 201 ms returned sat
[2023-03-22 00:05:24] [INFO ] After 1428ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:05:25] [INFO ] [Nat]Absence check using 898 positive place invariants in 224 ms returned sat
[2023-03-22 00:05:26] [INFO ] After 938ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:05:26] [INFO ] After 1062ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-22 00:05:26] [INFO ] After 1675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 51 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 82 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-22 00:05:26] [INFO ] Invariant cache hit.
[2023-03-22 00:05:28] [INFO ] Implicit Places using invariants in 1539 ms returned []
[2023-03-22 00:05:28] [INFO ] Invariant cache hit.
[2023-03-22 00:05:31] [INFO ] Implicit Places using invariants and state equation in 2935 ms returned []
Implicit Place search using SMT with State Equation took 4477 ms to find 0 implicit places.
[2023-03-22 00:05:31] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-22 00:05:31] [INFO ] Invariant cache hit.
[2023-03-22 00:05:32] [INFO ] Dead Transitions using invariants and state equation in 1240 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5858 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 202 times.
Drop transitions removed 202 transitions
Iterating global reduction 0 with 202 rules applied. Total rules applied 202 place count 1898 transition count 1897
Applied a total of 202 rules in 102 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-22 00:05:32] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-22 00:05:32] [INFO ] [Real]Absence check using 898 positive place invariants in 206 ms returned sat
[2023-03-22 00:05:33] [INFO ] After 1431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:05:34] [INFO ] [Nat]Absence check using 898 positive place invariants in 287 ms returned sat
[2023-03-22 00:05:35] [INFO ] After 1278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:05:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 00:05:35] [INFO ] After 92ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:05:35] [INFO ] After 234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-22 00:05:36] [INFO ] After 2158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Applied a total of 0 rules in 62 ms. Remains 1898 /1898 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
// Phase 1: matrix 1898 rows 1898 cols
[2023-03-22 00:05:36] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-22 00:05:38] [INFO ] Implicit Places using invariants in 1410 ms returned []
[2023-03-22 00:05:38] [INFO ] Invariant cache hit.
[2023-03-22 00:05:41] [INFO ] Implicit Places using invariants and state equation in 3506 ms returned []
Implicit Place search using SMT with State Equation took 4919 ms to find 0 implicit places.
[2023-03-22 00:05:41] [INFO ] Invariant cache hit.
[2023-03-22 00:05:43] [INFO ] Dead Transitions using invariants and state equation in 1748 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6731 ms. Remains : 1898/1898 places, 1898/1898 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 107991 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107991 steps, saw 67328 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:05:46] [INFO ] Invariant cache hit.
[2023-03-22 00:05:48] [INFO ] [Real]Absence check using 898 positive place invariants in 601 ms returned sat
[2023-03-22 00:05:49] [INFO ] After 2074ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:05:49] [INFO ] [Nat]Absence check using 898 positive place invariants in 144 ms returned sat
[2023-03-22 00:05:50] [INFO ] After 1024ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:05:50] [INFO ] After 1141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-22 00:05:50] [INFO ] After 1709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1898/1898 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 1898 transition count 1897
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1897
Applied a total of 2 rules in 95 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1898 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 1898/1898 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 108526 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108526 steps, saw 68946 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-22 00:05:54] [INFO ] Computed 898 place invariants in 5 ms
[2023-03-22 00:05:54] [INFO ] [Real]Absence check using 898 positive place invariants in 188 ms returned sat
[2023-03-22 00:05:55] [INFO ] After 1443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:05:56] [INFO ] [Nat]Absence check using 898 positive place invariants in 184 ms returned sat
[2023-03-22 00:05:56] [INFO ] After 870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:05:57] [INFO ] After 1022ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-22 00:05:57] [INFO ] After 1609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 46 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 56 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-22 00:05:57] [INFO ] Invariant cache hit.
[2023-03-22 00:05:58] [INFO ] Implicit Places using invariants in 1345 ms returned []
[2023-03-22 00:05:58] [INFO ] Invariant cache hit.
[2023-03-22 00:06:02] [INFO ] Implicit Places using invariants and state equation in 3430 ms returned []
Implicit Place search using SMT with State Equation took 4790 ms to find 0 implicit places.
[2023-03-22 00:06:02] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-22 00:06:02] [INFO ] Invariant cache hit.
[2023-03-22 00:06:03] [INFO ] Dead Transitions using invariants and state equation in 1506 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6386 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 202 times.
Drop transitions removed 202 transitions
Iterating global reduction 0 with 202 rules applied. Total rules applied 202 place count 1898 transition count 1897
Applied a total of 202 rules in 92 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-22 00:06:03] [INFO ] Computed 898 place invariants in 4 ms
[2023-03-22 00:06:04] [INFO ] [Real]Absence check using 898 positive place invariants in 254 ms returned sat
[2023-03-22 00:06:05] [INFO ] After 1515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:06:05] [INFO ] [Nat]Absence check using 898 positive place invariants in 237 ms returned sat
[2023-03-22 00:06:06] [INFO ] After 1091ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:06:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 00:06:07] [INFO ] After 90ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:06:07] [INFO ] After 293ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-22 00:06:07] [INFO ] After 2063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 257 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1412 ms.
Product exploration explored 100000 steps with 0 reset in 1765 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Applied a total of 0 rules in 62 ms. Remains 1898 /1898 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2023-03-22 00:06:11] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 1898 rows 1898 cols
[2023-03-22 00:06:12] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-22 00:06:13] [INFO ] Dead Transitions using invariants and state equation in 1119 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1231 ms. Remains : 1898/1898 places, 1898/1898 transitions.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Applied a total of 0 rules in 37 ms. Remains 1898 /1898 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2023-03-22 00:06:13] [INFO ] Invariant cache hit.
[2023-03-22 00:06:14] [INFO ] Implicit Places using invariants in 1458 ms returned []
[2023-03-22 00:06:14] [INFO ] Invariant cache hit.
[2023-03-22 00:06:18] [INFO ] Implicit Places using invariants and state equation in 3736 ms returned []
Implicit Place search using SMT with State Equation took 5225 ms to find 0 implicit places.
[2023-03-22 00:06:18] [INFO ] Invariant cache hit.
[2023-03-22 00:06:19] [INFO ] Dead Transitions using invariants and state equation in 1271 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6539 ms. Remains : 1898/1898 places, 1898/1898 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLFireability-05 finished in 77424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-100B-LTLFireability-13
Stuttering acceptance computed with spot in 180 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5909 transition count 4210
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4710 transition count 4210
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2398 place count 4710 transition count 3414
Deduced a syphon composed of 796 places in 10 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 3990 place count 3914 transition count 3414
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 3997 place count 3907 transition count 3407
Iterating global reduction 2 with 7 rules applied. Total rules applied 4004 place count 3907 transition count 3407
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4004 place count 3907 transition count 3401
Deduced a syphon composed of 6 places in 10 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 4016 place count 3901 transition count 3401
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 3 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 2 with 3394 rules applied. Total rules applied 7410 place count 2204 transition count 1704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7411 place count 2204 transition count 1703
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7413 place count 2203 transition count 1702
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7615 place count 2102 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7817 place count 2001 transition count 1835
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 6 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8009 place count 1905 transition count 1900
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8011 place count 1903 transition count 1898
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8013 place count 1901 transition count 1898
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8013 place count 1901 transition count 1897
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8015 place count 1900 transition count 1897
Applied a total of 8015 rules in 1597 ms. Remains 1900 /5910 variables (removed 4010) and now considering 1897/5410 (removed 3513) transitions.
// Phase 1: matrix 1897 rows 1900 cols
[2023-03-22 00:06:21] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-22 00:06:23] [INFO ] Implicit Places using invariants in 1578 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1579 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1899/5910 places, 1897/5410 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1896
Applied a total of 2 rules in 103 ms. Remains 1898 /1899 variables (removed 1) and now considering 1896/1897 (removed 1) transitions.
// Phase 1: matrix 1896 rows 1898 cols
[2023-03-22 00:06:23] [INFO ] Computed 898 place invariants in 2 ms
[2023-03-22 00:06:24] [INFO ] Implicit Places using invariants in 1342 ms returned []
[2023-03-22 00:06:24] [INFO ] Invariant cache hit.
[2023-03-22 00:06:27] [INFO ] Implicit Places using invariants and state equation in 2777 ms returned []
Implicit Place search using SMT with State Equation took 4120 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1898/5910 places, 1896/5410 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 7399 ms. Remains : 1898/5910 places, 1896/5410 transitions.
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(NEQ s820 1), p0:(NEQ s912 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1366 ms.
Product exploration explored 100000 steps with 0 reset in 1745 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 446 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 69363 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69363 steps, saw 42499 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 00:06:35] [INFO ] Invariant cache hit.
[2023-03-22 00:06:35] [INFO ] [Real]Absence check using 898 positive place invariants in 155 ms returned sat
[2023-03-22 00:06:36] [INFO ] After 1455ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 00:06:36] [INFO ] [Nat]Absence check using 898 positive place invariants in 162 ms returned sat
[2023-03-22 00:06:38] [INFO ] After 992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 00:06:38] [INFO ] After 1339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 305 ms.
[2023-03-22 00:06:38] [INFO ] After 2224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 196 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1896/1896 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 1898 transition count 1895
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1897 transition count 1894
Applied a total of 3 rules in 103 ms. Remains 1897 /1898 variables (removed 1) and now considering 1894/1896 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 1897/1898 places, 1894/1896 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 71390 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71390 steps, saw 44524 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1894 rows 1897 cols
[2023-03-22 00:06:42] [INFO ] Computed 898 place invariants in 15 ms
[2023-03-22 00:06:43] [INFO ] [Real]Absence check using 898 positive place invariants in 239 ms returned sat
[2023-03-22 00:06:45] [INFO ] After 2452ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 00:06:46] [INFO ] [Nat]Absence check using 898 positive place invariants in 323 ms returned sat
[2023-03-22 00:06:47] [INFO ] After 1202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 00:06:48] [INFO ] After 1871ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 402 ms.
[2023-03-22 00:06:48] [INFO ] After 3059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 560 ms.
Support contains 2 out of 1897 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 45 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1897/1897 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 46 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-22 00:06:49] [INFO ] Invariant cache hit.
[2023-03-22 00:06:50] [INFO ] Implicit Places using invariants in 1220 ms returned []
[2023-03-22 00:06:50] [INFO ] Invariant cache hit.
[2023-03-22 00:06:53] [INFO ] Implicit Places using invariants and state equation in 3021 ms returned []
Implicit Place search using SMT with State Equation took 4259 ms to find 0 implicit places.
[2023-03-22 00:06:53] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-22 00:06:53] [INFO ] Invariant cache hit.
[2023-03-22 00:06:54] [INFO ] Dead Transitions using invariants and state equation in 1119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5481 ms. Remains : 1897/1897 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1897 transition count 1894
Applied a total of 199 rules in 90 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1894 rows 1897 cols
[2023-03-22 00:06:54] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-22 00:06:55] [INFO ] [Real]Absence check using 898 positive place invariants in 225 ms returned sat
[2023-03-22 00:06:56] [INFO ] After 1913ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 00:06:57] [INFO ] [Nat]Absence check using 898 positive place invariants in 240 ms returned sat
[2023-03-22 00:06:59] [INFO ] After 1993ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 00:06:59] [INFO ] After 2456ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 328 ms.
[2023-03-22 00:07:00] [INFO ] After 3463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 413 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 147 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 places, 1896/1896 transitions.
Applied a total of 0 rules in 40 ms. Remains 1898 /1898 variables (removed 0) and now considering 1896/1896 (removed 0) transitions.
// Phase 1: matrix 1896 rows 1898 cols
[2023-03-22 00:07:00] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-22 00:07:02] [INFO ] Implicit Places using invariants in 1445 ms returned []
[2023-03-22 00:07:02] [INFO ] Invariant cache hit.
[2023-03-22 00:07:05] [INFO ] Implicit Places using invariants and state equation in 3545 ms returned []
Implicit Place search using SMT with State Equation took 5007 ms to find 0 implicit places.
[2023-03-22 00:07:05] [INFO ] Invariant cache hit.
[2023-03-22 00:07:06] [INFO ] Dead Transitions using invariants and state equation in 1124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6184 ms. Remains : 1898/1898 places, 1896/1896 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 265 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 73783 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73783 steps, saw 45162 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 00:07:11] [INFO ] Invariant cache hit.
[2023-03-22 00:07:11] [INFO ] [Real]Absence check using 898 positive place invariants in 171 ms returned sat
[2023-03-22 00:07:12] [INFO ] After 1718ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 00:07:13] [INFO ] [Nat]Absence check using 898 positive place invariants in 251 ms returned sat
[2023-03-22 00:07:15] [INFO ] After 1484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 00:07:15] [INFO ] After 2124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 452 ms.
[2023-03-22 00:07:16] [INFO ] After 3377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 221 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1896/1896 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 1898 transition count 1895
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1897 transition count 1894
Applied a total of 3 rules in 96 ms. Remains 1897 /1898 variables (removed 1) and now considering 1894/1896 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 1897/1898 places, 1894/1896 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 78275 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78275 steps, saw 48798 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1894 rows 1897 cols
[2023-03-22 00:07:20] [INFO ] Computed 898 place invariants in 2 ms
[2023-03-22 00:07:21] [INFO ] [Real]Absence check using 898 positive place invariants in 241 ms returned sat
[2023-03-22 00:07:22] [INFO ] After 1710ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 00:07:23] [INFO ] [Nat]Absence check using 898 positive place invariants in 185 ms returned sat
[2023-03-22 00:07:24] [INFO ] After 1439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 00:07:25] [INFO ] After 2132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 458 ms.
[2023-03-22 00:07:25] [INFO ] After 3481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 329 ms.
Support contains 2 out of 1897 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 45 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1897/1897 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 46 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-22 00:07:26] [INFO ] Invariant cache hit.
[2023-03-22 00:07:27] [INFO ] Implicit Places using invariants in 1069 ms returned []
[2023-03-22 00:07:27] [INFO ] Invariant cache hit.
[2023-03-22 00:07:30] [INFO ] Implicit Places using invariants and state equation in 3206 ms returned []
Implicit Place search using SMT with State Equation took 4294 ms to find 0 implicit places.
[2023-03-22 00:07:30] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-22 00:07:30] [INFO ] Invariant cache hit.
[2023-03-22 00:07:31] [INFO ] Dead Transitions using invariants and state equation in 1230 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5644 ms. Remains : 1897/1897 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1897 transition count 1894
Applied a total of 199 rules in 92 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1894 rows 1897 cols
[2023-03-22 00:07:31] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-22 00:07:32] [INFO ] [Real]Absence check using 898 positive place invariants in 168 ms returned sat
[2023-03-22 00:07:33] [INFO ] After 1608ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 00:07:34] [INFO ] [Nat]Absence check using 898 positive place invariants in 206 ms returned sat
[2023-03-22 00:07:35] [INFO ] After 1226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 00:07:36] [INFO ] After 1903ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 452 ms.
[2023-03-22 00:07:36] [INFO ] After 3121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 436 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 218 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 279 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1381 ms.
Product exploration explored 100000 steps with 0 reset in 1751 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 214 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 1896/1896 transitions.
Applied a total of 0 rules in 87 ms. Remains 1898 /1898 variables (removed 0) and now considering 1896/1896 (removed 0) transitions.
[2023-03-22 00:07:41] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 1896 rows 1898 cols
[2023-03-22 00:07:41] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-22 00:07:43] [INFO ] Dead Transitions using invariants and state equation in 2382 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2524 ms. Remains : 1898/1898 places, 1896/1896 transitions.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 places, 1896/1896 transitions.
Applied a total of 0 rules in 38 ms. Remains 1898 /1898 variables (removed 0) and now considering 1896/1896 (removed 0) transitions.
[2023-03-22 00:07:43] [INFO ] Invariant cache hit.
[2023-03-22 00:07:45] [INFO ] Implicit Places using invariants in 1975 ms returned []
[2023-03-22 00:07:45] [INFO ] Invariant cache hit.
[2023-03-22 00:07:50] [INFO ] Implicit Places using invariants and state equation in 4433 ms returned []
Implicit Place search using SMT with State Equation took 6421 ms to find 0 implicit places.
[2023-03-22 00:07:50] [INFO ] Invariant cache hit.
[2023-03-22 00:07:51] [INFO ] Dead Transitions using invariants and state equation in 1198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7659 ms. Remains : 1898/1898 places, 1896/1896 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLFireability-13 finished in 91687 ms.
[2023-03-22 00:07:51] [INFO ] Flatten gal took : 168 ms
[2023-03-22 00:07:51] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-22 00:07:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5910 places, 5410 transitions and 14020 arcs took 25 ms.
Total runtime 926603 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2824/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2824/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2824/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPt-PT-100B-LTLFireability-05
Could not compute solution for formula : ShieldIIPt-PT-100B-LTLFireability-08
Could not compute solution for formula : ShieldIIPt-PT-100B-LTLFireability-13

BK_STOP 1679443684060

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPt-PT-100B-LTLFireability-05
ltl formula formula --ltl=/tmp/2824/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 5910 places, 5410 transitions and 14020 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.780 real 0.210 user 0.320 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2824/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2824/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2824/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2824/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldIIPt-PT-100B-LTLFireability-08
ltl formula formula --ltl=/tmp/2824/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
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 5910 places, 5410 transitions and 14020 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.760 real 0.250 user 0.280 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2824/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2824/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2824/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2824/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 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 ShieldIIPt-PT-100B-LTLFireability-13
ltl formula formula --ltl=/tmp/2824/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
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 5910 places, 5410 transitions and 14020 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.830 real 0.270 user 0.300 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2824/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2824/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2824/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2824/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** 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="ShieldIIPt-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 ShieldIIPt-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 r393-oct2-167903716900348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100B.tgz
mv ShieldIIPt-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 ;