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-167903716900347.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716900347
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-100B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679442555847

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 23:49:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 23:49:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 23:49:18] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2023-03-21 23:49:18] [INFO ] Transformed 7003 places.
[2023-03-21 23:49:18] [INFO ] Transformed 6503 transitions.
[2023-03-21 23:49:18] [INFO ] Found NUPN structural information;
[2023-03-21 23:49:18] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 573 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-13 FALSE 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 1087 places :
Symmetric choice reduction at 0 with 1087 rule applications. Total rules 1087 place count 5916 transition count 5416
Iterating global reduction 0 with 1087 rules applied. Total rules applied 2174 place count 5916 transition count 5416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2175 place count 5915 transition count 5415
Iterating global reduction 0 with 1 rules applied. Total rules applied 2176 place count 5915 transition count 5415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2177 place count 5914 transition count 5414
Iterating global reduction 0 with 1 rules applied. Total rules applied 2178 place count 5914 transition count 5414
Applied a total of 2178 rules in 4267 ms. Remains 5914 /7003 variables (removed 1089) and now considering 5414/6503 (removed 1089) transitions.
// Phase 1: matrix 5414 rows 5914 cols
[2023-03-21 23:49:23] [INFO ] Computed 901 place invariants in 44 ms
[2023-03-21 23:49:26] [INFO ] Implicit Places using invariants in 2973 ms returned []
[2023-03-21 23:49:26] [INFO ] Invariant cache hit.
[2023-03-21 23:49:29] [INFO ] Implicit Places using invariants and state equation in 2699 ms returned []
Implicit Place search using SMT with State Equation took 5732 ms to find 0 implicit places.
[2023-03-21 23:49:29] [INFO ] Invariant cache hit.
[2023-03-21 23:49:34] [INFO ] Dead Transitions using invariants and state equation in 5433 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5914/7003 places, 5414/6503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15443 ms. Remains : 5914/7003 places, 5414/6503 transitions.
Support contains 43 out of 5914 places after structural reductions.
[2023-03-21 23:49:35] [INFO ] Flatten gal took : 306 ms
[2023-03-21 23:49:35] [INFO ] Flatten gal took : 230 ms
[2023-03-21 23:49:35] [INFO ] Input system was already deterministic with 5414 transitions.
Support contains 34 out of 5914 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 18) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-21 23:49:36] [INFO ] Invariant cache hit.
[2023-03-21 23:49:39] [INFO ] [Real]Absence check using 901 positive place invariants in 747 ms returned sat
[2023-03-21 23:49:39] [INFO ] After 3014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-21 23:49:42] [INFO ] [Nat]Absence check using 901 positive place invariants in 638 ms returned sat
[2023-03-21 23:49:50] [INFO ] After 7031ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-21 23:49:53] [INFO ] Deduced a trap composed of 17 places in 2495 ms of which 28 ms to minimize.
[2023-03-21 23:49:56] [INFO ] Deduced a trap composed of 17 places in 2543 ms of which 18 ms to minimize.
[2023-03-21 23:49:58] [INFO ] Deduced a trap composed of 16 places in 2326 ms of which 22 ms to minimize.
[2023-03-21 23:50:01] [INFO ] Deduced a trap composed of 27 places in 2426 ms of which 19 ms to minimize.
[2023-03-21 23:50:04] [INFO ] Deduced a trap composed of 26 places in 2091 ms of which 2 ms to minimize.
[2023-03-21 23:50:06] [INFO ] Deduced a trap composed of 23 places in 2175 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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:50:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:50:06] [INFO ] After 26415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 1 properties in 4237 ms.
Support contains 19 out of 5914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5914/5914 places, 5414/5414 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 5914 transition count 4225
Reduce places removed 1189 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1190 rules applied. Total rules applied 2379 place count 4725 transition count 4224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2380 place count 4724 transition count 4224
Performed 793 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 793 Pre rules applied. Total rules applied 2380 place count 4724 transition count 3431
Deduced a syphon composed of 793 places in 12 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 3 with 1586 rules applied. Total rules applied 3966 place count 3931 transition count 3431
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 3970 place count 3927 transition count 3427
Iterating global reduction 3 with 4 rules applied. Total rules applied 3974 place count 3927 transition count 3427
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 3974 place count 3927 transition count 3423
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 3982 place count 3923 transition count 3423
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 11 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 3 with 3402 rules applied. Total rules applied 7384 place count 2222 transition count 1722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7385 place count 2222 transition count 1721
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 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7387 place count 2221 transition count 1720
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
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 7589 place count 2120 transition count 1785
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
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 7791 place count 2019 transition count 1850
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 93 places in 6 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 4 with 186 rules applied. Total rules applied 7977 place count 1926 transition count 1910
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7978 place count 1926 transition count 1909
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 7981 place count 1926 transition count 1906
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 7984 place count 1923 transition count 1906
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 6 with 100 rules applied. Total rules applied 8084 place count 1923 transition count 1906
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 8085 place count 1922 transition count 1905
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 8087 place count 1920 transition count 1905
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 8087 place count 1920 transition count 1904
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 8089 place count 1919 transition count 1904
Applied a total of 8089 rules in 1998 ms. Remains 1919 /5914 variables (removed 3995) and now considering 1904/5414 (removed 3510) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1998 ms. Remains : 1919/5914 places, 1904/5414 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1904 rows 1919 cols
[2023-03-21 23:50:14] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-21 23:50:14] [INFO ] [Real]Absence check using 899 positive place invariants in 228 ms returned sat
[2023-03-21 23:50:14] [INFO ] After 761ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 23:50:15] [INFO ] [Nat]Absence check using 899 positive place invariants in 241 ms returned sat
[2023-03-21 23:50:18] [INFO ] After 1874ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 23:50:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-21 23:50:19] [INFO ] After 938ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-21 23:50:20] [INFO ] After 2320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 840 ms.
[2023-03-21 23:50:21] [INFO ] After 6548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 556 ms.
Support contains 17 out of 1919 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1919/1919 places, 1904/1904 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 1918 transition count 1904
Applied a total of 2 rules in 115 ms. Remains 1918 /1919 variables (removed 1) and now considering 1904/1904 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 1918/1919 places, 1904/1904 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 8) 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 8) seen :0
Interrupted probabilistic random walk after 55592 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55592 steps, saw 37373 distinct states, run finished after 3003 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1904 rows 1918 cols
[2023-03-21 23:50:26] [INFO ] Computed 899 place invariants in 4 ms
[2023-03-21 23:50:27] [INFO ] [Real]Absence check using 899 positive place invariants in 225 ms returned sat
[2023-03-21 23:50:27] [INFO ] After 758ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 23:50:28] [INFO ] [Nat]Absence check using 899 positive place invariants in 263 ms returned sat
[2023-03-21 23:50:30] [INFO ] After 1761ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 23:50:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-21 23:50:31] [INFO ] After 851ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-21 23:50:33] [INFO ] After 2291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 882 ms.
[2023-03-21 23:50:33] [INFO ] After 6347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 483 ms.
Support contains 17 out of 1918 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1918/1918 places, 1904/1904 transitions.
Applied a total of 0 rules in 61 ms. Remains 1918 /1918 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1918/1918 places, 1904/1904 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1918/1918 places, 1904/1904 transitions.
Applied a total of 0 rules in 71 ms. Remains 1918 /1918 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
[2023-03-21 23:50:34] [INFO ] Invariant cache hit.
[2023-03-21 23:50:36] [INFO ] Implicit Places using invariants in 1451 ms returned [1907]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1456 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1917/1918 places, 1904/1904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1916 transition count 1903
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1916 transition count 1903
Applied a total of 2 rules in 87 ms. Remains 1916 /1917 variables (removed 1) and now considering 1903/1904 (removed 1) transitions.
// Phase 1: matrix 1903 rows 1916 cols
[2023-03-21 23:50:36] [INFO ] Computed 898 place invariants in 9 ms
[2023-03-21 23:50:37] [INFO ] Implicit Places using invariants in 1571 ms returned []
[2023-03-21 23:50:37] [INFO ] Invariant cache hit.
[2023-03-21 23:50:39] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-21 23:50:41] [INFO ] Implicit Places using invariants and state equation in 3936 ms returned []
Implicit Place search using SMT with State Equation took 5517 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1916/1918 places, 1903/1904 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7132 ms. Remains : 1916/1918 places, 1903/1904 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) seen :0
Interrupted probabilistic random walk after 54926 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54926 steps, saw 38833 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-21 23:50:46] [INFO ] Invariant cache hit.
[2023-03-21 23:50:46] [INFO ] [Real]Absence check using 898 positive place invariants in 213 ms returned sat
[2023-03-21 23:50:47] [INFO ] After 827ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 23:50:47] [INFO ] [Nat]Absence check using 898 positive place invariants in 207 ms returned sat
[2023-03-21 23:50:50] [INFO ] After 1795ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 23:50:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-21 23:50:50] [INFO ] After 804ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-21 23:50:51] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 1 ms to minimize.
[2023-03-21 23:50:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2023-03-21 23:50:52] [INFO ] After 2261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 837 ms.
[2023-03-21 23:50:53] [INFO ] After 6079ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 339 ms.
Support contains 17 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 1903/1903 transitions.
Applied a total of 0 rules in 50 ms. Remains 1916 /1916 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1916/1916 places, 1903/1903 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 1903/1903 transitions.
Applied a total of 0 rules in 49 ms. Remains 1916 /1916 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2023-03-21 23:50:53] [INFO ] Invariant cache hit.
[2023-03-21 23:50:55] [INFO ] Implicit Places using invariants in 2129 ms returned []
[2023-03-21 23:50:55] [INFO ] Invariant cache hit.
[2023-03-21 23:50:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-21 23:50:59] [INFO ] Implicit Places using invariants and state equation in 3438 ms returned []
Implicit Place search using SMT with State Equation took 5582 ms to find 0 implicit places.
[2023-03-21 23:50:59] [INFO ] Redundant transitions in 176 ms returned []
[2023-03-21 23:50:59] [INFO ] Invariant cache hit.
[2023-03-21 23:51:00] [INFO ] Dead Transitions using invariants and state equation in 1379 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7203 ms. Remains : 1916/1916 places, 1903/1903 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1916 transition count 1903
Applied a total of 200 rules in 98 ms. Remains 1916 /1916 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 1903 rows 1916 cols
[2023-03-21 23:51:00] [INFO ] Computed 898 place invariants in 10 ms
[2023-03-21 23:51:01] [INFO ] [Real]Absence check using 898 positive place invariants in 241 ms returned sat
[2023-03-21 23:51:01] [INFO ] After 915ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 23:51:02] [INFO ] [Nat]Absence check using 898 positive place invariants in 209 ms returned sat
[2023-03-21 23:51:04] [INFO ] After 1640ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 23:51:04] [INFO ] State equation strengthened by 197 read => feed constraints.
[2023-03-21 23:51:05] [INFO ] After 1203ms SMT Verify possible using 197 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-21 23:51:07] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 1 ms to minimize.
[2023-03-21 23:51:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2023-03-21 23:51:07] [INFO ] After 3082ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1014 ms.
[2023-03-21 23:51:08] [INFO ] After 6964ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Computed a total of 1601 stabilizing places and 1601 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 5914 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5914/5914 places, 5414/5414 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 5913 transition count 4215
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4715 transition count 4215
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2396 place count 4715 transition count 3419
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 3988 place count 3919 transition count 3419
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 3998 place count 3909 transition count 3409
Iterating global reduction 2 with 10 rules applied. Total rules applied 4008 place count 3909 transition count 3409
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4008 place count 3909 transition count 3402
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 4022 place count 3902 transition count 3402
Performed 1695 Post agglomeration using F-continuation condition.Transition count delta: 1695
Deduced a syphon composed of 1695 places in 5 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 2 with 3390 rules applied. Total rules applied 7412 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 7413 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 7415 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 3 with 202 rules applied. Total rules applied 7617 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 3 with 202 rules applied. Total rules applied 7819 place count 2004 transition count 1839
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -64
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 8011 place count 1908 transition count 1903
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 8012 place count 1908 transition count 1903
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8014 place count 1906 transition count 1901
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8016 place count 1904 transition count 1901
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8016 place count 1904 transition count 1900
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 8018 place count 1903 transition count 1900
Applied a total of 8018 rules in 1620 ms. Remains 1903 /5914 variables (removed 4011) and now considering 1900/5414 (removed 3514) transitions.
// Phase 1: matrix 1900 rows 1903 cols
[2023-03-21 23:51:10] [INFO ] Computed 899 place invariants in 10 ms
[2023-03-21 23:51:12] [INFO ] Implicit Places using invariants in 1272 ms returned [1892]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1281 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1902/5914 places, 1900/5414 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 1899
Applied a total of 2 rules in 120 ms. Remains 1901 /1902 variables (removed 1) and now considering 1899/1900 (removed 1) transitions.
// Phase 1: matrix 1899 rows 1901 cols
[2023-03-21 23:51:12] [INFO ] Computed 898 place invariants in 8 ms
[2023-03-21 23:51:13] [INFO ] Implicit Places using invariants in 1658 ms returned []
[2023-03-21 23:51:13] [INFO ] Invariant cache hit.
[2023-03-21 23:51:15] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-21 23:51:17] [INFO ] Implicit Places using invariants and state equation in 3451 ms returned []
Implicit Place search using SMT with State Equation took 5114 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1901/5914 places, 1899/5414 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8136 ms. Remains : 1901/5914 places, 1899/5414 transitions.
Stuttering acceptance computed with spot in 449 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s1785 0) (EQ s1328 1)), p1:(EQ s267 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-00 finished in 8686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 5914 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5914/5914 places, 5414/5414 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 5913 transition count 4215
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4715 transition count 4215
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 795 Pre rules applied. Total rules applied 2396 place count 4715 transition count 3420
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 3986 place count 3920 transition count 3420
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 3995 place count 3911 transition count 3411
Iterating global reduction 2 with 9 rules applied. Total rules applied 4004 place count 3911 transition count 3411
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4004 place count 3911 transition count 3404
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 4018 place count 3904 transition count 3404
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 5 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7416 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 7417 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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7419 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 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7621 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 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7823 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 8017 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 8019 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 8021 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 8021 place count 1901 transition count 1899
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 8023 place count 1900 transition count 1899
Applied a total of 8023 rules in 1675 ms. Remains 1900 /5914 variables (removed 4014) and now considering 1899/5414 (removed 3515) transitions.
// Phase 1: matrix 1899 rows 1900 cols
[2023-03-21 23:51:19] [INFO ] Computed 899 place invariants in 8 ms
[2023-03-21 23:51:21] [INFO ] Implicit Places using invariants in 1505 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1519 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/5914 places, 1899/5414 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 1898
Applied a total of 2 rules in 87 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:51:21] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-21 23:51:22] [INFO ] Implicit Places using invariants in 1575 ms returned []
[2023-03-21 23:51:22] [INFO ] Invariant cache hit.
[2023-03-21 23:51:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:51:26] [INFO ] Implicit Places using invariants and state equation in 3544 ms returned []
Implicit Place search using SMT with State Equation took 5128 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1898/5914 places, 1898/5414 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8409 ms. Remains : 1898/5914 places, 1898/5414 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1295 0) (EQ s1063 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]]
Product exploration explored 100000 steps with 0 reset in 1546 ms.
Product exploration explored 100000 steps with 0 reset in 1900 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(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 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 111635 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111635 steps, saw 68083 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:51:33] [INFO ] Invariant cache hit.
[2023-03-21 23:51:33] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:51:34] [INFO ] [Nat]Absence check using 898 positive place invariants in 155 ms returned sat
[2023-03-21 23:51:35] [INFO ] After 1042ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:51:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:51:35] [INFO ] After 52ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:51:35] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-21 23:51:35] [INFO ] After 1741ms 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, 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
Applied a total of 1 rules in 57 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 57 ms. Remains : 1898/1898 places, 1897/1898 transitions.
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 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 114157 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114157 steps, saw 71633 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-21 23:51:39] [INFO ] Computed 898 place invariants in 8 ms
[2023-03-21 23:51:39] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:51:39] [INFO ] [Nat]Absence check using 898 positive place invariants in 150 ms returned sat
[2023-03-21 23:51:40] [INFO ] After 1229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:51:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:51:41] [INFO ] After 81ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:51:41] [INFO ] After 285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-21 23:51:41] [INFO ] After 2075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 56 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 53 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 53 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 53 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-21 23:51:41] [INFO ] Invariant cache hit.
[2023-03-21 23:51:43] [INFO ] Implicit Places using invariants in 1911 ms returned []
[2023-03-21 23:51:43] [INFO ] Invariant cache hit.
[2023-03-21 23:51:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:51:46] [INFO ] Implicit Places using invariants and state equation in 3525 ms returned []
Implicit Place search using SMT with State Equation took 5443 ms to find 0 implicit places.
[2023-03-21 23:51:47] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-21 23:51:47] [INFO ] Invariant cache hit.
[2023-03-21 23:51:48] [INFO ] Dead Transitions using invariants and state equation in 1234 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6797 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1898 transition count 1897
Applied a total of 200 rules in 100 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:51:48] [INFO ] Computed 898 place invariants in 8 ms
[2023-03-21 23:51:48] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:51:49] [INFO ] [Nat]Absence check using 898 positive place invariants in 244 ms returned sat
[2023-03-21 23:51:50] [INFO ] After 998ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:51:50] [INFO ] After 1133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-21 23:51:50] [INFO ] After 1787ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 232 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(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 88 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:51:51] [INFO ] Computed 898 place invariants in 4 ms
[2023-03-21 23:51:52] [INFO ] Implicit Places using invariants in 1529 ms returned []
[2023-03-21 23:51:52] [INFO ] Invariant cache hit.
[2023-03-21 23:51:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:51:55] [INFO ] Implicit Places using invariants and state equation in 3015 ms returned []
Implicit Place search using SMT with State Equation took 4573 ms to find 0 implicit places.
[2023-03-21 23:51:55] [INFO ] Redundant transitions in 107 ms returned []
[2023-03-21 23:51:55] [INFO ] Invariant cache hit.
[2023-03-21 23:51:56] [INFO ] Dead Transitions using invariants and state equation in 1125 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5900 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
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 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 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 108886 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108886 steps, saw 66242 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:52:00] [INFO ] Invariant cache hit.
[2023-03-21 23:52:00] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:52:01] [INFO ] [Nat]Absence check using 898 positive place invariants in 182 ms returned sat
[2023-03-21 23:52:02] [INFO ] After 895ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:52:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:52:02] [INFO ] After 121ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:52:02] [INFO ] After 315ms 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:52:02] [INFO ] After 1825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 66 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
Applied a total of 1 rules in 51 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 51 ms. Remains : 1898/1898 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 105542 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105542 steps, saw 66368 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-21 23:52:05] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-21 23:52:06] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:52:06] [INFO ] [Nat]Absence check using 898 positive place invariants in 174 ms returned sat
[2023-03-21 23:52:07] [INFO ] After 1012ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:52:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:52:07] [INFO ] After 89ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:52:08] [INFO ] After 272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-21 23:52:08] [INFO ] After 1941ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 53 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 48 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 48 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 45 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-21 23:52:08] [INFO ] Invariant cache hit.
[2023-03-21 23:52:10] [INFO ] Implicit Places using invariants in 1911 ms returned []
[2023-03-21 23:52:10] [INFO ] Invariant cache hit.
[2023-03-21 23:52:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:52:13] [INFO ] Implicit Places using invariants and state equation in 3232 ms returned []
Implicit Place search using SMT with State Equation took 5146 ms to find 0 implicit places.
[2023-03-21 23:52:13] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-21 23:52:13] [INFO ] Invariant cache hit.
[2023-03-21 23:52:15] [INFO ] Dead Transitions using invariants and state equation in 1770 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7040 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1898 transition count 1897
Applied a total of 200 rules in 124 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:52:15] [INFO ] Computed 898 place invariants in 8 ms
[2023-03-21 23:52:15] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:52:16] [INFO ] [Nat]Absence check using 898 positive place invariants in 163 ms returned sat
[2023-03-21 23:52:17] [INFO ] After 989ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:52:17] [INFO ] After 1134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-21 23:52:17] [INFO ] After 1712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1417 ms.
Product exploration explored 100000 steps with 0 reset in 1808 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 47 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:52:21] [INFO ] Computed 898 place invariants in 8 ms
[2023-03-21 23:52:23] [INFO ] Implicit Places using invariants in 1699 ms returned []
[2023-03-21 23:52:23] [INFO ] Invariant cache hit.
[2023-03-21 23:52:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:52:26] [INFO ] Implicit Places using invariants and state equation in 3114 ms returned []
Implicit Place search using SMT with State Equation took 4815 ms to find 0 implicit places.
[2023-03-21 23:52:26] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-21 23:52:26] [INFO ] Invariant cache hit.
[2023-03-21 23:52:27] [INFO ] Dead Transitions using invariants and state equation in 1247 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6194 ms. Remains : 1898/1898 places, 1898/1898 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-01 finished in 70020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(G(p2)))))'
Support contains 5 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5903 transition count 5403
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5903 transition count 5403
Applied a total of 22 rules in 1496 ms. Remains 5903 /5914 variables (removed 11) and now considering 5403/5414 (removed 11) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2023-03-21 23:52:29] [INFO ] Computed 901 place invariants in 42 ms
[2023-03-21 23:52:32] [INFO ] Implicit Places using invariants in 2618 ms returned []
[2023-03-21 23:52:32] [INFO ] Invariant cache hit.
[2023-03-21 23:52:34] [INFO ] Implicit Places using invariants and state equation in 2363 ms returned []
Implicit Place search using SMT with State Equation took 5003 ms to find 0 implicit places.
[2023-03-21 23:52:34] [INFO ] Invariant cache hit.
[2023-03-21 23:52:39] [INFO ] Dead Transitions using invariants and state equation in 4989 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5903/5914 places, 5403/5414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11491 ms. Remains : 5903/5914 places, 5403/5414 transitions.
Stuttering acceptance computed with spot in 361 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(EQ s2169 1), p0:(OR (EQ s2008 0) (EQ s5409 1)), p2:(AND (EQ s2169 0) (OR (EQ s1734 0) (EQ s5800 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1830 steps with 0 reset in 40 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-02 finished in 11998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 4 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5902 transition count 5402
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5902 transition count 5402
Applied a total of 24 rules in 1588 ms. Remains 5902 /5914 variables (removed 12) and now considering 5402/5414 (removed 12) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-21 23:52:41] [INFO ] Computed 901 place invariants in 41 ms
[2023-03-21 23:52:43] [INFO ] Implicit Places using invariants in 2465 ms returned []
[2023-03-21 23:52:43] [INFO ] Invariant cache hit.
[2023-03-21 23:52:46] [INFO ] Implicit Places using invariants and state equation in 2354 ms returned []
Implicit Place search using SMT with State Equation took 4847 ms to find 0 implicit places.
[2023-03-21 23:52:46] [INFO ] Invariant cache hit.
[2023-03-21 23:52:51] [INFO ] Dead Transitions using invariants and state equation in 5114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5914 places, 5402/5414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11566 ms. Remains : 5902/5914 places, 5402/5414 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (EQ s2535 0) (EQ s4430 1)), p0:(OR (EQ s4865 0) (EQ s4703 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1532 ms.
Product exploration explored 100000 steps with 0 reset in 2079 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 p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 238 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:52:56] [INFO ] Invariant cache hit.
[2023-03-21 23:52:56] [INFO ] After 719ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:52:58] [INFO ] [Nat]Absence check using 901 positive place invariants in 545 ms returned sat
[2023-03-21 23:53:03] [INFO ] After 4999ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:53:06] [INFO ] Deduced a trap composed of 31 places in 2415 ms of which 3 ms to minimize.
[2023-03-21 23:53:08] [INFO ] Deduced a trap composed of 21 places in 2607 ms of which 3 ms to minimize.
[2023-03-21 23:53:11] [INFO ] Deduced a trap composed of 25 places in 2278 ms of which 3 ms to minimize.
[2023-03-21 23:53:13] [INFO ] Deduced a trap composed of 12 places in 2395 ms of which 6 ms to minimize.
[2023-03-21 23:53:16] [INFO ] Deduced a trap composed of 27 places in 2307 ms of which 4 ms to minimize.
[2023-03-21 23:53:18] [INFO ] Deduced a trap composed of 36 places in 2358 ms of which 4 ms to minimize.
[2023-03-21 23:53:21] [INFO ] Deduced a trap composed of 20 places in 2106 ms of which 3 ms to minimize.
[2023-03-21 23:53:23] [INFO ] Deduced a trap composed of 17 places in 2326 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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:53:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:53:23] [INFO ] After 26901ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 139 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 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 5902 transition count 4204
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4704 transition count 4204
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2396 place count 4704 transition count 3404
Deduced a syphon composed of 800 places in 12 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 3996 place count 3904 transition count 3404
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 5 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 2 with 3402 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 4 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 6 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: -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 7805 place count 2000 transition count 1833
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 5 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 1898
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 1897
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 8098 place count 1904 transition count 1897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8099 place count 1903 transition count 1896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8101 place count 1901 transition count 1896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8101 place count 1901 transition count 1895
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 8103 place count 1900 transition count 1895
Applied a total of 8103 rules in 1539 ms. Remains 1900 /5902 variables (removed 4002) and now considering 1895/5402 (removed 3507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1539 ms. Remains : 1900/5902 places, 1895/5402 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 145 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100393 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100393 steps, saw 63930 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1895 rows 1900 cols
[2023-03-21 23:53:28] [INFO ] Computed 899 place invariants in 7 ms
[2023-03-21 23:53:29] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:53:29] [INFO ] [Nat]Absence check using 899 positive place invariants in 171 ms returned sat
[2023-03-21 23:53:30] [INFO ] After 970ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:53:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:53:30] [INFO ] After 112ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:53:30] [INFO ] After 277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-21 23:53:30] [INFO ] After 1857ms 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 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1895/1895 transitions.
Applied a total of 0 rules in 47 ms. Remains 1900 /1900 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1900/1900 places, 1895/1895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1895/1895 transitions.
Applied a total of 0 rules in 44 ms. Remains 1900 /1900 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
[2023-03-21 23:53:31] [INFO ] Invariant cache hit.
[2023-03-21 23:53:33] [INFO ] Implicit Places using invariants in 1931 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1934 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1900 places, 1895/1895 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1898 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1894
Applied a total of 2 rules in 95 ms. Remains 1898 /1899 variables (removed 1) and now considering 1894/1895 (removed 1) transitions.
// Phase 1: matrix 1894 rows 1898 cols
[2023-03-21 23:53:33] [INFO ] Computed 898 place invariants in 5 ms
[2023-03-21 23:53:34] [INFO ] Implicit Places using invariants in 1104 ms returned []
[2023-03-21 23:53:34] [INFO ] Invariant cache hit.
[2023-03-21 23:53:37] [INFO ] Implicit Places using invariants and state equation in 3460 ms returned []
Implicit Place search using SMT with State Equation took 4578 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1898/1900 places, 1894/1895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6654 ms. Remains : 1898/1900 places, 1894/1895 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 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 97988 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97988 steps, saw 61994 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:53:40] [INFO ] Invariant cache hit.
[2023-03-21 23:53:41] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:53:41] [INFO ] [Nat]Absence check using 898 positive place invariants in 243 ms returned sat
[2023-03-21 23:53:42] [INFO ] After 968ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:53:42] [INFO ] After 1107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-21 23:53:43] [INFO ] After 1772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 59 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 55 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 54 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-21 23:53:43] [INFO ] Invariant cache hit.
[2023-03-21 23:53:45] [INFO ] Implicit Places using invariants in 1829 ms returned []
[2023-03-21 23:53:45] [INFO ] Invariant cache hit.
[2023-03-21 23:53:48] [INFO ] Implicit Places using invariants and state equation in 3591 ms returned []
Implicit Place search using SMT with State Equation took 5423 ms to find 0 implicit places.
[2023-03-21 23:53:48] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-21 23:53:48] [INFO ] Invariant cache hit.
[2023-03-21 23:53:49] [INFO ] Dead Transitions using invariants and state equation in 1279 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6801 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1898 transition count 1894
Applied a total of 200 rules in 91 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2023-03-21 23:53:50] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-21 23:53:50] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:53:50] [INFO ] [Nat]Absence check using 898 positive place invariants in 163 ms returned sat
[2023-03-21 23:53:51] [INFO ] After 862ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:53:51] [INFO ] State equation strengthened by 198 read => feed constraints.
[2023-03-21 23:53:51] [INFO ] After 360ms SMT Verify possible using 198 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:53:52] [INFO ] After 517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-21 23:53:52] [INFO ] After 1950ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 304 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 4 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 827 ms. Remains 5902 /5902 variables (removed 0) and now considering 5402/5402 (removed 0) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-21 23:53:53] [INFO ] Computed 901 place invariants in 36 ms
[2023-03-21 23:53:56] [INFO ] Implicit Places using invariants in 2884 ms returned []
[2023-03-21 23:53:56] [INFO ] Invariant cache hit.
[2023-03-21 23:53:59] [INFO ] Implicit Places using invariants and state equation in 2826 ms returned []
Implicit Place search using SMT with State Equation took 5756 ms to find 0 implicit places.
[2023-03-21 23:53:59] [INFO ] Invariant cache hit.
[2023-03-21 23:54:04] [INFO ] Dead Transitions using invariants and state equation in 5093 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11695 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 p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 364 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:54:05] [INFO ] Invariant cache hit.
[2023-03-21 23:54:06] [INFO ] After 755ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:54:07] [INFO ] [Nat]Absence check using 901 positive place invariants in 548 ms returned sat
[2023-03-21 23:54:12] [INFO ] After 5109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:54:15] [INFO ] Deduced a trap composed of 31 places in 2416 ms of which 4 ms to minimize.
[2023-03-21 23:54:18] [INFO ] Deduced a trap composed of 21 places in 2403 ms of which 4 ms to minimize.
[2023-03-21 23:54:20] [INFO ] Deduced a trap composed of 25 places in 2303 ms of which 4 ms to minimize.
[2023-03-21 23:54:23] [INFO ] Deduced a trap composed of 12 places in 2805 ms of which 4 ms to minimize.
[2023-03-21 23:54:26] [INFO ] Deduced a trap composed of 27 places in 2403 ms of which 4 ms to minimize.
[2023-03-21 23:54:28] [INFO ] Deduced a trap composed of 36 places in 2345 ms of which 4 ms to minimize.
[2023-03-21 23:54:31] [INFO ] Deduced a trap composed of 20 places in 2609 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:54:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:54:31] [INFO ] After 25355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 114 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 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 5902 transition count 4204
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4704 transition count 4204
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2396 place count 4704 transition count 3404
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 3996 place count 3904 transition count 3404
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 4 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 2 with 3402 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: -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 7805 place count 2000 transition count 1833
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 5 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 1898
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 1897
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 8098 place count 1904 transition count 1897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8099 place count 1903 transition count 1896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8101 place count 1901 transition count 1896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8101 place count 1901 transition count 1895
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 8103 place count 1900 transition count 1895
Applied a total of 8103 rules in 1283 ms. Remains 1900 /5902 variables (removed 4002) and now considering 1895/5402 (removed 3507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1283 ms. Remains : 1900/5902 places, 1895/5402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 101138 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101138 steps, saw 64370 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1895 rows 1900 cols
[2023-03-21 23:54:36] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-21 23:54:36] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:54:37] [INFO ] [Nat]Absence check using 899 positive place invariants in 171 ms returned sat
[2023-03-21 23:54:38] [INFO ] After 1161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:54:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:54:38] [INFO ] After 82ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:54:38] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-21 23:54:38] [INFO ] After 2001ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 56 ms.
Support contains 2 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1895/1895 transitions.
Applied a total of 0 rules in 51 ms. Remains 1900 /1900 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1900/1900 places, 1895/1895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1895/1895 transitions.
Applied a total of 0 rules in 52 ms. Remains 1900 /1900 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
[2023-03-21 23:54:39] [INFO ] Invariant cache hit.
[2023-03-21 23:54:40] [INFO ] Implicit Places using invariants in 1913 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1928 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1900 places, 1895/1895 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1898 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1894
Applied a total of 2 rules in 114 ms. Remains 1898 /1899 variables (removed 1) and now considering 1894/1895 (removed 1) transitions.
// Phase 1: matrix 1894 rows 1898 cols
[2023-03-21 23:54:41] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-21 23:54:43] [INFO ] Implicit Places using invariants in 2031 ms returned []
[2023-03-21 23:54:43] [INFO ] Invariant cache hit.
[2023-03-21 23:54:46] [INFO ] Implicit Places using invariants and state equation in 3276 ms returned []
Implicit Place search using SMT with State Equation took 5318 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1898/1900 places, 1894/1895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7412 ms. Remains : 1898/1900 places, 1894/1895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101214 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101214 steps, saw 64172 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:54:49] [INFO ] Invariant cache hit.
[2023-03-21 23:54:49] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:54:50] [INFO ] [Nat]Absence check using 898 positive place invariants in 240 ms returned sat
[2023-03-21 23:54:51] [INFO ] After 999ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:54:51] [INFO ] After 1129ms 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-21 23:54:51] [INFO ] After 1730ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 45 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 49 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 68 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-21 23:54:51] [INFO ] Invariant cache hit.
[2023-03-21 23:54:53] [INFO ] Implicit Places using invariants in 1696 ms returned []
[2023-03-21 23:54:53] [INFO ] Invariant cache hit.
[2023-03-21 23:54:56] [INFO ] Implicit Places using invariants and state equation in 3389 ms returned []
Implicit Place search using SMT with State Equation took 5103 ms to find 0 implicit places.
[2023-03-21 23:54:56] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-21 23:54:56] [INFO ] Invariant cache hit.
[2023-03-21 23:54:58] [INFO ] Dead Transitions using invariants and state equation in 1746 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6990 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1898 transition count 1894
Applied a total of 200 rules in 101 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2023-03-21 23:54:58] [INFO ] Computed 898 place invariants in 5 ms
[2023-03-21 23:54:59] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:54:59] [INFO ] [Nat]Absence check using 898 positive place invariants in 201 ms returned sat
[2023-03-21 23:55:00] [INFO ] After 967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:55:00] [INFO ] State equation strengthened by 198 read => feed constraints.
[2023-03-21 23:55:01] [INFO ] After 359ms SMT Verify possible using 198 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:55:01] [INFO ] After 589ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-21 23:55:01] [INFO ] After 2266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 282 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1392 ms.
Product exploration explored 100000 steps with 0 reset in 2054 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 5902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5902/5902 places, 5402/5402 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 5902 transition count 5402
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 400 Pre rules applied. Total rules applied 1198 place count 5902 transition count 5703
Deduced a syphon composed of 1598 places in 19 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 1598 place count 5902 transition count 5703
Performed 2000 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3598 places in 11 ms
Iterating global reduction 1 with 2000 rules applied. Total rules applied 3598 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 3599 place count 5902 transition count 5703
Renaming transitions due to excessive name length > 1024 char.
Discarding 802 places :
Symmetric choice reduction at 2 with 802 rule applications. Total rules 4401 place count 5100 transition count 4900
Deduced a syphon composed of 2796 places in 9 ms
Iterating global reduction 2 with 802 rules applied. Total rules applied 5203 place count 5100 transition count 4900
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2797 places in 9 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5204 place count 5100 transition count 4900
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5206 place count 5098 transition count 4898
Deduced a syphon composed of 2795 places in 9 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5208 place count 5098 transition count 4898
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 2896 places in 24 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5309 place count 5098 transition count 5428
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5410 place count 4997 transition count 5226
Deduced a syphon composed of 2795 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5511 place count 4997 transition count 5226
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -523
Deduced a syphon composed of 2896 places in 13 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5612 place count 4997 transition count 5749
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5713 place count 4896 transition count 5547
Deduced a syphon composed of 2795 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5814 place count 4896 transition count 5547
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -537
Deduced a syphon composed of 2896 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5915 place count 4896 transition count 6084
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6016 place count 4795 transition count 5882
Deduced a syphon composed of 2795 places in 14 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6117 place count 4795 transition count 5882
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: -498
Deduced a syphon composed of 2889 places in 17 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 6211 place count 4795 transition count 6380
Discarding 94 places :
Symmetric choice reduction at 2 with 94 rule applications. Total rules 6305 place count 4701 transition count 6192
Deduced a syphon composed of 2795 places in 17 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 6399 place count 4701 transition count 6192
Deduced a syphon composed of 2795 places in 17 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 4701 transition count 6183
Deduced a syphon composed of 2795 places in 15 ms
Applied a total of 6408 rules in 8590 ms. Remains 4701 /5902 variables (removed 1201) and now considering 6183/5402 (removed -781) transitions.
[2023-03-21 23:55:15] [INFO ] Redundant transitions in 245 ms returned []
// Phase 1: matrix 6183 rows 4701 cols
[2023-03-21 23:55:15] [INFO ] Computed 901 place invariants in 148 ms
[2023-03-21 23:55:20] [INFO ] Dead Transitions using invariants and state equation in 5395 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4701/5902 places, 6183/5402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14264 ms. Remains : 4701/5902 places, 6183/5402 transitions.
Support contains 4 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 778 ms. Remains 5902 /5902 variables (removed 0) and now considering 5402/5402 (removed 0) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-21 23:55:21] [INFO ] Computed 901 place invariants in 34 ms
[2023-03-21 23:55:23] [INFO ] Implicit Places using invariants in 2587 ms returned []
[2023-03-21 23:55:23] [INFO ] Invariant cache hit.
[2023-03-21 23:55:26] [INFO ] Implicit Places using invariants and state equation in 2596 ms returned []
Implicit Place search using SMT with State Equation took 5200 ms to find 0 implicit places.
[2023-03-21 23:55:26] [INFO ] Invariant cache hit.
[2023-03-21 23:55:31] [INFO ] Dead Transitions using invariants and state equation in 5441 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11434 ms. Remains : 5902/5902 places, 5402/5402 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-03 finished in 172391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 5914 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5914/5914 places, 5414/5414 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 5913 transition count 4214
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 4714 transition count 4213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2400 place count 4713 transition count 4213
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 795 Pre rules applied. Total rules applied 2400 place count 4713 transition count 3418
Deduced a syphon composed of 795 places in 10 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 3 with 1590 rules applied. Total rules applied 3990 place count 3918 transition count 3418
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 4000 place count 3908 transition count 3408
Iterating global reduction 3 with 10 rules applied. Total rules applied 4010 place count 3908 transition count 3408
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 4010 place count 3908 transition count 3401
Deduced a syphon composed of 7 places in 11 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 4024 place count 3901 transition count 3401
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 3 with 3396 rules applied. Total rules applied 7420 place count 2203 transition count 1703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7421 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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7423 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 4 with 202 rules applied. Total rules applied 7625 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 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7827 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 6 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8019 place count 1904 transition count 1899
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8021 place count 1902 transition count 1897
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8023 place count 1900 transition count 1897
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8023 place count 1900 transition count 1896
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 8025 place count 1899 transition count 1896
Applied a total of 8025 rules in 1769 ms. Remains 1899 /5914 variables (removed 4015) and now considering 1896/5414 (removed 3518) transitions.
// Phase 1: matrix 1896 rows 1899 cols
[2023-03-21 23:55:34] [INFO ] Computed 899 place invariants in 7 ms
[2023-03-21 23:55:35] [INFO ] Implicit Places using invariants in 1721 ms returned [1888]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1724 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1898/5914 places, 1896/5414 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 1897 transition count 1895
Applied a total of 2 rules in 96 ms. Remains 1897 /1898 variables (removed 1) and now considering 1895/1896 (removed 1) transitions.
// Phase 1: matrix 1895 rows 1897 cols
[2023-03-21 23:55:35] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-21 23:55:37] [INFO ] Implicit Places using invariants in 1896 ms returned []
[2023-03-21 23:55:37] [INFO ] Invariant cache hit.
[2023-03-21 23:55:41] [INFO ] Implicit Places using invariants and state equation in 3311 ms returned []
Implicit Place search using SMT with State Equation took 5243 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/5914 places, 1895/5414 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8832 ms. Remains : 1897/5914 places, 1895/5414 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s1179 0) (NEQ s1494 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-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-04 finished in 9023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5903 transition count 5403
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5903 transition count 5403
Applied a total of 22 rules in 1565 ms. Remains 5903 /5914 variables (removed 11) and now considering 5403/5414 (removed 11) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2023-03-21 23:55:42] [INFO ] Computed 901 place invariants in 19 ms
[2023-03-21 23:55:45] [INFO ] Implicit Places using invariants in 2282 ms returned []
[2023-03-21 23:55:45] [INFO ] Invariant cache hit.
[2023-03-21 23:55:47] [INFO ] Implicit Places using invariants and state equation in 2651 ms returned []
Implicit Place search using SMT with State Equation took 5011 ms to find 0 implicit places.
[2023-03-21 23:55:47] [INFO ] Invariant cache hit.
[2023-03-21 23:55:53] [INFO ] Dead Transitions using invariants and state equation in 5352 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5903/5914 places, 5403/5414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11932 ms. Remains : 5903/5914 places, 5403/5414 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (EQ s1742 0) (EQ s4434 1)) (OR (EQ s1024 0) (EQ s4854 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1566 ms.
Product exploration explored 100000 steps with 0 reset in 1966 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, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 217722 steps, run timeout after 3071 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 217722 steps, saw 209163 distinct states, run finished after 3072 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:56:00] [INFO ] Invariant cache hit.
[2023-03-21 23:56:01] [INFO ] After 709ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:56:03] [INFO ] [Nat]Absence check using 901 positive place invariants in 562 ms returned sat
[2023-03-21 23:56:08] [INFO ] After 4955ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:56:11] [INFO ] Deduced a trap composed of 22 places in 2802 ms of which 4 ms to minimize.
[2023-03-21 23:56:13] [INFO ] Deduced a trap composed of 19 places in 2556 ms of which 4 ms to minimize.
[2023-03-21 23:56:16] [INFO ] Deduced a trap composed of 15 places in 2543 ms of which 4 ms to minimize.
[2023-03-21 23:56:19] [INFO ] Deduced a trap composed of 17 places in 2282 ms of which 3 ms to minimize.
[2023-03-21 23:56:21] [INFO ] Deduced a trap composed of 17 places in 2577 ms of which 4 ms to minimize.
[2023-03-21 23:56:24] [INFO ] Deduced a trap composed of 21 places in 2542 ms of which 3 ms to minimize.
[2023-03-21 23:56:27] [INFO ] Deduced a trap composed of 28 places in 2315 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 23:56:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:56:27] [INFO ] After 25653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 159 ms.
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5903/5903 places, 5403/5403 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 5903 transition count 4205
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4705 transition count 4205
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2396 place count 4705 transition count 3406
Deduced a syphon composed of 799 places in 14 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3994 place count 3906 transition count 3406
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 6 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 2 with 3402 rules applied. Total rules applied 7396 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 7397 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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7399 place count 2204 transition count 1703
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
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 7601 place count 2103 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
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 7803 place count 2002 transition count 1836
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -63
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 7995 place count 1906 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 7996 place count 1906 transition count 1898
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 7997 place count 1906 transition count 1897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7998 place count 1905 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 8098 place count 1905 transition count 1897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8099 place count 1904 transition count 1896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 8101 place count 1902 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 8101 place count 1902 transition count 1895
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 8103 place count 1901 transition count 1895
Applied a total of 8103 rules in 1615 ms. Remains 1901 /5903 variables (removed 4002) and now considering 1895/5403 (removed 3508) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1615 ms. Remains : 1901/5903 places, 1895/5403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) 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 98405 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98405 steps, saw 62642 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1895 rows 1901 cols
[2023-03-21 23:56:32] [INFO ] Computed 899 place invariants in 7 ms
[2023-03-21 23:56:32] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:56:33] [INFO ] [Nat]Absence check using 899 positive place invariants in 288 ms returned sat
[2023-03-21 23:56:34] [INFO ] After 1125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:56:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:56:34] [INFO ] After 95ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:56:34] [INFO ] After 303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-21 23:56:34] [INFO ] After 2223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 68 ms.
Support contains 4 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1895/1895 transitions.
Applied a total of 0 rules in 56 ms. Remains 1901 /1901 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1901/1901 places, 1895/1895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1895/1895 transitions.
Applied a total of 0 rules in 52 ms. Remains 1901 /1901 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
[2023-03-21 23:56:35] [INFO ] Invariant cache hit.
[2023-03-21 23:56:36] [INFO ] Implicit Places using invariants in 1802 ms returned [1890]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1811 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1900/1901 places, 1895/1895 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1899 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1899 transition count 1894
Applied a total of 2 rules in 108 ms. Remains 1899 /1900 variables (removed 1) and now considering 1894/1895 (removed 1) transitions.
// Phase 1: matrix 1894 rows 1899 cols
[2023-03-21 23:56:37] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-21 23:56:38] [INFO ] Implicit Places using invariants in 1895 ms returned []
[2023-03-21 23:56:38] [INFO ] Invariant cache hit.
[2023-03-21 23:56:42] [INFO ] Implicit Places using invariants and state equation in 3433 ms returned []
Implicit Place search using SMT with State Equation took 5343 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1899/1901 places, 1894/1895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7314 ms. Remains : 1899/1901 places, 1894/1895 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 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95074 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95074 steps, saw 60040 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:56:45] [INFO ] Invariant cache hit.
[2023-03-21 23:56:45] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:56:46] [INFO ] [Nat]Absence check using 898 positive place invariants in 168 ms returned sat
[2023-03-21 23:56:47] [INFO ] After 946ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:56:47] [INFO ] After 1094ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-21 23:56:47] [INFO ] After 1665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 82 ms.
Support contains 4 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 98 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 64 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-21 23:56:47] [INFO ] Invariant cache hit.
[2023-03-21 23:56:49] [INFO ] Implicit Places using invariants in 1666 ms returned []
[2023-03-21 23:56:49] [INFO ] Invariant cache hit.
[2023-03-21 23:56:52] [INFO ] Implicit Places using invariants and state equation in 3481 ms returned []
Implicit Place search using SMT with State Equation took 5149 ms to find 0 implicit places.
[2023-03-21 23:56:53] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-21 23:56:53] [INFO ] Invariant cache hit.
[2023-03-21 23:56:54] [INFO ] Dead Transitions using invariants and state equation in 1595 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6875 ms. Remains : 1899/1899 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 1899 transition count 1894
Applied a total of 199 rules in 146 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2023-03-21 23:56:54] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-21 23:56:55] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:56:55] [INFO ] [Nat]Absence check using 898 positive place invariants in 225 ms returned sat
[2023-03-21 23:56:56] [INFO ] After 1211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:56:56] [INFO ] State equation strengthened by 196 read => feed constraints.
[2023-03-21 23:56:57] [INFO ] After 324ms SMT Verify possible using 196 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:56:57] [INFO ] After 578ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-21 23:56:57] [INFO ] After 2475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Applied a total of 0 rules in 882 ms. Remains 5903 /5903 variables (removed 0) and now considering 5403/5403 (removed 0) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2023-03-21 23:56:59] [INFO ] Computed 901 place invariants in 39 ms
[2023-03-21 23:57:01] [INFO ] Implicit Places using invariants in 2546 ms returned []
[2023-03-21 23:57:01] [INFO ] Invariant cache hit.
[2023-03-21 23:57:03] [INFO ] Implicit Places using invariants and state equation in 2144 ms returned []
Implicit Place search using SMT with State Equation took 4695 ms to find 0 implicit places.
[2023-03-21 23:57:03] [INFO ] Invariant cache hit.
[2023-03-21 23:57:09] [INFO ] Dead Transitions using invariants and state equation in 5379 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10965 ms. Remains : 5903/5903 places, 5403/5403 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, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 241 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 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 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 215897 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215897 steps, saw 208233 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:57:12] [INFO ] Invariant cache hit.
[2023-03-21 23:57:13] [INFO ] After 820ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:57:15] [INFO ] [Nat]Absence check using 901 positive place invariants in 623 ms returned sat
[2023-03-21 23:57:20] [INFO ] After 4974ms 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 22 places in 2768 ms of which 5 ms to minimize.
[2023-03-21 23:57:25] [INFO ] Deduced a trap composed of 19 places in 2324 ms of which 11 ms to minimize.
[2023-03-21 23:57:28] [INFO ] Deduced a trap composed of 15 places in 2416 ms of which 4 ms to minimize.
[2023-03-21 23:57:31] [INFO ] Deduced a trap composed of 17 places in 2363 ms of which 4 ms to minimize.
[2023-03-21 23:57:33] [INFO ] Deduced a trap composed of 17 places in 2399 ms of which 4 ms to minimize.
[2023-03-21 23:57:36] [INFO ] Deduced a trap composed of 21 places in 2470 ms of which 4 ms to minimize.
[2023-03-21 23:57:39] [INFO ] Deduced a trap composed of 28 places in 2766 ms of which 15 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:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:57:39] [INFO ] After 25546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 120 ms.
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5903/5903 places, 5403/5403 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 5903 transition count 4205
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4705 transition count 4205
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2396 place count 4705 transition count 3406
Deduced a syphon composed of 799 places in 12 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3994 place count 3906 transition count 3406
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 4 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 2 with 3402 rules applied. Total rules applied 7396 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 7397 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 7399 place count 2204 transition count 1703
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
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 7601 place count 2103 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 7803 place count 2002 transition count 1836
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 7995 place count 1906 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 7996 place count 1906 transition count 1898
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 7997 place count 1906 transition count 1897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7998 place count 1905 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 8098 place count 1905 transition count 1897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8099 place count 1904 transition count 1896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 8101 place count 1902 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 8101 place count 1902 transition count 1895
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 8103 place count 1901 transition count 1895
Applied a total of 8103 rules in 1525 ms. Remains 1901 /5903 variables (removed 4002) and now considering 1895/5403 (removed 3508) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1525 ms. Remains : 1901/5903 places, 1895/5403 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 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 96937 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96937 steps, saw 61620 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1895 rows 1901 cols
[2023-03-21 23:57:44] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-21 23:57:44] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:57:44] [INFO ] [Nat]Absence check using 899 positive place invariants in 170 ms returned sat
[2023-03-21 23:57:45] [INFO ] After 976ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:57:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:57:46] [INFO ] After 89ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:57:46] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-03-21 23:57:46] [INFO ] After 1845ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 85 ms.
Support contains 4 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1895/1895 transitions.
Applied a total of 0 rules in 46 ms. Remains 1901 /1901 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1901/1901 places, 1895/1895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1895/1895 transitions.
Applied a total of 0 rules in 44 ms. Remains 1901 /1901 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
[2023-03-21 23:57:46] [INFO ] Invariant cache hit.
[2023-03-21 23:57:48] [INFO ] Implicit Places using invariants in 1958 ms returned [1890]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1961 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1900/1901 places, 1895/1895 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1899 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1899 transition count 1894
Applied a total of 2 rules in 107 ms. Remains 1899 /1900 variables (removed 1) and now considering 1894/1895 (removed 1) transitions.
// Phase 1: matrix 1894 rows 1899 cols
[2023-03-21 23:57:48] [INFO ] Computed 898 place invariants in 4 ms
[2023-03-21 23:57:50] [INFO ] Implicit Places using invariants in 1926 ms returned []
[2023-03-21 23:57:50] [INFO ] Invariant cache hit.
[2023-03-21 23:57:53] [INFO ] Implicit Places using invariants and state equation in 3382 ms returned []
Implicit Place search using SMT with State Equation took 5315 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1899/1901 places, 1894/1895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7428 ms. Remains : 1899/1901 places, 1894/1895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100463 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100463 steps, saw 63646 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:57] [INFO ] Invariant cache hit.
[2023-03-21 23:57:57] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:57:57] [INFO ] [Nat]Absence check using 898 positive place invariants in 174 ms returned sat
[2023-03-21 23:57:58] [INFO ] After 984ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:57:59] [INFO ] After 1120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-21 23:57:59] [INFO ] After 1694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 80 ms.
Support contains 4 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 53 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 53 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-21 23:57:59] [INFO ] Invariant cache hit.
[2023-03-21 23:58:00] [INFO ] Implicit Places using invariants in 1571 ms returned []
[2023-03-21 23:58:00] [INFO ] Invariant cache hit.
[2023-03-21 23:58:04] [INFO ] Implicit Places using invariants and state equation in 3185 ms returned []
Implicit Place search using SMT with State Equation took 4758 ms to find 0 implicit places.
[2023-03-21 23:58:04] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-21 23:58:04] [INFO ] Invariant cache hit.
[2023-03-21 23:58:05] [INFO ] Dead Transitions using invariants and state equation in 1393 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6267 ms. Remains : 1899/1899 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 1899 transition count 1894
Applied a total of 199 rules in 149 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2023-03-21 23:58:05] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-21 23:58:05] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:58:06] [INFO ] [Nat]Absence check using 898 positive place invariants in 185 ms returned sat
[2023-03-21 23:58:07] [INFO ] After 1085ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:58:07] [INFO ] State equation strengthened by 196 read => feed constraints.
[2023-03-21 23:58:07] [INFO ] After 288ms SMT Verify possible using 196 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:58:08] [INFO ] After 563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 135 ms.
[2023-03-21 23:58:08] [INFO ] After 2341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 264 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1459 ms.
Product exploration explored 100000 steps with 0 reset in 1893 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5903/5903 places, 5403/5403 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 5903 transition count 5403
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 5903 transition count 5704
Deduced a syphon composed of 1599 places in 17 ms
Iterating global reduction 1 with 401 rules applied. Total rules applied 1599 place count 5903 transition count 5704
Performed 2000 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3599 places in 11 ms
Iterating global reduction 1 with 2000 rules applied. Total rules applied 3599 place count 5903 transition count 5705
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 5903 transition count 5704
Renaming transitions due to excessive name length > 1024 char.
Discarding 799 places :
Symmetric choice reduction at 2 with 799 rule applications. Total rules 4399 place count 5104 transition count 4905
Deduced a syphon composed of 2800 places in 13 ms
Iterating global reduction 2 with 799 rules applied. Total rules applied 5198 place count 5104 transition count 4905
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2801 places in 12 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5199 place count 5104 transition count 4905
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5201 place count 5102 transition count 4903
Deduced a syphon composed of 2799 places in 11 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5203 place count 5102 transition count 4903
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -527
Deduced a syphon composed of 2900 places in 14 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5304 place count 5102 transition count 5430
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 5406 place count 5000 transition count 5226
Deduced a syphon composed of 2798 places in 14 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 5508 place count 5000 transition count 5226
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -527
Deduced a syphon composed of 2899 places in 28 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5609 place count 5000 transition count 5753
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5710 place count 4899 transition count 5551
Deduced a syphon composed of 2798 places in 15 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5811 place count 4899 transition count 5551
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -537
Deduced a syphon composed of 2899 places in 17 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5912 place count 4899 transition count 6088
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6013 place count 4798 transition count 5886
Deduced a syphon composed of 2798 places in 16 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6114 place count 4798 transition count 5886
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: -494
Deduced a syphon composed of 2892 places in 13 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 6208 place count 4798 transition count 6380
Discarding 94 places :
Symmetric choice reduction at 2 with 94 rule applications. Total rules 6302 place count 4704 transition count 6192
Deduced a syphon composed of 2798 places in 12 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 6396 place count 4704 transition count 6192
Deduced a syphon composed of 2798 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 6405 place count 4704 transition count 6183
Deduced a syphon composed of 2798 places in 14 ms
Applied a total of 6405 rules in 7462 ms. Remains 4704 /5903 variables (removed 1199) and now considering 6183/5403 (removed -780) transitions.
[2023-03-21 23:58:20] [INFO ] Redundant transitions in 270 ms returned []
// Phase 1: matrix 6183 rows 4704 cols
[2023-03-21 23:58:20] [INFO ] Computed 901 place invariants in 190 ms
[2023-03-21 23:58:25] [INFO ] Dead Transitions using invariants and state equation in 5235 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4704/5903 places, 6183/5403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12983 ms. Remains : 4704/5903 places, 6183/5403 transitions.
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Applied a total of 0 rules in 715 ms. Remains 5903 /5903 variables (removed 0) and now considering 5403/5403 (removed 0) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2023-03-21 23:58:26] [INFO ] Computed 901 place invariants in 38 ms
[2023-03-21 23:58:28] [INFO ] Implicit Places using invariants in 2345 ms returned []
[2023-03-21 23:58:28] [INFO ] Invariant cache hit.
[2023-03-21 23:58:31] [INFO ] Implicit Places using invariants and state equation in 2346 ms returned []
Implicit Place search using SMT with State Equation took 4695 ms to find 0 implicit places.
[2023-03-21 23:58:31] [INFO ] Invariant cache hit.
[2023-03-21 23:58:35] [INFO ] Dead Transitions using invariants and state equation in 4788 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10213 ms. Remains : 5903/5903 places, 5403/5403 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-05 finished in 174818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 5901 transition count 5401
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 5901 transition count 5401
Applied a total of 26 rules in 1565 ms. Remains 5901 /5914 variables (removed 13) and now considering 5401/5414 (removed 13) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2023-03-21 23:58:37] [INFO ] Computed 901 place invariants in 15 ms
[2023-03-21 23:58:39] [INFO ] Implicit Places using invariants in 2204 ms returned []
[2023-03-21 23:58:39] [INFO ] Invariant cache hit.
[2023-03-21 23:58:42] [INFO ] Implicit Places using invariants and state equation in 2311 ms returned []
Implicit Place search using SMT with State Equation took 4539 ms to find 0 implicit places.
[2023-03-21 23:58:42] [INFO ] Invariant cache hit.
[2023-03-21 23:58:47] [INFO ] Dead Transitions using invariants and state equation in 5194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5914 places, 5401/5414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11317 ms. Remains : 5901/5914 places, 5401/5414 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s2539 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-07 finished in 11580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 5901 transition count 5401
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 5901 transition count 5401
Applied a total of 26 rules in 1609 ms. Remains 5901 /5914 variables (removed 13) and now considering 5401/5414 (removed 13) transitions.
[2023-03-21 23:58:49] [INFO ] Invariant cache hit.
[2023-03-21 23:58:52] [INFO ] Implicit Places using invariants in 3447 ms returned []
[2023-03-21 23:58:52] [INFO ] Invariant cache hit.
[2023-03-21 23:58:55] [INFO ] Implicit Places using invariants and state equation in 2387 ms returned []
Implicit Place search using SMT with State Equation took 5849 ms to find 0 implicit places.
[2023-03-21 23:58:55] [INFO ] Invariant cache hit.
[2023-03-21 23:59:00] [INFO ] Dead Transitions using invariants and state equation in 5236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5914 places, 5401/5414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12700 ms. Remains : 5901/5914 places, 5401/5414 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s5840 0) (EQ s5677 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3199 ms.
Product exploration explored 100000 steps with 50000 reset in 3147 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, (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 134 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-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-08 finished in 19491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U X(G(p1)))))'
Support contains 4 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5902 transition count 5402
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5902 transition count 5402
Applied a total of 24 rules in 1530 ms. Remains 5902 /5914 variables (removed 12) and now considering 5402/5414 (removed 12) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-21 23:59:08] [INFO ] Computed 901 place invariants in 19 ms
[2023-03-21 23:59:10] [INFO ] Implicit Places using invariants in 2049 ms returned []
[2023-03-21 23:59:10] [INFO ] Invariant cache hit.
[2023-03-21 23:59:13] [INFO ] Implicit Places using invariants and state equation in 2191 ms returned []
Implicit Place search using SMT with State Equation took 4252 ms to find 0 implicit places.
[2023-03-21 23:59:13] [INFO ] Invariant cache hit.
[2023-03-21 23:59:17] [INFO ] Dead Transitions using invariants and state equation in 4702 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5914 places, 5402/5414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10499 ms. Remains : 5902/5914 places, 5402/5414 transitions.
Stuttering acceptance computed with spot in 288 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=4, aps=[p1:(OR (EQ s5286 0) (EQ s2935 1)), p0:(OR (EQ s434 0) (EQ s171 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3142 ms.
Product exploration explored 100000 steps with 50000 reset in 3083 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 p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 5 factoid took 233 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100B-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-11 finished in 17463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5902 transition count 5402
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5902 transition count 5402
Applied a total of 24 rules in 1606 ms. Remains 5902 /5914 variables (removed 12) and now considering 5402/5414 (removed 12) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-21 23:59:26] [INFO ] Computed 901 place invariants in 51 ms
[2023-03-21 23:59:28] [INFO ] Implicit Places using invariants in 2491 ms returned []
[2023-03-21 23:59:28] [INFO ] Invariant cache hit.
[2023-03-21 23:59:31] [INFO ] Implicit Places using invariants and state equation in 2380 ms returned []
Implicit Place search using SMT with State Equation took 4900 ms to find 0 implicit places.
[2023-03-21 23:59:31] [INFO ] Invariant cache hit.
[2023-03-21 23:59:36] [INFO ] Dead Transitions using invariants and state equation in 4861 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5914 places, 5402/5414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11380 ms. Remains : 5902/5914 places, 5402/5414 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-12 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 s3703 0) (EQ s2338 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 1358 ms.
Stack based approach found an accepted trace after 3691 steps with 0 reset with depth 3692 and stack size 3692 in 52 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-12 finished in 13001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F((G(p2)||p1)))))'
Support contains 5 out of 5914 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5914/5914 places, 5414/5414 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 5913 transition count 4215
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4715 transition count 4215
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 795 Pre rules applied. Total rules applied 2396 place count 4715 transition count 3420
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 3986 place count 3920 transition count 3420
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 3995 place count 3911 transition count 3411
Iterating global reduction 2 with 9 rules applied. Total rules applied 4004 place count 3911 transition count 3411
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4004 place count 3911 transition count 3404
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 4018 place count 3904 transition count 3404
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 2209 transition count 1709
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 2209 transition count 1708
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 7411 place count 2208 transition count 1707
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 2107 transition count 1773
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 2006 transition count 1841
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 8009 place count 1909 transition count 1906
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8011 place count 1907 transition count 1904
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8013 place count 1905 transition count 1904
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 1905 transition count 1903
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 1904 transition count 1903
Applied a total of 8015 rules in 1505 ms. Remains 1904 /5914 variables (removed 4010) and now considering 1903/5414 (removed 3511) transitions.
// Phase 1: matrix 1903 rows 1904 cols
[2023-03-21 23:59:39] [INFO ] Computed 899 place invariants in 19 ms
[2023-03-21 23:59:40] [INFO ] Implicit Places using invariants in 1273 ms returned [1893]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1291 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1903/5914 places, 1903/5414 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 1902 transition count 1902
Applied a total of 2 rules in 92 ms. Remains 1902 /1903 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1902 cols
[2023-03-21 23:59:40] [INFO ] Computed 898 place invariants in 4 ms
[2023-03-21 23:59:42] [INFO ] Implicit Places using invariants in 1540 ms returned []
[2023-03-21 23:59:42] [INFO ] Invariant cache hit.
[2023-03-21 23:59:43] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-21 23:59:45] [INFO ] Implicit Places using invariants and state equation in 3263 ms returned []
Implicit Place search using SMT with State Equation took 4805 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1902/5914 places, 1902/5414 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7693 ms. Remains : 1902/5914 places, 1902/5414 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1750 0) (EQ s1088 1)), p1:(OR (EQ s1384 0) (EQ s170 1)), p2:(EQ s1824 1)], 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 1328 ms.
Product exploration explored 100000 steps with 0 reset in 1850 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/1902 stabilizing places and 6/1902 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 575 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 92993 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92993 steps, saw 56303 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-21 23:59:53] [INFO ] Invariant cache hit.
[2023-03-21 23:59:53] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 23:59:54] [INFO ] [Nat]Absence check using 898 positive place invariants in 353 ms returned sat
[2023-03-21 23:59:55] [INFO ] After 1213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 23:59:55] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-21 23:59:56] [INFO ] After 330ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 23:59:56] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2023-03-21 23:59:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-21 23:59:56] [INFO ] After 1007ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 354 ms.
[2023-03-21 23:59:57] [INFO ] After 3577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 208 ms.
Support contains 5 out of 1902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1902/1902 places, 1902/1902 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 1902 transition count 1901
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 1902 transition count 1901
Applied a total of 2 rules in 163 ms. Remains 1902 /1902 variables (removed 0) and now considering 1901/1902 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 1902/1902 places, 1901/1902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 88054 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88054 steps, saw 55049 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1901 rows 1902 cols
[2023-03-22 00:00:01] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-22 00:00:01] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 00:00:02] [INFO ] [Nat]Absence check using 898 positive place invariants in 253 ms returned sat
[2023-03-22 00:00:03] [INFO ] After 1270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 00:00:03] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 00:00:03] [INFO ] After 345ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 00:00:04] [INFO ] After 839ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 332 ms.
[2023-03-22 00:00:04] [INFO ] After 3163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 391 ms.
Support contains 5 out of 1902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1902/1902 places, 1901/1901 transitions.
Applied a total of 0 rules in 45 ms. Remains 1902 /1902 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1902/1902 places, 1901/1901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1902/1902 places, 1901/1901 transitions.
Applied a total of 0 rules in 45 ms. Remains 1902 /1902 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2023-03-22 00:00:05] [INFO ] Invariant cache hit.
[2023-03-22 00:00:06] [INFO ] Implicit Places using invariants in 1222 ms returned []
[2023-03-22 00:00:06] [INFO ] Invariant cache hit.
[2023-03-22 00:00:07] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 00:00:10] [INFO ] Implicit Places using invariants and state equation in 3638 ms returned []
Implicit Place search using SMT with State Equation took 4884 ms to find 0 implicit places.
[2023-03-22 00:00:10] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-22 00:00:10] [INFO ] Invariant cache hit.
[2023-03-22 00:00:11] [INFO ] Dead Transitions using invariants and state equation in 1254 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6255 ms. Remains : 1902/1902 places, 1901/1901 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 1902 transition count 1901
Applied a total of 203 rules in 90 ms. Remains 1902 /1902 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1901 rows 1902 cols
[2023-03-22 00:00:11] [INFO ] Computed 898 place invariants in 5 ms
[2023-03-22 00:00:11] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 00:00:12] [INFO ] [Nat]Absence check using 898 positive place invariants in 227 ms returned sat
[2023-03-22 00:00:13] [INFO ] After 1099ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 00:00:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 00:00:13] [INFO ] After 218ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 00:00:13] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2023-03-22 00:00:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-22 00:00:14] [INFO ] After 921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-03-22 00:00:14] [INFO ] After 3013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 437 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 1902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1902/1902 places, 1902/1902 transitions.
Applied a total of 0 rules in 86 ms. Remains 1902 /1902 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
// Phase 1: matrix 1902 rows 1902 cols
[2023-03-22 00:00:15] [INFO ] Computed 898 place invariants in 18 ms
[2023-03-22 00:00:17] [INFO ] Implicit Places using invariants in 1583 ms returned []
[2023-03-22 00:00:17] [INFO ] Invariant cache hit.
[2023-03-22 00:00:18] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 00:00:20] [INFO ] Implicit Places using invariants and state equation in 3590 ms returned []
Implicit Place search using SMT with State Equation took 5192 ms to find 0 implicit places.
[2023-03-22 00:00:20] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-22 00:00:20] [INFO ] Invariant cache hit.
[2023-03-22 00:00:22] [INFO ] Dead Transitions using invariants and state equation in 1249 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6589 ms. Remains : 1902/1902 places, 1902/1902 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/1902 stabilizing places and 6/1902 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 254 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 90760 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90760 steps, saw 54909 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 00:00:26] [INFO ] Invariant cache hit.
[2023-03-22 00:00:26] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 00:00:27] [INFO ] [Nat]Absence check using 898 positive place invariants in 177 ms returned sat
[2023-03-22 00:00:28] [INFO ] After 1124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 00:00:28] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 00:00:28] [INFO ] After 311ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 00:00:28] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-03-22 00:00:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-03-22 00:00:29] [INFO ] After 998ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 346 ms.
[2023-03-22 00:00:29] [INFO ] After 3020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 237 ms.
Support contains 5 out of 1902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1902/1902 places, 1902/1902 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 1902 transition count 1901
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 1902 transition count 1901
Applied a total of 2 rules in 104 ms. Remains 1902 /1902 variables (removed 0) and now considering 1901/1902 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 1902/1902 places, 1901/1902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 84102 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84102 steps, saw 52623 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1901 rows 1902 cols
[2023-03-22 00:00:33] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-22 00:00:33] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 00:00:34] [INFO ] [Nat]Absence check using 898 positive place invariants in 152 ms returned sat
[2023-03-22 00:00:35] [INFO ] After 1304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 00:00:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 00:00:36] [INFO ] After 337ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 00:00:36] [INFO ] After 757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 278 ms.
[2023-03-22 00:00:36] [INFO ] After 3000ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 341 ms.
Support contains 5 out of 1902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1902/1902 places, 1901/1901 transitions.
Applied a total of 0 rules in 53 ms. Remains 1902 /1902 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1902/1902 places, 1901/1901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1902/1902 places, 1901/1901 transitions.
Applied a total of 0 rules in 46 ms. Remains 1902 /1902 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2023-03-22 00:00:37] [INFO ] Invariant cache hit.
[2023-03-22 00:00:38] [INFO ] Implicit Places using invariants in 1346 ms returned []
[2023-03-22 00:00:38] [INFO ] Invariant cache hit.
[2023-03-22 00:00:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 00:00:42] [INFO ] Implicit Places using invariants and state equation in 3776 ms returned []
Implicit Place search using SMT with State Equation took 5154 ms to find 0 implicit places.
[2023-03-22 00:00:42] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-22 00:00:42] [INFO ] Invariant cache hit.
[2023-03-22 00:00:43] [INFO ] Dead Transitions using invariants and state equation in 1333 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6579 ms. Remains : 1902/1902 places, 1901/1901 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 1902 transition count 1901
Applied a total of 203 rules in 90 ms. Remains 1902 /1902 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1901 rows 1902 cols
[2023-03-22 00:00:43] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-22 00:00:44] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 00:00:44] [INFO ] [Nat]Absence check using 898 positive place invariants in 190 ms returned sat
[2023-03-22 00:00:46] [INFO ] After 1437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 00:00:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 00:00:46] [INFO ] After 314ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 00:00:46] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2023-03-22 00:00:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-22 00:00:47] [INFO ] After 942ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 289 ms.
[2023-03-22 00:00:47] [INFO ] After 3282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 359 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 1332 ms.
Product exploration explored 100000 steps with 0 reset in 1778 ms.
Support contains 5 out of 1902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1902/1902 places, 1902/1902 transitions.
Applied a total of 0 rules in 55 ms. Remains 1902 /1902 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
// Phase 1: matrix 1902 rows 1902 cols
[2023-03-22 00:00:51] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-22 00:00:53] [INFO ] Implicit Places using invariants in 1601 ms returned []
[2023-03-22 00:00:53] [INFO ] Invariant cache hit.
[2023-03-22 00:00:54] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 00:00:56] [INFO ] Implicit Places using invariants and state equation in 3386 ms returned []
Implicit Place search using SMT with State Equation took 5022 ms to find 0 implicit places.
[2023-03-22 00:00:56] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-22 00:00:56] [INFO ] Invariant cache hit.
[2023-03-22 00:00:57] [INFO ] Dead Transitions using invariants and state equation in 1210 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6352 ms. Remains : 1902/1902 places, 1902/1902 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-15 finished in 80258 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-100B-LTLCardinality-03
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5914/5914 places, 5414/5414 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 5913 transition count 4214
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 4714 transition count 4213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2400 place count 4713 transition count 4213
Performed 794 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 794 Pre rules applied. Total rules applied 2400 place count 4713 transition count 3419
Deduced a syphon composed of 794 places in 12 ms
Reduce places removed 794 places and 0 transitions.
Iterating global reduction 3 with 1588 rules applied. Total rules applied 3988 place count 3919 transition count 3419
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 3997 place count 3910 transition count 3410
Iterating global reduction 3 with 9 rules applied. Total rules applied 4006 place count 3910 transition count 3410
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 4006 place count 3910 transition count 3403
Deduced a syphon composed of 7 places in 10 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 4020 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 5 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 3 with 3394 rules applied. Total rules applied 7414 place count 2206 transition count 1706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7415 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 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7417 place count 2205 transition count 1704
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 7619 place count 2104 transition count 1770
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 4 with 202 rules applied. Total rules applied 7821 place count 2003 transition count 1836
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 4 with 192 rules applied. Total rules applied 8013 place count 1907 transition count 1901
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8015 place count 1905 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8017 place count 1903 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 8017 place count 1903 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 8019 place count 1902 transition count 1898
Applied a total of 8019 rules in 1798 ms. Remains 1902 /5914 variables (removed 4012) and now considering 1898/5414 (removed 3516) transitions.
// Phase 1: matrix 1898 rows 1902 cols
[2023-03-22 00:01:00] [INFO ] Computed 899 place invariants in 19 ms
[2023-03-22 00:01:01] [INFO ] Implicit Places using invariants in 1213 ms returned [1891]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1224 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1901/5914 places, 1898/5414 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 1897
Applied a total of 2 rules in 109 ms. Remains 1900 /1901 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1900 cols
[2023-03-22 00:01:01] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-22 00:01:02] [INFO ] Implicit Places using invariants in 1407 ms returned []
[2023-03-22 00:01:02] [INFO ] Invariant cache hit.
[2023-03-22 00:01:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 00:01:06] [INFO ] Implicit Places using invariants and state equation in 3463 ms returned []
Implicit Place search using SMT with State Equation took 4882 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1900/5914 places, 1897/5414 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 8013 ms. Remains : 1900/5914 places, 1897/5414 transitions.
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (EQ s801 0) (EQ s1423 1)), p0:(OR (EQ s1564 0) (EQ s1512 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1350 ms.
Product exploration explored 100000 steps with 0 reset in 1828 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:01:10] [INFO ] Invariant cache hit.
[2023-03-22 00:01:10] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:01:10] [INFO ] [Nat]Absence check using 898 positive place invariants in 245 ms returned sat
[2023-03-22 00:01:11] [INFO ] After 958ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:01:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 00:01:11] [INFO ] After 82ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:01:12] [INFO ] After 257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-22 00:01:12] [INFO ] After 1861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 73 ms.
Support contains 2 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1897/1897 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 1900 transition count 1896
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 1 with 2 rules applied. Total rules applied 3 place count 1899 transition count 1895
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 1899 transition count 1895
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1898 transition count 1894
Applied a total of 5 rules in 200 ms. Remains 1898 /1900 variables (removed 2) and now considering 1894/1897 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 1898/1900 places, 1894/1897 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 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 110995 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110995 steps, saw 68855 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2023-03-22 00:01:15] [INFO ] Computed 898 place invariants in 15 ms
[2023-03-22 00:01:16] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:01:16] [INFO ] [Nat]Absence check using 898 positive place invariants in 144 ms returned sat
[2023-03-22 00:01:17] [INFO ] After 884ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:01:17] [INFO ] After 1034ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-22 00:01:17] [INFO ] After 1527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 52 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 53 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 53 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-22 00:01:17] [INFO ] Invariant cache hit.
[2023-03-22 00:01:19] [INFO ] Implicit Places using invariants in 1522 ms returned []
[2023-03-22 00:01:19] [INFO ] Invariant cache hit.
[2023-03-22 00:01:22] [INFO ] Implicit Places using invariants and state equation in 3333 ms returned []
Implicit Place search using SMT with State Equation took 4880 ms to find 0 implicit places.
[2023-03-22 00:01:22] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-22 00:01:22] [INFO ] Invariant cache hit.
[2023-03-22 00:01:24] [INFO ] Dead Transitions using invariants and state equation in 1515 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6530 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1898 transition count 1894
Applied a total of 200 rules in 102 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2023-03-22 00:01:24] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-22 00:01:24] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:01:25] [INFO ] [Nat]Absence check using 898 positive place invariants in 198 ms returned sat
[2023-03-22 00:01:26] [INFO ] After 1121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:01:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 00:01:26] [INFO ] After 90ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:01:26] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-22 00:01:26] [INFO ] After 1920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 266 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1900/1900 places, 1897/1897 transitions.
Applied a total of 0 rules in 41 ms. Remains 1900 /1900 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
// Phase 1: matrix 1897 rows 1900 cols
[2023-03-22 00:01:27] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-22 00:01:29] [INFO ] Implicit Places using invariants in 1839 ms returned []
[2023-03-22 00:01:29] [INFO ] Invariant cache hit.
[2023-03-22 00:01:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 00:01:32] [INFO ] Implicit Places using invariants and state equation in 3551 ms returned []
Implicit Place search using SMT with State Equation took 5392 ms to find 0 implicit places.
[2023-03-22 00:01:32] [INFO ] Invariant cache hit.
[2023-03-22 00:01:34] [INFO ] Dead Transitions using invariants and state equation in 1653 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7088 ms. Remains : 1900/1900 places, 1897/1897 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 234 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:01:35] [INFO ] Invariant cache hit.
[2023-03-22 00:01:35] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:01:35] [INFO ] [Nat]Absence check using 898 positive place invariants in 149 ms returned sat
[2023-03-22 00:01:36] [INFO ] After 979ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:01:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 00:01:36] [INFO ] After 87ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:01:37] [INFO ] After 271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-22 00:01:37] [INFO ] After 1818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 92 ms.
Support contains 2 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1897/1897 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 1900 transition count 1896
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 1 with 2 rules applied. Total rules applied 3 place count 1899 transition count 1895
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 1899 transition count 1895
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1898 transition count 1894
Applied a total of 5 rules in 250 ms. Remains 1898 /1900 variables (removed 2) and now considering 1894/1897 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 1898/1900 places, 1894/1897 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 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 110430 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110430 steps, saw 68521 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2023-03-22 00:01:40] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-22 00:01:41] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:01:41] [INFO ] [Nat]Absence check using 898 positive place invariants in 166 ms returned sat
[2023-03-22 00:01:42] [INFO ] After 1025ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:01:42] [INFO ] After 1147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-22 00:01:42] [INFO ] After 1684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 71 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 56 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 52 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-22 00:01:42] [INFO ] Invariant cache hit.
[2023-03-22 00:01:44] [INFO ] Implicit Places using invariants in 1653 ms returned []
[2023-03-22 00:01:44] [INFO ] Invariant cache hit.
[2023-03-22 00:01:47] [INFO ] Implicit Places using invariants and state equation in 3114 ms returned []
Implicit Place search using SMT with State Equation took 4768 ms to find 0 implicit places.
[2023-03-22 00:01:47] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-22 00:01:47] [INFO ] Invariant cache hit.
[2023-03-22 00:01:48] [INFO ] Dead Transitions using invariants and state equation in 981 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5860 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1898 transition count 1894
Applied a total of 200 rules in 105 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2023-03-22 00:01:48] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-22 00:01:49] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:01:49] [INFO ] [Nat]Absence check using 898 positive place invariants in 168 ms returned sat
[2023-03-22 00:01:50] [INFO ] After 885ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:01:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 00:01:50] [INFO ] After 81ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:01:50] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-22 00:01:50] [INFO ] After 1691ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 229 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1416 ms.
Product exploration explored 100000 steps with 0 reset in 1754 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1900/1900 places, 1897/1897 transitions.
Applied a total of 0 rules in 68 ms. Remains 1900 /1900 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-22 00:01:55] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 1897 rows 1900 cols
[2023-03-22 00:01:55] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-22 00:01:56] [INFO ] Dead Transitions using invariants and state equation in 1295 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1410 ms. Remains : 1900/1900 places, 1897/1897 transitions.
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1900/1900 places, 1897/1897 transitions.
Applied a total of 0 rules in 44 ms. Remains 1900 /1900 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-22 00:01:56] [INFO ] Invariant cache hit.
[2023-03-22 00:01:58] [INFO ] Implicit Places using invariants in 1491 ms returned []
[2023-03-22 00:01:58] [INFO ] Invariant cache hit.
[2023-03-22 00:01:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 00:02:01] [INFO ] Implicit Places using invariants and state equation in 3688 ms returned []
Implicit Place search using SMT with State Equation took 5204 ms to find 0 implicit places.
[2023-03-22 00:02:01] [INFO ] Invariant cache hit.
[2023-03-22 00:02:03] [INFO ] Dead Transitions using invariants and state equation in 1446 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6695 ms. Remains : 1900/1900 places, 1897/1897 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-03 finished in 65357 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)))'
Found a Lengthening insensitive property : ShieldIIPt-PT-100B-LTLCardinality-05
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5914/5914 places, 5414/5414 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 5913 transition count 4213
Reduce places removed 1200 places and 0 transitions.
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2400 place count 4713 transition count 4213
Performed 794 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 794 Pre rules applied. Total rules applied 2400 place count 4713 transition count 3419
Deduced a syphon composed of 794 places in 13 ms
Reduce places removed 794 places and 0 transitions.
Iterating global reduction 2 with 1588 rules applied. Total rules applied 3988 place count 3919 transition count 3419
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 3997 place count 3910 transition count 3410
Iterating global reduction 2 with 9 rules applied. Total rules applied 4006 place count 3910 transition count 3410
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 3910 transition count 3404
Deduced a syphon composed of 6 places in 11 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 4018 place count 3904 transition count 3404
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 7414 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 7415 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 7417 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 7619 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 7821 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 8013 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 8015 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 8017 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 8017 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 8019 place count 1902 transition count 1897
Applied a total of 8019 rules in 1695 ms. Remains 1902 /5914 variables (removed 4012) and now considering 1897/5414 (removed 3517) transitions.
// Phase 1: matrix 1897 rows 1902 cols
[2023-03-22 00:02:05] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-22 00:02:06] [INFO ] Implicit Places using invariants in 1382 ms returned [1891]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1397 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1901/5914 places, 1897/5414 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 1896
Applied a total of 2 rules in 93 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:02:06] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-22 00:02:08] [INFO ] Implicit Places using invariants in 1297 ms returned []
[2023-03-22 00:02:08] [INFO ] Invariant cache hit.
[2023-03-22 00:02:11] [INFO ] Implicit Places using invariants and state equation in 3454 ms returned []
Implicit Place search using SMT with State Equation took 4772 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1900/5914 places, 1896/5414 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 7958 ms. Remains : 1900/5914 places, 1896/5414 transitions.
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (EQ s539 0) (EQ s1425 1)) (OR (EQ s304 0) (EQ s1562 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][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1311 ms.
Product exploration explored 100000 steps with 0 reset in 1789 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 243 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 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 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 109647 steps, run timeout after 3076 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 109647 steps, saw 65773 distinct states, run finished after 3076 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:02:18] [INFO ] Invariant cache hit.
[2023-03-22 00:02:18] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:02:19] [INFO ] [Nat]Absence check using 898 positive place invariants in 195 ms returned sat
[2023-03-22 00:02:20] [INFO ] After 1204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:02:20] [INFO ] After 1354ms 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-22 00:02:20] [INFO ] After 1947ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 92 ms.
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 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 1900 transition count 1895
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1900 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 1899 transition count 1894
Applied a total of 3 rules in 116 ms. Remains 1899 /1900 variables (removed 1) and now considering 1894/1896 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 1899/1900 places, 1894/1896 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 195 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 103227 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103227 steps, saw 63956 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2023-03-22 00:02:24] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-22 00:02:24] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:02:25] [INFO ] [Nat]Absence check using 898 positive place invariants in 252 ms returned sat
[2023-03-22 00:02:26] [INFO ] After 1054ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:02:26] [INFO ] After 1161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-22 00:02:26] [INFO ] After 1877ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 91 ms.
Support contains 4 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 53 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 52 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-22 00:02:26] [INFO ] Invariant cache hit.
[2023-03-22 00:02:28] [INFO ] Implicit Places using invariants in 2357 ms returned []
[2023-03-22 00:02:28] [INFO ] Invariant cache hit.
[2023-03-22 00:02:32] [INFO ] Implicit Places using invariants and state equation in 3361 ms returned []
Implicit Place search using SMT with State Equation took 5746 ms to find 0 implicit places.
[2023-03-22 00:02:32] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-22 00:02:32] [INFO ] Invariant cache hit.
[2023-03-22 00:02:33] [INFO ] Dead Transitions using invariants and state equation in 1267 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7104 ms. Remains : 1899/1899 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 1899 transition count 1894
Applied a total of 199 rules in 100 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2023-03-22 00:02:33] [INFO ] Computed 898 place invariants in 2 ms
[2023-03-22 00:02:33] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:02:34] [INFO ] [Nat]Absence check using 898 positive place invariants in 313 ms returned sat
[2023-03-22 00:02:35] [INFO ] After 1015ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:02:35] [INFO ] After 1167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-22 00:02:35] [INFO ] After 1868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 233 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1900/1900 places, 1896/1896 transitions.
Applied a total of 0 rules in 44 ms. Remains 1900 /1900 variables (removed 0) and now considering 1896/1896 (removed 0) transitions.
// Phase 1: matrix 1896 rows 1900 cols
[2023-03-22 00:02:36] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-22 00:02:37] [INFO ] Implicit Places using invariants in 1600 ms returned []
[2023-03-22 00:02:37] [INFO ] Invariant cache hit.
[2023-03-22 00:02:41] [INFO ] Implicit Places using invariants and state equation in 3251 ms returned []
Implicit Place search using SMT with State Equation took 4853 ms to find 0 implicit places.
[2023-03-22 00:02:41] [INFO ] Invariant cache hit.
[2023-03-22 00:02:42] [INFO ] Dead Transitions using invariants and state equation in 1413 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6312 ms. Remains : 1900/1900 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 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 96520 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96520 steps, saw 57978 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:02:46] [INFO ] Invariant cache hit.
[2023-03-22 00:02:46] [INFO ] After 404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:02:46] [INFO ] [Nat]Absence check using 898 positive place invariants in 165 ms returned sat
[2023-03-22 00:02:48] [INFO ] After 1186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:02:48] [INFO ] After 1385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-22 00:02:48] [INFO ] After 1881ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 98 ms.
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 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 1900 transition count 1895
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1900 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 1899 transition count 1894
Applied a total of 3 rules in 121 ms. Remains 1899 /1900 variables (removed 1) and now considering 1894/1896 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 1899/1900 places, 1894/1896 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) 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 99808 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99808 steps, saw 61804 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2023-03-22 00:02:52] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-22 00:02:52] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:02:52] [INFO ] [Nat]Absence check using 898 positive place invariants in 189 ms returned sat
[2023-03-22 00:02:53] [INFO ] After 883ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:02:53] [INFO ] After 1021ms 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:02:53] [INFO ] After 1621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 92 ms.
Support contains 4 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 87 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 55 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-22 00:02:54] [INFO ] Invariant cache hit.
[2023-03-22 00:02:55] [INFO ] Implicit Places using invariants in 1478 ms returned []
[2023-03-22 00:02:55] [INFO ] Invariant cache hit.
[2023-03-22 00:02:59] [INFO ] Implicit Places using invariants and state equation in 3437 ms returned []
Implicit Place search using SMT with State Equation took 4935 ms to find 0 implicit places.
[2023-03-22 00:02:59] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-22 00:02:59] [INFO ] Invariant cache hit.
[2023-03-22 00:03:00] [INFO ] Dead Transitions using invariants and state equation in 1336 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6388 ms. Remains : 1899/1899 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 1899 transition count 1894
Applied a total of 199 rules in 183 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2023-03-22 00:03:00] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-22 00:03:00] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:03:01] [INFO ] [Nat]Absence check using 898 positive place invariants in 145 ms returned sat
[2023-03-22 00:03:02] [INFO ] After 897ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:03:02] [INFO ] After 1064ms 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-22 00:03:02] [INFO ] After 1621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 379 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1393 ms.
Product exploration explored 100000 steps with 0 reset in 2000 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1900/1900 places, 1896/1896 transitions.
Applied a total of 0 rules in 73 ms. Remains 1900 /1900 variables (removed 0) and now considering 1896/1896 (removed 0) transitions.
[2023-03-22 00:03:07] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 1896 rows 1900 cols
[2023-03-22 00:03:07] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-22 00:03:08] [INFO ] Dead Transitions using invariants and state equation in 1523 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1645 ms. Remains : 1900/1900 places, 1896/1896 transitions.
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1900/1900 places, 1896/1896 transitions.
Applied a total of 0 rules in 37 ms. Remains 1900 /1900 variables (removed 0) and now considering 1896/1896 (removed 0) transitions.
[2023-03-22 00:03:08] [INFO ] Invariant cache hit.
[2023-03-22 00:03:10] [INFO ] Implicit Places using invariants in 1488 ms returned []
[2023-03-22 00:03:10] [INFO ] Invariant cache hit.
[2023-03-22 00:03:13] [INFO ] Implicit Places using invariants and state equation in 2898 ms returned []
Implicit Place search using SMT with State Equation took 4388 ms to find 0 implicit places.
[2023-03-22 00:03:13] [INFO ] Invariant cache hit.
[2023-03-22 00:03:14] [INFO ] Dead Transitions using invariants and state equation in 1144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5571 ms. Remains : 1900/1900 places, 1896/1896 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-05 finished in 70902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F((G(p2)||p1)))))'
[2023-03-22 00:03:14] [INFO ] Flatten gal took : 163 ms
[2023-03-22 00:03:14] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-22 00:03:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5914 places, 5414 transitions and 14028 arcs took 27 ms.
Total runtime 836579 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2512/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2512/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2512/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2512/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPt-PT-100B-LTLCardinality-01
Could not compute solution for formula : ShieldIIPt-PT-100B-LTLCardinality-03
Could not compute solution for formula : ShieldIIPt-PT-100B-LTLCardinality-05
Could not compute solution for formula : ShieldIIPt-PT-100B-LTLCardinality-15

BK_STOP 1679443412075

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPt-PT-100B-LTLCardinality-01
ltl formula formula --ltl=/tmp/2512/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 5914 places, 5414 transitions and 14028 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 1.000 real 0.320 user 0.410 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2512/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2512/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2512/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2512/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldIIPt-PT-100B-LTLCardinality-03
ltl formula formula --ltl=/tmp/2512/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5914 places, 5414 transitions and 14028 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 1.200 real 0.430 user 0.440 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2512/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2512/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2512/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2512/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 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:
corrupted size vs. prev_size in fastbins
ltl formula name ShieldIIPt-PT-100B-LTLCardinality-05
ltl formula formula --ltl=/tmp/2512/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5914 places, 5414 transitions and 14028 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.890 real 0.290 user 0.380 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2512/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2512/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2512/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2512/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 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:
ltl formula name ShieldIIPt-PT-100B-LTLCardinality-15
ltl formula formula --ltl=/tmp/2512/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 5914 places, 5414 transitions and 14028 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.960 real 0.240 user 0.400 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2512/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2512/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2512/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2512/ltl_3_
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:

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-100B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716900347"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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