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-167903715200348.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 ShieldIIPt-PT-100B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715200348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.5K Feb 25 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679274169094

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:02:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 01:02:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:02:52] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2023-03-20 01:02:52] [INFO ] Transformed 7003 places.
[2023-03-20 01:02:52] [INFO ] Transformed 6503 transitions.
[2023-03-20 01:02:52] [INFO ] Found NUPN structural information;
[2023-03-20 01:02:52] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 832 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-100B-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 7003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Discarding 1091 places :
Symmetric choice reduction at 0 with 1091 rule applications. Total rules 1091 place count 5912 transition count 5412
Iterating global reduction 0 with 1091 rules applied. Total rules applied 2182 place count 5912 transition count 5412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2183 place count 5911 transition count 5411
Iterating global reduction 0 with 1 rules applied. Total rules applied 2184 place count 5911 transition count 5411
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2185 place count 5910 transition count 5410
Iterating global reduction 0 with 1 rules applied. Total rules applied 2186 place count 5910 transition count 5410
Applied a total of 2186 rules in 4898 ms. Remains 5910 /7003 variables (removed 1093) and now considering 5410/6503 (removed 1093) transitions.
// Phase 1: matrix 5410 rows 5910 cols
[2023-03-20 01:02:58] [INFO ] Computed 901 place invariants in 123 ms
[2023-03-20 01:03:01] [INFO ] Implicit Places using invariants in 3570 ms returned []
[2023-03-20 01:03:01] [INFO ] Invariant cache hit.
[2023-03-20 01:03:04] [INFO ] Implicit Places using invariants and state equation in 2837 ms returned []
Implicit Place search using SMT with State Equation took 6476 ms to find 0 implicit places.
[2023-03-20 01:03:04] [INFO ] Invariant cache hit.
[2023-03-20 01:03:10] [INFO ] Dead Transitions using invariants and state equation in 5659 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5910/7003 places, 5410/6503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17036 ms. Remains : 5910/7003 places, 5410/6503 transitions.
Support contains 43 out of 5910 places after structural reductions.
[2023-03-20 01:03:11] [INFO ] Flatten gal took : 394 ms
[2023-03-20 01:03:11] [INFO ] Flatten gal took : 240 ms
[2023-03-20 01:03:11] [INFO ] Input system was already deterministic with 5410 transitions.
Support contains 42 out of 5910 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 662 ms. (steps per millisecond=15 ) properties (out of 28) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-20 01:03:12] [INFO ] Invariant cache hit.
[2023-03-20 01:03:16] [INFO ] [Real]Absence check using 901 positive place invariants in 977 ms returned sat
[2023-03-20 01:03:17] [INFO ] After 4873ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-20 01:03:21] [INFO ] [Nat]Absence check using 901 positive place invariants in 1057 ms returned sat
[2023-03-20 01:03:32] [INFO ] After 8966ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-20 01:03:34] [INFO ] Deduced a trap composed of 30 places in 2029 ms of which 14 ms to minimize.
[2023-03-20 01:03:37] [INFO ] Deduced a trap composed of 17 places in 2152 ms of which 23 ms to minimize.
[2023-03-20 01:03:39] [INFO ] Deduced a trap composed of 18 places in 2344 ms of which 7 ms to minimize.
[2023-03-20 01:03:42] [INFO ] Deduced a trap composed of 17 places in 2472 ms of which 19 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 01:03:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:03:42] [INFO ] After 25110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:18
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 7354 ms.
Support contains 29 out of 5910 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Drop transitions removed 1189 transitions
Trivial Post-agglo rules discarded 1189 transitions
Performed 1189 trivial Post agglomeration. Transition count delta: 1189
Iterating post reduction 0 with 1189 rules applied. Total rules applied 1189 place count 5910 transition count 4221
Reduce places removed 1189 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1191 rules applied. Total rules applied 2380 place count 4721 transition count 4219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2382 place count 4719 transition count 4219
Performed 794 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 794 Pre rules applied. Total rules applied 2382 place count 4719 transition count 3425
Deduced a syphon composed of 794 places in 13 ms
Reduce places removed 794 places and 0 transitions.
Iterating global reduction 3 with 1588 rules applied. Total rules applied 3970 place count 3925 transition count 3425
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 3972 place count 3923 transition count 3423
Iterating global reduction 3 with 2 rules applied. Total rules applied 3974 place count 3923 transition count 3423
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 3974 place count 3923 transition count 3421
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 3978 place count 3921 transition count 3421
Performed 1690 Post agglomeration using F-continuation condition.Transition count delta: 1690
Deduced a syphon composed of 1690 places in 6 ms
Reduce places removed 1690 places and 0 transitions.
Iterating global reduction 3 with 3380 rules applied. Total rules applied 7358 place count 2231 transition count 1731
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7359 place count 2231 transition count 1730
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7361 place count 2230 transition count 1729
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7563 place count 2129 transition count 1795
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7765 place count 2028 transition count 1862
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 94 places in 5 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 7953 place count 1934 transition count 1922
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7954 place count 1934 transition count 1921
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 7956 place count 1934 transition count 1919
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 7958 place count 1932 transition count 1919
Partial Free-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 6 with 98 rules applied. Total rules applied 8056 place count 1932 transition count 1919
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 8057 place count 1931 transition count 1918
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 8059 place count 1929 transition count 1918
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 8059 place count 1929 transition count 1917
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 8061 place count 1928 transition count 1917
Applied a total of 8061 rules in 2321 ms. Remains 1928 /5910 variables (removed 3982) and now considering 1917/5410 (removed 3493) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2322 ms. Remains : 1928/5910 places, 1917/5410 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 1917 rows 1928 cols
[2023-03-20 01:03:53] [INFO ] Computed 899 place invariants in 5 ms
[2023-03-20 01:03:54] [INFO ] [Real]Absence check using 899 positive place invariants in 335 ms returned sat
[2023-03-20 01:03:54] [INFO ] After 1381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-20 01:03:55] [INFO ] [Nat]Absence check using 899 positive place invariants in 239 ms returned sat
[2023-03-20 01:03:59] [INFO ] After 2559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-20 01:03:59] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-20 01:04:00] [INFO ] After 1564ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-20 01:04:00] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 15 ms to minimize.
[2023-03-20 01:04:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2023-03-20 01:04:03] [INFO ] After 4670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 1572 ms.
[2023-03-20 01:04:05] [INFO ] After 10643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 1192 ms.
Support contains 27 out of 1928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1928/1928 places, 1917/1917 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 1926 transition count 1915
Applied a total of 4 rules in 115 ms. Remains 1926 /1928 variables (removed 2) and now considering 1915/1917 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 1926/1928 places, 1915/1917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 49729 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 49729 steps, saw 31543 distinct states, run finished after 3004 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 1915 rows 1926 cols
[2023-03-20 01:04:10] [INFO ] Computed 899 place invariants in 4 ms
[2023-03-20 01:04:11] [INFO ] [Real]Absence check using 899 positive place invariants in 218 ms returned sat
[2023-03-20 01:04:11] [INFO ] After 1209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-20 01:04:12] [INFO ] [Nat]Absence check using 899 positive place invariants in 246 ms returned sat
[2023-03-20 01:04:15] [INFO ] After 2446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-20 01:04:16] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-20 01:04:17] [INFO ] After 1597ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-20 01:04:20] [INFO ] After 4500ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 1673 ms.
[2023-03-20 01:04:22] [INFO ] After 10629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 1199 ms.
Support contains 27 out of 1926 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1926/1926 places, 1915/1915 transitions.
Applied a total of 0 rules in 63 ms. Remains 1926 /1926 variables (removed 0) and now considering 1915/1915 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1926/1926 places, 1915/1915 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1926/1926 places, 1915/1915 transitions.
Applied a total of 0 rules in 61 ms. Remains 1926 /1926 variables (removed 0) and now considering 1915/1915 (removed 0) transitions.
[2023-03-20 01:04:23] [INFO ] Invariant cache hit.
[2023-03-20 01:04:25] [INFO ] Implicit Places using invariants in 1670 ms returned [1915]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1678 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1925/1926 places, 1915/1915 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1924 transition count 1914
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1924 transition count 1914
Applied a total of 2 rules in 133 ms. Remains 1924 /1925 variables (removed 1) and now considering 1914/1915 (removed 1) transitions.
// Phase 1: matrix 1914 rows 1924 cols
[2023-03-20 01:04:25] [INFO ] Computed 898 place invariants in 9 ms
[2023-03-20 01:04:26] [INFO ] Implicit Places using invariants in 1653 ms returned []
[2023-03-20 01:04:27] [INFO ] Invariant cache hit.
[2023-03-20 01:04:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-20 01:04:31] [INFO ] Implicit Places using invariants and state equation in 4234 ms returned []
Implicit Place search using SMT with State Equation took 5920 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1924/1926 places, 1914/1915 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7792 ms. Remains : 1924/1926 places, 1914/1915 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 50867 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 50867 steps, saw 32441 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 16 properties.
[2023-03-20 01:04:34] [INFO ] Invariant cache hit.
[2023-03-20 01:04:36] [INFO ] [Real]Absence check using 898 positive place invariants in 277 ms returned sat
[2023-03-20 01:04:36] [INFO ] After 1442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-20 01:04:37] [INFO ] [Nat]Absence check using 898 positive place invariants in 331 ms returned sat
[2023-03-20 01:04:40] [INFO ] After 2521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-20 01:04:40] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-20 01:04:42] [INFO ] After 1685ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-20 01:04:42] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2023-03-20 01:04:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-20 01:04:45] [INFO ] After 4663ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 1680 ms.
[2023-03-20 01:04:47] [INFO ] After 10939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 1348 ms.
Support contains 27 out of 1924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1924/1924 places, 1914/1914 transitions.
Applied a total of 0 rules in 56 ms. Remains 1924 /1924 variables (removed 0) and now considering 1914/1914 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1924/1924 places, 1914/1914 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1924/1924 places, 1914/1914 transitions.
Applied a total of 0 rules in 54 ms. Remains 1924 /1924 variables (removed 0) and now considering 1914/1914 (removed 0) transitions.
[2023-03-20 01:04:48] [INFO ] Invariant cache hit.
[2023-03-20 01:04:50] [INFO ] Implicit Places using invariants in 1470 ms returned []
[2023-03-20 01:04:50] [INFO ] Invariant cache hit.
[2023-03-20 01:04:52] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-20 01:04:54] [INFO ] Implicit Places using invariants and state equation in 3767 ms returned []
Implicit Place search using SMT with State Equation took 5253 ms to find 0 implicit places.
[2023-03-20 01:04:54] [INFO ] Redundant transitions in 138 ms returned []
[2023-03-20 01:04:54] [INFO ] Invariant cache hit.
[2023-03-20 01:04:55] [INFO ] Dead Transitions using invariants and state equation in 1247 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6712 ms. Remains : 1924/1924 places, 1914/1914 transitions.
Computed a total of 1600 stabilizing places and 1600 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p1)||p0))))'
Support contains 4 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 5902 transition count 5402
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 5902 transition count 5402
Applied a total of 16 rules in 1863 ms. Remains 5902 /5910 variables (removed 8) and now considering 5402/5410 (removed 8) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-20 01:04:57] [INFO ] Computed 901 place invariants in 23 ms
[2023-03-20 01:04:59] [INFO ] Implicit Places using invariants in 2160 ms returned []
[2023-03-20 01:04:59] [INFO ] Invariant cache hit.
[2023-03-20 01:05:02] [INFO ] Implicit Places using invariants and state equation in 2564 ms returned []
Implicit Place search using SMT with State Equation took 4756 ms to find 0 implicit places.
[2023-03-20 01:05:02] [INFO ] Invariant cache hit.
[2023-03-20 01:05:08] [INFO ] Dead Transitions using invariants and state equation in 5690 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5910 places, 5402/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12330 ms. Remains : 5902/5910 places, 5402/5410 transitions.
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s1263 1) (AND (EQ s4767 1) (EQ s4792 1) (EQ s4801 1))), p1:(AND (EQ s4767 1) (EQ s4792 1) (EQ s4801 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 1885 ms.
Stack based approach found an accepted trace after 2570 steps with 0 reset with depth 2571 and stack size 2571 in 38 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-00 finished in 14720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(!p1&&X(F(!p1)))||G(F(!p1)))))'
Support contains 4 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 5901 transition count 5401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 5901 transition count 5401
Applied a total of 18 rules in 1792 ms. Remains 5901 /5910 variables (removed 9) and now considering 5401/5410 (removed 9) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2023-03-20 01:05:12] [INFO ] Computed 901 place invariants in 40 ms
[2023-03-20 01:05:15] [INFO ] Implicit Places using invariants in 2754 ms returned []
[2023-03-20 01:05:15] [INFO ] Invariant cache hit.
[2023-03-20 01:05:17] [INFO ] Implicit Places using invariants and state equation in 2274 ms returned []
Implicit Place search using SMT with State Equation took 5041 ms to find 0 implicit places.
[2023-03-20 01:05:17] [INFO ] Invariant cache hit.
[2023-03-20 01:05:22] [INFO ] Dead Transitions using invariants and state equation in 5068 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5910 places, 5401/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11909 ms. Remains : 5901/5910 places, 5401/5410 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s3842 1) (EQ s3891 1)), p1:(AND (EQ s234 1) (EQ s236 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 4365 ms.
Product exploration explored 100000 steps with 50000 reset in 4413 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100B-LTLFireability-01 finished in 21100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 5902 transition count 5402
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 5902 transition count 5402
Applied a total of 16 rules in 1845 ms. Remains 5902 /5910 variables (removed 8) and now considering 5402/5410 (removed 8) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-20 01:05:33] [INFO ] Computed 901 place invariants in 42 ms
[2023-03-20 01:05:35] [INFO ] Implicit Places using invariants in 2199 ms returned []
[2023-03-20 01:05:35] [INFO ] Invariant cache hit.
[2023-03-20 01:05:37] [INFO ] Implicit Places using invariants and state equation in 1898 ms returned []
Implicit Place search using SMT with State Equation took 4101 ms to find 0 implicit places.
[2023-03-20 01:05:37] [INFO ] Invariant cache hit.
[2023-03-20 01:05:38] [INFO ] Dead Transitions using invariants and state equation in 911 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5910 places, 5402/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6859 ms. Remains : 5902/5910 places, 5402/5410 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2066 0) (OR (EQ s1806 0) (EQ s1887 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 4408 ms.
Product exploration explored 100000 steps with 50000 reset in 4470 ms.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Computed a total of 1599 stabilizing places and 1599 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100B-LTLFireability-02 finished in 16223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 5910 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5909 transition count 4210
Reduce places removed 1199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2399 place count 4710 transition count 4209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2400 place count 4709 transition count 4209
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 796 Pre rules applied. Total rules applied 2400 place count 4709 transition count 3413
Deduced a syphon composed of 796 places in 9 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 3 with 1592 rules applied. Total rules applied 3992 place count 3913 transition count 3413
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 3999 place count 3906 transition count 3406
Iterating global reduction 3 with 7 rules applied. Total rules applied 4006 place count 3906 transition count 3406
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 4006 place count 3906 transition count 3400
Deduced a syphon composed of 6 places in 11 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 4018 place count 3900 transition count 3400
Performed 1696 Post agglomeration using F-continuation condition.Transition count delta: 1696
Deduced a syphon composed of 1696 places in 4 ms
Reduce places removed 1696 places and 0 transitions.
Iterating global reduction 3 with 3392 rules applied. Total rules applied 7410 place count 2204 transition count 1704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7411 place count 2204 transition count 1703
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7413 place count 2203 transition count 1702
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7615 place count 2102 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7817 place count 2001 transition count 1836
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8011 place count 1904 transition count 1901
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8013 place count 1902 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8015 place count 1900 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8015 place count 1900 transition count 1898
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8017 place count 1899 transition count 1898
Applied a total of 8017 rules in 1764 ms. Remains 1899 /5910 variables (removed 4011) and now considering 1898/5410 (removed 3512) transitions.
// Phase 1: matrix 1898 rows 1899 cols
[2023-03-20 01:05:49] [INFO ] Computed 899 place invariants in 10 ms
[2023-03-20 01:05:51] [INFO ] Implicit Places using invariants in 1905 ms returned [1888]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1919 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1898/5910 places, 1898/5410 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1897 transition count 1897
Applied a total of 2 rules in 128 ms. Remains 1897 /1898 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1897 cols
[2023-03-20 01:05:51] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:05:53] [INFO ] Implicit Places using invariants in 1372 ms returned []
[2023-03-20 01:05:53] [INFO ] Invariant cache hit.
[2023-03-20 01:05:54] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 01:05:56] [INFO ] Implicit Places using invariants and state equation in 3508 ms returned []
Implicit Place search using SMT with State Equation took 4894 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/5910 places, 1897/5410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8718 ms. Remains : 1897/5910 places, 1897/5410 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s911 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-03 finished in 8822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(p0) U p1)&&p2))))'
Support contains 3 out of 5910 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1200 rules applied. Total rules applied 1200 place count 5909 transition count 4209
Reduce places removed 1200 places and 0 transitions.
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2400 place count 4709 transition count 4209
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 795 Pre rules applied. Total rules applied 2400 place count 4709 transition count 3414
Deduced a syphon composed of 795 places in 11 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 2 with 1590 rules applied. Total rules applied 3990 place count 3914 transition count 3414
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 3995 place count 3909 transition count 3409
Iterating global reduction 2 with 5 rules applied. Total rules applied 4000 place count 3909 transition count 3409
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4000 place count 3909 transition count 3405
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4008 place count 3905 transition count 3405
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7404 place count 2207 transition count 1707
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7405 place count 2207 transition count 1706
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7407 place count 2206 transition count 1705
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7609 place count 2105 transition count 1771
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7811 place count 2004 transition count 1839
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 8 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8005 place count 1907 transition count 1904
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8007 place count 1905 transition count 1902
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8008 place count 1904 transition count 1902
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8008 place count 1904 transition count 1901
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8010 place count 1903 transition count 1901
Applied a total of 8010 rules in 1945 ms. Remains 1903 /5910 variables (removed 4007) and now considering 1901/5410 (removed 3509) transitions.
// Phase 1: matrix 1901 rows 1903 cols
[2023-03-20 01:05:58] [INFO ] Computed 900 place invariants in 7 ms
[2023-03-20 01:06:00] [INFO ] Implicit Places using invariants in 1794 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1796 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1902/5910 places, 1901/5410 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1901 transition count 1900
Applied a total of 2 rules in 154 ms. Remains 1901 /1902 variables (removed 1) and now considering 1900/1901 (removed 1) transitions.
// Phase 1: matrix 1900 rows 1901 cols
[2023-03-20 01:06:00] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-20 01:06:02] [INFO ] Implicit Places using invariants in 1518 ms returned []
[2023-03-20 01:06:02] [INFO ] Invariant cache hit.
[2023-03-20 01:06:04] [INFO ] Implicit Places using invariants and state equation in 2881 ms returned []
Implicit Place search using SMT with State Equation took 4421 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1901/5910 places, 1900/5410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8316 ms. Remains : 1901/5910 places, 1900/5410 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s1892 1), p1:(EQ s1176 1), p0:(EQ s1686 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1493 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-04 finished in 10081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 5901 transition count 5401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 5901 transition count 5401
Applied a total of 18 rules in 1900 ms. Remains 5901 /5910 variables (removed 9) and now considering 5401/5410 (removed 9) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2023-03-20 01:06:08] [INFO ] Computed 901 place invariants in 40 ms
[2023-03-20 01:06:11] [INFO ] Implicit Places using invariants in 2774 ms returned []
[2023-03-20 01:06:11] [INFO ] Invariant cache hit.
[2023-03-20 01:06:15] [INFO ] Implicit Places using invariants and state equation in 4186 ms returned []
Implicit Place search using SMT with State Equation took 6979 ms to find 0 implicit places.
[2023-03-20 01:06:15] [INFO ] Invariant cache hit.
[2023-03-20 01:06:21] [INFO ] Dead Transitions using invariants and state equation in 5732 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5910 places, 5401/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14620 ms. Remains : 5901/5910 places, 5401/5410 transitions.
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s362 1) (NEQ s411 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1588 ms.
Product exploration explored 100000 steps with 0 reset in 1980 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 217286 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217286 steps, saw 208870 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:06:29] [INFO ] Invariant cache hit.
[2023-03-20 01:06:31] [INFO ] [Real]Absence check using 901 positive place invariants in 1876 ms returned sat
[2023-03-20 01:06:37] [INFO ] After 7856ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:06:38] [INFO ] [Nat]Absence check using 901 positive place invariants in 1024 ms returned sat
[2023-03-20 01:06:44] [INFO ] After 5556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:06:48] [INFO ] Deduced a trap composed of 27 places in 3384 ms of which 2 ms to minimize.
[2023-03-20 01:06:52] [INFO ] Deduced a trap composed of 17 places in 3909 ms of which 4 ms to minimize.
[2023-03-20 01:06:56] [INFO ] Deduced a trap composed of 22 places in 4191 ms of which 7 ms to minimize.
[2023-03-20 01:06:59] [INFO ] Deduced a trap composed of 23 places in 3008 ms of which 4 ms to minimize.
[2023-03-20 01:07:03] [INFO ] Deduced a trap composed of 22 places in 3832 ms of which 21 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 01:07:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:07:03] [INFO ] After 26834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 121 ms.
Support contains 2 out of 5901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5901/5901 places, 5401/5401 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5901 transition count 4203
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4703 transition count 4203
Performed 801 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 801 Pre rules applied. Total rules applied 2396 place count 4703 transition count 3402
Deduced a syphon composed of 801 places in 10 ms
Reduce places removed 801 places and 0 transitions.
Iterating global reduction 2 with 1602 rules applied. Total rules applied 3998 place count 3902 transition count 3402
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7394 place count 2204 transition count 1704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7395 place count 2204 transition count 1703
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7397 place count 2203 transition count 1702
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7599 place count 2102 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7801 place count 2001 transition count 1836
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 7995 place count 1904 transition count 1901
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7996 place count 1904 transition count 1900
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 8096 place count 1904 transition count 1900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8097 place count 1903 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8099 place count 1901 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8099 place count 1901 transition count 1898
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8101 place count 1900 transition count 1898
Applied a total of 8101 rules in 1574 ms. Remains 1900 /5901 variables (removed 4001) and now considering 1898/5401 (removed 3503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1574 ms. Remains : 1900/5901 places, 1898/5401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) 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 98959 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98959 steps, saw 63048 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1898 rows 1900 cols
[2023-03-20 01:07:08] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-20 01:07:10] [INFO ] [Real]Absence check using 899 positive place invariants in 796 ms returned sat
[2023-03-20 01:07:11] [INFO ] After 3052ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:07:12] [INFO ] [Nat]Absence check using 899 positive place invariants in 250 ms returned sat
[2023-03-20 01:07:13] [INFO ] After 1106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:07:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 01:07:13] [INFO ] After 94ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:07:13] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-20 01:07:14] [INFO ] After 2093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 62 ms.
Support contains 2 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1898/1898 transitions.
Applied a total of 0 rules in 59 ms. Remains 1900 /1900 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 1900/1900 places, 1898/1898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1898/1898 transitions.
Applied a total of 0 rules in 57 ms. Remains 1900 /1900 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2023-03-20 01:07:14] [INFO ] Invariant cache hit.
[2023-03-20 01:07:15] [INFO ] Implicit Places using invariants in 1619 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1635 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1900 places, 1898/1898 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1898 transition count 1897
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1897
Applied a total of 2 rules in 145 ms. Remains 1898 /1899 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-20 01:07:15] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:07:17] [INFO ] Implicit Places using invariants in 1524 ms returned []
[2023-03-20 01:07:17] [INFO ] Invariant cache hit.
[2023-03-20 01:07:20] [INFO ] Implicit Places using invariants and state equation in 3480 ms returned []
Implicit Place search using SMT with State Equation took 5009 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1898/1900 places, 1897/1898 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6846 ms. Remains : 1898/1900 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 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 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 97367 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97367 steps, saw 61561 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:07:24] [INFO ] Invariant cache hit.
[2023-03-20 01:07:24] [INFO ] [Real]Absence check using 898 positive place invariants in 190 ms returned sat
[2023-03-20 01:07:26] [INFO ] After 1836ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:07:26] [INFO ] [Nat]Absence check using 898 positive place invariants in 189 ms returned sat
[2023-03-20 01:07:27] [INFO ] After 1047ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:07:27] [INFO ] After 1159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-20 01:07:27] [INFO ] After 1711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 68 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 65 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-20 01:07:27] [INFO ] Invariant cache hit.
[2023-03-20 01:07:29] [INFO ] Implicit Places using invariants in 1474 ms returned []
[2023-03-20 01:07:29] [INFO ] Invariant cache hit.
[2023-03-20 01:07:33] [INFO ] Implicit Places using invariants and state equation in 4320 ms returned []
Implicit Place search using SMT with State Equation took 5838 ms to find 0 implicit places.
[2023-03-20 01:07:33] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-20 01:07:33] [INFO ] Invariant cache hit.
[2023-03-20 01:07:35] [INFO ] Dead Transitions using invariants and state equation in 1434 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7449 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 202 times.
Drop transitions removed 202 transitions
Iterating global reduction 0 with 202 rules applied. Total rules applied 202 place count 1898 transition count 1897
Applied a total of 202 rules in 118 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-20 01:07:35] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:07:36] [INFO ] [Real]Absence check using 898 positive place invariants in 225 ms returned sat
[2023-03-20 01:07:37] [INFO ] After 2347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:07:38] [INFO ] [Nat]Absence check using 898 positive place invariants in 168 ms returned sat
[2023-03-20 01:07:41] [INFO ] After 3297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:07:41] [INFO ] State equation strengthened by 199 read => feed constraints.
[2023-03-20 01:07:42] [INFO ] After 433ms SMT Verify possible using 199 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:07:42] [INFO ] After 656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-20 01:07:42] [INFO ] After 4653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5901/5901 places, 5401/5401 transitions.
Applied a total of 0 rules in 815 ms. Remains 5901 /5901 variables (removed 0) and now considering 5401/5401 (removed 0) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2023-03-20 01:07:43] [INFO ] Computed 901 place invariants in 16 ms
[2023-03-20 01:07:46] [INFO ] Implicit Places using invariants in 2673 ms returned []
[2023-03-20 01:07:46] [INFO ] Invariant cache hit.
[2023-03-20 01:07:49] [INFO ] Implicit Places using invariants and state equation in 2383 ms returned []
Implicit Place search using SMT with State Equation took 5101 ms to find 0 implicit places.
[2023-03-20 01:07:49] [INFO ] Invariant cache hit.
[2023-03-20 01:08:00] [INFO ] Dead Transitions using invariants and state equation in 11797 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17753 ms. Remains : 5901/5901 places, 5401/5401 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 222273 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 222273 steps, saw 211605 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:08:04] [INFO ] Invariant cache hit.
[2023-03-20 01:08:08] [INFO ] [Real]Absence check using 901 positive place invariants in 2689 ms returned sat
[2023-03-20 01:08:14] [INFO ] After 9274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:08:15] [INFO ] [Nat]Absence check using 901 positive place invariants in 862 ms returned sat
[2023-03-20 01:08:26] [INFO ] After 10147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:08:29] [INFO ] Deduced a trap composed of 27 places in 2920 ms of which 5 ms to minimize.
[2023-03-20 01:08:33] [INFO ] Deduced a trap composed of 17 places in 3564 ms of which 3 ms to minimize.
[2023-03-20 01:08:35] [INFO ] Deduced a trap composed of 22 places in 2403 ms of which 3 ms to minimize.
[2023-03-20 01:08:42] [INFO ] Deduced a trap composed of 23 places in 6940 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 01:08:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:08:42] [INFO ] After 28785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 133 ms.
Support contains 2 out of 5901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5901/5901 places, 5401/5401 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5901 transition count 4203
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4703 transition count 4203
Performed 801 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 801 Pre rules applied. Total rules applied 2396 place count 4703 transition count 3402
Deduced a syphon composed of 801 places in 11 ms
Reduce places removed 801 places and 0 transitions.
Iterating global reduction 2 with 1602 rules applied. Total rules applied 3998 place count 3902 transition count 3402
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 5 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7394 place count 2204 transition count 1704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7395 place count 2204 transition count 1703
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7397 place count 2203 transition count 1702
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7599 place count 2102 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7801 place count 2001 transition count 1836
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 6 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 7995 place count 1904 transition count 1901
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7996 place count 1904 transition count 1900
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 8096 place count 1904 transition count 1900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8097 place count 1903 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8099 place count 1901 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8099 place count 1901 transition count 1898
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8101 place count 1900 transition count 1898
Applied a total of 8101 rules in 1464 ms. Remains 1900 /5901 variables (removed 4001) and now considering 1898/5401 (removed 3503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1477 ms. Remains : 1900/5901 places, 1898/5401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 96492 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96492 steps, saw 61338 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1898 rows 1900 cols
[2023-03-20 01:08:47] [INFO ] Computed 899 place invariants in 7 ms
[2023-03-20 01:08:48] [INFO ] [Real]Absence check using 899 positive place invariants in 266 ms returned sat
[2023-03-20 01:08:49] [INFO ] After 1565ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:08:49] [INFO ] [Nat]Absence check using 899 positive place invariants in 226 ms returned sat
[2023-03-20 01:08:52] [INFO ] After 2077ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:08:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 01:08:52] [INFO ] After 79ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:08:52] [INFO ] After 241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-20 01:08:52] [INFO ] After 3050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 69 ms.
Support contains 2 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1898/1898 transitions.
Applied a total of 0 rules in 48 ms. Remains 1900 /1900 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1900/1900 places, 1898/1898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1898/1898 transitions.
Applied a total of 0 rules in 48 ms. Remains 1900 /1900 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2023-03-20 01:08:52] [INFO ] Invariant cache hit.
[2023-03-20 01:08:58] [INFO ] Implicit Places using invariants in 6325 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 6341 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1900 places, 1898/1898 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1898 transition count 1897
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1897
Applied a total of 2 rules in 108 ms. Remains 1898 /1899 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-20 01:08:59] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:09:01] [INFO ] Implicit Places using invariants in 2371 ms returned []
[2023-03-20 01:09:01] [INFO ] Invariant cache hit.
[2023-03-20 01:09:04] [INFO ] Implicit Places using invariants and state equation in 3087 ms returned []
Implicit Place search using SMT with State Equation took 5459 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1898/1900 places, 1897/1898 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11956 ms. Remains : 1898/1900 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 99441 steps, run timeout after 3033 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 99441 steps, saw 62879 distinct states, run finished after 3034 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:09:07] [INFO ] Invariant cache hit.
[2023-03-20 01:09:08] [INFO ] [Real]Absence check using 898 positive place invariants in 147 ms returned sat
[2023-03-20 01:09:09] [INFO ] After 1351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:09:09] [INFO ] [Nat]Absence check using 898 positive place invariants in 209 ms returned sat
[2023-03-20 01:09:10] [INFO ] After 905ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:09:10] [INFO ] After 1079ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-20 01:09:10] [INFO ] After 1695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 56 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 52 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 48 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-20 01:09:10] [INFO ] Invariant cache hit.
[2023-03-20 01:09:12] [INFO ] Implicit Places using invariants in 1552 ms returned []
[2023-03-20 01:09:12] [INFO ] Invariant cache hit.
[2023-03-20 01:09:16] [INFO ] Implicit Places using invariants and state equation in 3723 ms returned []
Implicit Place search using SMT with State Equation took 5293 ms to find 0 implicit places.
[2023-03-20 01:09:16] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-20 01:09:16] [INFO ] Invariant cache hit.
[2023-03-20 01:09:17] [INFO ] Dead Transitions using invariants and state equation in 1531 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6983 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 202 times.
Drop transitions removed 202 transitions
Iterating global reduction 0 with 202 rules applied. Total rules applied 202 place count 1898 transition count 1897
Applied a total of 202 rules in 133 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-20 01:09:18] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:09:18] [INFO ] [Real]Absence check using 898 positive place invariants in 710 ms returned sat
[2023-03-20 01:09:20] [INFO ] After 2236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:09:20] [INFO ] [Nat]Absence check using 898 positive place invariants in 143 ms returned sat
[2023-03-20 01:09:21] [INFO ] After 916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:09:21] [INFO ] State equation strengthened by 199 read => feed constraints.
[2023-03-20 01:09:22] [INFO ] After 426ms SMT Verify possible using 199 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:09:22] [INFO ] After 615ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-20 01:09:22] [INFO ] After 2134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 332 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 322 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1483 ms.
Product exploration explored 100000 steps with 0 reset in 2013 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 323 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5901 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5901/5901 places, 5401/5401 transitions.
Performed 1198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5901 transition count 5401
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 401 Pre rules applied. Total rules applied 1198 place count 5901 transition count 5702
Deduced a syphon composed of 1599 places in 18 ms
Iterating global reduction 1 with 401 rules applied. Total rules applied 1599 place count 5901 transition count 5702
Performed 1998 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3597 places in 10 ms
Iterating global reduction 1 with 1998 rules applied. Total rules applied 3597 place count 5901 transition count 5702
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3598 place count 5901 transition count 5701
Renaming transitions due to excessive name length > 1024 char.
Discarding 800 places :
Symmetric choice reduction at 2 with 800 rule applications. Total rules 4398 place count 5101 transition count 4901
Deduced a syphon composed of 2797 places in 36 ms
Iterating global reduction 2 with 800 rules applied. Total rules applied 5198 place count 5101 transition count 4901
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2798 places in 9 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5199 place count 5101 transition count 4901
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5201 place count 5099 transition count 4899
Deduced a syphon composed of 2796 places in 8 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5203 place count 5099 transition count 4899
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 2897 places in 10 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5304 place count 5099 transition count 5429
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5405 place count 4998 transition count 5227
Deduced a syphon composed of 2796 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5506 place count 4998 transition count 5227
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -527
Deduced a syphon composed of 2897 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5607 place count 4998 transition count 5754
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5708 place count 4897 transition count 5552
Deduced a syphon composed of 2796 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5809 place count 4897 transition count 5552
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 2897 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5910 place count 4897 transition count 6082
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6011 place count 4796 transition count 5880
Deduced a syphon composed of 2796 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6112 place count 4796 transition count 5880
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -512
Deduced a syphon composed of 2892 places in 13 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6208 place count 4796 transition count 6392
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 6304 place count 4700 transition count 6200
Deduced a syphon composed of 2796 places in 12 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6400 place count 4700 transition count 6200
Deduced a syphon composed of 2796 places in 13 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 6409 place count 4700 transition count 6191
Deduced a syphon composed of 2796 places in 20 ms
Applied a total of 6409 rules in 9050 ms. Remains 4700 /5901 variables (removed 1201) and now considering 6191/5401 (removed -790) transitions.
[2023-03-20 01:09:36] [INFO ] Redundant transitions in 280 ms returned []
// Phase 1: matrix 6191 rows 4700 cols
[2023-03-20 01:09:37] [INFO ] Computed 901 place invariants in 102 ms
[2023-03-20 01:09:42] [INFO ] Dead Transitions using invariants and state equation in 5848 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4700/5901 places, 6191/5401 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15225 ms. Remains : 4700/5901 places, 6191/5401 transitions.
Support contains 2 out of 5901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5901/5901 places, 5401/5401 transitions.
Applied a total of 0 rules in 921 ms. Remains 5901 /5901 variables (removed 0) and now considering 5401/5401 (removed 0) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2023-03-20 01:09:43] [INFO ] Computed 901 place invariants in 36 ms
[2023-03-20 01:09:46] [INFO ] Implicit Places using invariants in 2473 ms returned []
[2023-03-20 01:09:46] [INFO ] Invariant cache hit.
[2023-03-20 01:09:48] [INFO ] Implicit Places using invariants and state equation in 2589 ms returned []
Implicit Place search using SMT with State Equation took 5080 ms to find 0 implicit places.
[2023-03-20 01:09:48] [INFO ] Invariant cache hit.
[2023-03-20 01:09:54] [INFO ] Dead Transitions using invariants and state equation in 5463 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11466 ms. Remains : 5901/5901 places, 5401/5401 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLFireability-05 finished in 228194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 3 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 5902 transition count 5402
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 5902 transition count 5402
Applied a total of 16 rules in 2026 ms. Remains 5902 /5910 variables (removed 8) and now considering 5402/5410 (removed 8) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-20 01:09:56] [INFO ] Computed 901 place invariants in 33 ms
[2023-03-20 01:09:59] [INFO ] Implicit Places using invariants in 2435 ms returned []
[2023-03-20 01:09:59] [INFO ] Invariant cache hit.
[2023-03-20 01:10:02] [INFO ] Implicit Places using invariants and state equation in 3352 ms returned []
Implicit Place search using SMT with State Equation took 5822 ms to find 0 implicit places.
[2023-03-20 01:10:02] [INFO ] Invariant cache hit.
[2023-03-20 01:10:10] [INFO ] Dead Transitions using invariants and state equation in 7517 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5910 places, 5402/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15368 ms. Remains : 5902/5910 places, 5402/5410 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s5242 1), p1:(AND (EQ s5270 1) (EQ s97 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3 reset in 1430 ms.
Stack based approach found an accepted trace after 2240 steps with 0 reset with depth 2241 and stack size 2241 in 26 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-06 finished in 17207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 2 out of 5910 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1200 rules applied. Total rules applied 1200 place count 5909 transition count 4209
Reduce places removed 1200 places and 0 transitions.
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2400 place count 4709 transition count 4209
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2400 place count 4709 transition count 3413
Deduced a syphon composed of 796 places in 9 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 3992 place count 3913 transition count 3413
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 3999 place count 3906 transition count 3406
Iterating global reduction 2 with 7 rules applied. Total rules applied 4006 place count 3906 transition count 3406
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4006 place count 3906 transition count 3400
Deduced a syphon composed of 6 places in 9 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 4018 place count 3900 transition count 3400
Performed 1695 Post agglomeration using F-continuation condition.Transition count delta: 1695
Deduced a syphon composed of 1695 places in 4 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 2 with 3390 rules applied. Total rules applied 7408 place count 2205 transition count 1705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7409 place count 2205 transition count 1704
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7411 place count 2204 transition count 1703
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7613 place count 2103 transition count 1769
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7815 place count 2002 transition count 1837
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 6 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8009 place count 1905 transition count 1902
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8011 place count 1903 transition count 1900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8013 place count 1901 transition count 1900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8013 place count 1901 transition count 1899
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8015 place count 1900 transition count 1899
Applied a total of 8015 rules in 1930 ms. Remains 1900 /5910 variables (removed 4010) and now considering 1899/5410 (removed 3511) transitions.
// Phase 1: matrix 1899 rows 1900 cols
[2023-03-20 01:10:14] [INFO ] Computed 899 place invariants in 19 ms
[2023-03-20 01:10:16] [INFO ] Implicit Places using invariants in 2146 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2161 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/5910 places, 1899/5410 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1898
Applied a total of 2 rules in 117 ms. Remains 1898 /1899 variables (removed 1) and now considering 1898/1899 (removed 1) transitions.
// Phase 1: matrix 1898 rows 1898 cols
[2023-03-20 01:10:16] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:10:18] [INFO ] Implicit Places using invariants in 1749 ms returned []
[2023-03-20 01:10:18] [INFO ] Invariant cache hit.
[2023-03-20 01:10:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 01:10:21] [INFO ] Implicit Places using invariants and state equation in 3094 ms returned []
Implicit Place search using SMT with State Equation took 4870 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1898/5910 places, 1898/5410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9078 ms. Remains : 1898/5910 places, 1898/5410 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s821 0), p0:(EQ s202 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1384 ms.
Product exploration explored 100000 steps with 0 reset in 1690 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1898 stabilizing places and 2/1898 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 415 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 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 96750 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96750 steps, saw 59333 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 01:10:28] [INFO ] Invariant cache hit.
[2023-03-20 01:10:28] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:10:29] [INFO ] [Nat]Absence check using 898 positive place invariants in 225 ms returned sat
[2023-03-20 01:10:31] [INFO ] After 1977ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:10:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 01:10:31] [INFO ] After 165ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 01:10:31] [INFO ] After 429ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 201 ms.
[2023-03-20 01:10:31] [INFO ] After 3119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 155 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1898 transition count 1897
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1897
Applied a total of 2 rules in 181 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1898 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 1898/1898 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 89570 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89570 steps, saw 55598 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-20 01:10:35] [INFO ] Computed 898 place invariants in 2 ms
[2023-03-20 01:10:36] [INFO ] After 350ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:10:36] [INFO ] [Nat]Absence check using 898 positive place invariants in 158 ms returned sat
[2023-03-20 01:10:37] [INFO ] After 958ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:10:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 01:10:37] [INFO ] After 180ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 01:10:38] [INFO ] After 578ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 236 ms.
[2023-03-20 01:10:38] [INFO ] After 2441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 223 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 52 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 51 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-20 01:10:38] [INFO ] Invariant cache hit.
[2023-03-20 01:10:40] [INFO ] Implicit Places using invariants in 1764 ms returned []
[2023-03-20 01:10:40] [INFO ] Invariant cache hit.
[2023-03-20 01:10:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 01:10:44] [INFO ] Implicit Places using invariants and state equation in 4280 ms returned []
Implicit Place search using SMT with State Equation took 6061 ms to find 0 implicit places.
[2023-03-20 01:10:44] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-20 01:10:44] [INFO ] Invariant cache hit.
[2023-03-20 01:10:46] [INFO ] Dead Transitions using invariants and state equation in 1261 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7432 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 203 times.
Drop transitions removed 203 transitions
Iterating global reduction 0 with 203 rules applied. Total rules applied 203 place count 1898 transition count 1897
Applied a total of 203 rules in 122 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-20 01:10:46] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:10:46] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:10:47] [INFO ] [Nat]Absence check using 898 positive place invariants in 179 ms returned sat
[2023-03-20 01:10:48] [INFO ] After 964ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:10:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 01:10:48] [INFO ] After 230ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 01:10:48] [INFO ] After 598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 217 ms.
[2023-03-20 01:10:48] [INFO ] After 2320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 375 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 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Applied a total of 0 rules in 105 ms. Remains 1898 /1898 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
// Phase 1: matrix 1898 rows 1898 cols
[2023-03-20 01:10:49] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:10:53] [INFO ] Implicit Places using invariants in 3561 ms returned []
[2023-03-20 01:10:53] [INFO ] Invariant cache hit.
[2023-03-20 01:10:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 01:10:59] [INFO ] Implicit Places using invariants and state equation in 5798 ms returned []
Implicit Place search using SMT with State Equation took 9360 ms to find 0 implicit places.
[2023-03-20 01:10:59] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-20 01:10:59] [INFO ] Invariant cache hit.
[2023-03-20 01:11:00] [INFO ] Dead Transitions using invariants and state equation in 1527 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11089 ms. Remains : 1898/1898 places, 1898/1898 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1898 stabilizing places and 2/1898 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 244 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 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 79665 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79665 steps, saw 48048 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 01:11:04] [INFO ] Invariant cache hit.
[2023-03-20 01:11:04] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:11:05] [INFO ] [Nat]Absence check using 898 positive place invariants in 198 ms returned sat
[2023-03-20 01:11:06] [INFO ] After 1203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:11:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 01:11:06] [INFO ] After 155ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 01:11:07] [INFO ] After 436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 232 ms.
[2023-03-20 01:11:07] [INFO ] After 2503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 170 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1898 transition count 1897
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1897
Applied a total of 2 rules in 115 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1898 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 1898/1898 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 72861 steps, run timeout after 3011 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72861 steps, saw 45047 distinct states, run finished after 3011 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-20 01:11:11] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:11:11] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:11:11] [INFO ] [Nat]Absence check using 898 positive place invariants in 144 ms returned sat
[2023-03-20 01:11:13] [INFO ] After 1689ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:11:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 01:11:14] [INFO ] After 187ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 01:11:14] [INFO ] After 568ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 248 ms.
[2023-03-20 01:11:14] [INFO ] After 3064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 410 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 52 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 53 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-20 01:11:15] [INFO ] Invariant cache hit.
[2023-03-20 01:11:16] [INFO ] Implicit Places using invariants in 1509 ms returned []
[2023-03-20 01:11:16] [INFO ] Invariant cache hit.
[2023-03-20 01:11:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 01:11:20] [INFO ] Implicit Places using invariants and state equation in 3396 ms returned []
Implicit Place search using SMT with State Equation took 4929 ms to find 0 implicit places.
[2023-03-20 01:11:20] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-20 01:11:20] [INFO ] Invariant cache hit.
[2023-03-20 01:11:21] [INFO ] Dead Transitions using invariants and state equation in 1656 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6694 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 203 times.
Drop transitions removed 203 transitions
Iterating global reduction 0 with 203 rules applied. Total rules applied 203 place count 1898 transition count 1897
Applied a total of 203 rules in 114 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-20 01:11:21] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-20 01:11:22] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:11:22] [INFO ] [Nat]Absence check using 898 positive place invariants in 288 ms returned sat
[2023-03-20 01:11:24] [INFO ] After 1128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:11:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 01:11:24] [INFO ] After 188ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 01:11:24] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-20 01:11:24] [INFO ] After 2470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 480 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 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1488 ms.
Product exploration explored 100000 steps with 0 reset in 1848 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Applied a total of 0 rules in 53 ms. Remains 1898 /1898 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
// Phase 1: matrix 1898 rows 1898 cols
[2023-03-20 01:11:29] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:11:32] [INFO ] Implicit Places using invariants in 3735 ms returned []
[2023-03-20 01:11:32] [INFO ] Invariant cache hit.
[2023-03-20 01:11:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 01:11:38] [INFO ] Implicit Places using invariants and state equation in 5814 ms returned []
Implicit Place search using SMT with State Equation took 9565 ms to find 0 implicit places.
[2023-03-20 01:11:38] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-20 01:11:38] [INFO ] Invariant cache hit.
[2023-03-20 01:11:40] [INFO ] Dead Transitions using invariants and state equation in 1571 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11265 ms. Remains : 1898/1898 places, 1898/1898 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLFireability-08 finished in 88395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&G(p1))))'
Support contains 5 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 5901 transition count 5401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 5901 transition count 5401
Applied a total of 18 rules in 1952 ms. Remains 5901 /5910 variables (removed 9) and now considering 5401/5410 (removed 9) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2023-03-20 01:11:42] [INFO ] Computed 901 place invariants in 36 ms
[2023-03-20 01:11:44] [INFO ] Implicit Places using invariants in 2440 ms returned []
[2023-03-20 01:11:44] [INFO ] Invariant cache hit.
[2023-03-20 01:11:47] [INFO ] Implicit Places using invariants and state equation in 2080 ms returned []
Implicit Place search using SMT with State Equation took 4542 ms to find 0 implicit places.
[2023-03-20 01:11:47] [INFO ] Invariant cache hit.
[2023-03-20 01:11:52] [INFO ] Dead Transitions using invariants and state equation in 5657 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5910 places, 5401/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12168 ms. Remains : 5901/5910 places, 5401/5410 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s3726 1) (EQ s3775 1) (EQ s501 0)), p0:(OR (EQ s2031 0) (EQ s2048 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1486 ms.
Stack based approach found an accepted trace after 2420 steps with 0 reset with depth 2421 and stack size 2421 in 35 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-09 finished in 13998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U X(p1)))))'
Support contains 4 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 5903 transition count 5403
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 5903 transition count 5403
Applied a total of 14 rules in 1988 ms. Remains 5903 /5910 variables (removed 7) and now considering 5403/5410 (removed 7) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2023-03-20 01:11:56] [INFO ] Computed 901 place invariants in 37 ms
[2023-03-20 01:11:58] [INFO ] Implicit Places using invariants in 2478 ms returned []
[2023-03-20 01:11:59] [INFO ] Invariant cache hit.
[2023-03-20 01:12:01] [INFO ] Implicit Places using invariants and state equation in 2403 ms returned []
Implicit Place search using SMT with State Equation took 4900 ms to find 0 implicit places.
[2023-03-20 01:12:01] [INFO ] Invariant cache hit.
[2023-03-20 01:12:07] [INFO ] Dead Transitions using invariants and state equation in 5886 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5903/5910 places, 5403/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12777 ms. Remains : 5903/5910 places, 5403/5410 transitions.
Stuttering acceptance computed with spot in 491 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s5082 1) (EQ s129 1)), p1:(AND (EQ s3715 1) (EQ s3717 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-10 finished in 13377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(F(p2)&&p1))))'
Support contains 3 out of 5910 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5909 transition count 4211
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4711 transition count 4211
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 797 Pre rules applied. Total rules applied 2396 place count 4711 transition count 3414
Deduced a syphon composed of 797 places in 11 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 2 with 1594 rules applied. Total rules applied 3990 place count 3914 transition count 3414
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 3996 place count 3908 transition count 3408
Iterating global reduction 2 with 6 rules applied. Total rules applied 4002 place count 3908 transition count 3408
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4002 place count 3908 transition count 3403
Deduced a syphon composed of 5 places in 11 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 4012 place count 3903 transition count 3403
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 3 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 2 with 3394 rules applied. Total rules applied 7406 place count 2206 transition count 1706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7407 place count 2206 transition count 1705
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7409 place count 2205 transition count 1704
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7611 place count 2104 transition count 1769
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7813 place count 2003 transition count 1837
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 96 places in 7 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8005 place count 1907 transition count 1900
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8007 place count 1905 transition count 1898
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8009 place count 1903 transition count 1898
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8009 place count 1903 transition count 1897
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8011 place count 1902 transition count 1897
Applied a total of 8011 rules in 2037 ms. Remains 1902 /5910 variables (removed 4008) and now considering 1897/5410 (removed 3513) transitions.
// Phase 1: matrix 1897 rows 1902 cols
[2023-03-20 01:12:09] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-20 01:12:11] [INFO ] Implicit Places using invariants in 1586 ms returned [1891]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1601 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1901/5910 places, 1897/5410 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1900 transition count 1896
Applied a total of 2 rules in 121 ms. Remains 1900 /1901 variables (removed 1) and now considering 1896/1897 (removed 1) transitions.
// Phase 1: matrix 1896 rows 1900 cols
[2023-03-20 01:12:11] [INFO ] Computed 898 place invariants in 2 ms
[2023-03-20 01:12:13] [INFO ] Implicit Places using invariants in 1531 ms returned []
[2023-03-20 01:12:13] [INFO ] Invariant cache hit.
[2023-03-20 01:12:14] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 01:12:16] [INFO ] Implicit Places using invariants and state equation in 3112 ms returned []
Implicit Place search using SMT with State Equation took 4678 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1900/5910 places, 1896/5410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8437 ms. Remains : 1900/5910 places, 1896/5410 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s226 1) (EQ s98 1)), p0:(EQ s1602 0), p2:(EQ s226 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 36233 steps with 0 reset in 458 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-11 finished in 9237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 5901 transition count 5401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 5901 transition count 5401
Applied a total of 18 rules in 1855 ms. Remains 5901 /5910 variables (removed 9) and now considering 5401/5410 (removed 9) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2023-03-20 01:12:19] [INFO ] Computed 901 place invariants in 39 ms
[2023-03-20 01:12:21] [INFO ] Implicit Places using invariants in 2219 ms returned []
[2023-03-20 01:12:21] [INFO ] Invariant cache hit.
[2023-03-20 01:12:23] [INFO ] Implicit Places using invariants and state equation in 2267 ms returned []
Implicit Place search using SMT with State Equation took 4513 ms to find 0 implicit places.
[2023-03-20 01:12:23] [INFO ] Invariant cache hit.
[2023-03-20 01:12:29] [INFO ] Dead Transitions using invariants and state equation in 5699 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5910 places, 5401/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12071 ms. Remains : 5901/5910 places, 5401/5410 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s3897 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 689 steps with 0 reset in 9 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-12 finished in 12399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 2 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 5902 transition count 5402
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 5902 transition count 5402
Applied a total of 16 rules in 1944 ms. Remains 5902 /5910 variables (removed 8) and now considering 5402/5410 (removed 8) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-20 01:12:31] [INFO ] Computed 901 place invariants in 36 ms
[2023-03-20 01:12:33] [INFO ] Implicit Places using invariants in 2111 ms returned []
[2023-03-20 01:12:33] [INFO ] Invariant cache hit.
[2023-03-20 01:12:35] [INFO ] Implicit Places using invariants and state equation in 2236 ms returned []
Implicit Place search using SMT with State Equation took 4363 ms to find 0 implicit places.
[2023-03-20 01:12:35] [INFO ] Invariant cache hit.
[2023-03-20 01:12:36] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5910 places, 5402/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6905 ms. Remains : 5902/5910 places, 5402/5410 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(NEQ s2606 1), p0:(NEQ s2872 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1552 ms.
Product exploration explored 100000 steps with 0 reset in 1952 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 531 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 149448 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149448 steps, saw 147354 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 01:12:44] [INFO ] Invariant cache hit.
[2023-03-20 01:12:46] [INFO ] [Real]Absence check using 901 positive place invariants in 533 ms returned sat
[2023-03-20 01:12:52] [INFO ] After 7943ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:12:54] [INFO ] [Nat]Absence check using 901 positive place invariants in 715 ms returned sat
[2023-03-20 01:13:03] [INFO ] After 7770ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:13:05] [INFO ] Deduced a trap composed of 23 places in 2184 ms of which 5 ms to minimize.
[2023-03-20 01:13:08] [INFO ] Deduced a trap composed of 19 places in 2610 ms of which 27 ms to minimize.
[2023-03-20 01:13:11] [INFO ] Deduced a trap composed of 24 places in 2716 ms of which 3 ms to minimize.
[2023-03-20 01:13:13] [INFO ] Deduced a trap composed of 17 places in 2216 ms of which 3 ms to minimize.
[2023-03-20 01:13:15] [INFO ] Deduced a trap composed of 17 places in 1904 ms of which 3 ms to minimize.
[2023-03-20 01:13:18] [INFO ] Deduced a trap composed of 31 places in 2720 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:13:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:13:18] [INFO ] After 26097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 637 ms.
Support contains 2 out of 5902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5902 transition count 4203
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4703 transition count 4203
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2398 place count 4703 transition count 3403
Deduced a syphon composed of 800 places in 9 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 3998 place count 3903 transition count 3403
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 4 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 2 with 3400 rules applied. Total rules applied 7398 place count 2203 transition count 1703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7399 place count 2203 transition count 1702
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7401 place count 2202 transition count 1701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7603 place count 2101 transition count 1767
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7805 place count 2000 transition count 1834
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 12 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 7997 place count 1904 transition count 1899
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7998 place count 1904 transition count 1898
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 7999 place count 1904 transition count 1897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8000 place count 1903 transition count 1897
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 8100 place count 1903 transition count 1897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8101 place count 1902 transition count 1896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 8103 place count 1900 transition count 1896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 8103 place count 1900 transition count 1895
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 8105 place count 1899 transition count 1895
Applied a total of 8105 rules in 1616 ms. Remains 1899 /5902 variables (removed 4003) and now considering 1895/5402 (removed 3507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1616 ms. Remains : 1899/5902 places, 1895/5402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 63446 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 63446 steps, saw 40372 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1895 rows 1899 cols
[2023-03-20 01:13:24] [INFO ] Computed 899 place invariants in 3 ms
[2023-03-20 01:13:25] [INFO ] [Real]Absence check using 899 positive place invariants in 196 ms returned sat
[2023-03-20 01:13:26] [INFO ] After 1680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:13:27] [INFO ] [Nat]Absence check using 899 positive place invariants in 311 ms returned sat
[2023-03-20 01:13:29] [INFO ] After 1666ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:13:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 01:13:29] [INFO ] After 339ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 01:13:30] [INFO ] After 914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 400 ms.
[2023-03-20 01:13:30] [INFO ] After 3836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 852 ms.
Support contains 2 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1895/1895 transitions.
Applied a total of 0 rules in 52 ms. Remains 1899 /1899 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1899/1899 places, 1895/1895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1895/1895 transitions.
Applied a total of 0 rules in 63 ms. Remains 1899 /1899 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
[2023-03-20 01:13:31] [INFO ] Invariant cache hit.
[2023-03-20 01:13:33] [INFO ] Implicit Places using invariants in 1664 ms returned [1888]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1674 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1898/1899 places, 1895/1895 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1897 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1897 transition count 1894
Applied a total of 2 rules in 95 ms. Remains 1897 /1898 variables (removed 1) and now considering 1894/1895 (removed 1) transitions.
// Phase 1: matrix 1894 rows 1897 cols
[2023-03-20 01:13:33] [INFO ] Computed 898 place invariants in 4 ms
[2023-03-20 01:13:34] [INFO ] Implicit Places using invariants in 1746 ms returned []
[2023-03-20 01:13:34] [INFO ] Invariant cache hit.
[2023-03-20 01:13:39] [INFO ] Implicit Places using invariants and state equation in 4424 ms returned []
Implicit Place search using SMT with State Equation took 6198 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1897/1899 places, 1894/1895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8031 ms. Remains : 1897/1899 places, 1894/1895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 61335 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61335 steps, saw 38637 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 01:13:43] [INFO ] Invariant cache hit.
[2023-03-20 01:13:43] [INFO ] [Real]Absence check using 898 positive place invariants in 196 ms returned sat
[2023-03-20 01:13:45] [INFO ] After 1833ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:13:45] [INFO ] [Nat]Absence check using 898 positive place invariants in 222 ms returned sat
[2023-03-20 01:13:47] [INFO ] After 1213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:13:47] [INFO ] After 1909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 462 ms.
[2023-03-20 01:13:48] [INFO ] After 3315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 387 ms.
Support contains 2 out of 1897 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 52 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1897/1897 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 54 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-20 01:13:48] [INFO ] Invariant cache hit.
[2023-03-20 01:13:50] [INFO ] Implicit Places using invariants in 1235 ms returned []
[2023-03-20 01:13:50] [INFO ] Invariant cache hit.
[2023-03-20 01:13:53] [INFO ] Implicit Places using invariants and state equation in 3256 ms returned []
Implicit Place search using SMT with State Equation took 4499 ms to find 0 implicit places.
[2023-03-20 01:13:53] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-20 01:13:53] [INFO ] Invariant cache hit.
[2023-03-20 01:13:54] [INFO ] Dead Transitions using invariants and state equation in 1230 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5821 ms. Remains : 1897/1897 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1897 transition count 1894
Applied a total of 199 rules in 124 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1894 rows 1897 cols
[2023-03-20 01:13:54] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:13:55] [INFO ] [Real]Absence check using 898 positive place invariants in 249 ms returned sat
[2023-03-20 01:13:57] [INFO ] After 2994ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:13:58] [INFO ] [Nat]Absence check using 898 positive place invariants in 266 ms returned sat
[2023-03-20 01:13:59] [INFO ] After 1223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:13:59] [INFO ] State equation strengthened by 197 read => feed constraints.
[2023-03-20 01:14:00] [INFO ] After 1065ms SMT Verify possible using 197 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 01:14:01] [INFO ] After 1769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 480 ms.
[2023-03-20 01:14:02] [INFO ] After 4278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 509 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 255 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 5902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Applied a total of 0 rules in 992 ms. Remains 5902 /5902 variables (removed 0) and now considering 5402/5402 (removed 0) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-20 01:14:04] [INFO ] Computed 901 place invariants in 47 ms
[2023-03-20 01:14:07] [INFO ] Implicit Places using invariants in 3265 ms returned []
[2023-03-20 01:14:07] [INFO ] Invariant cache hit.
[2023-03-20 01:14:11] [INFO ] Implicit Places using invariants and state equation in 4044 ms returned []
Implicit Place search using SMT with State Equation took 7369 ms to find 0 implicit places.
[2023-03-20 01:14:11] [INFO ] Invariant cache hit.
[2023-03-20 01:14:16] [INFO ] Dead Transitions using invariants and state equation in 5219 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13595 ms. Remains : 5902/5902 places, 5402/5402 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 620 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 102974 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102974 steps, saw 101519 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 01:14:21] [INFO ] Invariant cache hit.
[2023-03-20 01:14:22] [INFO ] [Real]Absence check using 901 positive place invariants in 573 ms returned sat
[2023-03-20 01:14:29] [INFO ] After 8714ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:14:32] [INFO ] [Nat]Absence check using 901 positive place invariants in 897 ms returned sat
[2023-03-20 01:14:38] [INFO ] After 5496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:14:40] [INFO ] Deduced a trap composed of 23 places in 2057 ms of which 4 ms to minimize.
[2023-03-20 01:14:42] [INFO ] Deduced a trap composed of 19 places in 2233 ms of which 3 ms to minimize.
[2023-03-20 01:14:45] [INFO ] Deduced a trap composed of 24 places in 2340 ms of which 8 ms to minimize.
[2023-03-20 01:14:48] [INFO ] Deduced a trap composed of 17 places in 2514 ms of which 4 ms to minimize.
[2023-03-20 01:14:50] [INFO ] Deduced a trap composed of 17 places in 2424 ms of which 3 ms to minimize.
[2023-03-20 01:14:53] [INFO ] Deduced a trap composed of 31 places in 2576 ms of which 3 ms to minimize.
[2023-03-20 01:14:56] [INFO ] Deduced a trap composed of 21 places in 2532 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 01:14:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:14:56] [INFO ] After 26456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 753 ms.
Support contains 2 out of 5902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5902 transition count 4203
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4703 transition count 4203
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2398 place count 4703 transition count 3403
Deduced a syphon composed of 800 places in 10 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 3998 place count 3903 transition count 3403
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 5 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 2 with 3400 rules applied. Total rules applied 7398 place count 2203 transition count 1703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7399 place count 2203 transition count 1702
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7401 place count 2202 transition count 1701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7603 place count 2101 transition count 1767
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7805 place count 2000 transition count 1834
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 6 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 7997 place count 1904 transition count 1899
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7998 place count 1904 transition count 1898
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 7999 place count 1904 transition count 1897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8000 place count 1903 transition count 1897
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 8100 place count 1903 transition count 1897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8101 place count 1902 transition count 1896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 8103 place count 1900 transition count 1896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 8103 place count 1900 transition count 1895
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 8105 place count 1899 transition count 1895
Applied a total of 8105 rules in 1561 ms. Remains 1899 /5902 variables (removed 4003) and now considering 1895/5402 (removed 3507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1561 ms. Remains : 1899/5902 places, 1895/5402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 58237 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58237 steps, saw 37057 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1895 rows 1899 cols
[2023-03-20 01:15:02] [INFO ] Computed 899 place invariants in 3 ms
[2023-03-20 01:15:03] [INFO ] [Real]Absence check using 899 positive place invariants in 177 ms returned sat
[2023-03-20 01:15:04] [INFO ] After 2126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:15:05] [INFO ] [Nat]Absence check using 899 positive place invariants in 777 ms returned sat
[2023-03-20 01:15:07] [INFO ] After 1492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:15:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 01:15:07] [INFO ] After 404ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 01:15:08] [INFO ] After 1090ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 276 ms.
[2023-03-20 01:15:08] [INFO ] After 4101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 673 ms.
Support contains 2 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1895/1895 transitions.
Applied a total of 0 rules in 85 ms. Remains 1899 /1899 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 1899/1899 places, 1895/1895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1895/1895 transitions.
Applied a total of 0 rules in 59 ms. Remains 1899 /1899 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
[2023-03-20 01:15:09] [INFO ] Invariant cache hit.
[2023-03-20 01:15:11] [INFO ] Implicit Places using invariants in 1938 ms returned [1888]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1953 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1898/1899 places, 1895/1895 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1897 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1897 transition count 1894
Applied a total of 2 rules in 102 ms. Remains 1897 /1898 variables (removed 1) and now considering 1894/1895 (removed 1) transitions.
// Phase 1: matrix 1894 rows 1897 cols
[2023-03-20 01:15:11] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:15:13] [INFO ] Implicit Places using invariants in 1521 ms returned []
[2023-03-20 01:15:13] [INFO ] Invariant cache hit.
[2023-03-20 01:15:18] [INFO ] Implicit Places using invariants and state equation in 5738 ms returned []
Implicit Place search using SMT with State Equation took 7341 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1897/1899 places, 1894/1895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9456 ms. Remains : 1897/1899 places, 1894/1895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 55299 steps, run timeout after 3002 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55299 steps, saw 34783 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 01:15:22] [INFO ] Invariant cache hit.
[2023-03-20 01:15:23] [INFO ] [Real]Absence check using 898 positive place invariants in 277 ms returned sat
[2023-03-20 01:15:25] [INFO ] After 2397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:15:25] [INFO ] [Nat]Absence check using 898 positive place invariants in 173 ms returned sat
[2023-03-20 01:15:27] [INFO ] After 1318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:15:28] [INFO ] After 1880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 299 ms.
[2023-03-20 01:15:28] [INFO ] After 3057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 285 ms.
Support contains 2 out of 1897 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 60 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1897/1897 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 50 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-20 01:15:28] [INFO ] Invariant cache hit.
[2023-03-20 01:15:30] [INFO ] Implicit Places using invariants in 1646 ms returned []
[2023-03-20 01:15:30] [INFO ] Invariant cache hit.
[2023-03-20 01:15:34] [INFO ] Implicit Places using invariants and state equation in 3826 ms returned []
Implicit Place search using SMT with State Equation took 5494 ms to find 0 implicit places.
[2023-03-20 01:15:34] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-20 01:15:34] [INFO ] Invariant cache hit.
[2023-03-20 01:15:35] [INFO ] Dead Transitions using invariants and state equation in 1418 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6995 ms. Remains : 1897/1897 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1897 transition count 1894
Applied a total of 199 rules in 122 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1894 rows 1897 cols
[2023-03-20 01:15:35] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-20 01:15:36] [INFO ] [Real]Absence check using 898 positive place invariants in 151 ms returned sat
[2023-03-20 01:15:37] [INFO ] After 1750ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:15:38] [INFO ] [Nat]Absence check using 898 positive place invariants in 210 ms returned sat
[2023-03-20 01:15:39] [INFO ] After 973ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:15:39] [INFO ] State equation strengthened by 197 read => feed constraints.
[2023-03-20 01:15:40] [INFO ] After 937ms SMT Verify possible using 197 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 01:15:40] [INFO ] After 1568ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 427 ms.
[2023-03-20 01:15:41] [INFO ] After 3749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 556 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 258 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 172 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1461 ms.
Product exploration explored 100000 steps with 0 reset in 2017 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 158 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 5902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Performed 1199 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5902 transition count 5402
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 401 Pre rules applied. Total rules applied 1199 place count 5902 transition count 5704
Deduced a syphon composed of 1600 places in 20 ms
Iterating global reduction 1 with 401 rules applied. Total rules applied 1600 place count 5902 transition count 5704
Performed 1999 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3599 places in 14 ms
Iterating global reduction 1 with 1999 rules applied. Total rules applied 3599 place count 5902 transition count 5704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3600 place count 5902 transition count 5703
Renaming transitions due to excessive name length > 1024 char.
Discarding 800 places :
Symmetric choice reduction at 2 with 800 rule applications. Total rules 4400 place count 5102 transition count 4903
Deduced a syphon composed of 2799 places in 10 ms
Iterating global reduction 2 with 800 rules applied. Total rules applied 5200 place count 5102 transition count 4903
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2800 places in 10 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5201 place count 5102 transition count 4903
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5203 place count 5100 transition count 4901
Deduced a syphon composed of 2798 places in 9 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5205 place count 5100 transition count 4901
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 2899 places in 16 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5306 place count 5100 transition count 5431
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5407 place count 4999 transition count 5229
Deduced a syphon composed of 2798 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5508 place count 4999 transition count 5229
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -531
Deduced a syphon composed of 2899 places in 16 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5609 place count 4999 transition count 5760
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5710 place count 4898 transition count 5558
Deduced a syphon composed of 2798 places in 14 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5811 place count 4898 transition count 5558
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -534
Deduced a syphon composed of 2899 places in 16 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5912 place count 4898 transition count 6092
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6013 place count 4797 transition count 5890
Deduced a syphon composed of 2798 places in 15 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6114 place count 4797 transition count 5890
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -503
Deduced a syphon composed of 2893 places in 16 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6209 place count 4797 transition count 6393
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 6304 place count 4702 transition count 6203
Deduced a syphon composed of 2798 places in 13 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6399 place count 4702 transition count 6203
Deduced a syphon composed of 2798 places in 12 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 6408 place count 4702 transition count 6194
Deduced a syphon composed of 2798 places in 12 ms
Applied a total of 6408 rules in 9273 ms. Remains 4702 /5902 variables (removed 1200) and now considering 6194/5402 (removed -792) transitions.
[2023-03-20 01:15:55] [INFO ] Redundant transitions in 266 ms returned []
// Phase 1: matrix 6194 rows 4702 cols
[2023-03-20 01:15:56] [INFO ] Computed 901 place invariants in 127 ms
[2023-03-20 01:16:02] [INFO ] Dead Transitions using invariants and state equation in 6070 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4702/5902 places, 6194/5402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15652 ms. Remains : 4702/5902 places, 6194/5402 transitions.
Support contains 2 out of 5902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Applied a total of 0 rules in 928 ms. Remains 5902 /5902 variables (removed 0) and now considering 5402/5402 (removed 0) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-20 01:16:03] [INFO ] Computed 901 place invariants in 23 ms
[2023-03-20 01:16:05] [INFO ] Implicit Places using invariants in 2780 ms returned []
[2023-03-20 01:16:05] [INFO ] Invariant cache hit.
[2023-03-20 01:16:08] [INFO ] Implicit Places using invariants and state equation in 2232 ms returned []
Implicit Place search using SMT with State Equation took 5057 ms to find 0 implicit places.
[2023-03-20 01:16:08] [INFO ] Invariant cache hit.
[2023-03-20 01:16:18] [INFO ] Dead Transitions using invariants and state equation in 10916 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16925 ms. Remains : 5902/5902 places, 5402/5402 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLFireability-13 finished in 229739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 3 out of 5910 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5909 transition count 4211
Reduce places removed 1198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2397 place count 4711 transition count 4210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2398 place count 4710 transition count 4210
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 796 Pre rules applied. Total rules applied 2398 place count 4710 transition count 3414
Deduced a syphon composed of 796 places in 10 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 3 with 1592 rules applied. Total rules applied 3990 place count 3914 transition count 3414
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 3997 place count 3907 transition count 3407
Iterating global reduction 3 with 7 rules applied. Total rules applied 4004 place count 3907 transition count 3407
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 4004 place count 3907 transition count 3401
Deduced a syphon composed of 6 places in 16 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 4016 place count 3901 transition count 3401
Performed 1694 Post agglomeration using F-continuation condition.Transition count delta: 1694
Deduced a syphon composed of 1694 places in 4 ms
Reduce places removed 1694 places and 0 transitions.
Iterating global reduction 3 with 3388 rules applied. Total rules applied 7404 place count 2207 transition count 1707
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7405 place count 2207 transition count 1706
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7407 place count 2206 transition count 1705
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7609 place count 2105 transition count 1771
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7811 place count 2004 transition count 1839
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8005 place count 1907 transition count 1904
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8007 place count 1905 transition count 1902
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8009 place count 1903 transition count 1902
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8009 place count 1903 transition count 1901
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8011 place count 1902 transition count 1901
Applied a total of 8011 rules in 2186 ms. Remains 1902 /5910 variables (removed 4008) and now considering 1901/5410 (removed 3509) transitions.
// Phase 1: matrix 1901 rows 1902 cols
[2023-03-20 01:16:21] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-20 01:16:23] [INFO ] Implicit Places using invariants in 2238 ms returned [1891]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2246 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1901/5910 places, 1901/5410 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1900 transition count 1900
Applied a total of 2 rules in 117 ms. Remains 1900 /1901 variables (removed 1) and now considering 1900/1901 (removed 1) transitions.
// Phase 1: matrix 1900 rows 1900 cols
[2023-03-20 01:16:23] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:16:25] [INFO ] Implicit Places using invariants in 1681 ms returned []
[2023-03-20 01:16:25] [INFO ] Invariant cache hit.
[2023-03-20 01:16:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 01:16:29] [INFO ] Implicit Places using invariants and state equation in 3965 ms returned []
Implicit Place search using SMT with State Equation took 5690 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1900/5910 places, 1900/5410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10239 ms. Remains : 1900/5910 places, 1900/5410 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s839 1) (EQ s858 1)), p0:(EQ s1216 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-14 finished in 10386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U G(p1)))))'
Support contains 2 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 5901 transition count 5401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 5901 transition count 5401
Applied a total of 18 rules in 1978 ms. Remains 5901 /5910 variables (removed 9) and now considering 5401/5410 (removed 9) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2023-03-20 01:16:31] [INFO ] Computed 901 place invariants in 55 ms
[2023-03-20 01:16:33] [INFO ] Implicit Places using invariants in 2227 ms returned []
[2023-03-20 01:16:33] [INFO ] Invariant cache hit.
[2023-03-20 01:16:36] [INFO ] Implicit Places using invariants and state equation in 2653 ms returned []
Implicit Place search using SMT with State Equation took 4906 ms to find 0 implicit places.
[2023-03-20 01:16:36] [INFO ] Invariant cache hit.
[2023-03-20 01:16:42] [INFO ] Dead Transitions using invariants and state equation in 6076 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5910 places, 5401/5410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12993 ms. Remains : 5901/5910 places, 5401/5410 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s5658 1), p0:(EQ s4129 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 261 reset in 696 ms.
Product exploration explored 100000 steps with 251 reset in 864 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/5901 stabilizing places and 1598/5401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 2232 steps, including 0 resets, run visited all 4 properties in 69 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 276 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
[2023-03-20 01:16:45] [INFO ] Invariant cache hit.
[2023-03-20 01:16:56] [INFO ] [Real]Absence check using 901 positive place invariants in 3417 ms returned unsat
Proved EG (NOT p1)
[2023-03-20 01:16:56] [INFO ] Invariant cache hit.
[2023-03-20 01:17:06] [INFO ] [Real]Absence check using 901 positive place invariants in 4390 ms returned sat
[2023-03-20 01:17:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:17:11] [INFO ] [Real]Absence check using state equation in 5236 ms returned unknown
Could not prove EG (NOT p0)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 350 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100B-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100B-LTLFireability-15 finished in 41994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-100B-LTLFireability-05
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5909 transition count 4210
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4710 transition count 4210
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2398 place count 4710 transition count 3414
Deduced a syphon composed of 796 places in 11 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 3990 place count 3914 transition count 3414
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 3997 place count 3907 transition count 3407
Iterating global reduction 2 with 7 rules applied. Total rules applied 4004 place count 3907 transition count 3407
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4004 place count 3907 transition count 3401
Deduced a syphon composed of 6 places in 10 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 4016 place count 3901 transition count 3401
Performed 1696 Post agglomeration using F-continuation condition.Transition count delta: 1696
Deduced a syphon composed of 1696 places in 4 ms
Reduce places removed 1696 places and 0 transitions.
Iterating global reduction 2 with 3392 rules applied. Total rules applied 7408 place count 2205 transition count 1705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7409 place count 2205 transition count 1704
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7411 place count 2204 transition count 1703
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7613 place count 2103 transition count 1769
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7815 place count 2002 transition count 1837
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8009 place count 1905 transition count 1902
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8011 place count 1903 transition count 1900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8013 place count 1901 transition count 1900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8013 place count 1901 transition count 1899
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8015 place count 1900 transition count 1899
Applied a total of 8015 rules in 2000 ms. Remains 1900 /5910 variables (removed 4010) and now considering 1899/5410 (removed 3511) transitions.
// Phase 1: matrix 1899 rows 1900 cols
[2023-03-20 01:17:13] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-20 01:17:15] [INFO ] Implicit Places using invariants in 1859 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1861 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1899/5910 places, 1899/5410 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1898
Applied a total of 2 rules in 139 ms. Remains 1898 /1899 variables (removed 1) and now considering 1898/1899 (removed 1) transitions.
// Phase 1: matrix 1898 rows 1898 cols
[2023-03-20 01:17:15] [INFO ] Computed 898 place invariants in 4 ms
[2023-03-20 01:17:17] [INFO ] Implicit Places using invariants in 2023 ms returned []
[2023-03-20 01:17:17] [INFO ] Invariant cache hit.
[2023-03-20 01:17:21] [INFO ] Implicit Places using invariants and state equation in 3266 ms returned []
Implicit Place search using SMT with State Equation took 5307 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1898/5910 places, 1898/5410 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 9308 ms. Remains : 1898/5910 places, 1898/5410 transitions.
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s90 1) (NEQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1413 ms.
Product exploration explored 100000 steps with 0 reset in 1926 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 231 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) 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 109603 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109603 steps, saw 68332 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:17:28] [INFO ] Invariant cache hit.
[2023-03-20 01:17:29] [INFO ] [Real]Absence check using 898 positive place invariants in 228 ms returned sat
[2023-03-20 01:17:30] [INFO ] After 1931ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:17:30] [INFO ] [Nat]Absence check using 898 positive place invariants in 151 ms returned sat
[2023-03-20 01:17:31] [INFO ] After 1011ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:17:31] [INFO ] After 1161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 135 ms.
[2023-03-20 01:17:32] [INFO ] After 1773ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 60 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1898 transition count 1897
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1897
Applied a total of 2 rules in 119 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1898 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 1898/1898 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 104404 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104404 steps, saw 66416 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-20 01:17:35] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:17:36] [INFO ] [Real]Absence check using 898 positive place invariants in 248 ms returned sat
[2023-03-20 01:17:37] [INFO ] After 1640ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:17:37] [INFO ] [Nat]Absence check using 898 positive place invariants in 237 ms returned sat
[2023-03-20 01:17:39] [INFO ] After 1279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:17:39] [INFO ] After 1414ms 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 01:17:39] [INFO ] After 2123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 44 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 110 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 100 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-20 01:17:39] [INFO ] Invariant cache hit.
[2023-03-20 01:17:41] [INFO ] Implicit Places using invariants in 2221 ms returned []
[2023-03-20 01:17:41] [INFO ] Invariant cache hit.
[2023-03-20 01:17:45] [INFO ] Implicit Places using invariants and state equation in 3507 ms returned []
Implicit Place search using SMT with State Equation took 5730 ms to find 0 implicit places.
[2023-03-20 01:17:45] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-20 01:17:45] [INFO ] Invariant cache hit.
[2023-03-20 01:17:47] [INFO ] Dead Transitions using invariants and state equation in 1793 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7704 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 202 times.
Drop transitions removed 202 transitions
Iterating global reduction 0 with 202 rules applied. Total rules applied 202 place count 1898 transition count 1897
Applied a total of 202 rules in 174 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-20 01:17:47] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:17:47] [INFO ] [Real]Absence check using 898 positive place invariants in 147 ms returned sat
[2023-03-20 01:17:48] [INFO ] After 1392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:17:49] [INFO ] [Nat]Absence check using 898 positive place invariants in 150 ms returned sat
[2023-03-20 01:17:50] [INFO ] After 1091ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:17:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 01:17:50] [INFO ] After 140ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:17:50] [INFO ] After 327ms 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 01:17:50] [INFO ] After 1985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Applied a total of 0 rules in 51 ms. Remains 1898 /1898 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
// Phase 1: matrix 1898 rows 1898 cols
[2023-03-20 01:17:51] [INFO ] Computed 898 place invariants in 5 ms
[2023-03-20 01:17:52] [INFO ] Implicit Places using invariants in 1273 ms returned []
[2023-03-20 01:17:52] [INFO ] Invariant cache hit.
[2023-03-20 01:17:56] [INFO ] Implicit Places using invariants and state equation in 3678 ms returned []
Implicit Place search using SMT with State Equation took 4958 ms to find 0 implicit places.
[2023-03-20 01:17:56] [INFO ] Invariant cache hit.
[2023-03-20 01:17:58] [INFO ] Dead Transitions using invariants and state equation in 1541 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6550 ms. Remains : 1898/1898 places, 1898/1898 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 54 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 105389 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105389 steps, saw 65818 distinct states, run finished after 3014 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:18:01] [INFO ] Invariant cache hit.
[2023-03-20 01:18:02] [INFO ] [Real]Absence check using 898 positive place invariants in 162 ms returned sat
[2023-03-20 01:18:03] [INFO ] After 1441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:18:03] [INFO ] [Nat]Absence check using 898 positive place invariants in 147 ms returned sat
[2023-03-20 01:18:05] [INFO ] After 1457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:18:05] [INFO ] After 1609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-20 01:18:05] [INFO ] After 2268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1898 transition count 1897
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1897
Applied a total of 2 rules in 122 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1898 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 1898/1898 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 103659 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103659 steps, saw 66007 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-20 01:18:08] [INFO ] Computed 898 place invariants in 16 ms
[2023-03-20 01:18:09] [INFO ] [Real]Absence check using 898 positive place invariants in 187 ms returned sat
[2023-03-20 01:18:10] [INFO ] After 1726ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:18:11] [INFO ] [Nat]Absence check using 898 positive place invariants in 390 ms returned sat
[2023-03-20 01:18:12] [INFO ] After 864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:18:12] [INFO ] After 977ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-20 01:18:12] [INFO ] After 1694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 52 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 51 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-20 01:18:12] [INFO ] Invariant cache hit.
[2023-03-20 01:18:14] [INFO ] Implicit Places using invariants in 2479 ms returned []
[2023-03-20 01:18:14] [INFO ] Invariant cache hit.
[2023-03-20 01:18:18] [INFO ] Implicit Places using invariants and state equation in 3571 ms returned []
Implicit Place search using SMT with State Equation took 6060 ms to find 0 implicit places.
[2023-03-20 01:18:18] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-20 01:18:18] [INFO ] Invariant cache hit.
[2023-03-20 01:18:19] [INFO ] Dead Transitions using invariants and state equation in 1307 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7496 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 202 times.
Drop transitions removed 202 transitions
Iterating global reduction 0 with 202 rules applied. Total rules applied 202 place count 1898 transition count 1897
Applied a total of 202 rules in 102 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-20 01:18:19] [INFO ] Computed 898 place invariants in 5 ms
[2023-03-20 01:18:20] [INFO ] [Real]Absence check using 898 positive place invariants in 283 ms returned sat
[2023-03-20 01:18:21] [INFO ] After 1772ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:18:22] [INFO ] [Nat]Absence check using 898 positive place invariants in 168 ms returned sat
[2023-03-20 01:18:23] [INFO ] After 1405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:18:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 01:18:23] [INFO ] After 121ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:18:23] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-20 01:18:24] [INFO ] After 2274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 306 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1365 ms.
Product exploration explored 100000 steps with 0 reset in 1964 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Applied a total of 0 rules in 102 ms. Remains 1898 /1898 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2023-03-20 01:18:28] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 1898 rows 1898 cols
[2023-03-20 01:18:28] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:18:30] [INFO ] Dead Transitions using invariants and state equation in 1195 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1353 ms. Remains : 1898/1898 places, 1898/1898 transitions.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Applied a total of 0 rules in 43 ms. Remains 1898 /1898 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2023-03-20 01:18:30] [INFO ] Invariant cache hit.
[2023-03-20 01:18:31] [INFO ] Implicit Places using invariants in 1343 ms returned []
[2023-03-20 01:18:31] [INFO ] Invariant cache hit.
[2023-03-20 01:18:35] [INFO ] Implicit Places using invariants and state equation in 3501 ms returned []
Implicit Place search using SMT with State Equation took 4861 ms to find 0 implicit places.
[2023-03-20 01:18:35] [INFO ] Invariant cache hit.
[2023-03-20 01:18:36] [INFO ] Dead Transitions using invariants and state equation in 1229 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6134 ms. Remains : 1898/1898 places, 1898/1898 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLFireability-05 finished in 84802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-100B-LTLFireability-13
Stuttering acceptance computed with spot in 233 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 5910 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5910/5910 places, 5410/5410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5909 transition count 4210
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4710 transition count 4210
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2398 place count 4710 transition count 3414
Deduced a syphon composed of 796 places in 12 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 3990 place count 3914 transition count 3414
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 3997 place count 3907 transition count 3407
Iterating global reduction 2 with 7 rules applied. Total rules applied 4004 place count 3907 transition count 3407
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4004 place count 3907 transition count 3401
Deduced a syphon composed of 6 places in 8 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 4016 place count 3901 transition count 3401
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 4 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 2 with 3394 rules applied. Total rules applied 7410 place count 2204 transition count 1704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7411 place count 2204 transition count 1703
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7413 place count 2203 transition count 1702
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7615 place count 2102 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7817 place count 2001 transition count 1835
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 6 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8009 place count 1905 transition count 1900
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8011 place count 1903 transition count 1898
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8013 place count 1901 transition count 1898
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8013 place count 1901 transition count 1897
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8015 place count 1900 transition count 1897
Applied a total of 8015 rules in 1987 ms. Remains 1900 /5910 variables (removed 4010) and now considering 1897/5410 (removed 3513) transitions.
// Phase 1: matrix 1897 rows 1900 cols
[2023-03-20 01:18:38] [INFO ] Computed 899 place invariants in 3 ms
[2023-03-20 01:18:40] [INFO ] Implicit Places using invariants in 1720 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1740 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1899/5910 places, 1897/5410 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1896
Applied a total of 2 rules in 112 ms. Remains 1898 /1899 variables (removed 1) and now considering 1896/1897 (removed 1) transitions.
// Phase 1: matrix 1896 rows 1898 cols
[2023-03-20 01:18:40] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:18:42] [INFO ] Implicit Places using invariants in 1725 ms returned []
[2023-03-20 01:18:42] [INFO ] Invariant cache hit.
[2023-03-20 01:18:45] [INFO ] Implicit Places using invariants and state equation in 3176 ms returned []
Implicit Place search using SMT with State Equation took 4923 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1898/5910 places, 1896/5410 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 8762 ms. Remains : 1898/5910 places, 1896/5410 transitions.
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(NEQ s820 1), p0:(NEQ s912 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1493 ms.
Product exploration explored 100000 steps with 0 reset in 2000 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 457 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 63134 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 63134 steps, saw 38895 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 01:18:53] [INFO ] Invariant cache hit.
[2023-03-20 01:18:54] [INFO ] [Real]Absence check using 898 positive place invariants in 319 ms returned sat
[2023-03-20 01:18:55] [INFO ] After 1873ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:18:56] [INFO ] [Nat]Absence check using 898 positive place invariants in 198 ms returned sat
[2023-03-20 01:18:57] [INFO ] After 1162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:18:58] [INFO ] After 1745ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 438 ms.
[2023-03-20 01:18:58] [INFO ] After 2913ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 326 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1896/1896 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1898 transition count 1895
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1897 transition count 1894
Applied a total of 3 rules in 110 ms. Remains 1897 /1898 variables (removed 1) and now considering 1894/1896 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 1897/1898 places, 1894/1896 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 51185 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 51185 steps, saw 31301 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1894 rows 1897 cols
[2023-03-20 01:19:03] [INFO ] Computed 898 place invariants in 4 ms
[2023-03-20 01:19:03] [INFO ] [Real]Absence check using 898 positive place invariants in 250 ms returned sat
[2023-03-20 01:19:05] [INFO ] After 2001ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:19:05] [INFO ] [Nat]Absence check using 898 positive place invariants in 208 ms returned sat
[2023-03-20 01:19:07] [INFO ] After 1495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:19:07] [INFO ] After 2092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 330 ms.
[2023-03-20 01:19:08] [INFO ] After 3172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 369 ms.
Support contains 2 out of 1897 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 57 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1897/1897 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 50 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-20 01:19:08] [INFO ] Invariant cache hit.
[2023-03-20 01:19:10] [INFO ] Implicit Places using invariants in 1555 ms returned []
[2023-03-20 01:19:10] [INFO ] Invariant cache hit.
[2023-03-20 01:19:13] [INFO ] Implicit Places using invariants and state equation in 2967 ms returned []
Implicit Place search using SMT with State Equation took 4523 ms to find 0 implicit places.
[2023-03-20 01:19:13] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-20 01:19:13] [INFO ] Invariant cache hit.
[2023-03-20 01:19:14] [INFO ] Dead Transitions using invariants and state equation in 1288 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5916 ms. Remains : 1897/1897 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1897 transition count 1894
Applied a total of 199 rules in 110 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1894 rows 1897 cols
[2023-03-20 01:19:14] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:19:15] [INFO ] [Real]Absence check using 898 positive place invariants in 298 ms returned sat
[2023-03-20 01:19:16] [INFO ] After 2009ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:19:17] [INFO ] [Nat]Absence check using 898 positive place invariants in 599 ms returned sat
[2023-03-20 01:19:19] [INFO ] After 1129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:19:19] [INFO ] After 1842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 432 ms.
[2023-03-20 01:19:20] [INFO ] After 3466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 615 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 199 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 places, 1896/1896 transitions.
Applied a total of 0 rules in 45 ms. Remains 1898 /1898 variables (removed 0) and now considering 1896/1896 (removed 0) transitions.
// Phase 1: matrix 1896 rows 1898 cols
[2023-03-20 01:19:21] [INFO ] Computed 898 place invariants in 5 ms
[2023-03-20 01:19:22] [INFO ] Implicit Places using invariants in 1361 ms returned []
[2023-03-20 01:19:22] [INFO ] Invariant cache hit.
[2023-03-20 01:19:26] [INFO ] Implicit Places using invariants and state equation in 4011 ms returned []
Implicit Place search using SMT with State Equation took 5395 ms to find 0 implicit places.
[2023-03-20 01:19:26] [INFO ] Invariant cache hit.
[2023-03-20 01:19:27] [INFO ] Dead Transitions using invariants and state equation in 1169 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6622 ms. Remains : 1898/1898 places, 1896/1896 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 404 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 57050 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57050 steps, saw 35118 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 01:19:32] [INFO ] Invariant cache hit.
[2023-03-20 01:19:32] [INFO ] [Real]Absence check using 898 positive place invariants in 164 ms returned sat
[2023-03-20 01:19:40] [INFO ] After 7546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:19:40] [INFO ] [Nat]Absence check using 898 positive place invariants in 233 ms returned sat
[2023-03-20 01:19:41] [INFO ] After 981ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:19:42] [INFO ] After 1579ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 395 ms.
[2023-03-20 01:19:42] [INFO ] After 2782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 376 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1896/1896 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1898 transition count 1895
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1897 transition count 1894
Applied a total of 3 rules in 122 ms. Remains 1897 /1898 variables (removed 1) and now considering 1894/1896 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 1897/1898 places, 1894/1896 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 64350 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64350 steps, saw 39928 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1894 rows 1897 cols
[2023-03-20 01:19:47] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:19:47] [INFO ] [Real]Absence check using 898 positive place invariants in 162 ms returned sat
[2023-03-20 01:19:48] [INFO ] After 1610ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:19:49] [INFO ] [Nat]Absence check using 898 positive place invariants in 266 ms returned sat
[2023-03-20 01:19:51] [INFO ] After 1319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:19:51] [INFO ] After 2062ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 538 ms.
[2023-03-20 01:19:52] [INFO ] After 3541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 276 ms.
Support contains 2 out of 1897 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 52 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1897/1897 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 1894/1894 transitions.
Applied a total of 0 rules in 54 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-20 01:19:52] [INFO ] Invariant cache hit.
[2023-03-20 01:19:54] [INFO ] Implicit Places using invariants in 1367 ms returned []
[2023-03-20 01:19:54] [INFO ] Invariant cache hit.
[2023-03-20 01:19:57] [INFO ] Implicit Places using invariants and state equation in 3247 ms returned []
Implicit Place search using SMT with State Equation took 4637 ms to find 0 implicit places.
[2023-03-20 01:19:57] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-20 01:19:57] [INFO ] Invariant cache hit.
[2023-03-20 01:19:59] [INFO ] Dead Transitions using invariants and state equation in 1493 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6231 ms. Remains : 1897/1897 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1897 transition count 1894
Applied a total of 199 rules in 133 ms. Remains 1897 /1897 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1894 rows 1897 cols
[2023-03-20 01:19:59] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:19:59] [INFO ] [Real]Absence check using 898 positive place invariants in 218 ms returned sat
[2023-03-20 01:20:01] [INFO ] After 1937ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:20:01] [INFO ] [Nat]Absence check using 898 positive place invariants in 232 ms returned sat
[2023-03-20 01:20:03] [INFO ] After 1571ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:20:04] [INFO ] After 2153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 457 ms.
[2023-03-20 01:20:04] [INFO ] After 3400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 629 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 292 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 217 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1364 ms.
Product exploration explored 100000 steps with 0 reset in 1844 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 216 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 1896/1896 transitions.
Applied a total of 0 rules in 95 ms. Remains 1898 /1898 variables (removed 0) and now considering 1896/1896 (removed 0) transitions.
[2023-03-20 01:20:09] [INFO ] Redundant transitions in 51 ms returned []
// Phase 1: matrix 1896 rows 1898 cols
[2023-03-20 01:20:09] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:20:11] [INFO ] Dead Transitions using invariants and state equation in 1394 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1578 ms. Remains : 1898/1898 places, 1896/1896 transitions.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 places, 1896/1896 transitions.
Applied a total of 0 rules in 58 ms. Remains 1898 /1898 variables (removed 0) and now considering 1896/1896 (removed 0) transitions.
[2023-03-20 01:20:11] [INFO ] Invariant cache hit.
[2023-03-20 01:20:12] [INFO ] Implicit Places using invariants in 1594 ms returned []
[2023-03-20 01:20:12] [INFO ] Invariant cache hit.
[2023-03-20 01:20:17] [INFO ] Implicit Places using invariants and state equation in 4394 ms returned []
Implicit Place search using SMT with State Equation took 6022 ms to find 0 implicit places.
[2023-03-20 01:20:17] [INFO ] Invariant cache hit.
[2023-03-20 01:20:18] [INFO ] Dead Transitions using invariants and state equation in 1549 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7645 ms. Remains : 1898/1898 places, 1896/1896 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLFireability-13 finished in 102278 ms.
[2023-03-20 01:20:19] [INFO ] Flatten gal took : 139 ms
[2023-03-20 01:20:19] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 01:20:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5910 places, 5410 transitions and 14020 arcs took 29 ms.
Total runtime 1047109 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-100B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/381
LTLFireability

BK_STOP 1679275317122

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/381/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/381/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/381/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldIIPt-PT-100B-LTLFireability-08
lola: time limit : 1198 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 4/1198 4/32 ShieldIIPt-PT-100B-LTLFireability-08 240409 m, 48081 m/sec, 350271 t fired, .

Time elapsed: 8 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 9/1198 10/32 ShieldIIPt-PT-100B-LTLFireability-08 608688 m, 73655 m/sec, 898793 t fired, .

Time elapsed: 13 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 14/1198 16/32 ShieldIIPt-PT-100B-LTLFireability-08 976722 m, 73606 m/sec, 1445525 t fired, .

Time elapsed: 18 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 19/1198 21/32 ShieldIIPt-PT-100B-LTLFireability-08 1342382 m, 73132 m/sec, 1987966 t fired, .

Time elapsed: 23 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 24/1198 27/32 ShieldIIPt-PT-100B-LTLFireability-08 1710291 m, 73581 m/sec, 2530104 t fired, .

Time elapsed: 28 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 29/1198 32/32 ShieldIIPt-PT-100B-LTLFireability-08 2078209 m, 73583 m/sec, 3070023 t fired, .

Time elapsed: 33 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for ShieldIIPt-PT-100B-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 38 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldIIPt-PT-100B-LTLFireability-13
lola: time limit : 1781 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1781 7/32 ShieldIIPt-PT-100B-LTLFireability-13 73858 m, 14771 m/sec, 188573 t fired, .

Time elapsed: 43 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1781 12/32 ShieldIIPt-PT-100B-LTLFireability-13 130815 m, 11391 m/sec, 381129 t fired, .

Time elapsed: 48 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1781 18/32 ShieldIIPt-PT-100B-LTLFireability-13 187649 m, 11366 m/sec, 573625 t fired, .

Time elapsed: 53 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1781 23/32 ShieldIIPt-PT-100B-LTLFireability-13 241959 m, 10862 m/sec, 766530 t fired, .

Time elapsed: 58 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1781 28/32 ShieldIIPt-PT-100B-LTLFireability-13 288532 m, 9314 m/sec, 961068 t fired, .

Time elapsed: 63 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for ShieldIIPt-PT-100B-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 68 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldIIPt-PT-100B-LTLFireability-05
lola: time limit : 3532 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3532 7/32 ShieldIIPt-PT-100B-LTLFireability-05 74357 m, 14871 m/sec, 190752 t fired, .

Time elapsed: 73 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3532 13/32 ShieldIIPt-PT-100B-LTLFireability-05 131543 m, 11437 m/sec, 383735 t fired, .

Time elapsed: 78 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3532 18/32 ShieldIIPt-PT-100B-LTLFireability-05 188726 m, 11436 m/sec, 577280 t fired, .

Time elapsed: 83 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3532 24/32 ShieldIIPt-PT-100B-LTLFireability-05 243305 m, 10915 m/sec, 770900 t fired, .

Time elapsed: 88 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3532 28/32 ShieldIIPt-PT-100B-LTLFireability-05 290248 m, 9388 m/sec, 966004 t fired, .

Time elapsed: 93 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for ShieldIIPt-PT-100B-LTLFireability-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 98 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-100B-LTLFireability-05: LTL unknown AGGR
ShieldIIPt-PT-100B-LTLFireability-08: LTL unknown AGGR
ShieldIIPt-PT-100B-LTLFireability-13: LTL unknown AGGR


Time elapsed: 98 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="ShieldIIPt-PT-100B"
export BK_EXAMINATION="LTLFireability"
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 ShieldIIPt-PT-100B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715200348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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