About the Execution of LoLa+red for ShieldPPPt-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2795.275 | 937546.00 | 1161665.00 | 167.00 | ?FFFTFTFF?FFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903715600699.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 lolaxred
Input is ShieldPPPt-PT-100B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715600699
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:09 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.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 21:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 21:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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.9M 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 ShieldPPPt-PT-100B-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679281410138
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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 03:03:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 03:03:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 03:03:33] [INFO ] Load time of PNML (sax parser for PT used): 392 ms
[2023-03-20 03:03:33] [INFO ] Transformed 7803 places.
[2023-03-20 03:03:33] [INFO ] Transformed 7103 transitions.
[2023-03-20 03:03:33] [INFO ] Found NUPN structural information;
[2023-03-20 03:03:33] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 975 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 7803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Discarding 1095 places :
Symmetric choice reduction at 0 with 1095 rule applications. Total rules 1095 place count 6708 transition count 6008
Iterating global reduction 0 with 1095 rules applied. Total rules applied 2190 place count 6708 transition count 6008
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2191 place count 6707 transition count 6007
Iterating global reduction 0 with 1 rules applied. Total rules applied 2192 place count 6707 transition count 6007
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2193 place count 6706 transition count 6006
Iterating global reduction 0 with 1 rules applied. Total rules applied 2194 place count 6706 transition count 6006
Applied a total of 2194 rules in 5472 ms. Remains 6706 /7803 variables (removed 1097) and now considering 6006/7103 (removed 1097) transitions.
// Phase 1: matrix 6006 rows 6706 cols
[2023-03-20 03:03:39] [INFO ] Computed 1101 place invariants in 131 ms
[2023-03-20 03:03:44] [INFO ] Implicit Places using invariants in 4665 ms returned []
[2023-03-20 03:03:44] [INFO ] Invariant cache hit.
[2023-03-20 03:03:47] [INFO ] Implicit Places using invariants and state equation in 3321 ms returned []
Implicit Place search using SMT with State Equation took 8057 ms to find 0 implicit places.
[2023-03-20 03:03:47] [INFO ] Invariant cache hit.
[2023-03-20 03:03:54] [INFO ] Dead Transitions using invariants and state equation in 6260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6706/7803 places, 6006/7103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19801 ms. Remains : 6706/7803 places, 6006/7103 transitions.
Support contains 29 out of 6706 places after structural reductions.
[2023-03-20 03:03:55] [INFO ] Flatten gal took : 498 ms
[2023-03-20 03:03:55] [INFO ] Flatten gal took : 212 ms
[2023-03-20 03:03:55] [INFO ] Input system was already deterministic with 6006 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 623 ms. (steps per millisecond=16 ) properties (out of 15) seen :5
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 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 31 ms. (steps per millisecond=322 ) 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 32 ms. (steps per millisecond=312 ) 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 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 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-20 03:03:56] [INFO ] Invariant cache hit.
[2023-03-20 03:03:58] [INFO ] After 1976ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 03:04:02] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1161 ms returned sat
[2023-03-20 03:04:10] [INFO ] After 7178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 03:04:13] [INFO ] Deduced a trap composed of 21 places in 2609 ms of which 12 ms to minimize.
[2023-03-20 03:04:17] [INFO ] Deduced a trap composed of 27 places in 3484 ms of which 32 ms to minimize.
[2023-03-20 03:04:20] [INFO ] Deduced a trap composed of 26 places in 3014 ms of which 30 ms to minimize.
[2023-03-20 03:04:24] [INFO ] Deduced a trap composed of 28 places in 3956 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.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 03:04:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 03:04:24] [INFO ] After 25859ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 3501 ms.
Support contains 21 out of 6706 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Drop transitions removed 1383 transitions
Trivial Post-agglo rules discarded 1383 transitions
Performed 1383 trivial Post agglomeration. Transition count delta: 1383
Iterating post reduction 0 with 1383 rules applied. Total rules applied 1383 place count 6706 transition count 4623
Reduce places removed 1383 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 1387 rules applied. Total rules applied 2770 place count 5323 transition count 4619
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2774 place count 5319 transition count 4619
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2774 place count 5319 transition count 3820
Deduced a syphon composed of 799 places in 12 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 4372 place count 4520 transition count 3820
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 4373 place count 4519 transition count 3819
Iterating global reduction 3 with 1 rules applied. Total rules applied 4374 place count 4519 transition count 3819
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4374 place count 4519 transition count 3818
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4376 place count 4518 transition count 3818
Performed 1695 Post agglomeration using F-continuation condition.Transition count delta: 1695
Deduced a syphon composed of 1695 places in 6 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 3 with 3390 rules applied. Total rules applied 7766 place count 2823 transition count 2123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7767 place count 2823 transition count 2122
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 7769 place count 2822 transition count 2121
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 7971 place count 2721 transition count 2121
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8173 place count 2620 transition count 2121
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 91 places in 6 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 8355 place count 2529 transition count 2121
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8356 place count 2529 transition count 2120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8357 place count 2528 transition count 2120
Partial Free-agglomeration rule applied 295 times.
Drop transitions removed 295 transitions
Iterating global reduction 5 with 295 rules applied. Total rules applied 8652 place count 2528 transition count 2120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8653 place count 2527 transition count 2119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8654 place count 2526 transition count 2119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 8654 place count 2526 transition count 2117
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 8658 place count 2524 transition count 2117
Applied a total of 8658 rules in 2917 ms. Remains 2524 /6706 variables (removed 4182) and now considering 2117/6006 (removed 3889) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2917 ms. Remains : 2524/6706 places, 2117/6006 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2117 rows 2524 cols
[2023-03-20 03:04:33] [INFO ] Computed 1100 place invariants in 6 ms
[2023-03-20 03:04:34] [INFO ] After 745ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 03:04:35] [INFO ] [Nat]Absence check using 1100 positive place invariants in 327 ms returned sat
[2023-03-20 03:04:38] [INFO ] After 3345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 03:04:38] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-20 03:04:39] [INFO ] After 887ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 03:04:40] [INFO ] Deduced a trap composed of 8 places in 429 ms of which 1 ms to minimize.
[2023-03-20 03:04:40] [INFO ] Deduced a trap composed of 5 places in 362 ms of which 0 ms to minimize.
[2023-03-20 03:04:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1114 ms
[2023-03-20 03:04:42] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 1 ms to minimize.
[2023-03-20 03:04:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 372 ms
[2023-03-20 03:04:42] [INFO ] After 3868ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 690 ms.
[2023-03-20 03:04:43] [INFO ] After 9387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 330 ms.
Support contains 17 out of 2524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2524/2524 places, 2117/2117 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 2524 transition count 2115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 2522 transition count 2115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 2522 transition count 2114
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 2521 transition count 2114
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 2 with 2 rules applied. Total rules applied 8 place count 2520 transition count 2113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 2519 transition count 2113
Applied a total of 10 rules in 346 ms. Remains 2519 /2524 variables (removed 5) and now considering 2113/2117 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 2519/2524 places, 2113/2117 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 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 156 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 157 ms. (steps per millisecond=63 ) 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 10000 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 131 ms. (steps per millisecond=76 ) 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 158 ms. (steps per millisecond=63 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 45755 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 45755 steps, saw 37534 distinct states, run finished after 3003 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2113 rows 2519 cols
[2023-03-20 03:04:48] [INFO ] Computed 1100 place invariants in 4 ms
[2023-03-20 03:04:49] [INFO ] After 688ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 03:04:50] [INFO ] [Nat]Absence check using 1100 positive place invariants in 571 ms returned sat
[2023-03-20 03:04:54] [INFO ] After 2780ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 03:04:54] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-20 03:04:54] [INFO ] After 752ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 03:04:55] [INFO ] Deduced a trap composed of 6 places in 438 ms of which 1 ms to minimize.
[2023-03-20 03:04:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 620 ms
[2023-03-20 03:04:56] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 0 ms to minimize.
[2023-03-20 03:04:57] [INFO ] Deduced a trap composed of 3 places in 351 ms of which 1 ms to minimize.
[2023-03-20 03:04:57] [INFO ] Deduced a trap composed of 6 places in 412 ms of which 1 ms to minimize.
[2023-03-20 03:04:58] [INFO ] Deduced a trap composed of 6 places in 326 ms of which 0 ms to minimize.
[2023-03-20 03:04:58] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 1 ms to minimize.
[2023-03-20 03:04:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2332 ms
[2023-03-20 03:04:59] [INFO ] After 4858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1066 ms.
[2023-03-20 03:05:00] [INFO ] After 10670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 556 ms.
Support contains 17 out of 2519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2519/2519 places, 2113/2113 transitions.
Applied a total of 0 rules in 90 ms. Remains 2519 /2519 variables (removed 0) and now considering 2113/2113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 2519/2519 places, 2113/2113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2519/2519 places, 2113/2113 transitions.
Applied a total of 0 rules in 87 ms. Remains 2519 /2519 variables (removed 0) and now considering 2113/2113 (removed 0) transitions.
[2023-03-20 03:05:00] [INFO ] Invariant cache hit.
[2023-03-20 03:05:03] [INFO ] Implicit Places using invariants in 2175 ms returned [2502, 2506]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2181 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2517/2519 places, 2113/2113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2515 transition count 2111
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2515 transition count 2111
Applied a total of 4 rules in 170 ms. Remains 2515 /2517 variables (removed 2) and now considering 2111/2113 (removed 2) transitions.
// Phase 1: matrix 2111 rows 2515 cols
[2023-03-20 03:05:03] [INFO ] Computed 1098 place invariants in 12 ms
[2023-03-20 03:05:06] [INFO ] Implicit Places using invariants in 2949 ms returned []
[2023-03-20 03:05:06] [INFO ] Invariant cache hit.
[2023-03-20 03:05:08] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-20 03:05:12] [INFO ] Implicit Places using invariants and state equation in 5919 ms returned []
Implicit Place search using SMT with State Equation took 8900 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2515/2519 places, 2111/2113 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11338 ms. Remains : 2515/2519 places, 2111/2113 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 424 ms. (steps per millisecond=23 ) 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 10000 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 10000 steps, including 2 resets, run finished after 164 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 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 151 ms. (steps per millisecond=66 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 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 149 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 152 ms. (steps per millisecond=65 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 51935 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 51935 steps, saw 42816 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-20 03:05:16] [INFO ] Invariant cache hit.
[2023-03-20 03:05:17] [INFO ] After 425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 03:05:18] [INFO ] [Nat]Absence check using 1098 positive place invariants in 253 ms returned sat
[2023-03-20 03:05:20] [INFO ] After 2074ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 03:05:20] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-20 03:05:21] [INFO ] After 817ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 03:05:21] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 0 ms to minimize.
[2023-03-20 03:05:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 400 ms
[2023-03-20 03:05:22] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 1 ms to minimize.
[2023-03-20 03:05:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 467 ms
[2023-03-20 03:05:23] [INFO ] After 2983ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1023 ms.
[2023-03-20 03:05:24] [INFO ] After 7603ms 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 546 ms.
Support contains 17 out of 2515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2515/2515 places, 2111/2111 transitions.
Applied a total of 0 rules in 103 ms. Remains 2515 /2515 variables (removed 0) and now considering 2111/2111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 2515/2515 places, 2111/2111 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2515/2515 places, 2111/2111 transitions.
Applied a total of 0 rules in 110 ms. Remains 2515 /2515 variables (removed 0) and now considering 2111/2111 (removed 0) transitions.
[2023-03-20 03:05:25] [INFO ] Invariant cache hit.
[2023-03-20 03:05:29] [INFO ] Implicit Places using invariants in 3487 ms returned []
[2023-03-20 03:05:29] [INFO ] Invariant cache hit.
[2023-03-20 03:05:31] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-20 03:05:34] [INFO ] Implicit Places using invariants and state equation in 5404 ms returned []
Implicit Place search using SMT with State Equation took 8907 ms to find 0 implicit places.
[2023-03-20 03:05:34] [INFO ] Redundant transitions in 202 ms returned []
[2023-03-20 03:05:34] [INFO ] Invariant cache hit.
[2023-03-20 03:05:36] [INFO ] Dead Transitions using invariants and state equation in 1761 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11002 ms. Remains : 2515/2515 places, 2111/2111 transitions.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 4 out of 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1396 transitions
Trivial Post-agglo rules discarded 1396 transitions
Performed 1396 trivial Post agglomeration. Transition count delta: 1396
Iterating post reduction 0 with 1396 rules applied. Total rules applied 1396 place count 6705 transition count 4609
Reduce places removed 1396 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1397 rules applied. Total rules applied 2793 place count 5309 transition count 4608
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2794 place count 5308 transition count 4608
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2794 place count 5308 transition count 3809
Deduced a syphon composed of 799 places in 12 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 4392 place count 4509 transition count 3809
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 4396 place count 4505 transition count 3805
Iterating global reduction 3 with 4 rules applied. Total rules applied 4400 place count 4505 transition count 3805
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4400 place count 4505 transition count 3801
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 4408 place count 4501 transition count 3801
Performed 1696 Post agglomeration using F-continuation condition.Transition count delta: 1696
Deduced a syphon composed of 1696 places in 9 ms
Reduce places removed 1696 places and 0 transitions.
Iterating global reduction 3 with 3392 rules applied. Total rules applied 7800 place count 2805 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7801 place count 2805 transition count 2104
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 7803 place count 2804 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8005 place count 2703 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8207 place count 2602 transition count 2103
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8401 place count 2505 transition count 2103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8403 place count 2503 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8404 place count 2502 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8404 place count 2502 transition count 2099
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8408 place count 2500 transition count 2099
Applied a total of 8408 rules in 2516 ms. Remains 2500 /6706 variables (removed 4206) and now considering 2099/6006 (removed 3907) transitions.
// Phase 1: matrix 2099 rows 2500 cols
[2023-03-20 03:05:39] [INFO ] Computed 1100 place invariants in 6 ms
[2023-03-20 03:05:41] [INFO ] Implicit Places using invariants in 2390 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2392 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2498/6706 places, 2099/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2097
Applied a total of 4 rules in 169 ms. Remains 2496 /2498 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2023-03-20 03:05:41] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-20 03:05:44] [INFO ] Implicit Places using invariants in 2329 ms returned []
[2023-03-20 03:05:44] [INFO ] Invariant cache hit.
[2023-03-20 03:05:49] [INFO ] Implicit Places using invariants and state equation in 5220 ms returned []
Implicit Place search using SMT with State Equation took 7572 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/6706 places, 2097/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12649 ms. Remains : 2496/6706 places, 2097/6006 transitions.
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s405 0) (EQ s512 1) (EQ s2153 0) (EQ s1885 1)), p1:(OR (EQ s2153 0) (EQ s1885 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 2 reset in 1476 ms.
Product exploration explored 100000 steps with 2 reset in 2037 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 461 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 80208 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80208 steps, saw 60314 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 03:05:57] [INFO ] Invariant cache hit.
[2023-03-20 03:05:57] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 03:05:58] [INFO ] [Nat]Absence check using 1098 positive place invariants in 449 ms returned sat
[2023-03-20 03:06:00] [INFO ] After 1429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 03:06:00] [INFO ] After 1760ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 202 ms.
[2023-03-20 03:06:00] [INFO ] After 2888ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 88 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 82 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 84813 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84813 steps, saw 63944 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 03:06:04] [INFO ] Invariant cache hit.
[2023-03-20 03:06:04] [INFO ] After 444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 03:06:05] [INFO ] [Nat]Absence check using 1098 positive place invariants in 233 ms returned sat
[2023-03-20 03:06:07] [INFO ] After 1885ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 03:06:07] [INFO ] After 2238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 278 ms.
[2023-03-20 03:06:08] [INFO ] After 3239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 124 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 115 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 93 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2023-03-20 03:06:08] [INFO ] Invariant cache hit.
[2023-03-20 03:06:10] [INFO ] Implicit Places using invariants in 2175 ms returned []
[2023-03-20 03:06:10] [INFO ] Invariant cache hit.
[2023-03-20 03:06:14] [INFO ] Implicit Places using invariants and state equation in 4311 ms returned []
Implicit Place search using SMT with State Equation took 6509 ms to find 0 implicit places.
[2023-03-20 03:06:15] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-20 03:06:15] [INFO ] Invariant cache hit.
[2023-03-20 03:06:17] [INFO ] Dead Transitions using invariants and state equation in 2210 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8889 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2496 transition count 2097
Applied a total of 595 rules in 254 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2023-03-20 03:06:17] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-20 03:06:17] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 03:06:18] [INFO ] [Nat]Absence check using 1098 positive place invariants in 375 ms returned sat
[2023-03-20 03:06:21] [INFO ] After 2035ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 03:06:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 03:06:21] [INFO ] After 284ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 03:06:21] [INFO ] After 625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 273 ms.
[2023-03-20 03:06:22] [INFO ] After 4041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 272 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 127 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2023-03-20 03:06:22] [INFO ] Computed 1098 place invariants in 3 ms
[2023-03-20 03:06:24] [INFO ] Implicit Places using invariants in 2042 ms returned []
[2023-03-20 03:06:24] [INFO ] Invariant cache hit.
[2023-03-20 03:06:29] [INFO ] Implicit Places using invariants and state equation in 5234 ms returned []
Implicit Place search using SMT with State Equation took 7281 ms to find 0 implicit places.
[2023-03-20 03:06:29] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-20 03:06:29] [INFO ] Invariant cache hit.
[2023-03-20 03:06:32] [INFO ] Dead Transitions using invariants and state equation in 2504 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9969 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 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 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:06:33] [INFO ] Invariant cache hit.
[2023-03-20 03:06:33] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:06:34] [INFO ] [Nat]Absence check using 1098 positive place invariants in 381 ms returned sat
[2023-03-20 03:06:35] [INFO ] After 1605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:06:35] [INFO ] After 1733ms 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-20 03:06:35] [INFO ] After 2551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 92 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) 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 109166 steps, run timeout after 3103 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 109166 steps, saw 81184 distinct states, run finished after 3103 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:06:39] [INFO ] Invariant cache hit.
[2023-03-20 03:06:39] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:06:40] [INFO ] [Nat]Absence check using 1098 positive place invariants in 317 ms returned sat
[2023-03-20 03:06:41] [INFO ] After 1199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:06:42] [INFO ] After 1369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-20 03:06:42] [INFO ] After 2431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 38 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 95 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 81 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2023-03-20 03:06:42] [INFO ] Invariant cache hit.
[2023-03-20 03:06:44] [INFO ] Implicit Places using invariants in 2217 ms returned []
[2023-03-20 03:06:44] [INFO ] Invariant cache hit.
[2023-03-20 03:06:49] [INFO ] Implicit Places using invariants and state equation in 4696 ms returned []
Implicit Place search using SMT with State Equation took 6932 ms to find 0 implicit places.
[2023-03-20 03:06:49] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-20 03:06:49] [INFO ] Invariant cache hit.
[2023-03-20 03:06:51] [INFO ] Dead Transitions using invariants and state equation in 1852 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8945 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2496 transition count 2097
Applied a total of 595 rules in 215 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2023-03-20 03:06:51] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-20 03:06:51] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:06:52] [INFO ] [Nat]Absence check using 1098 positive place invariants in 218 ms returned sat
[2023-03-20 03:06:53] [INFO ] After 1282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:06:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 03:06:53] [INFO ] After 96ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 03:06:53] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 0 ms to minimize.
[2023-03-20 03:06:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2023-03-20 03:06:54] [INFO ] After 459ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-20 03:06:54] [INFO ] After 2441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 414 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4 reset in 1542 ms.
Product exploration explored 100000 steps with 7 reset in 1907 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 86 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2023-03-20 03:06:58] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-20 03:07:00] [INFO ] Implicit Places using invariants in 1857 ms returned []
[2023-03-20 03:07:00] [INFO ] Invariant cache hit.
[2023-03-20 03:07:05] [INFO ] Implicit Places using invariants and state equation in 5325 ms returned []
Implicit Place search using SMT with State Equation took 7186 ms to find 0 implicit places.
[2023-03-20 03:07:06] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-20 03:07:06] [INFO ] Invariant cache hit.
[2023-03-20 03:07:07] [INFO ] Dead Transitions using invariants and state equation in 1381 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8732 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-00 finished in 91090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 2 out of 6706 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6701 transition count 6001
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6701 transition count 6001
Applied a total of 10 rules in 2158 ms. Remains 6701 /6706 variables (removed 5) and now considering 6001/6006 (removed 5) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-20 03:07:10] [INFO ] Computed 1101 place invariants in 46 ms
[2023-03-20 03:07:13] [INFO ] Implicit Places using invariants in 3281 ms returned []
[2023-03-20 03:07:13] [INFO ] Invariant cache hit.
[2023-03-20 03:07:16] [INFO ] Implicit Places using invariants and state equation in 3427 ms returned []
Implicit Place search using SMT with State Equation took 6712 ms to find 0 implicit places.
[2023-03-20 03:07:16] [INFO ] Invariant cache hit.
[2023-03-20 03:07:22] [INFO ] Dead Transitions using invariants and state equation in 5729 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6706 places, 6001/6006 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14602 ms. Remains : 6701/6706 places, 6001/6006 transitions.
Stuttering acceptance computed with spot in 393 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(OR (EQ s6249 0) (EQ s5074 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 213 steps with 0 reset in 3 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-01 finished in 15137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6705 transition count 4608
Reduce places removed 1397 places and 0 transitions.
Iterating post reduction 1 with 1397 rules applied. Total rules applied 2794 place count 5308 transition count 4608
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 797 Pre rules applied. Total rules applied 2794 place count 5308 transition count 3811
Deduced a syphon composed of 797 places in 14 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 2 with 1594 rules applied. Total rules applied 4388 place count 4511 transition count 3811
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 4392 place count 4507 transition count 3807
Iterating global reduction 2 with 4 rules applied. Total rules applied 4396 place count 4507 transition count 3807
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4396 place count 4507 transition count 3803
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4404 place count 4503 transition count 3803
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 6 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7802 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7803 place count 2804 transition count 2103
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 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7805 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8007 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8209 place count 2601 transition count 2102
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 6 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 8399 place count 2506 transition count 2102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8401 place count 2504 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8402 place count 2503 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8402 place count 2503 transition count 2098
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8406 place count 2501 transition count 2098
Applied a total of 8406 rules in 2404 ms. Remains 2501 /6706 variables (removed 4205) and now considering 2098/6006 (removed 3908) transitions.
// Phase 1: matrix 2098 rows 2501 cols
[2023-03-20 03:07:25] [INFO ] Computed 1100 place invariants in 9 ms
[2023-03-20 03:07:28] [INFO ] Implicit Places using invariants in 2956 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2964 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6706 places, 2098/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2497 transition count 2096
Applied a total of 4 rules in 182 ms. Remains 2497 /2499 variables (removed 2) and now considering 2096/2098 (removed 2) transitions.
// Phase 1: matrix 2096 rows 2497 cols
[2023-03-20 03:07:28] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-20 03:07:30] [INFO ] Implicit Places using invariants in 2150 ms returned []
[2023-03-20 03:07:30] [INFO ] Invariant cache hit.
[2023-03-20 03:07:35] [INFO ] Implicit Places using invariants and state equation in 4705 ms returned []
Implicit Place search using SMT with State Equation took 6869 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2497/6706 places, 2096/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12419 ms. Remains : 2497/6706 places, 2096/6006 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1001 0) (EQ s2203 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22 reset in 1471 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-02 finished in 13978 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 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1399 transitions
Trivial Post-agglo rules discarded 1399 transitions
Performed 1399 trivial Post agglomeration. Transition count delta: 1399
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6705 transition count 4606
Reduce places removed 1399 places and 0 transitions.
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2798 place count 5306 transition count 4606
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 797 Pre rules applied. Total rules applied 2798 place count 5306 transition count 3809
Deduced a syphon composed of 797 places in 12 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 2 with 1594 rules applied. Total rules applied 4392 place count 4509 transition count 3809
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 4395 place count 4506 transition count 3806
Iterating global reduction 2 with 3 rules applied. Total rules applied 4398 place count 4506 transition count 3806
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4398 place count 4506 transition count 3803
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 4404 place count 4503 transition count 3803
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 4 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7802 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7803 place count 2804 transition count 2103
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 7805 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8007 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8209 place count 2601 transition count 2102
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8403 place count 2504 transition count 2102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8405 place count 2502 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8406 place count 2501 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8406 place count 2501 transition count 2098
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8410 place count 2499 transition count 2098
Applied a total of 8410 rules in 2231 ms. Remains 2499 /6706 variables (removed 4207) and now considering 2098/6006 (removed 3908) transitions.
// Phase 1: matrix 2098 rows 2499 cols
[2023-03-20 03:07:39] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-20 03:07:41] [INFO ] Implicit Places using invariants in 2179 ms returned [2482, 2486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2184 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2497/6706 places, 2098/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2495 transition count 2096
Applied a total of 4 rules in 203 ms. Remains 2495 /2497 variables (removed 2) and now considering 2096/2098 (removed 2) transitions.
// Phase 1: matrix 2096 rows 2495 cols
[2023-03-20 03:07:41] [INFO ] Computed 1098 place invariants in 6 ms
[2023-03-20 03:07:43] [INFO ] Implicit Places using invariants in 2320 ms returned []
[2023-03-20 03:07:43] [INFO ] Invariant cache hit.
[2023-03-20 03:07:48] [INFO ] Implicit Places using invariants and state equation in 4197 ms returned []
Implicit Place search using SMT with State Equation took 6522 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2495/6706 places, 2096/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11141 ms. Remains : 2495/6706 places, 2096/6006 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1175 0) (EQ s2147 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 1 reset in 1433 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-03 finished in 12762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6705 transition count 4608
Reduce places removed 1397 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2795 place count 5308 transition count 4607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2796 place count 5307 transition count 4607
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 798 Pre rules applied. Total rules applied 2796 place count 5307 transition count 3809
Deduced a syphon composed of 798 places in 11 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 3 with 1596 rules applied. Total rules applied 4392 place count 4509 transition count 3809
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 4395 place count 4506 transition count 3806
Iterating global reduction 3 with 3 rules applied. Total rules applied 4398 place count 4506 transition count 3806
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 4398 place count 4506 transition count 3803
Deduced a syphon composed of 3 places in 11 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 4404 place count 4503 transition count 3803
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 6 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 3 with 3398 rules applied. Total rules applied 7802 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7803 place count 2804 transition count 2103
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 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7805 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8007 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8209 place count 2601 transition count 2102
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8401 place count 2505 transition count 2102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8403 place count 2503 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8404 place count 2502 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8404 place count 2502 transition count 2098
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8408 place count 2500 transition count 2098
Applied a total of 8408 rules in 2337 ms. Remains 2500 /6706 variables (removed 4206) and now considering 2098/6006 (removed 3908) transitions.
// Phase 1: matrix 2098 rows 2500 cols
[2023-03-20 03:07:52] [INFO ] Computed 1100 place invariants in 4 ms
[2023-03-20 03:07:54] [INFO ] Implicit Places using invariants in 2504 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2523 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2498/6706 places, 2098/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2096
Applied a total of 4 rules in 232 ms. Remains 2496 /2498 variables (removed 2) and now considering 2096/2098 (removed 2) transitions.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-20 03:07:54] [INFO ] Computed 1098 place invariants in 6 ms
[2023-03-20 03:07:57] [INFO ] Implicit Places using invariants in 2579 ms returned []
[2023-03-20 03:07:57] [INFO ] Invariant cache hit.
[2023-03-20 03:08:03] [INFO ] Implicit Places using invariants and state equation in 6004 ms returned []
Implicit Place search using SMT with State Equation took 8587 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/6706 places, 2096/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13682 ms. Remains : 2496/6706 places, 2096/6006 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s719 0) (EQ s1452 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1498 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-07 finished in 15276 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 6706 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6701 transition count 6001
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6701 transition count 6001
Applied a total of 10 rules in 2144 ms. Remains 6701 /6706 variables (removed 5) and now considering 6001/6006 (removed 5) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-20 03:08:07] [INFO ] Computed 1101 place invariants in 58 ms
[2023-03-20 03:08:10] [INFO ] Implicit Places using invariants in 3415 ms returned []
[2023-03-20 03:08:10] [INFO ] Invariant cache hit.
[2023-03-20 03:08:13] [INFO ] Implicit Places using invariants and state equation in 3240 ms returned []
Implicit Place search using SMT with State Equation took 6669 ms to find 0 implicit places.
[2023-03-20 03:08:13] [INFO ] Invariant cache hit.
[2023-03-20 03:08:20] [INFO ] Dead Transitions using invariants and state equation in 6422 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6706 places, 6001/6006 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15271 ms. Remains : 6701/6706 places, 6001/6006 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-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:(AND (NEQ s3136 0) (NEQ s3665 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 1759 ms.
Stack based approach found an accepted trace after 4113 steps with 0 reset with depth 4114 and stack size 4114 in 69 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-08 finished in 17380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6705 transition count 4608
Reduce places removed 1397 places and 0 transitions.
Iterating post reduction 1 with 1397 rules applied. Total rules applied 2794 place count 5308 transition count 4608
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2794 place count 5308 transition count 3809
Deduced a syphon composed of 799 places in 13 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 4392 place count 4509 transition count 3809
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 4396 place count 4505 transition count 3805
Iterating global reduction 2 with 4 rules applied. Total rules applied 4400 place count 4505 transition count 3805
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4400 place count 4505 transition count 3801
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4408 place count 4501 transition count 3801
Performed 1695 Post agglomeration using F-continuation condition.Transition count delta: 1695
Deduced a syphon composed of 1695 places in 6 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 2 with 3390 rules applied. Total rules applied 7798 place count 2806 transition count 2106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7799 place count 2806 transition count 2105
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 7801 place count 2805 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8003 place count 2704 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8205 place count 2603 transition count 2104
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8399 place count 2506 transition count 2104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8401 place count 2504 transition count 2102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8402 place count 2503 transition count 2102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8402 place count 2503 transition count 2100
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8406 place count 2501 transition count 2100
Applied a total of 8406 rules in 2304 ms. Remains 2501 /6706 variables (removed 4205) and now considering 2100/6006 (removed 3906) transitions.
// Phase 1: matrix 2100 rows 2501 cols
[2023-03-20 03:08:24] [INFO ] Computed 1100 place invariants in 6 ms
[2023-03-20 03:08:27] [INFO ] Implicit Places using invariants in 2373 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2390 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6706 places, 2100/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2497 transition count 2098
Applied a total of 4 rules in 196 ms. Remains 2497 /2499 variables (removed 2) and now considering 2098/2100 (removed 2) transitions.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-20 03:08:27] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-20 03:08:29] [INFO ] Implicit Places using invariants in 2686 ms returned []
[2023-03-20 03:08:29] [INFO ] Invariant cache hit.
[2023-03-20 03:08:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 03:08:35] [INFO ] Implicit Places using invariants and state equation in 5133 ms returned []
Implicit Place search using SMT with State Equation took 7831 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2497/6706 places, 2098/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12721 ms. Remains : 2497/6706 places, 2098/6006 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s938 0) (EQ s2363 1)), p0:(EQ s1477 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4 reset in 1564 ms.
Product exploration explored 100000 steps with 0 reset in 1922 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2497 stabilizing places and 2/2098 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 326 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:08:39] [INFO ] Invariant cache hit.
[2023-03-20 03:08:40] [INFO ] After 501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:08:41] [INFO ] [Nat]Absence check using 1098 positive place invariants in 316 ms returned sat
[2023-03-20 03:08:43] [INFO ] After 2419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:08:43] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 03:08:43] [INFO ] After 148ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 03:08:44] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-20 03:08:44] [INFO ] After 3874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 60 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 4 factoid took 515 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 92 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
[2023-03-20 03:08:45] [INFO ] Invariant cache hit.
[2023-03-20 03:08:48] [INFO ] Implicit Places using invariants in 3200 ms returned []
[2023-03-20 03:08:48] [INFO ] Invariant cache hit.
[2023-03-20 03:08:50] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 03:08:54] [INFO ] Implicit Places using invariants and state equation in 5947 ms returned []
Implicit Place search using SMT with State Equation took 9171 ms to find 0 implicit places.
[2023-03-20 03:08:54] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-20 03:08:54] [INFO ] Invariant cache hit.
[2023-03-20 03:08:56] [INFO ] Dead Transitions using invariants and state equation in 1721 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11080 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2497 stabilizing places and 2/2098 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 272 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:08:56] [INFO ] Invariant cache hit.
[2023-03-20 03:08:57] [INFO ] After 469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:08:57] [INFO ] [Nat]Absence check using 1098 positive place invariants in 264 ms returned sat
[2023-03-20 03:08:59] [INFO ] After 1402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:08:59] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 03:08:59] [INFO ] After 94ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 03:08:59] [INFO ] After 249ms 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-20 03:08:59] [INFO ] After 2426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 64 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 4 factoid took 546 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4 reset in 1467 ms.
Product exploration explored 100000 steps with 0 reset in 1891 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 86 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
[2023-03-20 03:09:04] [INFO ] Invariant cache hit.
[2023-03-20 03:09:05] [INFO ] Implicit Places using invariants in 1848 ms returned []
[2023-03-20 03:09:05] [INFO ] Invariant cache hit.
[2023-03-20 03:09:07] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 03:09:10] [INFO ] Implicit Places using invariants and state equation in 4478 ms returned []
Implicit Place search using SMT with State Equation took 6338 ms to find 0 implicit places.
[2023-03-20 03:09:10] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-20 03:09:10] [INFO ] Invariant cache hit.
[2023-03-20 03:09:12] [INFO ] Dead Transitions using invariants and state equation in 2398 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8913 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-09 finished in 50760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&X(p1)))&&G(p2)))'
Support contains 4 out of 6706 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6701 transition count 6001
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6701 transition count 6001
Applied a total of 10 rules in 2218 ms. Remains 6701 /6706 variables (removed 5) and now considering 6001/6006 (removed 5) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-20 03:09:15] [INFO ] Computed 1101 place invariants in 45 ms
[2023-03-20 03:09:19] [INFO ] Implicit Places using invariants in 3838 ms returned []
[2023-03-20 03:09:19] [INFO ] Invariant cache hit.
[2023-03-20 03:09:23] [INFO ] Implicit Places using invariants and state equation in 4251 ms returned []
Implicit Place search using SMT with State Equation took 8100 ms to find 0 implicit places.
[2023-03-20 03:09:23] [INFO ] Invariant cache hit.
[2023-03-20 03:09:31] [INFO ] Dead Transitions using invariants and state equation in 8387 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6706 places, 6001/6006 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18725 ms. Remains : 6701/6706 places, 6001/6006 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s1895 0), p0:(OR (EQ s6537 0) (EQ s4173 1)), p1:(EQ s4053 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 1642 ms.
Product exploration explored 100000 steps with 8 reset in 2032 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 p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 660 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 4) seen :3
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-20 03:09:37] [INFO ] Invariant cache hit.
[2023-03-20 03:09:38] [INFO ] After 754ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:09:39] [INFO ] [Nat]Absence check using 1101 positive place invariants in 663 ms returned sat
[2023-03-20 03:09:46] [INFO ] After 6079ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:09:48] [INFO ] Deduced a trap composed of 16 places in 2642 ms of which 4 ms to minimize.
[2023-03-20 03:09:51] [INFO ] Deduced a trap composed of 21 places in 2614 ms of which 4 ms to minimize.
[2023-03-20 03:09:54] [INFO ] Deduced a trap composed of 16 places in 2828 ms of which 4 ms to minimize.
[2023-03-20 03:09:57] [INFO ] Deduced a trap composed of 17 places in 2518 ms of which 4 ms to minimize.
[2023-03-20 03:10:00] [INFO ] Deduced a trap composed of 21 places in 2440 ms of which 3 ms to minimize.
[2023-03-20 03:10:02] [INFO ] Deduced a trap composed of 21 places in 2353 ms of which 4 ms to minimize.
[2023-03-20 03:10:07] [INFO ] Deduced a trap composed of 23 places in 3995 ms of which 36 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 03:10:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 03:10:07] [INFO ] After 28889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 129 ms.
Support contains 1 out of 6701 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6701 transition count 4601
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5301 transition count 4601
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2800 place count 5301 transition count 3801
Deduced a syphon composed of 800 places in 13 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 4400 place count 4501 transition count 3801
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 6 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 2 with 3400 rules applied. Total rules applied 7800 place count 2801 transition count 2101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7801 place count 2801 transition count 2100
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 7803 place count 2800 transition count 2099
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8005 place count 2699 transition count 2099
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8207 place count 2598 transition count 2099
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 7 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8401 place count 2501 transition count 2099
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8700 place count 2501 transition count 2099
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8701 place count 2500 transition count 2098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8702 place count 2499 transition count 2098
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8702 place count 2499 transition count 2096
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8706 place count 2497 transition count 2096
Applied a total of 8706 rules in 2062 ms. Remains 2497 /6701 variables (removed 4204) and now considering 2096/6001 (removed 3905) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2062 ms. Remains : 2497/6701 places, 2096/6001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) 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 77868 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77868 steps, saw 52782 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2497 cols
[2023-03-20 03:10:12] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-20 03:10:12] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:10:13] [INFO ] [Nat]Absence check using 1100 positive place invariants in 393 ms returned sat
[2023-03-20 03:10:15] [INFO ] After 1298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:10:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 03:10:15] [INFO ] After 98ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 03:10:15] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 1 ms to minimize.
[2023-03-20 03:10:15] [INFO ] Deduced a trap composed of 7 places in 319 ms of which 1 ms to minimize.
[2023-03-20 03:10:16] [INFO ] Deduced a trap composed of 6 places in 298 ms of which 1 ms to minimize.
[2023-03-20 03:10:16] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 2 ms to minimize.
[2023-03-20 03:10:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1543 ms
[2023-03-20 03:10:16] [INFO ] After 1715ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-20 03:10:16] [INFO ] After 3935ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2096/2096 transitions.
Applied a total of 0 rules in 83 ms. Remains 2497 /2497 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 2497/2497 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2096/2096 transitions.
Applied a total of 0 rules in 82 ms. Remains 2497 /2497 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2023-03-20 03:10:17] [INFO ] Invariant cache hit.
[2023-03-20 03:10:19] [INFO ] Implicit Places using invariants in 2163 ms returned [2480, 2484]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2183 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2495/2497 places, 2096/2096 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2493 transition count 2094
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2493 transition count 2094
Applied a total of 4 rules in 230 ms. Remains 2493 /2495 variables (removed 2) and now considering 2094/2096 (removed 2) transitions.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-20 03:10:19] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-20 03:10:21] [INFO ] Implicit Places using invariants in 1965 ms returned []
[2023-03-20 03:10:21] [INFO ] Invariant cache hit.
[2023-03-20 03:10:26] [INFO ] Implicit Places using invariants and state equation in 4545 ms returned []
Implicit Place search using SMT with State Equation took 6551 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2493/2497 places, 2094/2096 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9047 ms. Remains : 2493/2497 places, 2094/2096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 76477 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76477 steps, saw 51905 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:10:29] [INFO ] Invariant cache hit.
[2023-03-20 03:10:29] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:10:30] [INFO ] [Nat]Absence check using 1098 positive place invariants in 223 ms returned sat
[2023-03-20 03:10:31] [INFO ] After 1251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:10:31] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 3 ms to minimize.
[2023-03-20 03:10:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 466 ms
[2023-03-20 03:10:32] [INFO ] After 1821ms 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-20 03:10:32] [INFO ] After 2524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 2493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 112 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 110 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
[2023-03-20 03:10:32] [INFO ] Invariant cache hit.
[2023-03-20 03:10:34] [INFO ] Implicit Places using invariants in 2383 ms returned []
[2023-03-20 03:10:34] [INFO ] Invariant cache hit.
[2023-03-20 03:10:39] [INFO ] Implicit Places using invariants and state equation in 5142 ms returned []
Implicit Place search using SMT with State Equation took 7554 ms to find 0 implicit places.
[2023-03-20 03:10:40] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-20 03:10:40] [INFO ] Invariant cache hit.
[2023-03-20 03:10:41] [INFO ] Dead Transitions using invariants and state equation in 1769 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9532 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2493 transition count 2094
Applied a total of 596 rules in 207 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-20 03:10:42] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-20 03:10:42] [INFO ] After 544ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:10:43] [INFO ] [Nat]Absence check using 1098 positive place invariants in 201 ms returned sat
[2023-03-20 03:10:44] [INFO ] After 1256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:10:44] [INFO ] State equation strengthened by 594 read => feed constraints.
[2023-03-20 03:10:44] [INFO ] After 331ms SMT Verify possible using 594 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 03:10:45] [INFO ] Deduced a trap composed of 6 places in 858 ms of which 2 ms to minimize.
[2023-03-20 03:10:46] [INFO ] Deduced a trap composed of 6 places in 841 ms of which 23 ms to minimize.
[2023-03-20 03:10:48] [INFO ] Deduced a trap composed of 5 places in 1499 ms of which 1 ms to minimize.
[2023-03-20 03:10:49] [INFO ] Deduced a trap composed of 5 places in 801 ms of which 1 ms to minimize.
[2023-03-20 03:10:50] [INFO ] Deduced a trap composed of 5 places in 864 ms of which 1 ms to minimize.
[2023-03-20 03:10:51] [INFO ] Deduced a trap composed of 7 places in 949 ms of which 1 ms to minimize.
[2023-03-20 03:10:52] [INFO ] Deduced a trap composed of 5 places in 1176 ms of which 2 ms to minimize.
[2023-03-20 03:10:53] [INFO ] Deduced a trap composed of 5 places in 898 ms of which 2 ms to minimize.
[2023-03-20 03:10:54] [INFO ] Deduced a trap composed of 5 places in 977 ms of which 2 ms to minimize.
[2023-03-20 03:10:56] [INFO ] Deduced a trap composed of 5 places in 1003 ms of which 2 ms to minimize.
[2023-03-20 03:10:57] [INFO ] Deduced a trap composed of 5 places in 899 ms of which 23 ms to minimize.
[2023-03-20 03:10:58] [INFO ] Deduced a trap composed of 5 places in 784 ms of which 2 ms to minimize.
[2023-03-20 03:10:59] [INFO ] Deduced a trap composed of 7 places in 898 ms of which 2 ms to minimize.
[2023-03-20 03:11:00] [INFO ] Deduced a trap composed of 9 places in 695 ms of which 1 ms to minimize.
[2023-03-20 03:11:01] [INFO ] Deduced a trap composed of 5 places in 875 ms of which 1 ms to minimize.
[2023-03-20 03:11:01] [INFO ] Deduced a trap composed of 11 places in 683 ms of which 2 ms to minimize.
[2023-03-20 03:11:02] [INFO ] Deduced a trap composed of 5 places in 647 ms of which 1 ms to minimize.
[2023-03-20 03:11:03] [INFO ] Deduced a trap composed of 7 places in 738 ms of which 2 ms to minimize.
[2023-03-20 03:11:04] [INFO ] Deduced a trap composed of 7 places in 703 ms of which 1 ms to minimize.
[2023-03-20 03:11:04] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 19634 ms
[2023-03-20 03:11:04] [INFO ] After 20121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 134 ms.
[2023-03-20 03:11:04] [INFO ] After 22104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 1045 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 391 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-20 03:11:06] [INFO ] Computed 1101 place invariants in 30 ms
[2023-03-20 03:11:21] [INFO ] [Real]Absence check using 1101 positive place invariants in 6345 ms returned sat
[2023-03-20 03:11:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 03:11:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 4 out of 6701 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Applied a total of 0 rules in 1031 ms. Remains 6701 /6701 variables (removed 0) and now considering 6001/6001 (removed 0) transitions.
[2023-03-20 03:11:22] [INFO ] Invariant cache hit.
[2023-03-20 03:11:25] [INFO ] Implicit Places using invariants in 3177 ms returned []
[2023-03-20 03:11:25] [INFO ] Invariant cache hit.
[2023-03-20 03:11:28] [INFO ] Implicit Places using invariants and state equation in 2543 ms returned []
Implicit Place search using SMT with State Equation took 5768 ms to find 0 implicit places.
[2023-03-20 03:11:28] [INFO ] Invariant cache hit.
[2023-03-20 03:11:35] [INFO ] Dead Transitions using invariants and state equation in 7197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14009 ms. Remains : 6701/6701 places, 6001/6001 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 p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 475 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:11:37] [INFO ] Invariant cache hit.
[2023-03-20 03:11:37] [INFO ] After 819ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:11:39] [INFO ] [Nat]Absence check using 1101 positive place invariants in 688 ms returned sat
[2023-03-20 03:11:45] [INFO ] After 6355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:11:48] [INFO ] Deduced a trap composed of 16 places in 2740 ms of which 4 ms to minimize.
[2023-03-20 03:11:51] [INFO ] Deduced a trap composed of 21 places in 2373 ms of which 3 ms to minimize.
[2023-03-20 03:11:54] [INFO ] Deduced a trap composed of 16 places in 2616 ms of which 6 ms to minimize.
[2023-03-20 03:11:56] [INFO ] Deduced a trap composed of 17 places in 2281 ms of which 3 ms to minimize.
[2023-03-20 03:12:00] [INFO ] Deduced a trap composed of 21 places in 3063 ms of which 20 ms to minimize.
[2023-03-20 03:12:03] [INFO ] Deduced a trap composed of 21 places in 2733 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-20 03:12:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 03:12:03] [INFO ] After 25301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 170 ms.
Support contains 1 out of 6701 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6701 transition count 4601
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5301 transition count 4601
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2800 place count 5301 transition count 3801
Deduced a syphon composed of 800 places in 13 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 4400 place count 4501 transition count 3801
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 6 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 2 with 3400 rules applied. Total rules applied 7800 place count 2801 transition count 2101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7801 place count 2801 transition count 2100
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 7803 place count 2800 transition count 2099
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8005 place count 2699 transition count 2099
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8207 place count 2598 transition count 2099
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8401 place count 2501 transition count 2099
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8700 place count 2501 transition count 2099
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8701 place count 2500 transition count 2098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8702 place count 2499 transition count 2098
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8702 place count 2499 transition count 2096
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8706 place count 2497 transition count 2096
Applied a total of 8706 rules in 2063 ms. Remains 2497 /6701 variables (removed 4204) and now considering 2096/6001 (removed 3905) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2063 ms. Remains : 2497/6701 places, 2096/6001 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 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 78234 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78234 steps, saw 53004 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2497 cols
[2023-03-20 03:12:08] [INFO ] Computed 1100 place invariants in 21 ms
[2023-03-20 03:12:09] [INFO ] After 405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:12:09] [INFO ] [Nat]Absence check using 1100 positive place invariants in 262 ms returned sat
[2023-03-20 03:12:11] [INFO ] After 1808ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:12:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 03:12:11] [INFO ] After 117ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 03:12:12] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 8 ms to minimize.
[2023-03-20 03:12:12] [INFO ] Deduced a trap composed of 7 places in 291 ms of which 2 ms to minimize.
[2023-03-20 03:12:12] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 1 ms to minimize.
[2023-03-20 03:12:13] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 1 ms to minimize.
[2023-03-20 03:12:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1462 ms
[2023-03-20 03:12:13] [INFO ] After 1695ms 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-20 03:12:13] [INFO ] After 4438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2096/2096 transitions.
Applied a total of 0 rules in 89 ms. Remains 2497 /2497 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 2497/2497 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2096/2096 transitions.
Applied a total of 0 rules in 137 ms. Remains 2497 /2497 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2023-03-20 03:12:13] [INFO ] Invariant cache hit.
[2023-03-20 03:12:15] [INFO ] Implicit Places using invariants in 2007 ms returned [2480, 2484]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2022 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2495/2497 places, 2096/2096 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2493 transition count 2094
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2493 transition count 2094
Applied a total of 4 rules in 169 ms. Remains 2493 /2495 variables (removed 2) and now considering 2094/2096 (removed 2) transitions.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-20 03:12:16] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-20 03:12:18] [INFO ] Implicit Places using invariants in 2365 ms returned []
[2023-03-20 03:12:18] [INFO ] Invariant cache hit.
[2023-03-20 03:12:27] [INFO ] Implicit Places using invariants and state equation in 8704 ms returned []
Implicit Place search using SMT with State Equation took 11086 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2493/2497 places, 2094/2096 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13415 ms. Remains : 2493/2497 places, 2094/2096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 76308 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76308 steps, saw 51788 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:12:30] [INFO ] Invariant cache hit.
[2023-03-20 03:12:30] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:12:31] [INFO ] [Nat]Absence check using 1098 positive place invariants in 229 ms returned sat
[2023-03-20 03:12:32] [INFO ] After 1143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:12:32] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 1 ms to minimize.
[2023-03-20 03:12:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 480 ms
[2023-03-20 03:12:33] [INFO ] After 1722ms 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-20 03:12:33] [INFO ] After 2494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 2493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 89 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 84 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
[2023-03-20 03:12:33] [INFO ] Invariant cache hit.
[2023-03-20 03:12:36] [INFO ] Implicit Places using invariants in 2448 ms returned []
[2023-03-20 03:12:36] [INFO ] Invariant cache hit.
[2023-03-20 03:12:37] [INFO ] Implicit Places using invariants and state equation in 1555 ms returned []
Implicit Place search using SMT with State Equation took 4007 ms to find 0 implicit places.
[2023-03-20 03:12:37] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-20 03:12:37] [INFO ] Invariant cache hit.
[2023-03-20 03:12:39] [INFO ] Dead Transitions using invariants and state equation in 2281 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6440 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2493 transition count 2094
Applied a total of 596 rules in 227 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-20 03:12:40] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-20 03:12:40] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:12:41] [INFO ] [Nat]Absence check using 1098 positive place invariants in 233 ms returned sat
[2023-03-20 03:12:42] [INFO ] After 1551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:12:42] [INFO ] State equation strengthened by 594 read => feed constraints.
[2023-03-20 03:12:43] [INFO ] After 295ms SMT Verify possible using 594 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 03:12:44] [INFO ] Deduced a trap composed of 6 places in 985 ms of which 2 ms to minimize.
[2023-03-20 03:12:45] [INFO ] Deduced a trap composed of 6 places in 823 ms of which 1 ms to minimize.
[2023-03-20 03:12:46] [INFO ] Deduced a trap composed of 5 places in 892 ms of which 2 ms to minimize.
[2023-03-20 03:12:47] [INFO ] Deduced a trap composed of 5 places in 969 ms of which 2 ms to minimize.
[2023-03-20 03:12:48] [INFO ] Deduced a trap composed of 5 places in 799 ms of which 2 ms to minimize.
[2023-03-20 03:12:49] [INFO ] Deduced a trap composed of 7 places in 805 ms of which 4 ms to minimize.
[2023-03-20 03:12:50] [INFO ] Deduced a trap composed of 5 places in 763 ms of which 2 ms to minimize.
[2023-03-20 03:12:51] [INFO ] Deduced a trap composed of 5 places in 757 ms of which 2 ms to minimize.
[2023-03-20 03:12:52] [INFO ] Deduced a trap composed of 5 places in 1031 ms of which 2 ms to minimize.
[2023-03-20 03:12:53] [INFO ] Deduced a trap composed of 5 places in 896 ms of which 1 ms to minimize.
[2023-03-20 03:12:54] [INFO ] Deduced a trap composed of 5 places in 906 ms of which 2 ms to minimize.
[2023-03-20 03:12:55] [INFO ] Deduced a trap composed of 5 places in 711 ms of which 2 ms to minimize.
[2023-03-20 03:12:56] [INFO ] Deduced a trap composed of 7 places in 915 ms of which 1 ms to minimize.
[2023-03-20 03:12:57] [INFO ] Deduced a trap composed of 9 places in 770 ms of which 18 ms to minimize.
[2023-03-20 03:12:58] [INFO ] Deduced a trap composed of 5 places in 759 ms of which 1 ms to minimize.
[2023-03-20 03:12:59] [INFO ] Deduced a trap composed of 11 places in 870 ms of which 1 ms to minimize.
[2023-03-20 03:12:59] [INFO ] Deduced a trap composed of 5 places in 679 ms of which 2 ms to minimize.
[2023-03-20 03:13:00] [INFO ] Deduced a trap composed of 7 places in 820 ms of which 2 ms to minimize.
[2023-03-20 03:13:01] [INFO ] Deduced a trap composed of 7 places in 762 ms of which 2 ms to minimize.
[2023-03-20 03:13:01] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 18818 ms
[2023-03-20 03:13:01] [INFO ] After 19281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 171 ms.
[2023-03-20 03:13:02] [INFO ] After 21640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 711 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-20 03:13:03] [INFO ] Computed 1101 place invariants in 19 ms
[2023-03-20 03:13:16] [INFO ] [Real]Absence check using 1101 positive place invariants in 6002 ms returned sat
[2023-03-20 03:13:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:13:18] [INFO ] [Real]Absence check using state equation in 2167 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1615 ms.
Product exploration explored 100000 steps with 0 reset in 2043 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 398 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Support contains 4 out of 6701 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Performed 1399 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6701 transition count 6001
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 499 Pre rules applied. Total rules applied 1399 place count 6701 transition count 6400
Deduced a syphon composed of 1898 places in 19 ms
Iterating global reduction 1 with 499 rules applied. Total rules applied 1898 place count 6701 transition count 6400
Performed 1898 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3796 places in 23 ms
Iterating global reduction 1 with 1898 rules applied. Total rules applied 3796 place count 6701 transition count 6400
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3797 place count 6701 transition count 6399
Renaming transitions due to excessive name length > 1024 char.
Discarding 701 places :
Symmetric choice reduction at 2 with 701 rule applications. Total rules 4498 place count 6000 transition count 5698
Deduced a syphon composed of 3095 places in 22 ms
Iterating global reduction 2 with 701 rules applied. Total rules applied 5199 place count 6000 transition count 5698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3096 places in 27 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5200 place count 6000 transition count 5698
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5202 place count 5998 transition count 5696
Deduced a syphon composed of 3094 places in 26 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5204 place count 5998 transition count 5696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3195 places in 21 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5305 place count 5998 transition count 6126
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5406 place count 5897 transition count 5924
Deduced a syphon composed of 3094 places in 23 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5507 place count 5897 transition count 5924
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -427
Deduced a syphon composed of 3195 places in 20 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5608 place count 5897 transition count 6351
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5709 place count 5796 transition count 6149
Deduced a syphon composed of 3094 places in 23 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5810 place count 5796 transition count 6149
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -431
Deduced a syphon composed of 3195 places in 22 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5911 place count 5796 transition count 6580
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6012 place count 5695 transition count 6378
Deduced a syphon composed of 3094 places in 22 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6113 place count 5695 transition count 6378
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -403
Deduced a syphon composed of 3189 places in 15 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6208 place count 5695 transition count 6781
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 6303 place count 5600 transition count 6591
Deduced a syphon composed of 3094 places in 15 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6398 place count 5600 transition count 6591
Deduced a syphon composed of 3094 places in 13 ms
Applied a total of 6398 rules in 10370 ms. Remains 5600 /6701 variables (removed 1101) and now considering 6591/6001 (removed -590) transitions.
[2023-03-20 03:13:34] [INFO ] Redundant transitions in 453 ms returned []
// Phase 1: matrix 6591 rows 5600 cols
[2023-03-20 03:13:34] [INFO ] Computed 1101 place invariants in 188 ms
[2023-03-20 03:13:40] [INFO ] Dead Transitions using invariants and state equation in 6576 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5600/6701 places, 6591/6001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17415 ms. Remains : 5600/6701 places, 6591/6001 transitions.
Support contains 4 out of 6701 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Applied a total of 0 rules in 1141 ms. Remains 6701 /6701 variables (removed 0) and now considering 6001/6001 (removed 0) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-20 03:13:41] [INFO ] Computed 1101 place invariants in 43 ms
[2023-03-20 03:13:45] [INFO ] Implicit Places using invariants in 3195 ms returned []
[2023-03-20 03:13:45] [INFO ] Invariant cache hit.
[2023-03-20 03:13:48] [INFO ] Implicit Places using invariants and state equation in 3214 ms returned []
Implicit Place search using SMT with State Equation took 6424 ms to find 0 implicit places.
[2023-03-20 03:13:48] [INFO ] Invariant cache hit.
[2023-03-20 03:13:54] [INFO ] Dead Transitions using invariants and state equation in 5926 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13502 ms. Remains : 6701/6701 places, 6001/6001 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-11 finished in 281472 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 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6705 transition count 4607
Reduce places removed 1398 places and 0 transitions.
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2796 place count 5307 transition count 4607
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 798 Pre rules applied. Total rules applied 2796 place count 5307 transition count 3809
Deduced a syphon composed of 798 places in 12 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 2 with 1596 rules applied. Total rules applied 4392 place count 4509 transition count 3809
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 4396 place count 4505 transition count 3805
Iterating global reduction 2 with 4 rules applied. Total rules applied 4400 place count 4505 transition count 3805
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4400 place count 4505 transition count 3801
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4408 place count 4501 transition count 3801
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 4 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 2 with 3394 rules applied. Total rules applied 7802 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7803 place count 2804 transition count 2103
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 7805 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8007 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8209 place count 2601 transition count 2102
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8401 place count 2505 transition count 2102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8403 place count 2503 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8404 place count 2502 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8404 place count 2502 transition count 2098
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8408 place count 2500 transition count 2098
Applied a total of 8408 rules in 2214 ms. Remains 2500 /6706 variables (removed 4206) and now considering 2098/6006 (removed 3908) transitions.
// Phase 1: matrix 2098 rows 2500 cols
[2023-03-20 03:13:56] [INFO ] Computed 1100 place invariants in 4 ms
[2023-03-20 03:13:59] [INFO ] Implicit Places using invariants in 3093 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3110 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2498/6706 places, 2098/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2096
Applied a total of 4 rules in 211 ms. Remains 2496 /2498 variables (removed 2) and now considering 2096/2098 (removed 2) transitions.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-20 03:14:00] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-20 03:14:02] [INFO ] Implicit Places using invariants in 2642 ms returned []
[2023-03-20 03:14:02] [INFO ] Invariant cache hit.
[2023-03-20 03:14:08] [INFO ] Implicit Places using invariants and state equation in 5248 ms returned []
Implicit Place search using SMT with State Equation took 7902 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/6706 places, 2096/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13450 ms. Remains : 2496/6706 places, 2096/6006 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-12 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 s1697 0) (EQ s1893 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 1419 ms.
Product exploration explored 100000 steps with 0 reset in 1924 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 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 91 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 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 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 107313 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107313 steps, saw 81307 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:14:15] [INFO ] Invariant cache hit.
[2023-03-20 03:14:15] [INFO ] After 357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:14:15] [INFO ] [Nat]Absence check using 1098 positive place invariants in 232 ms returned sat
[2023-03-20 03:14:17] [INFO ] After 1300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:14:17] [INFO ] After 1413ms 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-20 03:14:17] [INFO ] After 2102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 90 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 108393 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108393 steps, saw 82089 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:14:20] [INFO ] Invariant cache hit.
[2023-03-20 03:14:21] [INFO ] After 474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:14:21] [INFO ] [Nat]Absence check using 1098 positive place invariants in 319 ms returned sat
[2023-03-20 03:14:23] [INFO ] After 1785ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:14:24] [INFO ] After 2016ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-20 03:14:24] [INFO ] After 2934ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 171 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 94 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2023-03-20 03:14:24] [INFO ] Invariant cache hit.
[2023-03-20 03:14:27] [INFO ] Implicit Places using invariants in 2485 ms returned []
[2023-03-20 03:14:27] [INFO ] Invariant cache hit.
[2023-03-20 03:14:32] [INFO ] Implicit Places using invariants and state equation in 5365 ms returned []
Implicit Place search using SMT with State Equation took 7867 ms to find 0 implicit places.
[2023-03-20 03:14:32] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-20 03:14:32] [INFO ] Invariant cache hit.
[2023-03-20 03:14:34] [INFO ] Dead Transitions using invariants and state equation in 2202 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10271 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Partial Free-agglomeration rule applied 593 times.
Drop transitions removed 593 transitions
Iterating global reduction 0 with 593 rules applied. Total rules applied 593 place count 2496 transition count 2096
Applied a total of 593 rules in 269 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-20 03:14:35] [INFO ] Computed 1098 place invariants in 3 ms
[2023-03-20 03:14:35] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:14:36] [INFO ] [Nat]Absence check using 1098 positive place invariants in 284 ms returned sat
[2023-03-20 03:14:37] [INFO ] After 1376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:14:37] [INFO ] After 1615ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-20 03:14:37] [INFO ] After 2454ms 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 233 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 128 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 121 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-20 03:14:38] [INFO ] Computed 1098 place invariants in 6 ms
[2023-03-20 03:14:41] [INFO ] Implicit Places using invariants in 2389 ms returned []
[2023-03-20 03:14:41] [INFO ] Invariant cache hit.
[2023-03-20 03:14:46] [INFO ] Implicit Places using invariants and state equation in 5776 ms returned []
Implicit Place search using SMT with State Equation took 8187 ms to find 0 implicit places.
[2023-03-20 03:14:46] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-20 03:14:46] [INFO ] Invariant cache hit.
[2023-03-20 03:14:49] [INFO ] Dead Transitions using invariants and state equation in 2151 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10591 ms. Remains : 2496/2496 places, 2096/2096 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 164 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 105 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 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 107366 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107366 steps, saw 81351 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:14:52] [INFO ] Invariant cache hit.
[2023-03-20 03:14:53] [INFO ] After 601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:14:53] [INFO ] [Nat]Absence check using 1098 positive place invariants in 220 ms returned sat
[2023-03-20 03:14:55] [INFO ] After 1240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:14:55] [INFO ] After 1416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-20 03:14:55] [INFO ] After 2162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 97 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 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 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 104343 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104343 steps, saw 78898 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:14:58] [INFO ] Invariant cache hit.
[2023-03-20 03:14:59] [INFO ] After 387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:15:00] [INFO ] [Nat]Absence check using 1098 positive place invariants in 258 ms returned sat
[2023-03-20 03:15:01] [INFO ] After 1232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:15:01] [INFO ] After 1443ms 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-20 03:15:01] [INFO ] After 2511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 104 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 88 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2023-03-20 03:15:02] [INFO ] Invariant cache hit.
[2023-03-20 03:15:04] [INFO ] Implicit Places using invariants in 2663 ms returned []
[2023-03-20 03:15:04] [INFO ] Invariant cache hit.
[2023-03-20 03:15:09] [INFO ] Implicit Places using invariants and state equation in 5163 ms returned []
Implicit Place search using SMT with State Equation took 7873 ms to find 0 implicit places.
[2023-03-20 03:15:09] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-20 03:15:09] [INFO ] Invariant cache hit.
[2023-03-20 03:15:11] [INFO ] Dead Transitions using invariants and state equation in 1920 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9965 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Partial Free-agglomeration rule applied 593 times.
Drop transitions removed 593 transitions
Iterating global reduction 0 with 593 rules applied. Total rules applied 593 place count 2496 transition count 2096
Applied a total of 593 rules in 289 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-20 03:15:12] [INFO ] Computed 1098 place invariants in 13 ms
[2023-03-20 03:15:12] [INFO ] After 565ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:15:13] [INFO ] [Nat]Absence check using 1098 positive place invariants in 230 ms returned sat
[2023-03-20 03:15:14] [INFO ] After 1528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:15:15] [INFO ] After 1727ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-20 03:15:15] [INFO ] After 2426ms 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 169 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 111 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1463 ms.
Product exploration explored 100000 steps with 0 reset in 1934 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 95 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-20 03:15:19] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-20 03:15:21] [INFO ] Implicit Places using invariants in 2237 ms returned []
[2023-03-20 03:15:21] [INFO ] Invariant cache hit.
[2023-03-20 03:15:26] [INFO ] Implicit Places using invariants and state equation in 5000 ms returned []
Implicit Place search using SMT with State Equation took 7241 ms to find 0 implicit places.
[2023-03-20 03:15:26] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-20 03:15:26] [INFO ] Invariant cache hit.
[2023-03-20 03:15:28] [INFO ] Dead Transitions using invariants and state equation in 1713 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9142 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-12 finished in 93885 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)) U p1)))'
Support contains 6 out of 6706 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 6703 transition count 6003
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 6703 transition count 6003
Applied a total of 6 rules in 2180 ms. Remains 6703 /6706 variables (removed 3) and now considering 6003/6006 (removed 3) transitions.
// Phase 1: matrix 6003 rows 6703 cols
[2023-03-20 03:15:30] [INFO ] Computed 1101 place invariants in 43 ms
[2023-03-20 03:15:33] [INFO ] Implicit Places using invariants in 2924 ms returned []
[2023-03-20 03:15:33] [INFO ] Invariant cache hit.
[2023-03-20 03:15:36] [INFO ] Implicit Places using invariants and state equation in 3092 ms returned []
Implicit Place search using SMT with State Equation took 6018 ms to find 0 implicit places.
[2023-03-20 03:15:36] [INFO ] Invariant cache hit.
[2023-03-20 03:15:43] [INFO ] Dead Transitions using invariants and state equation in 6711 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6703/6706 places, 6003/6006 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14911 ms. Remains : 6703/6706 places, 6003/6006 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s894 0) (EQ s3804 1)), p0:(OR (EQ s4938 0) (EQ s4337 1) (EQ s1878 0) (EQ s3048 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3371 ms.
Product exploration explored 100000 steps with 50000 reset in 3464 ms.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Computed a total of 1599 stabilizing places and 1599 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100B-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-14 finished in 22309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||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' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&X(p1)))&&G(p2)))'
Found a Shortening insensitive property : ShieldPPPt-PT-100B-LTLCardinality-11
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p2), (NOT p0), (NOT p1)]
Support contains 4 out of 6706 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6705 transition count 4608
Reduce places removed 1397 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2795 place count 5308 transition count 4607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2796 place count 5307 transition count 4607
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 797 Pre rules applied. Total rules applied 2796 place count 5307 transition count 3810
Deduced a syphon composed of 797 places in 10 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 3 with 1594 rules applied. Total rules applied 4390 place count 4510 transition count 3810
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 4394 place count 4506 transition count 3806
Iterating global reduction 3 with 4 rules applied. Total rules applied 4398 place count 4506 transition count 3806
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4398 place count 4506 transition count 3802
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 4406 place count 4502 transition count 3802
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 3 with 3390 rules applied. Total rules applied 7796 place count 2807 transition count 2107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7797 place count 2807 transition count 2106
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 7799 place count 2806 transition count 2105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8001 place count 2705 transition count 2105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8203 place count 2604 transition count 2105
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 6 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8397 place count 2507 transition count 2105
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 8398 place count 2507 transition count 2105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8400 place count 2505 transition count 2103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8401 place count 2504 transition count 2103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8401 place count 2504 transition count 2101
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8405 place count 2502 transition count 2101
Applied a total of 8405 rules in 2599 ms. Remains 2502 /6706 variables (removed 4204) and now considering 2101/6006 (removed 3905) transitions.
// Phase 1: matrix 2101 rows 2502 cols
[2023-03-20 03:15:54] [INFO ] Computed 1100 place invariants in 4 ms
[2023-03-20 03:15:56] [INFO ] Implicit Places using invariants in 2672 ms returned [2485, 2489]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2676 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2500/6706 places, 2101/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 2099
Applied a total of 4 rules in 204 ms. Remains 2498 /2500 variables (removed 2) and now considering 2099/2101 (removed 2) transitions.
// Phase 1: matrix 2099 rows 2498 cols
[2023-03-20 03:15:56] [INFO ] Computed 1098 place invariants in 3 ms
[2023-03-20 03:15:59] [INFO ] Implicit Places using invariants in 2129 ms returned []
[2023-03-20 03:15:59] [INFO ] Invariant cache hit.
[2023-03-20 03:16:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 03:16:03] [INFO ] Implicit Places using invariants and state equation in 4894 ms returned []
Implicit Place search using SMT with State Equation took 7047 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 2498/6706 places, 2099/6006 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 12526 ms. Remains : 2498/6706 places, 2099/6006 transitions.
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s678 0), p0:(OR (EQ s2448 0) (EQ s1549 1)), p1:(EQ s1500 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1411 ms.
Product exploration explored 100000 steps with 0 reset in 1937 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 p2 p0 (NOT p1)), (X p2), true, (X (X p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 686 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:16:08] [INFO ] Invariant cache hit.
[2023-03-20 03:16:08] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:16:09] [INFO ] [Nat]Absence check using 1098 positive place invariants in 290 ms returned sat
[2023-03-20 03:16:11] [INFO ] After 1235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:16:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 03:16:11] [INFO ] After 95ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 03:16:11] [INFO ] After 320ms 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-20 03:16:11] [INFO ] After 2552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 2498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2498 transition count 2098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2497 transition count 2098
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 2497 transition count 2096
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 2495 transition count 2096
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 2 with 2 rules applied. Total rules applied 8 place count 2494 transition count 2095
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 2494 transition count 2095
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 2493 transition count 2094
Applied a total of 12 rules in 429 ms. Remains 2493 /2498 variables (removed 5) and now considering 2094/2099 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 2493/2498 places, 2094/2099 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 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 105624 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105624 steps, saw 76004 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-20 03:16:15] [INFO ] Computed 1098 place invariants in 27 ms
[2023-03-20 03:16:15] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:16:16] [INFO ] [Nat]Absence check using 1098 positive place invariants in 227 ms returned sat
[2023-03-20 03:16:17] [INFO ] After 1741ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:16:18] [INFO ] After 1905ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-20 03:16:18] [INFO ] After 2625ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 65 ms.
Support contains 1 out of 2493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 101 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 94 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
[2023-03-20 03:16:18] [INFO ] Invariant cache hit.
[2023-03-20 03:16:20] [INFO ] Implicit Places using invariants in 2322 ms returned []
[2023-03-20 03:16:20] [INFO ] Invariant cache hit.
[2023-03-20 03:16:24] [INFO ] Implicit Places using invariants and state equation in 4005 ms returned []
Implicit Place search using SMT with State Equation took 6329 ms to find 0 implicit places.
[2023-03-20 03:16:24] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-20 03:16:24] [INFO ] Invariant cache hit.
[2023-03-20 03:16:27] [INFO ] Dead Transitions using invariants and state equation in 2070 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8581 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2493 transition count 2094
Applied a total of 596 rules in 243 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-20 03:16:27] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-20 03:16:27] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:16:28] [INFO ] [Nat]Absence check using 1098 positive place invariants in 218 ms returned sat
[2023-03-20 03:16:29] [INFO ] After 1191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:16:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 03:16:29] [INFO ] After 94ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 03:16:29] [INFO ] After 269ms 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-20 03:16:29] [INFO ] After 2158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), true, (X (X p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p1), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 715 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
// Phase 1: matrix 2099 rows 2498 cols
[2023-03-20 03:16:31] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-20 03:16:35] [INFO ] [Real]Absence check using 1098 positive place invariants in 1320 ms returned sat
[2023-03-20 03:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:16:46] [INFO ] [Real]Absence check using state equation in 10645 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 2498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Applied a total of 0 rules in 133 ms. Remains 2498 /2498 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
[2023-03-20 03:16:46] [INFO ] Invariant cache hit.
[2023-03-20 03:16:48] [INFO ] Implicit Places using invariants in 2455 ms returned []
[2023-03-20 03:16:48] [INFO ] Invariant cache hit.
[2023-03-20 03:16:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 03:16:54] [INFO ] Implicit Places using invariants and state equation in 5490 ms returned []
Implicit Place search using SMT with State Equation took 7979 ms to find 0 implicit places.
[2023-03-20 03:16:54] [INFO ] Invariant cache hit.
[2023-03-20 03:16:56] [INFO ] Dead Transitions using invariants and state equation in 1943 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10056 ms. Remains : 2498/2498 places, 2099/2099 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 p2 p0 (NOT p1)), (X p2), true, (X (X p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 540 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 4) seen :3
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
Running SMT prover for 1 properties.
[2023-03-20 03:16:57] [INFO ] Invariant cache hit.
[2023-03-20 03:16:57] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:16:58] [INFO ] [Nat]Absence check using 1098 positive place invariants in 291 ms returned sat
[2023-03-20 03:16:59] [INFO ] After 1479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:16:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 03:17:00] [INFO ] After 89ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 03:17:00] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-20 03:17:00] [INFO ] After 2430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 2498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2498 transition count 2098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2497 transition count 2098
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 2497 transition count 2096
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 2495 transition count 2096
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 2 with 2 rules applied. Total rules applied 8 place count 2494 transition count 2095
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 2494 transition count 2095
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 2493 transition count 2094
Applied a total of 12 rules in 359 ms. Remains 2493 /2498 variables (removed 5) and now considering 2094/2099 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 359 ms. Remains : 2493/2498 places, 2094/2099 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) 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 107269 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107269 steps, saw 77344 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-20 03:17:03] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-20 03:17:04] [INFO ] After 391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:17:05] [INFO ] [Nat]Absence check using 1098 positive place invariants in 532 ms returned sat
[2023-03-20 03:17:06] [INFO ] After 1457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:17:06] [INFO ] After 1571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-20 03:17:06] [INFO ] After 2504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 2493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 127 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 109 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
[2023-03-20 03:17:07] [INFO ] Invariant cache hit.
[2023-03-20 03:17:08] [INFO ] Implicit Places using invariants in 1740 ms returned []
[2023-03-20 03:17:08] [INFO ] Invariant cache hit.
[2023-03-20 03:17:16] [INFO ] Implicit Places using invariants and state equation in 7756 ms returned []
Implicit Place search using SMT with State Equation took 9501 ms to find 0 implicit places.
[2023-03-20 03:17:16] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-20 03:17:16] [INFO ] Invariant cache hit.
[2023-03-20 03:17:18] [INFO ] Dead Transitions using invariants and state equation in 2025 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11742 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2493 transition count 2094
Applied a total of 596 rules in 227 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-20 03:17:18] [INFO ] Computed 1098 place invariants in 20 ms
[2023-03-20 03:17:19] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:17:20] [INFO ] [Nat]Absence check using 1098 positive place invariants in 520 ms returned sat
[2023-03-20 03:17:21] [INFO ] After 1602ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:17:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 03:17:21] [INFO ] After 98ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 03:17:22] [INFO ] After 229ms 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-20 03:17:22] [INFO ] After 2812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), true, (X (X p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p1), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 609 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
// Phase 1: matrix 2099 rows 2498 cols
[2023-03-20 03:17:23] [INFO ] Computed 1098 place invariants in 3 ms
[2023-03-20 03:17:30] [INFO ] [Real]Absence check using 1098 positive place invariants in 1792 ms returned sat
[2023-03-20 03:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:17:38] [INFO ] [Real]Absence check using state equation in 7397 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 3 reset in 1478 ms.
Product exploration explored 100000 steps with 0 reset in 1877 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Support contains 4 out of 2498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Applied a total of 0 rules in 88 ms. Remains 2498 /2498 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
[2023-03-20 03:17:42] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-20 03:17:42] [INFO ] Invariant cache hit.
[2023-03-20 03:17:44] [INFO ] Dead Transitions using invariants and state equation in 1747 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1897 ms. Remains : 2498/2498 places, 2099/2099 transitions.
Support contains 4 out of 2498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Applied a total of 0 rules in 80 ms. Remains 2498 /2498 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
[2023-03-20 03:17:44] [INFO ] Invariant cache hit.
[2023-03-20 03:17:46] [INFO ] Implicit Places using invariants in 2559 ms returned []
[2023-03-20 03:17:46] [INFO ] Invariant cache hit.
[2023-03-20 03:17:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 03:17:51] [INFO ] Implicit Places using invariants and state equation in 4827 ms returned []
Implicit Place search using SMT with State Equation took 7412 ms to find 0 implicit places.
[2023-03-20 03:17:51] [INFO ] Invariant cache hit.
[2023-03-20 03:17:53] [INFO ] Dead Transitions using invariants and state equation in 2409 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9913 ms. Remains : 2498/2498 places, 2099/2099 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-11 finished in 123121 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)))'
[2023-03-20 03:17:54] [INFO ] Flatten gal took : 163 ms
[2023-03-20 03:17:54] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 03:17:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6706 places, 6006 transitions and 15612 arcs took 31 ms.
Total runtime 861673 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-100B
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLCardinality
FORMULA ShieldPPPt-PT-100B-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-100B-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679282347684
--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 19 (type EXCL) for 6 ShieldPPPt-PT-100B-LTLCardinality-11
lola: time limit : 717 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 17 (type FNDP) for 6 ShieldPPPt-PT-100B-LTLCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 18 (type EQUN) for 6 ShieldPPPt-PT-100B-LTLCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type SRCH) for 6 ShieldPPPt-PT-100B-LTLCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 20 (type SRCH) for ShieldPPPt-PT-100B-LTLCardinality-11
lola: result : unknown
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 19 (type EXCL) for ShieldPPPt-PT-100B-LTLCardinality-11
lola: result : true
lola: markings : 220
lola: fired transitions : 219
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 17 (type FNDP) for ShieldPPPt-PT-100B-LTLCardinality-11 (obsolete)
lola: CANCELED task # 18 (type EQUN) for ShieldPPPt-PT-100B-LTLCardinality-11 (obsolete)
lola: LAUNCH task # 14 (type EXCL) for 13 ShieldPPPt-PT-100B-LTLCardinality-12
lola: time limit : 1196 sec
lola: memory limit: 32 pages
lola: FINISHED task # 17 (type FNDP) for ShieldPPPt-PT-100B-LTLCardinality-11
lola: result : true
lola: fired transitions : 218
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/376/LTLCardinality-18.sara.
sara: place or transition ordering is non-deterministic
lola: planning for (null) stopped (result already fixed).
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLCardinality-11: CONJ false state space
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 2/1196 2/32 ShieldPPPt-PT-100B-LTLCardinality-12 62479 m, 12495 m/sec, 73352 t fired, .
Time elapsed: 13 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 4
lola: FINISHED task # 14 (type EXCL) for ShieldPPPt-PT-100B-LTLCardinality-12
lola: result : false
lola: markings : 160292
lola: fired transitions : 188507
lola: time used : 5.000000
lola: memory pages used : 4
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldPPPt-PT-100B-LTLCardinality-09
lola: time limit : 1792 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLCardinality-11: CONJ false state space
ShieldPPPt-PT-100B-LTLCardinality-12: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 2/1792 3/32 ShieldPPPt-PT-100B-LTLCardinality-09 116243 m, 23248 m/sec, 139171 t fired, .
Time elapsed: 18 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 4
lola: FINISHED task # 18 (type EQUN) for ShieldPPPt-PT-100B-LTLCardinality-11
lola: result : unknown
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLCardinality-11: CONJ false state space
ShieldPPPt-PT-100B-LTLCardinality-12: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 7/1792 9/32 ShieldPPPt-PT-100B-LTLCardinality-09 349751 m, 46701 m/sec, 439131 t fired, .
Time elapsed: 23 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLCardinality-11: CONJ false state space
ShieldPPPt-PT-100B-LTLCardinality-12: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 12/1792 16/32 ShieldPPPt-PT-100B-LTLCardinality-09 605623 m, 51174 m/sec, 788699 t fired, .
Time elapsed: 28 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLCardinality-11: CONJ false state space
ShieldPPPt-PT-100B-LTLCardinality-12: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 17/1792 24/32 ShieldPPPt-PT-100B-LTLCardinality-09 859306 m, 50736 m/sec, 1140261 t fired, .
Time elapsed: 33 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLCardinality-11: CONJ false state space
ShieldPPPt-PT-100B-LTLCardinality-12: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 22/1792 30/32 ShieldPPPt-PT-100B-LTLCardinality-09 1085203 m, 45179 m/sec, 1473086 t fired, .
Time elapsed: 38 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 4 (type EXCL) for ShieldPPPt-PT-100B-LTLCardinality-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLCardinality-11: CONJ false state space
ShieldPPPt-PT-100B-LTLCardinality-12: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 43 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldPPPt-PT-100B-LTLCardinality-00
lola: time limit : 3557 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLCardinality-11: CONJ false state space
ShieldPPPt-PT-100B-LTLCardinality-12: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-100B-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3557 5/32 ShieldPPPt-PT-100B-LTLCardinality-00 188765 m, 37753 m/sec, 224985 t fired, .
Time elapsed: 48 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLCardinality-11: CONJ false state space
ShieldPPPt-PT-100B-LTLCardinality-12: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-100B-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3557 12/32 ShieldPPPt-PT-100B-LTLCardinality-00 438497 m, 49946 m/sec, 566716 t fired, .
Time elapsed: 53 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLCardinality-11: CONJ false state space
ShieldPPPt-PT-100B-LTLCardinality-12: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-100B-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3557 19/32 ShieldPPPt-PT-100B-LTLCardinality-00 698446 m, 51989 m/sec, 922379 t fired, .
Time elapsed: 58 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLCardinality-11: CONJ false state space
ShieldPPPt-PT-100B-LTLCardinality-12: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-100B-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3557 26/32 ShieldPPPt-PT-100B-LTLCardinality-00 939608 m, 48232 m/sec, 1271734 t fired, .
Time elapsed: 63 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLCardinality-11: CONJ false state space
ShieldPPPt-PT-100B-LTLCardinality-12: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-100B-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3557 32/32 ShieldPPPt-PT-100B-LTLCardinality-00 1170160 m, 46110 m/sec, 1596459 t fired, .
Time elapsed: 68 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for ShieldPPPt-PT-100B-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLCardinality-11: CONJ false state space
ShieldPPPt-PT-100B-LTLCardinality-12: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 73 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLCardinality-00: LTL unknown AGGR
ShieldPPPt-PT-100B-LTLCardinality-09: LTL unknown AGGR
ShieldPPPt-PT-100B-LTLCardinality-11: CONJ false state space
ShieldPPPt-PT-100B-LTLCardinality-12: LTL false LTL model checker
Time elapsed: 73 secs. Pages in use: 32
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="ShieldPPPt-PT-100B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldPPPt-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 r391-oct2-167903715600699"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100B.tgz
mv ShieldPPPt-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 '
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 ;