fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r391-oct2-167903715200347
Last Updated
May 14, 2023

About the Execution of LoLa+red for ShieldIIPt-PT-100B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2882.699 1091790.00 1310690.00 593.60 F???F?TFTFFTFFF? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903715200347.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715200347
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679274150773

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:02:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 01:02:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:02:33] [INFO ] Load time of PNML (sax parser for PT used): 281 ms
[2023-03-20 01:02:33] [INFO ] Transformed 7003 places.
[2023-03-20 01:02:33] [INFO ] Transformed 6503 transitions.
[2023-03-20 01:02:33] [INFO ] Found NUPN structural information;
[2023-03-20 01:02:34] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 637 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 7003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Discarding 1087 places :
Symmetric choice reduction at 0 with 1087 rule applications. Total rules 1087 place count 5916 transition count 5416
Iterating global reduction 0 with 1087 rules applied. Total rules applied 2174 place count 5916 transition count 5416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2175 place count 5915 transition count 5415
Iterating global reduction 0 with 1 rules applied. Total rules applied 2176 place count 5915 transition count 5415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2177 place count 5914 transition count 5414
Iterating global reduction 0 with 1 rules applied. Total rules applied 2178 place count 5914 transition count 5414
Applied a total of 2178 rules in 4412 ms. Remains 5914 /7003 variables (removed 1089) and now considering 5414/6503 (removed 1089) transitions.
// Phase 1: matrix 5414 rows 5914 cols
[2023-03-20 01:02:39] [INFO ] Computed 901 place invariants in 75 ms
[2023-03-20 01:02:43] [INFO ] Implicit Places using invariants in 4462 ms returned []
[2023-03-20 01:02:43] [INFO ] Invariant cache hit.
[2023-03-20 01:02:46] [INFO ] Implicit Places using invariants and state equation in 2455 ms returned []
Implicit Place search using SMT with State Equation took 6994 ms to find 0 implicit places.
[2023-03-20 01:02:46] [INFO ] Invariant cache hit.
[2023-03-20 01:02:51] [INFO ] Dead Transitions using invariants and state equation in 5363 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5914/7003 places, 5414/6503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16788 ms. Remains : 5914/7003 places, 5414/6503 transitions.
Support contains 43 out of 5914 places after structural reductions.
[2023-03-20 01:02:52] [INFO ] Flatten gal took : 382 ms
[2023-03-20 01:02:52] [INFO ] Flatten gal took : 267 ms
[2023-03-20 01:02:52] [INFO ] Input system was already deterministic with 5414 transitions.
Support contains 34 out of 5914 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 594 ms. (steps per millisecond=16 ) properties (out of 18) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-20 01:02:53] [INFO ] Invariant cache hit.
[2023-03-20 01:02:56] [INFO ] [Real]Absence check using 901 positive place invariants in 651 ms returned sat
[2023-03-20 01:02:56] [INFO ] After 2411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 01:02:58] [INFO ] [Nat]Absence check using 901 positive place invariants in 598 ms returned sat
[2023-03-20 01:03:06] [INFO ] After 6959ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 01:03:09] [INFO ] Deduced a trap composed of 27 places in 2277 ms of which 19 ms to minimize.
[2023-03-20 01:03:12] [INFO ] Deduced a trap composed of 20 places in 2885 ms of which 4 ms to minimize.
[2023-03-20 01:03:18] [INFO ] Deduced a trap composed of 13 places in 5976 ms of which 19 ms to minimize.
[2023-03-20 01:03:21] [INFO ] Deduced a trap composed of 24 places in 2672 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:03:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:03:21] [INFO ] After 25339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 3462 ms.
Support contains 19 out of 5914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Drop transitions removed 1189 transitions
Trivial Post-agglo rules discarded 1189 transitions
Performed 1189 trivial Post agglomeration. Transition count delta: 1189
Iterating post reduction 0 with 1189 rules applied. Total rules applied 1189 place count 5914 transition count 4225
Reduce places removed 1189 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1190 rules applied. Total rules applied 2379 place count 4725 transition count 4224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2380 place count 4724 transition count 4224
Performed 793 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 793 Pre rules applied. Total rules applied 2380 place count 4724 transition count 3431
Deduced a syphon composed of 793 places in 12 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 3 with 1586 rules applied. Total rules applied 3966 place count 3931 transition count 3431
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 3970 place count 3927 transition count 3427
Iterating global reduction 3 with 4 rules applied. Total rules applied 3974 place count 3927 transition count 3427
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 3974 place count 3927 transition count 3423
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 3982 place count 3923 transition count 3423
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 5 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 3 with 3402 rules applied. Total rules applied 7384 place count 2222 transition count 1722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7385 place count 2222 transition count 1721
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7387 place count 2221 transition count 1720
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 16 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7589 place count 2120 transition count 1785
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 15 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7791 place count 2019 transition count 1850
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 93 places in 6 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 4 with 186 rules applied. Total rules applied 7977 place count 1926 transition count 1910
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7978 place count 1926 transition count 1909
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 7981 place count 1926 transition count 1906
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 7984 place count 1923 transition count 1906
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 6 with 100 rules applied. Total rules applied 8084 place count 1923 transition count 1906
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 8085 place count 1922 transition count 1905
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 8087 place count 1920 transition count 1905
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 8087 place count 1920 transition count 1904
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 8089 place count 1919 transition count 1904
Applied a total of 8089 rules in 2156 ms. Remains 1919 /5914 variables (removed 3995) and now considering 1904/5414 (removed 3510) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2157 ms. Remains : 1919/5914 places, 1904/5414 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 50841 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 50841 steps, saw 33915 distinct states, run finished after 3007 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1904 rows 1919 cols
[2023-03-20 01:03:32] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-20 01:03:32] [INFO ] [Real]Absence check using 899 positive place invariants in 280 ms returned sat
[2023-03-20 01:03:33] [INFO ] After 910ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 01:03:33] [INFO ] [Nat]Absence check using 899 positive place invariants in 180 ms returned sat
[2023-03-20 01:03:35] [INFO ] After 1607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 01:03:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 01:03:36] [INFO ] After 1063ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 01:03:38] [INFO ] After 2820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1030 ms.
[2023-03-20 01:03:39] [INFO ] After 6619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 886 ms.
Support contains 19 out of 1919 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1919/1919 places, 1904/1904 transitions.
Applied a total of 0 rules in 51 ms. Remains 1919 /1919 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1919/1919 places, 1904/1904 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1919/1919 places, 1904/1904 transitions.
Applied a total of 0 rules in 50 ms. Remains 1919 /1919 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
[2023-03-20 01:03:40] [INFO ] Invariant cache hit.
[2023-03-20 01:03:42] [INFO ] Implicit Places using invariants in 1478 ms returned [1908]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1484 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1918/1919 places, 1904/1904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1917 transition count 1903
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1917 transition count 1903
Applied a total of 2 rules in 121 ms. Remains 1917 /1918 variables (removed 1) and now considering 1903/1904 (removed 1) transitions.
// Phase 1: matrix 1903 rows 1917 cols
[2023-03-20 01:03:42] [INFO ] Computed 898 place invariants in 5 ms
[2023-03-20 01:03:43] [INFO ] Implicit Places using invariants in 1582 ms returned []
[2023-03-20 01:03:43] [INFO ] Invariant cache hit.
[2023-03-20 01:03:45] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 01:03:47] [INFO ] Implicit Places using invariants and state equation in 3836 ms returned []
Implicit Place search using SMT with State Equation took 5424 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1917/1919 places, 1903/1904 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7079 ms. Remains : 1917/1919 places, 1903/1904 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 587 ms. (steps per millisecond=17 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 9) 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 9) seen :0
Interrupted probabilistic random walk after 51597 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 51597 steps, saw 36473 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-20 01:03:52] [INFO ] Invariant cache hit.
[2023-03-20 01:03:53] [INFO ] [Real]Absence check using 898 positive place invariants in 230 ms returned sat
[2023-03-20 01:03:53] [INFO ] After 761ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 01:03:54] [INFO ] [Nat]Absence check using 898 positive place invariants in 218 ms returned sat
[2023-03-20 01:03:56] [INFO ] After 1616ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 01:03:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 01:03:57] [INFO ] After 907ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 01:03:58] [INFO ] After 2334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 972 ms.
[2023-03-20 01:03:59] [INFO ] After 6163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 633 ms.
Support contains 19 out of 1917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 1903/1903 transitions.
Applied a total of 0 rules in 52 ms. Remains 1917 /1917 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1917/1917 places, 1903/1903 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1917/1917 places, 1903/1903 transitions.
Applied a total of 0 rules in 47 ms. Remains 1917 /1917 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2023-03-20 01:04:00] [INFO ] Invariant cache hit.
[2023-03-20 01:04:01] [INFO ] Implicit Places using invariants in 1413 ms returned []
[2023-03-20 01:04:01] [INFO ] Invariant cache hit.
[2023-03-20 01:04:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 01:04:05] [INFO ] Implicit Places using invariants and state equation in 4113 ms returned []
Implicit Place search using SMT with State Equation took 5528 ms to find 0 implicit places.
[2023-03-20 01:04:05] [INFO ] Redundant transitions in 121 ms returned []
[2023-03-20 01:04:05] [INFO ] Invariant cache hit.
[2023-03-20 01:04:07] [INFO ] Dead Transitions using invariants and state equation in 1097 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6815 ms. Remains : 1917/1917 places, 1903/1903 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1917 transition count 1903
Applied a total of 200 rules in 98 ms. Remains 1917 /1917 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 1903 rows 1917 cols
[2023-03-20 01:04:07] [INFO ] Computed 898 place invariants in 11 ms
[2023-03-20 01:04:07] [INFO ] [Real]Absence check using 898 positive place invariants in 214 ms returned sat
[2023-03-20 01:04:07] [INFO ] After 811ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 01:04:08] [INFO ] [Nat]Absence check using 898 positive place invariants in 210 ms returned sat
[2023-03-20 01:04:11] [INFO ] After 1858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 01:04:11] [INFO ] State equation strengthened by 197 read => feed constraints.
[2023-03-20 01:04:12] [INFO ] After 1356ms SMT Verify possible using 197 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 01:04:14] [INFO ] After 3314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1278 ms.
[2023-03-20 01:04:15] [INFO ] After 7734ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Computed a total of 1601 stabilizing places and 1601 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 5914 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5913 transition count 4215
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4715 transition count 4215
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2396 place count 4715 transition count 3419
Deduced a syphon composed of 796 places in 12 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 3988 place count 3919 transition count 3419
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 3998 place count 3909 transition count 3409
Iterating global reduction 2 with 10 rules applied. Total rules applied 4008 place count 3909 transition count 3409
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4008 place count 3909 transition count 3402
Deduced a syphon composed of 7 places in 13 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 4022 place count 3902 transition count 3402
Performed 1695 Post agglomeration using F-continuation condition.Transition count delta: 1695
Deduced a syphon composed of 1695 places in 5 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 2 with 3390 rules applied. Total rules applied 7412 place count 2207 transition count 1707
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7413 place count 2207 transition count 1706
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7415 place count 2206 transition count 1705
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7617 place count 2105 transition count 1771
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7819 place count 2004 transition count 1839
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 96 places in 11 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8011 place count 1908 transition count 1903
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 8012 place count 1908 transition count 1903
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8014 place count 1906 transition count 1901
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8016 place count 1904 transition count 1901
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8016 place count 1904 transition count 1900
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8018 place count 1903 transition count 1900
Applied a total of 8018 rules in 1838 ms. Remains 1903 /5914 variables (removed 4011) and now considering 1900/5414 (removed 3514) transitions.
// Phase 1: matrix 1900 rows 1903 cols
[2023-03-20 01:04:18] [INFO ] Computed 899 place invariants in 10 ms
[2023-03-20 01:04:19] [INFO ] Implicit Places using invariants in 1743 ms returned [1892]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1746 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1902/5914 places, 1900/5414 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1901 transition count 1899
Applied a total of 2 rules in 125 ms. Remains 1901 /1902 variables (removed 1) and now considering 1899/1900 (removed 1) transitions.
// Phase 1: matrix 1899 rows 1901 cols
[2023-03-20 01:04:19] [INFO ] Computed 898 place invariants in 9 ms
[2023-03-20 01:04:21] [INFO ] Implicit Places using invariants in 1722 ms returned []
[2023-03-20 01:04:21] [INFO ] Invariant cache hit.
[2023-03-20 01:04:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 01:04:25] [INFO ] Implicit Places using invariants and state equation in 3943 ms returned []
Implicit Place search using SMT with State Equation took 5698 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1901/5914 places, 1899/5414 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9409 ms. Remains : 1901/5914 places, 1899/5414 transitions.
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s1785 0) (EQ s1328 1)), p1:(EQ s267 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-00 finished in 9930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 5914 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5913 transition count 4215
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4715 transition count 4215
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 795 Pre rules applied. Total rules applied 2396 place count 4715 transition count 3420
Deduced a syphon composed of 795 places in 9 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 2 with 1590 rules applied. Total rules applied 3986 place count 3920 transition count 3420
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 3995 place count 3911 transition count 3411
Iterating global reduction 2 with 9 rules applied. Total rules applied 4004 place count 3911 transition count 3411
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4004 place count 3911 transition count 3404
Deduced a syphon composed of 7 places in 10 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 4018 place count 3904 transition count 3404
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 4 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7416 place count 2205 transition count 1705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7417 place count 2205 transition count 1704
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7419 place count 2204 transition count 1703
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7621 place count 2103 transition count 1769
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7823 place count 2002 transition count 1837
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 6 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8017 place count 1905 transition count 1902
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8019 place count 1903 transition count 1900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8021 place count 1901 transition count 1900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8021 place count 1901 transition count 1899
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8023 place count 1900 transition count 1899
Applied a total of 8023 rules in 1736 ms. Remains 1900 /5914 variables (removed 4014) and now considering 1899/5414 (removed 3515) transitions.
// Phase 1: matrix 1899 rows 1900 cols
[2023-03-20 01:04:27] [INFO ] Computed 899 place invariants in 9 ms
[2023-03-20 01:04:29] [INFO ] Implicit Places using invariants in 1368 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1374 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/5914 places, 1899/5414 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 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 90 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:04:29] [INFO ] Computed 898 place invariants in 9 ms
[2023-03-20 01:04:30] [INFO ] Implicit Places using invariants in 1383 ms returned []
[2023-03-20 01:04:30] [INFO ] Invariant cache hit.
[2023-03-20 01:04:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 01:04:33] [INFO ] Implicit Places using invariants and state equation in 3340 ms returned []
Implicit Place search using SMT with State Equation took 4739 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1898/5914 places, 1898/5414 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7940 ms. Remains : 1898/5914 places, 1898/5414 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1295 0) (EQ s1063 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1508 ms.
Product exploration explored 100000 steps with 0 reset in 1920 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) 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 100913 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100913 steps, saw 61723 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:04:41] [INFO ] Invariant cache hit.
[2023-03-20 01:04:41] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:04:41] [INFO ] [Nat]Absence check using 898 positive place invariants in 213 ms returned sat
[2023-03-20 01:04:42] [INFO ] After 941ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:04:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 01:04:43] [INFO ] After 88ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:04:43] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-20 01:04:43] [INFO ] After 1716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 43 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1898 transition count 1897
Applied a total of 1 rules in 62 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 62 ms. Remains : 1898/1898 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101039 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101039 steps, saw 63516 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2023-03-20 01:04:46] [INFO ] Computed 898 place invariants in 9 ms
[2023-03-20 01:04:46] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:04:47] [INFO ] [Nat]Absence check using 898 positive place invariants in 216 ms returned sat
[2023-03-20 01:04:48] [INFO ] After 990ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:04:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 01:04:48] [INFO ] After 95ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:04:48] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-20 01:04:48] [INFO ] After 1847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 52 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 54 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 54 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:04:48] [INFO ] Invariant cache hit.
[2023-03-20 01:04:50] [INFO ] Implicit Places using invariants in 1268 ms returned []
[2023-03-20 01:04:50] [INFO ] Invariant cache hit.
[2023-03-20 01:04:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 01:04:53] [INFO ] Implicit Places using invariants and state equation in 3488 ms returned []
Implicit Place search using SMT with State Equation took 4772 ms to find 0 implicit places.
[2023-03-20 01:04:53] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-20 01:04:53] [INFO ] Invariant cache hit.
[2023-03-20 01:04:55] [INFO ] Dead Transitions using invariants and state equation in 1329 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6322 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1898 transition count 1897
Applied a total of 200 rules in 94 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:04:55] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:04:55] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:04:55] [INFO ] [Nat]Absence check using 898 positive place invariants in 221 ms returned sat
[2023-03-20 01:04:57] [INFO ] After 1133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:04:57] [INFO ] After 1269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-20 01:04:57] [INFO ] After 1825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Applied a total of 0 rules in 83 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:04:57] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-20 01:04:59] [INFO ] Implicit Places using invariants in 1694 ms returned []
[2023-03-20 01:04:59] [INFO ] Invariant cache hit.
[2023-03-20 01:05:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 01:05:03] [INFO ] Implicit Places using invariants and state equation in 3445 ms returned []
Implicit Place search using SMT with State Equation took 5163 ms to find 0 implicit places.
[2023-03-20 01:05:03] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-20 01:05:03] [INFO ] Invariant cache hit.
[2023-03-20 01:05:04] [INFO ] Dead Transitions using invariants and state equation in 1182 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6479 ms. Remains : 1898/1898 places, 1898/1898 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) 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 102863 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102863 steps, saw 62892 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:05:07] [INFO ] Invariant cache hit.
[2023-03-20 01:05:08] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:05:08] [INFO ] [Nat]Absence check using 898 positive place invariants in 244 ms returned sat
[2023-03-20 01:05:09] [INFO ] After 972ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:05:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 01:05:09] [INFO ] After 79ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:05:09] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-20 01:05:09] [INFO ] After 1763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1898 transition count 1897
Applied a total of 1 rules in 51 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1898 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1898/1898 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 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 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 103326 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103326 steps, saw 65004 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:05:13] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-20 01:05:13] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:05:13] [INFO ] [Nat]Absence check using 898 positive place invariants in 226 ms returned sat
[2023-03-20 01:05:14] [INFO ] After 938ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:05:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 01:05:15] [INFO ] After 105ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:05:15] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-20 01:05:15] [INFO ] After 1809ms 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 96 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 96 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 44 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-20 01:05:15] [INFO ] Invariant cache hit.
[2023-03-20 01:05:16] [INFO ] Implicit Places using invariants in 1501 ms returned []
[2023-03-20 01:05:16] [INFO ] Invariant cache hit.
[2023-03-20 01:05:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 01:05:19] [INFO ] Implicit Places using invariants and state equation in 2870 ms returned []
Implicit Place search using SMT with State Equation took 4377 ms to find 0 implicit places.
[2023-03-20 01:05:19] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-20 01:05:19] [INFO ] Invariant cache hit.
[2023-03-20 01:05:21] [INFO ] Dead Transitions using invariants and state equation in 1171 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5632 ms. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1898 transition count 1897
Applied a total of 200 rules in 106 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:05:21] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:05:21] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:05:21] [INFO ] [Nat]Absence check using 898 positive place invariants in 151 ms returned sat
[2023-03-20 01:05:22] [INFO ] After 1043ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:05:22] [INFO ] After 1136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-20 01:05:23] [INFO ] After 1623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1259 ms.
Product exploration explored 100000 steps with 0 reset in 1920 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 68 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:05:26] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:05:28] [INFO ] Implicit Places using invariants in 1262 ms returned []
[2023-03-20 01:05:28] [INFO ] Invariant cache hit.
[2023-03-20 01:05:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 01:05:31] [INFO ] Implicit Places using invariants and state equation in 3491 ms returned []
Implicit Place search using SMT with State Equation took 4763 ms to find 0 implicit places.
[2023-03-20 01:05:31] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-20 01:05:31] [INFO ] Invariant cache hit.
[2023-03-20 01:05:32] [INFO ] Dead Transitions using invariants and state equation in 1146 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6040 ms. Remains : 1898/1898 places, 1898/1898 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-01 finished in 67059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(G(p2)))))'
Support contains 5 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5903 transition count 5403
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5903 transition count 5403
Applied a total of 22 rules in 1538 ms. Remains 5903 /5914 variables (removed 11) and now considering 5403/5414 (removed 11) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2023-03-20 01:05:34] [INFO ] Computed 901 place invariants in 44 ms
[2023-03-20 01:05:36] [INFO ] Implicit Places using invariants in 2241 ms returned []
[2023-03-20 01:05:36] [INFO ] Invariant cache hit.
[2023-03-20 01:05:38] [INFO ] Implicit Places using invariants and state equation in 2040 ms returned []
Implicit Place search using SMT with State Equation took 4284 ms to find 0 implicit places.
[2023-03-20 01:05:38] [INFO ] Invariant cache hit.
[2023-03-20 01:05:43] [INFO ] Dead Transitions using invariants and state equation in 4775 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5903/5914 places, 5403/5414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10600 ms. Remains : 5903/5914 places, 5403/5414 transitions.
Stuttering acceptance computed with spot in 307 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(EQ s2169 1), p0:(OR (EQ s2008 0) (EQ s5409 1)), p2:(AND (EQ s2169 0) (OR (EQ s1734 0) (EQ s5800 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1412 ms.
Product exploration explored 100000 steps with 0 reset in 1794 ms.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Computed a total of 1599 stabilizing places and 1599 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 513 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 01:05:48] [INFO ] Invariant cache hit.
[2023-03-20 01:05:49] [INFO ] After 913ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:05:51] [INFO ] [Nat]Absence check using 901 positive place invariants in 633 ms returned sat
[2023-03-20 01:05:57] [INFO ] After 5490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:05:59] [INFO ] Deduced a trap composed of 17 places in 2521 ms of which 4 ms to minimize.
[2023-03-20 01:06:02] [INFO ] Deduced a trap composed of 24 places in 2446 ms of which 3 ms to minimize.
[2023-03-20 01:06:07] [INFO ] Deduced a trap composed of 27 places in 5058 ms of which 19 ms to minimize.
[2023-03-20 01:06:10] [INFO ] Deduced a trap composed of 23 places in 2312 ms of which 3 ms to minimize.
[2023-03-20 01:06:12] [INFO ] Deduced a trap composed of 20 places in 2397 ms of which 4 ms to minimize.
[2023-03-20 01:06:15] [INFO ] Deduced a trap composed of 19 places in 2085 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:06:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:06:15] [INFO ] After 25545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 2 properties in 565 ms.
Support contains 5 out of 5903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Drop transitions removed 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1196 rules applied. Total rules applied 1196 place count 5903 transition count 4207
Reduce places removed 1196 places and 0 transitions.
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2392 place count 4707 transition count 4207
Performed 801 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 801 Pre rules applied. Total rules applied 2392 place count 4707 transition count 3406
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 3994 place count 3906 transition count 3406
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 7390 place count 2208 transition count 1708
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7391 place count 2208 transition count 1707
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 7393 place count 2207 transition count 1706
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 7595 place count 2106 transition count 1772
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 7797 place count 2005 transition count 1840
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 7991 place count 1908 transition count 1905
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7992 place count 1908 transition count 1904
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 4 with 99 rules applied. Total rules applied 8091 place count 1908 transition count 1904
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8092 place count 1907 transition count 1903
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8094 place count 1905 transition count 1903
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8094 place count 1905 transition count 1902
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 8096 place count 1904 transition count 1902
Applied a total of 8096 rules in 1274 ms. Remains 1904 /5903 variables (removed 3999) and now considering 1902/5403 (removed 3501) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1288 ms. Remains : 1904/5903 places, 1902/5403 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
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 626 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 5903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Applied a total of 0 rules in 749 ms. Remains 5903 /5903 variables (removed 0) and now considering 5403/5403 (removed 0) transitions.
[2023-03-20 01:06:19] [INFO ] Invariant cache hit.
[2023-03-20 01:06:21] [INFO ] Implicit Places using invariants in 2227 ms returned []
[2023-03-20 01:06:21] [INFO ] Invariant cache hit.
[2023-03-20 01:06:23] [INFO ] Implicit Places using invariants and state equation in 1811 ms returned []
Implicit Place search using SMT with State Equation took 4045 ms to find 0 implicit places.
[2023-03-20 01:06:23] [INFO ] Invariant cache hit.
[2023-03-20 01:06:31] [INFO ] Dead Transitions using invariants and state equation in 8914 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13715 ms. Remains : 5903/5903 places, 5403/5403 transitions.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Computed a total of 1599 stabilizing places and 1599 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 01:06:33] [INFO ] Invariant cache hit.
[2023-03-20 01:06:33] [INFO ] After 771ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:06:35] [INFO ] [Nat]Absence check using 901 positive place invariants in 610 ms returned sat
[2023-03-20 01:06:40] [INFO ] After 5234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:06:43] [INFO ] Deduced a trap composed of 17 places in 2946 ms of which 3 ms to minimize.
[2023-03-20 01:06:52] [INFO ] Deduced a trap composed of 24 places in 8778 ms of which 7 ms to minimize.
[2023-03-20 01:06:55] [INFO ] Deduced a trap composed of 27 places in 2721 ms of which 17 ms to minimize.
[2023-03-20 01:06:58] [INFO ] Deduced a trap composed of 23 places in 2742 ms of which 3 ms to minimize.
[2023-03-20 01:07:01] [INFO ] Deduced a trap composed of 20 places in 2426 ms of which 16 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:07:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:07:01] [INFO ] After 27344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 2 properties in 472 ms.
Support contains 5 out of 5903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Drop transitions removed 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1196 rules applied. Total rules applied 1196 place count 5903 transition count 4207
Reduce places removed 1196 places and 0 transitions.
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2392 place count 4707 transition count 4207
Performed 801 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 801 Pre rules applied. Total rules applied 2392 place count 4707 transition count 3406
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 3994 place count 3906 transition count 3406
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 7390 place count 2208 transition count 1708
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7391 place count 2208 transition count 1707
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 7393 place count 2207 transition count 1706
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7595 place count 2106 transition count 1772
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 7797 place count 2005 transition count 1840
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 7991 place count 1908 transition count 1905
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7992 place count 1908 transition count 1904
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 4 with 99 rules applied. Total rules applied 8091 place count 1908 transition count 1904
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8092 place count 1907 transition count 1903
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8094 place count 1905 transition count 1903
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8094 place count 1905 transition count 1902
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 8096 place count 1904 transition count 1902
Applied a total of 8096 rules in 1348 ms. Remains 1904 /5903 variables (removed 3999) and now considering 1902/5403 (removed 3501) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1348 ms. Remains : 1904/5903 places, 1902/5403 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 495 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 420 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 1378 ms.
Product exploration explored 100000 steps with 0 reset in 1763 ms.
Applying partial POR strategy [true, true, true, true, false, false]
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 5903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Performed 1196 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1196 rules applied. Total rules applied 1196 place count 5903 transition count 5403
Performed 403 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 403 Pre rules applied. Total rules applied 1196 place count 5903 transition count 5706
Deduced a syphon composed of 1599 places in 16 ms
Iterating global reduction 1 with 403 rules applied. Total rules applied 1599 place count 5903 transition count 5706
Performed 1996 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3595 places in 11 ms
Iterating global reduction 1 with 1996 rules applied. Total rules applied 3595 place count 5903 transition count 5706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3596 place count 5903 transition count 5705
Renaming transitions due to excessive name length > 1024 char.
Discarding 798 places :
Symmetric choice reduction at 2 with 798 rule applications. Total rules 4394 place count 5105 transition count 4907
Deduced a syphon composed of 2797 places in 9 ms
Iterating global reduction 2 with 798 rules applied. Total rules applied 5192 place count 5105 transition count 4907
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2798 places in 10 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5193 place count 5105 transition count 4907
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5195 place count 5103 transition count 4905
Deduced a syphon composed of 2796 places in 9 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5197 place count 5103 transition count 4905
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 2897 places in 14 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5298 place count 5103 transition count 5435
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5399 place count 5002 transition count 5233
Deduced a syphon composed of 2796 places in 10 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5500 place count 5002 transition count 5233
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -532
Deduced a syphon composed of 2897 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5601 place count 5002 transition count 5765
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5702 place count 4901 transition count 5563
Deduced a syphon composed of 2796 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5803 place count 4901 transition count 5563
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 2897 places in 13 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5904 place count 4901 transition count 6093
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6005 place count 4800 transition count 5891
Deduced a syphon composed of 2796 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6106 place count 4800 transition count 5891
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -517
Deduced a syphon composed of 2892 places in 12 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6202 place count 4800 transition count 6408
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 6298 place count 4704 transition count 6216
Deduced a syphon composed of 2796 places in 12 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6394 place count 4704 transition count 6216
Deduced a syphon composed of 2796 places in 15 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 6403 place count 4704 transition count 6207
Deduced a syphon composed of 2796 places in 12 ms
Applied a total of 6403 rules in 8866 ms. Remains 4704 /5903 variables (removed 1199) and now considering 6207/5403 (removed -804) transitions.
[2023-03-20 01:07:17] [INFO ] Redundant transitions in 283 ms returned []
// Phase 1: matrix 6207 rows 4704 cols
[2023-03-20 01:07:17] [INFO ] Computed 901 place invariants in 135 ms
[2023-03-20 01:07:22] [INFO ] Dead Transitions using invariants and state equation in 4966 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4704/5903 places, 6207/5403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14144 ms. Remains : 4704/5903 places, 6207/5403 transitions.
Support contains 5 out of 5903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Applied a total of 0 rules in 860 ms. Remains 5903 /5903 variables (removed 0) and now considering 5403/5403 (removed 0) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2023-03-20 01:07:23] [INFO ] Computed 901 place invariants in 75 ms
[2023-03-20 01:07:25] [INFO ] Implicit Places using invariants in 2346 ms returned []
[2023-03-20 01:07:25] [INFO ] Invariant cache hit.
[2023-03-20 01:07:27] [INFO ] Implicit Places using invariants and state equation in 2051 ms returned []
Implicit Place search using SMT with State Equation took 4428 ms to find 0 implicit places.
[2023-03-20 01:07:27] [INFO ] Invariant cache hit.
[2023-03-20 01:07:32] [INFO ] Dead Transitions using invariants and state equation in 4615 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9927 ms. Remains : 5903/5903 places, 5403/5403 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-02 finished in 119370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 4 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5902 transition count 5402
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5902 transition count 5402
Applied a total of 24 rules in 1771 ms. Remains 5902 /5914 variables (removed 12) and now considering 5402/5414 (removed 12) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-20 01:07:34] [INFO ] Computed 901 place invariants in 38 ms
[2023-03-20 01:07:36] [INFO ] Implicit Places using invariants in 2293 ms returned []
[2023-03-20 01:07:36] [INFO ] Invariant cache hit.
[2023-03-20 01:07:38] [INFO ] Implicit Places using invariants and state equation in 2256 ms returned []
Implicit Place search using SMT with State Equation took 4552 ms to find 0 implicit places.
[2023-03-20 01:07:38] [INFO ] Invariant cache hit.
[2023-03-20 01:07:43] [INFO ] Dead Transitions using invariants and state equation in 4785 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5914 places, 5402/5414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11123 ms. Remains : 5902/5914 places, 5402/5414 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (EQ s2535 0) (EQ s4430 1)), p0:(OR (EQ s4865 0) (EQ s4703 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1393 ms.
Product exploration explored 100000 steps with 0 reset in 1752 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:07:47] [INFO ] Invariant cache hit.
[2023-03-20 01:07:48] [INFO ] After 754ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:07:49] [INFO ] [Nat]Absence check using 901 positive place invariants in 578 ms returned sat
[2023-03-20 01:07:54] [INFO ] After 4867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:08:06] [INFO ] Deduced a trap composed of 31 places in 11823 ms of which 6 ms to minimize.
[2023-03-20 01:08:10] [INFO ] Deduced a trap composed of 21 places in 3463 ms of which 3 ms to minimize.
[2023-03-20 01:08:12] [INFO ] Deduced a trap composed of 25 places in 2304 ms of which 4 ms to minimize.
[2023-03-20 01:08:15] [INFO ] Deduced a trap composed of 12 places in 2369 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:08:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:08:15] [INFO ] After 27005ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 120 ms.
Support contains 2 out of 5902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5902 transition count 4204
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4704 transition count 4204
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2396 place count 4704 transition count 3404
Deduced a syphon composed of 800 places in 10 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 3996 place count 3904 transition count 3404
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 3 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 2 with 3402 rules applied. Total rules applied 7398 place count 2203 transition count 1703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7399 place count 2203 transition count 1702
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7401 place count 2202 transition count 1701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7603 place count 2101 transition count 1767
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7805 place count 2000 transition count 1833
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 7997 place count 1904 transition count 1898
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7998 place count 1904 transition count 1897
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 8098 place count 1904 transition count 1897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8099 place count 1903 transition count 1896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8101 place count 1901 transition count 1896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8101 place count 1901 transition count 1895
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8103 place count 1900 transition count 1895
Applied a total of 8103 rules in 1349 ms. Remains 1900 /5902 variables (removed 4002) and now considering 1895/5402 (removed 3507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1349 ms. Remains : 1900/5902 places, 1895/5402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 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 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 92062 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92062 steps, saw 58508 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1895 rows 1900 cols
[2023-03-20 01:08:20] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-20 01:08:20] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:08:20] [INFO ] [Nat]Absence check using 899 positive place invariants in 236 ms returned sat
[2023-03-20 01:08:21] [INFO ] After 838ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:08:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 01:08:21] [INFO ] After 66ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:08:21] [INFO ] After 208ms 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:08:22] [INFO ] After 1707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 52 ms.
Support contains 2 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1895/1895 transitions.
Applied a total of 0 rules in 53 ms. Remains 1900 /1900 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1900/1900 places, 1895/1895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1895/1895 transitions.
Applied a total of 0 rules in 50 ms. Remains 1900 /1900 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
[2023-03-20 01:08:22] [INFO ] Invariant cache hit.
[2023-03-20 01:08:23] [INFO ] Implicit Places using invariants in 1734 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1739 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1900 places, 1895/1895 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1898 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1894
Applied a total of 2 rules in 124 ms. Remains 1898 /1899 variables (removed 1) and now considering 1894/1895 (removed 1) transitions.
// Phase 1: matrix 1894 rows 1898 cols
[2023-03-20 01:08:24] [INFO ] Computed 898 place invariants in 4 ms
[2023-03-20 01:08:25] [INFO ] Implicit Places using invariants in 1882 ms returned []
[2023-03-20 01:08:25] [INFO ] Invariant cache hit.
[2023-03-20 01:08:32] [INFO ] Implicit Places using invariants and state equation in 6789 ms returned []
Implicit Place search using SMT with State Equation took 8673 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1898/1900 places, 1894/1895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10586 ms. Remains : 1898/1900 places, 1894/1895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 94665 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94665 steps, saw 59747 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:08:36] [INFO ] Invariant cache hit.
[2023-03-20 01:08:36] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:08:36] [INFO ] [Nat]Absence check using 898 positive place invariants in 161 ms returned sat
[2023-03-20 01:08:37] [INFO ] After 968ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:08:37] [INFO ] After 1109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-20 01:08:37] [INFO ] After 1621ms 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, 1894/1894 transitions.
Applied a total of 0 rules in 53 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 103 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-20 01:08:38] [INFO ] Invariant cache hit.
[2023-03-20 01:08:39] [INFO ] Implicit Places using invariants in 1549 ms returned []
[2023-03-20 01:08:39] [INFO ] Invariant cache hit.
[2023-03-20 01:08:43] [INFO ] Implicit Places using invariants and state equation in 4162 ms returned []
Implicit Place search using SMT with State Equation took 5738 ms to find 0 implicit places.
[2023-03-20 01:08:43] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-20 01:08:43] [INFO ] Invariant cache hit.
[2023-03-20 01:08:45] [INFO ] Dead Transitions using invariants and state equation in 1235 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7172 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1898 transition count 1894
Applied a total of 200 rules in 99 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2023-03-20 01:08:45] [INFO ] Computed 898 place invariants in 5 ms
[2023-03-20 01:08:45] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:08:45] [INFO ] [Nat]Absence check using 898 positive place invariants in 168 ms returned sat
[2023-03-20 01:08:46] [INFO ] After 914ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:08:46] [INFO ] State equation strengthened by 198 read => feed constraints.
[2023-03-20 01:08:47] [INFO ] After 333ms SMT Verify possible using 198 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:08:47] [INFO ] After 501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-20 01:08:47] [INFO ] After 1984ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 265 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 5902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Applied a total of 0 rules in 909 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:08:49] [INFO ] Computed 901 place invariants in 48 ms
[2023-03-20 01:08:51] [INFO ] Implicit Places using invariants in 2568 ms returned []
[2023-03-20 01:08:51] [INFO ] Invariant cache hit.
[2023-03-20 01:08:54] [INFO ] Implicit Places using invariants and state equation in 2365 ms returned []
Implicit Place search using SMT with State Equation took 4936 ms to find 0 implicit places.
[2023-03-20 01:08:54] [INFO ] Invariant cache hit.
[2023-03-20 01:08:58] [INFO ] Dead Transitions using invariants and state equation in 4538 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10386 ms. Remains : 5902/5902 places, 5402/5402 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:08:59] [INFO ] Invariant cache hit.
[2023-03-20 01:09:00] [INFO ] After 625ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:09:01] [INFO ] [Nat]Absence check using 901 positive place invariants in 514 ms returned sat
[2023-03-20 01:09:06] [INFO ] After 5010ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:09:08] [INFO ] Deduced a trap composed of 31 places in 2334 ms of which 3 ms to minimize.
[2023-03-20 01:09:11] [INFO ] Deduced a trap composed of 21 places in 2562 ms of which 3 ms to minimize.
[2023-03-20 01:09:14] [INFO ] Deduced a trap composed of 25 places in 2411 ms of which 20 ms to minimize.
[2023-03-20 01:09:16] [INFO ] Deduced a trap composed of 12 places in 2321 ms of which 3 ms to minimize.
[2023-03-20 01:09:19] [INFO ] Deduced a trap composed of 27 places in 2219 ms of which 3 ms to minimize.
[2023-03-20 01:09:21] [INFO ] Deduced a trap composed of 36 places in 2016 ms of which 4 ms to minimize.
[2023-03-20 01:09:23] [INFO ] Deduced a trap composed of 20 places in 2314 ms of which 3 ms to minimize.
[2023-03-20 01:09:26] [INFO ] Deduced a trap composed of 17 places in 2552 ms of which 6 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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:09:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:09:26] [INFO ] After 26579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 172 ms.
Support contains 2 out of 5902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5902 transition count 4204
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4704 transition count 4204
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2396 place count 4704 transition count 3404
Deduced a syphon composed of 800 places in 12 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 3996 place count 3904 transition count 3404
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 3 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 2 with 3402 rules applied. Total rules applied 7398 place count 2203 transition count 1703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7399 place count 2203 transition count 1702
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7401 place count 2202 transition count 1701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7603 place count 2101 transition count 1767
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7805 place count 2000 transition count 1833
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 7997 place count 1904 transition count 1898
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7998 place count 1904 transition count 1897
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 8098 place count 1904 transition count 1897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8099 place count 1903 transition count 1896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8101 place count 1901 transition count 1896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8101 place count 1901 transition count 1895
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8103 place count 1900 transition count 1895
Applied a total of 8103 rules in 1360 ms. Remains 1900 /5902 variables (removed 4002) and now considering 1895/5402 (removed 3507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1360 ms. Remains : 1900/5902 places, 1895/5402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) 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 94111 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94111 steps, saw 59871 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1895 rows 1900 cols
[2023-03-20 01:09:31] [INFO ] Computed 899 place invariants in 7 ms
[2023-03-20 01:09:31] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:09:32] [INFO ] [Nat]Absence check using 899 positive place invariants in 148 ms returned sat
[2023-03-20 01:09:33] [INFO ] After 827ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:09:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 01:09:33] [INFO ] After 58ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:09:33] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-20 01:09:33] [INFO ] After 1476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1895/1895 transitions.
Applied a total of 0 rules in 50 ms. Remains 1900 /1900 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1900/1900 places, 1895/1895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1895/1895 transitions.
Applied a total of 0 rules in 51 ms. Remains 1900 /1900 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
[2023-03-20 01:09:33] [INFO ] Invariant cache hit.
[2023-03-20 01:09:34] [INFO ] Implicit Places using invariants in 1441 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1455 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1900 places, 1895/1895 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1898 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1894
Applied a total of 2 rules in 114 ms. Remains 1898 /1899 variables (removed 1) and now considering 1894/1895 (removed 1) transitions.
// Phase 1: matrix 1894 rows 1898 cols
[2023-03-20 01:09:34] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:09:36] [INFO ] Implicit Places using invariants in 1236 ms returned []
[2023-03-20 01:09:36] [INFO ] Invariant cache hit.
[2023-03-20 01:09:39] [INFO ] Implicit Places using invariants and state equation in 3255 ms returned []
Implicit Place search using SMT with State Equation took 4509 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1898/1900 places, 1894/1895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6129 ms. Remains : 1898/1900 places, 1894/1895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 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 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 92917 steps, run timeout after 3033 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92917 steps, saw 58612 distinct states, run finished after 3033 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:09:42] [INFO ] Invariant cache hit.
[2023-03-20 01:09:42] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:09:43] [INFO ] [Nat]Absence check using 898 positive place invariants in 175 ms returned sat
[2023-03-20 01:09:44] [INFO ] After 857ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:09:44] [INFO ] After 1007ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-20 01:09:44] [INFO ] After 1472ms 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, 1894/1894 transitions.
Applied a total of 0 rules in 59 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 58 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-20 01:09:44] [INFO ] Invariant cache hit.
[2023-03-20 01:09:46] [INFO ] Implicit Places using invariants in 1484 ms returned []
[2023-03-20 01:09:46] [INFO ] Invariant cache hit.
[2023-03-20 01:09:49] [INFO ] Implicit Places using invariants and state equation in 3117 ms returned []
Implicit Place search using SMT with State Equation took 4627 ms to find 0 implicit places.
[2023-03-20 01:09:49] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-20 01:09:49] [INFO ] Invariant cache hit.
[2023-03-20 01:09:50] [INFO ] Dead Transitions using invariants and state equation in 1176 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5924 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1898 transition count 1894
Applied a total of 200 rules in 148 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2023-03-20 01:09:50] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:09:50] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:09:51] [INFO ] [Nat]Absence check using 898 positive place invariants in 176 ms returned sat
[2023-03-20 01:09:52] [INFO ] After 903ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:09:52] [INFO ] State equation strengthened by 198 read => feed constraints.
[2023-03-20 01:09:52] [INFO ] After 398ms SMT Verify possible using 198 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:09:52] [INFO ] After 549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-20 01:09:52] [INFO ] After 2037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1583 ms.
Product exploration explored 100000 steps with 0 reset in 1990 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 5902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Performed 1198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5902 transition count 5402
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 400 Pre rules applied. Total rules applied 1198 place count 5902 transition count 5703
Deduced a syphon composed of 1598 places in 18 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 1598 place count 5902 transition count 5703
Performed 2000 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3598 places in 12 ms
Iterating global reduction 1 with 2000 rules applied. Total rules applied 3598 place count 5902 transition count 5704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3599 place count 5902 transition count 5703
Renaming transitions due to excessive name length > 1024 char.
Discarding 802 places :
Symmetric choice reduction at 2 with 802 rule applications. Total rules 4401 place count 5100 transition count 4900
Deduced a syphon composed of 2796 places in 9 ms
Iterating global reduction 2 with 802 rules applied. Total rules applied 5203 place count 5100 transition count 4900
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2797 places in 9 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5204 place count 5100 transition count 4900
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5206 place count 5098 transition count 4898
Deduced a syphon composed of 2795 places in 17 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5208 place count 5098 transition count 4898
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 2896 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5309 place count 5098 transition count 5428
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5410 place count 4997 transition count 5226
Deduced a syphon composed of 2795 places in 10 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5511 place count 4997 transition count 5226
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -523
Deduced a syphon composed of 2896 places in 23 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5612 place count 4997 transition count 5749
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5713 place count 4896 transition count 5547
Deduced a syphon composed of 2795 places in 16 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5814 place count 4896 transition count 5547
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -537
Deduced a syphon composed of 2896 places in 16 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5915 place count 4896 transition count 6084
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6016 place count 4795 transition count 5882
Deduced a syphon composed of 2795 places in 16 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6117 place count 4795 transition count 5882
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: -498
Deduced a syphon composed of 2889 places in 17 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 6211 place count 4795 transition count 6380
Discarding 94 places :
Symmetric choice reduction at 2 with 94 rule applications. Total rules 6305 place count 4701 transition count 6192
Deduced a syphon composed of 2795 places in 17 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 6399 place count 4701 transition count 6192
Deduced a syphon composed of 2795 places in 16 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 6408 place count 4701 transition count 6183
Deduced a syphon composed of 2795 places in 17 ms
Applied a total of 6408 rules in 8100 ms. Remains 4701 /5902 variables (removed 1201) and now considering 6183/5402 (removed -781) transitions.
[2023-03-20 01:10:05] [INFO ] Redundant transitions in 240 ms returned []
// Phase 1: matrix 6183 rows 4701 cols
[2023-03-20 01:10:06] [INFO ] Computed 901 place invariants in 161 ms
[2023-03-20 01:10:06] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4701/5902 places, 6183/5402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9133 ms. Remains : 4701/5902 places, 6183/5402 transitions.
Support contains 4 out of 5902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Applied a total of 0 rules in 963 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:10:07] [INFO ] Computed 901 place invariants in 41 ms
[2023-03-20 01:10:09] [INFO ] Implicit Places using invariants in 2313 ms returned []
[2023-03-20 01:10:09] [INFO ] Invariant cache hit.
[2023-03-20 01:10:12] [INFO ] Implicit Places using invariants and state equation in 2175 ms returned []
Implicit Place search using SMT with State Equation took 4503 ms to find 0 implicit places.
[2023-03-20 01:10:12] [INFO ] Invariant cache hit.
[2023-03-20 01:10:17] [INFO ] Dead Transitions using invariants and state equation in 5113 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10588 ms. Remains : 5902/5902 places, 5402/5402 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-03 finished in 165096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 5914 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5913 transition count 4214
Reduce places removed 1199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2399 place count 4714 transition count 4213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2400 place count 4713 transition count 4213
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 795 Pre rules applied. Total rules applied 2400 place count 4713 transition count 3418
Deduced a syphon composed of 795 places in 11 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 3 with 1590 rules applied. Total rules applied 3990 place count 3918 transition count 3418
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 4000 place count 3908 transition count 3408
Iterating global reduction 3 with 10 rules applied. Total rules applied 4010 place count 3908 transition count 3408
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 4010 place count 3908 transition count 3401
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 4024 place count 3901 transition count 3401
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 3 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 3 with 3396 rules applied. Total rules applied 7420 place count 2203 transition count 1703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7421 place count 2203 transition count 1702
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7423 place count 2202 transition count 1701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7625 place count 2101 transition count 1767
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7827 place count 2000 transition count 1834
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8019 place count 1904 transition count 1899
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8021 place count 1902 transition count 1897
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8023 place count 1900 transition count 1897
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8023 place count 1900 transition count 1896
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8025 place count 1899 transition count 1896
Applied a total of 8025 rules in 1816 ms. Remains 1899 /5914 variables (removed 4015) and now considering 1896/5414 (removed 3518) transitions.
// Phase 1: matrix 1896 rows 1899 cols
[2023-03-20 01:10:19] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-20 01:10:22] [INFO ] Implicit Places using invariants in 2721 ms returned [1888]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2753 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1898/5914 places, 1896/5414 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1897 transition count 1895
Applied a total of 2 rules in 105 ms. Remains 1897 /1898 variables (removed 1) and now considering 1895/1896 (removed 1) transitions.
// Phase 1: matrix 1895 rows 1897 cols
[2023-03-20 01:10:22] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-20 01:10:23] [INFO ] Implicit Places using invariants in 1296 ms returned []
[2023-03-20 01:10:23] [INFO ] Invariant cache hit.
[2023-03-20 01:10:27] [INFO ] Implicit Places using invariants and state equation in 3539 ms returned []
Implicit Place search using SMT with State Equation took 4849 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/5914 places, 1895/5414 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9523 ms. Remains : 1897/5914 places, 1895/5414 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s1179 0) (NEQ s1494 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-04 finished in 9714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5903 transition count 5403
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5903 transition count 5403
Applied a total of 22 rules in 1821 ms. Remains 5903 /5914 variables (removed 11) and now considering 5403/5414 (removed 11) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2023-03-20 01:10:29] [INFO ] Computed 901 place invariants in 54 ms
[2023-03-20 01:10:31] [INFO ] Implicit Places using invariants in 2553 ms returned []
[2023-03-20 01:10:31] [INFO ] Invariant cache hit.
[2023-03-20 01:10:34] [INFO ] Implicit Places using invariants and state equation in 2347 ms returned []
Implicit Place search using SMT with State Equation took 4908 ms to find 0 implicit places.
[2023-03-20 01:10:34] [INFO ] Invariant cache hit.
[2023-03-20 01:10:38] [INFO ] Dead Transitions using invariants and state equation in 4858 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5903/5914 places, 5403/5414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11589 ms. Remains : 5903/5914 places, 5403/5414 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (EQ s1742 0) (EQ s4434 1)) (OR (EQ s1024 0) (EQ s4854 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1635 ms.
Product exploration explored 100000 steps with 0 reset in 1977 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 268 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) 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 217745 steps, run timeout after 3204 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 217745 steps, saw 209178 distinct states, run finished after 3204 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:10:46] [INFO ] Invariant cache hit.
[2023-03-20 01:10:47] [INFO ] After 539ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:10:48] [INFO ] [Nat]Absence check using 901 positive place invariants in 921 ms returned sat
[2023-03-20 01:10:54] [INFO ] After 5423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:10:57] [INFO ] Deduced a trap composed of 22 places in 2382 ms of which 4 ms to minimize.
[2023-03-20 01:10:59] [INFO ] Deduced a trap composed of 19 places in 2245 ms of which 2 ms to minimize.
[2023-03-20 01:11:02] [INFO ] Deduced a trap composed of 15 places in 2501 ms of which 7 ms to minimize.
[2023-03-20 01:11:05] [INFO ] Deduced a trap composed of 17 places in 3480 ms of which 3 ms to minimize.
[2023-03-20 01:11:08] [INFO ] Deduced a trap composed of 17 places in 2277 ms of which 4 ms to minimize.
[2023-03-20 01:11:11] [INFO ] Deduced a trap composed of 21 places in 2371 ms of which 4 ms to minimize.
[2023-03-20 01:11:13] [INFO ] Deduced a trap composed of 28 places in 2276 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:11:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:11:13] [INFO ] After 26341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 113 ms.
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5903 transition count 4205
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4705 transition count 4205
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2396 place count 4705 transition count 3406
Deduced a syphon composed of 799 places in 11 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3994 place count 3906 transition count 3406
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 4 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 2 with 3402 rules applied. Total rules applied 7396 place count 2205 transition count 1705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7397 place count 2205 transition count 1704
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7399 place count 2204 transition count 1703
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7601 place count 2103 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7803 place count 2002 transition count 1836
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 96 places in 6 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 7995 place count 1906 transition count 1899
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7996 place count 1906 transition count 1898
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 7997 place count 1906 transition count 1897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7998 place count 1905 transition count 1897
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 8098 place count 1905 transition count 1897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8099 place count 1904 transition count 1896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 8101 place count 1902 transition count 1896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 8101 place count 1902 transition count 1895
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 8103 place count 1901 transition count 1895
Applied a total of 8103 rules in 1707 ms. Remains 1901 /5903 variables (removed 4002) and now considering 1895/5403 (removed 3508) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1707 ms. Remains : 1901/5903 places, 1895/5403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 88062 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88062 steps, saw 56209 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1895 rows 1901 cols
[2023-03-20 01:11:18] [INFO ] Computed 899 place invariants in 3 ms
[2023-03-20 01:11:18] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:11:19] [INFO ] [Nat]Absence check using 899 positive place invariants in 188 ms returned sat
[2023-03-20 01:11:20] [INFO ] After 1027ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:11:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 01:11:20] [INFO ] After 129ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:11:20] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-20 01:11:20] [INFO ] After 1828ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 53 ms.
Support contains 4 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1895/1895 transitions.
Applied a total of 0 rules in 99 ms. Remains 1901 /1901 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 1901/1901 places, 1895/1895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1895/1895 transitions.
Applied a total of 0 rules in 55 ms. Remains 1901 /1901 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
[2023-03-20 01:11:20] [INFO ] Invariant cache hit.
[2023-03-20 01:11:22] [INFO ] Implicit Places using invariants in 1304 ms returned [1890]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1306 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1900/1901 places, 1895/1895 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1899 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1899 transition count 1894
Applied a total of 2 rules in 130 ms. Remains 1899 /1900 variables (removed 1) and now considering 1894/1895 (removed 1) transitions.
// Phase 1: matrix 1894 rows 1899 cols
[2023-03-20 01:11:22] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:11:24] [INFO ] Implicit Places using invariants in 1746 ms returned []
[2023-03-20 01:11:24] [INFO ] Invariant cache hit.
[2023-03-20 01:11:27] [INFO ] Implicit Places using invariants and state equation in 3308 ms returned []
Implicit Place search using SMT with State Equation took 5056 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1899/1901 places, 1894/1895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6547 ms. Remains : 1899/1901 places, 1894/1895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 86452 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86452 steps, saw 54444 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:11:30] [INFO ] Invariant cache hit.
[2023-03-20 01:11:30] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:11:31] [INFO ] [Nat]Absence check using 898 positive place invariants in 164 ms returned sat
[2023-03-20 01:11:32] [INFO ] After 916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:11:32] [INFO ] After 1058ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-20 01:11:32] [INFO ] After 1583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 175 ms.
Support contains 4 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 58 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 76 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-20 01:11:32] [INFO ] Invariant cache hit.
[2023-03-20 01:11:34] [INFO ] Implicit Places using invariants in 1530 ms returned []
[2023-03-20 01:11:34] [INFO ] Invariant cache hit.
[2023-03-20 01:11:37] [INFO ] Implicit Places using invariants and state equation in 3172 ms returned []
Implicit Place search using SMT with State Equation took 4712 ms to find 0 implicit places.
[2023-03-20 01:11:37] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-20 01:11:37] [INFO ] Invariant cache hit.
[2023-03-20 01:11:38] [INFO ] Dead Transitions using invariants and state equation in 1184 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6010 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1899 transition count 1894
Applied a total of 199 rules in 132 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2023-03-20 01:11:38] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:11:39] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:11:39] [INFO ] [Nat]Absence check using 898 positive place invariants in 167 ms returned sat
[2023-03-20 01:11:40] [INFO ] After 1303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:11:40] [INFO ] State equation strengthened by 196 read => feed constraints.
[2023-03-20 01:11:41] [INFO ] After 317ms SMT Verify possible using 196 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:11:41] [INFO ] After 522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-20 01:11:41] [INFO ] After 2425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Applied a total of 0 rules in 1103 ms. Remains 5903 /5903 variables (removed 0) and now considering 5403/5403 (removed 0) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2023-03-20 01:11:43] [INFO ] Computed 901 place invariants in 37 ms
[2023-03-20 01:11:45] [INFO ] Implicit Places using invariants in 2197 ms returned []
[2023-03-20 01:11:45] [INFO ] Invariant cache hit.
[2023-03-20 01:11:47] [INFO ] Implicit Places using invariants and state equation in 2297 ms returned []
Implicit Place search using SMT with State Equation took 4514 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 4873 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10498 ms. Remains : 5903/5903 places, 5403/5403 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 266 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 211946 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 211946 steps, saw 206005 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:11:56] [INFO ] Invariant cache hit.
[2023-03-20 01:11:57] [INFO ] After 738ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:11:58] [INFO ] [Nat]Absence check using 901 positive place invariants in 661 ms returned sat
[2023-03-20 01:12:04] [INFO ] After 5917ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:12:07] [INFO ] Deduced a trap composed of 22 places in 2370 ms of which 4 ms to minimize.
[2023-03-20 01:12:09] [INFO ] Deduced a trap composed of 19 places in 2340 ms of which 3 ms to minimize.
[2023-03-20 01:12:12] [INFO ] Deduced a trap composed of 15 places in 2688 ms of which 6 ms to minimize.
[2023-03-20 01:12:15] [INFO ] Deduced a trap composed of 17 places in 2446 ms of which 4 ms to minimize.
[2023-03-20 01:12:18] [INFO ] Deduced a trap composed of 17 places in 2531 ms of which 4 ms to minimize.
[2023-03-20 01:12:20] [INFO ] Deduced a trap composed of 21 places in 2360 ms of which 4 ms to minimize.
[2023-03-20 01:12:23] [INFO ] Deduced a trap composed of 28 places in 2507 ms of which 6 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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:12:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:12:23] [INFO ] After 26238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 161 ms.
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5903 transition count 4205
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4705 transition count 4205
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2396 place count 4705 transition count 3406
Deduced a syphon composed of 799 places in 12 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3994 place count 3906 transition count 3406
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 8 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 2 with 3402 rules applied. Total rules applied 7396 place count 2205 transition count 1705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7397 place count 2205 transition count 1704
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7399 place count 2204 transition count 1703
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7601 place count 2103 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7803 place count 2002 transition count 1836
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 7995 place count 1906 transition count 1899
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7996 place count 1906 transition count 1898
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 7997 place count 1906 transition count 1897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7998 place count 1905 transition count 1897
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 8098 place count 1905 transition count 1897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8099 place count 1904 transition count 1896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 8101 place count 1902 transition count 1896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 8101 place count 1902 transition count 1895
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 8103 place count 1901 transition count 1895
Applied a total of 8103 rules in 1711 ms. Remains 1901 /5903 variables (removed 4002) and now considering 1895/5403 (removed 3508) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1711 ms. Remains : 1901/5903 places, 1895/5403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 81470 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81470 steps, saw 51980 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1895 rows 1901 cols
[2023-03-20 01:12:28] [INFO ] Computed 899 place invariants in 29 ms
[2023-03-20 01:12:29] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:12:29] [INFO ] [Nat]Absence check using 899 positive place invariants in 170 ms returned sat
[2023-03-20 01:12:30] [INFO ] After 1160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:12:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 01:12:30] [INFO ] After 98ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:12:30] [INFO ] After 239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-20 01:12:31] [INFO ] After 2029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 99 ms.
Support contains 4 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1895/1895 transitions.
Applied a total of 0 rules in 78 ms. Remains 1901 /1901 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 1901/1901 places, 1895/1895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1895/1895 transitions.
Applied a total of 0 rules in 58 ms. Remains 1901 /1901 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
[2023-03-20 01:12:31] [INFO ] Invariant cache hit.
[2023-03-20 01:12:32] [INFO ] Implicit Places using invariants in 1190 ms returned [1890]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1193 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1900/1901 places, 1895/1895 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1899 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1899 transition count 1894
Applied a total of 2 rules in 117 ms. Remains 1899 /1900 variables (removed 1) and now considering 1894/1895 (removed 1) transitions.
// Phase 1: matrix 1894 rows 1899 cols
[2023-03-20 01:12:32] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:12:34] [INFO ] Implicit Places using invariants in 1459 ms returned []
[2023-03-20 01:12:34] [INFO ] Invariant cache hit.
[2023-03-20 01:12:37] [INFO ] Implicit Places using invariants and state equation in 3065 ms returned []
Implicit Place search using SMT with State Equation took 4539 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1899/1901 places, 1894/1895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5908 ms. Remains : 1899/1901 places, 1894/1895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 85269 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85269 steps, saw 53756 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:12:40] [INFO ] Invariant cache hit.
[2023-03-20 01:12:40] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:12:41] [INFO ] [Nat]Absence check using 898 positive place invariants in 166 ms returned sat
[2023-03-20 01:12:42] [INFO ] After 928ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:12:42] [INFO ] After 1091ms 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:12:42] [INFO ] After 1601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 77 ms.
Support contains 4 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 83 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 72 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-20 01:12:42] [INFO ] Invariant cache hit.
[2023-03-20 01:12:43] [INFO ] Implicit Places using invariants in 1309 ms returned []
[2023-03-20 01:12:43] [INFO ] Invariant cache hit.
[2023-03-20 01:12:46] [INFO ] Implicit Places using invariants and state equation in 3015 ms returned []
Implicit Place search using SMT with State Equation took 4347 ms to find 0 implicit places.
[2023-03-20 01:12:47] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-20 01:12:47] [INFO ] Invariant cache hit.
[2023-03-20 01:12:48] [INFO ] Dead Transitions using invariants and state equation in 1198 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5681 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1899 transition count 1894
Applied a total of 199 rules in 110 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2023-03-20 01:12:48] [INFO ] Computed 898 place invariants in 4 ms
[2023-03-20 01:12:48] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:12:49] [INFO ] [Nat]Absence check using 898 positive place invariants in 162 ms returned sat
[2023-03-20 01:12:49] [INFO ] After 781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:12:49] [INFO ] State equation strengthened by 196 read => feed constraints.
[2023-03-20 01:12:50] [INFO ] After 268ms SMT Verify possible using 196 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:12:50] [INFO ] After 494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-20 01:12:50] [INFO ] After 1772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1996 ms.
Product exploration explored 100000 steps with 0 reset in 2163 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Performed 1198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5903 transition count 5403
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 401 Pre rules applied. Total rules applied 1198 place count 5903 transition count 5704
Deduced a syphon composed of 1599 places in 22 ms
Iterating global reduction 1 with 401 rules applied. Total rules applied 1599 place count 5903 transition count 5704
Performed 2000 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3599 places in 14 ms
Iterating global reduction 1 with 2000 rules applied. Total rules applied 3599 place count 5903 transition count 5705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3600 place count 5903 transition count 5704
Renaming transitions due to excessive name length > 1024 char.
Discarding 799 places :
Symmetric choice reduction at 2 with 799 rule applications. Total rules 4399 place count 5104 transition count 4905
Deduced a syphon composed of 2800 places in 15 ms
Iterating global reduction 2 with 799 rules applied. Total rules applied 5198 place count 5104 transition count 4905
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2801 places in 26 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5199 place count 5104 transition count 4905
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5201 place count 5102 transition count 4903
Deduced a syphon composed of 2799 places in 9 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5203 place count 5102 transition count 4903
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -527
Deduced a syphon composed of 2900 places in 14 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5304 place count 5102 transition count 5430
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 5406 place count 5000 transition count 5226
Deduced a syphon composed of 2798 places in 12 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 5508 place count 5000 transition count 5226
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -527
Deduced a syphon composed of 2899 places in 14 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5609 place count 5000 transition count 5753
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5710 place count 4899 transition count 5551
Deduced a syphon composed of 2798 places in 14 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5811 place count 4899 transition count 5551
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -537
Deduced a syphon composed of 2899 places in 16 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5912 place count 4899 transition count 6088
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6013 place count 4798 transition count 5886
Deduced a syphon composed of 2798 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6114 place count 4798 transition count 5886
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: -494
Deduced a syphon composed of 2892 places in 13 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 6208 place count 4798 transition count 6380
Discarding 94 places :
Symmetric choice reduction at 2 with 94 rule applications. Total rules 6302 place count 4704 transition count 6192
Deduced a syphon composed of 2798 places in 12 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 6396 place count 4704 transition count 6192
Deduced a syphon composed of 2798 places in 12 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 6405 place count 4704 transition count 6183
Deduced a syphon composed of 2798 places in 14 ms
Applied a total of 6405 rules in 8895 ms. Remains 4704 /5903 variables (removed 1199) and now considering 6183/5403 (removed -780) transitions.
[2023-03-20 01:13:04] [INFO ] Redundant transitions in 272 ms returned []
// Phase 1: matrix 6183 rows 4704 cols
[2023-03-20 01:13:04] [INFO ] Computed 901 place invariants in 157 ms
[2023-03-20 01:13:10] [INFO ] Dead Transitions using invariants and state equation in 6242 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4704/5903 places, 6183/5403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15436 ms. Remains : 4704/5903 places, 6183/5403 transitions.
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Applied a total of 0 rules in 1068 ms. Remains 5903 /5903 variables (removed 0) and now considering 5403/5403 (removed 0) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2023-03-20 01:13:12] [INFO ] Computed 901 place invariants in 44 ms
[2023-03-20 01:13:14] [INFO ] Implicit Places using invariants in 2671 ms returned []
[2023-03-20 01:13:14] [INFO ] Invariant cache hit.
[2023-03-20 01:13:16] [INFO ] Implicit Places using invariants and state equation in 2312 ms returned []
Implicit Place search using SMT with State Equation took 4985 ms to find 0 implicit places.
[2023-03-20 01:13:16] [INFO ] Invariant cache hit.
[2023-03-20 01:13:21] [INFO ] Dead Transitions using invariants and state equation in 4982 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11058 ms. Remains : 5903/5903 places, 5403/5403 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-05 finished in 175025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 5901 transition count 5401
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 5901 transition count 5401
Applied a total of 26 rules in 1930 ms. Remains 5901 /5914 variables (removed 13) and now considering 5401/5414 (removed 13) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2023-03-20 01:13:24] [INFO ] Computed 901 place invariants in 50 ms
[2023-03-20 01:13:26] [INFO ] Implicit Places using invariants in 2323 ms returned []
[2023-03-20 01:13:26] [INFO ] Invariant cache hit.
[2023-03-20 01:13:28] [INFO ] Implicit Places using invariants and state equation in 2391 ms returned []
Implicit Place search using SMT with State Equation took 4720 ms to find 0 implicit places.
[2023-03-20 01:13:28] [INFO ] Invariant cache hit.
[2023-03-20 01:13:33] [INFO ] Dead Transitions using invariants and state equation in 4744 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5914 places, 5401/5414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11417 ms. Remains : 5901/5914 places, 5401/5414 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s2539 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-07 finished in 11614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 5901 transition count 5401
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 5901 transition count 5401
Applied a total of 26 rules in 1881 ms. Remains 5901 /5914 variables (removed 13) and now considering 5401/5414 (removed 13) transitions.
[2023-03-20 01:13:35] [INFO ] Invariant cache hit.
[2023-03-20 01:13:37] [INFO ] Implicit Places using invariants in 2156 ms returned []
[2023-03-20 01:13:37] [INFO ] Invariant cache hit.
[2023-03-20 01:13:40] [INFO ] Implicit Places using invariants and state equation in 2236 ms returned []
Implicit Place search using SMT with State Equation took 4394 ms to find 0 implicit places.
[2023-03-20 01:13:40] [INFO ] Invariant cache hit.
[2023-03-20 01:13:45] [INFO ] Dead Transitions using invariants and state equation in 4836 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5914 places, 5401/5414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11128 ms. Remains : 5901/5914 places, 5401/5414 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s5840 0) (EQ s5677 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3123 ms.
Product exploration explored 100000 steps with 50000 reset in 3445 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-08 finished in 18053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U X(G(p1)))))'
Support contains 4 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5902 transition count 5402
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5902 transition count 5402
Applied a total of 24 rules in 1933 ms. Remains 5902 /5914 variables (removed 12) and now considering 5402/5414 (removed 12) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-20 01:13:53] [INFO ] Computed 901 place invariants in 26 ms
[2023-03-20 01:13:56] [INFO ] Implicit Places using invariants in 2226 ms returned []
[2023-03-20 01:13:56] [INFO ] Invariant cache hit.
[2023-03-20 01:13:58] [INFO ] Implicit Places using invariants and state equation in 2390 ms returned []
Implicit Place search using SMT with State Equation took 4617 ms to find 0 implicit places.
[2023-03-20 01:13:58] [INFO ] Invariant cache hit.
[2023-03-20 01:14:03] [INFO ] Dead Transitions using invariants and state equation in 5299 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5914 places, 5402/5414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11857 ms. Remains : 5902/5914 places, 5402/5414 transitions.
Stuttering acceptance computed with spot in 332 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=4, aps=[p1:(OR (EQ s5286 0) (EQ s2935 1)), p0:(OR (EQ s434 0) (EQ s171 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3465 ms.
Product exploration explored 100000 steps with 50000 reset in 3311 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100B-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-11 finished in 19353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5902 transition count 5402
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5902 transition count 5402
Applied a total of 24 rules in 1886 ms. Remains 5902 /5914 variables (removed 12) and now considering 5402/5414 (removed 12) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2023-03-20 01:14:13] [INFO ] Computed 901 place invariants in 39 ms
[2023-03-20 01:14:15] [INFO ] Implicit Places using invariants in 2326 ms returned []
[2023-03-20 01:14:15] [INFO ] Invariant cache hit.
[2023-03-20 01:14:17] [INFO ] Implicit Places using invariants and state equation in 2324 ms returned []
Implicit Place search using SMT with State Equation took 4654 ms to find 0 implicit places.
[2023-03-20 01:14:17] [INFO ] Invariant cache hit.
[2023-03-20 01:14:22] [INFO ] Dead Transitions using invariants and state equation in 4642 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5914 places, 5402/5414 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11191 ms. Remains : 5902/5914 places, 5402/5414 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s3703 0) (EQ s2338 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 1456 ms.
Stack based approach found an accepted trace after 3034 steps with 0 reset with depth 3035 and stack size 3035 in 92 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-12 finished in 12911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F((G(p2)||p1)))))'
Support contains 5 out of 5914 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5913 transition count 4215
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4715 transition count 4215
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 795 Pre rules applied. Total rules applied 2396 place count 4715 transition count 3420
Deduced a syphon composed of 795 places in 12 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 2 with 1590 rules applied. Total rules applied 3986 place count 3920 transition count 3420
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 3995 place count 3911 transition count 3411
Iterating global reduction 2 with 9 rules applied. Total rules applied 4004 place count 3911 transition count 3411
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4004 place count 3911 transition count 3404
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 4018 place count 3904 transition count 3404
Performed 1695 Post agglomeration using F-continuation condition.Transition count delta: 1695
Deduced a syphon composed of 1695 places in 4 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 2 with 3390 rules applied. Total rules applied 7408 place count 2209 transition count 1709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7409 place count 2209 transition count 1708
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7411 place count 2208 transition count 1707
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7613 place count 2107 transition count 1773
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7815 place count 2006 transition count 1841
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 7 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8009 place count 1909 transition count 1906
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8011 place count 1907 transition count 1904
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8013 place count 1905 transition count 1904
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8013 place count 1905 transition count 1903
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8015 place count 1904 transition count 1903
Applied a total of 8015 rules in 1741 ms. Remains 1904 /5914 variables (removed 4010) and now considering 1903/5414 (removed 3511) transitions.
// Phase 1: matrix 1903 rows 1904 cols
[2023-03-20 01:14:25] [INFO ] Computed 899 place invariants in 7 ms
[2023-03-20 01:14:27] [INFO ] Implicit Places using invariants in 1228 ms returned [1893]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1230 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1903/5914 places, 1903/5414 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1902
Applied a total of 2 rules in 114 ms. Remains 1902 /1903 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1902 cols
[2023-03-20 01:14:27] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:14:28] [INFO ] Implicit Places using invariants in 1406 ms returned []
[2023-03-20 01:14:28] [INFO ] Invariant cache hit.
[2023-03-20 01:14:29] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 01:14:32] [INFO ] Implicit Places using invariants and state equation in 3841 ms returned []
Implicit Place search using SMT with State Equation took 5248 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1902/5914 places, 1902/5414 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8334 ms. Remains : 1902/5914 places, 1902/5414 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1750 0) (EQ s1088 1)), p1:(OR (EQ s1384 0) (EQ s170 1)), p2:(EQ s1824 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1419 ms.
Product exploration explored 100000 steps with 0 reset in 1927 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/1902 stabilizing places and 6/1902 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 454 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 83580 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83580 steps, saw 49995 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 01:14:40] [INFO ] Invariant cache hit.
[2023-03-20 01:14:40] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:14:41] [INFO ] [Nat]Absence check using 898 positive place invariants in 172 ms returned sat
[2023-03-20 01:14:42] [INFO ] After 1145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:14:42] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 01:14:42] [INFO ] After 184ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 01:14:42] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 9 ms to minimize.
[2023-03-20 01:14:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-20 01:14:42] [INFO ] After 717ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 276 ms.
[2023-03-20 01:14:43] [INFO ] After 2618ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 173 ms.
Support contains 5 out of 1902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1902/1902 places, 1902/1902 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1902 transition count 1901
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1902 transition count 1901
Applied a total of 2 rules in 148 ms. Remains 1902 /1902 variables (removed 0) and now considering 1901/1902 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 1902/1902 places, 1901/1902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 78130 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78130 steps, saw 49051 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1901 rows 1902 cols
[2023-03-20 01:14:47] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:14:47] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:14:48] [INFO ] [Nat]Absence check using 898 positive place invariants in 323 ms returned sat
[2023-03-20 01:14:49] [INFO ] After 985ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:14:49] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 01:14:49] [INFO ] After 177ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 01:14:50] [INFO ] After 758ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 329 ms.
[2023-03-20 01:14:50] [INFO ] After 2849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 228 ms.
Support contains 5 out of 1902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1902/1902 places, 1901/1901 transitions.
Applied a total of 0 rules in 56 ms. Remains 1902 /1902 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1902/1902 places, 1901/1901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1902/1902 places, 1901/1901 transitions.
Applied a total of 0 rules in 57 ms. Remains 1902 /1902 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2023-03-20 01:14:50] [INFO ] Invariant cache hit.
[2023-03-20 01:14:52] [INFO ] Implicit Places using invariants in 1555 ms returned []
[2023-03-20 01:14:52] [INFO ] Invariant cache hit.
[2023-03-20 01:14:53] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 01:14:56] [INFO ] Implicit Places using invariants and state equation in 3741 ms returned []
Implicit Place search using SMT with State Equation took 5298 ms to find 0 implicit places.
[2023-03-20 01:14:56] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-20 01:14:56] [INFO ] Invariant cache hit.
[2023-03-20 01:14:57] [INFO ] Dead Transitions using invariants and state equation in 1278 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6711 ms. Remains : 1902/1902 places, 1901/1901 transitions.
Partial Free-agglomeration rule applied 203 times.
Drop transitions removed 203 transitions
Iterating global reduction 0 with 203 rules applied. Total rules applied 203 place count 1902 transition count 1901
Applied a total of 203 rules in 102 ms. Remains 1902 /1902 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1901 rows 1902 cols
[2023-03-20 01:14:57] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:14:57] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:14:58] [INFO ] [Nat]Absence check using 898 positive place invariants in 205 ms returned sat
[2023-03-20 01:14:59] [INFO ] After 1112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:14:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 01:15:00] [INFO ] After 309ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 01:15:00] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2023-03-20 01:15:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-20 01:15:00] [INFO ] After 1063ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 345 ms.
[2023-03-20 01:15:01] [INFO ] After 3181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 428 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 1902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1902/1902 places, 1902/1902 transitions.
Applied a total of 0 rules in 95 ms. Remains 1902 /1902 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
// Phase 1: matrix 1902 rows 1902 cols
[2023-03-20 01:15:01] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-20 01:15:03] [INFO ] Implicit Places using invariants in 1771 ms returned []
[2023-03-20 01:15:03] [INFO ] Invariant cache hit.
[2023-03-20 01:15:05] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 01:15:07] [INFO ] Implicit Places using invariants and state equation in 3723 ms returned []
Implicit Place search using SMT with State Equation took 5496 ms to find 0 implicit places.
[2023-03-20 01:15:07] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-20 01:15:07] [INFO ] Invariant cache hit.
[2023-03-20 01:15:08] [INFO ] Dead Transitions using invariants and state equation in 1412 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7069 ms. Remains : 1902/1902 places, 1902/1902 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/1902 stabilizing places and 6/1902 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 306 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 78944 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78944 steps, saw 46940 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 01:15:13] [INFO ] Invariant cache hit.
[2023-03-20 01:15:13] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:15:13] [INFO ] [Nat]Absence check using 898 positive place invariants in 235 ms returned sat
[2023-03-20 01:15:15] [INFO ] After 1086ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:15:15] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 01:15:15] [INFO ] After 234ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 01:15:15] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2023-03-20 01:15:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-20 01:15:15] [INFO ] After 769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 220 ms.
[2023-03-20 01:15:16] [INFO ] After 2686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 225 ms.
Support contains 5 out of 1902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1902/1902 places, 1902/1902 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1902 transition count 1901
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1902 transition count 1901
Applied a total of 2 rules in 113 ms. Remains 1902 /1902 variables (removed 0) and now considering 1901/1902 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 1902/1902 places, 1901/1902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 89243 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89243 steps, saw 55694 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1901 rows 1902 cols
[2023-03-20 01:15:19] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:15:20] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:15:20] [INFO ] [Nat]Absence check using 898 positive place invariants in 164 ms returned sat
[2023-03-20 01:15:22] [INFO ] After 1174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:15:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 01:15:22] [INFO ] After 345ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 01:15:22] [INFO ] After 682ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 317 ms.
[2023-03-20 01:15:23] [INFO ] After 2735ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 270 ms.
Support contains 5 out of 1902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1902/1902 places, 1901/1901 transitions.
Applied a total of 0 rules in 59 ms. Remains 1902 /1902 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 1902/1902 places, 1901/1901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1902/1902 places, 1901/1901 transitions.
Applied a total of 0 rules in 58 ms. Remains 1902 /1902 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2023-03-20 01:15:23] [INFO ] Invariant cache hit.
[2023-03-20 01:15:24] [INFO ] Implicit Places using invariants in 1463 ms returned []
[2023-03-20 01:15:24] [INFO ] Invariant cache hit.
[2023-03-20 01:15:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 01:15:28] [INFO ] Implicit Places using invariants and state equation in 3155 ms returned []
Implicit Place search using SMT with State Equation took 4637 ms to find 0 implicit places.
[2023-03-20 01:15:28] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-20 01:15:28] [INFO ] Invariant cache hit.
[2023-03-20 01:15:29] [INFO ] Dead Transitions using invariants and state equation in 1321 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6103 ms. Remains : 1902/1902 places, 1901/1901 transitions.
Partial Free-agglomeration rule applied 203 times.
Drop transitions removed 203 transitions
Iterating global reduction 0 with 203 rules applied. Total rules applied 203 place count 1902 transition count 1901
Applied a total of 203 rules in 123 ms. Remains 1902 /1902 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1901 rows 1902 cols
[2023-03-20 01:15:29] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-20 01:15:29] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:15:30] [INFO ] [Nat]Absence check using 898 positive place invariants in 216 ms returned sat
[2023-03-20 01:15:32] [INFO ] After 2327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:15:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 01:15:33] [INFO ] After 246ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 01:15:33] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2023-03-20 01:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-20 01:15:33] [INFO ] After 931ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 189 ms.
[2023-03-20 01:15:34] [INFO ] After 4186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 311 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 1410 ms.
Product exploration explored 100000 steps with 0 reset in 1803 ms.
Support contains 5 out of 1902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1902/1902 places, 1902/1902 transitions.
Applied a total of 0 rules in 52 ms. Remains 1902 /1902 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
// Phase 1: matrix 1902 rows 1902 cols
[2023-03-20 01:15:38] [INFO ] Computed 898 place invariants in 2 ms
[2023-03-20 01:15:39] [INFO ] Implicit Places using invariants in 1437 ms returned []
[2023-03-20 01:15:39] [INFO ] Invariant cache hit.
[2023-03-20 01:15:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 01:15:42] [INFO ] Implicit Places using invariants and state equation in 2960 ms returned []
Implicit Place search using SMT with State Equation took 4404 ms to find 0 implicit places.
[2023-03-20 01:15:42] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-20 01:15:42] [INFO ] Invariant cache hit.
[2023-03-20 01:15:43] [INFO ] Dead Transitions using invariants and state equation in 1242 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5727 ms. Remains : 1902/1902 places, 1902/1902 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-15 finished in 79682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(G(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-100B-LTLCardinality-03
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5913 transition count 4214
Reduce places removed 1199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2399 place count 4714 transition count 4213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2400 place count 4713 transition count 4213
Performed 794 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 794 Pre rules applied. Total rules applied 2400 place count 4713 transition count 3419
Deduced a syphon composed of 794 places in 9 ms
Reduce places removed 794 places and 0 transitions.
Iterating global reduction 3 with 1588 rules applied. Total rules applied 3988 place count 3919 transition count 3419
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 3997 place count 3910 transition count 3410
Iterating global reduction 3 with 9 rules applied. Total rules applied 4006 place count 3910 transition count 3410
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 4006 place count 3910 transition count 3403
Deduced a syphon composed of 7 places in 10 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 4020 place count 3903 transition count 3403
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 6 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 3 with 3394 rules applied. Total rules applied 7414 place count 2206 transition count 1706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7415 place count 2206 transition count 1705
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7417 place count 2205 transition count 1704
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7619 place count 2104 transition count 1770
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7821 place count 2003 transition count 1836
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 6 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8013 place count 1907 transition count 1901
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8015 place count 1905 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8017 place count 1903 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8017 place count 1903 transition count 1898
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8019 place count 1902 transition count 1898
Applied a total of 8019 rules in 1863 ms. Remains 1902 /5914 variables (removed 4012) and now considering 1898/5414 (removed 3516) transitions.
// Phase 1: matrix 1898 rows 1902 cols
[2023-03-20 01:15:46] [INFO ] Computed 899 place invariants in 5 ms
[2023-03-20 01:15:47] [INFO ] Implicit Places using invariants in 1436 ms returned [1891]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1437 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1901/5914 places, 1898/5414 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 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 1897
Applied a total of 2 rules in 137 ms. Remains 1900 /1901 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1900 cols
[2023-03-20 01:15:47] [INFO ] Computed 898 place invariants in 5 ms
[2023-03-20 01:15:49] [INFO ] Implicit Places using invariants in 1219 ms returned []
[2023-03-20 01:15:49] [INFO ] Invariant cache hit.
[2023-03-20 01:15:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 01:15:52] [INFO ] Implicit Places using invariants and state equation in 3187 ms returned []
Implicit Place search using SMT with State Equation took 4412 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1900/5914 places, 1897/5414 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 7849 ms. Remains : 1900/5914 places, 1897/5414 transitions.
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (EQ s801 0) (EQ s1423 1)), p0:(OR (EQ s1564 0) (EQ s1512 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1337 ms.
Product exploration explored 100000 steps with 0 reset in 1802 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:15:56] [INFO ] Invariant cache hit.
[2023-03-20 01:15:56] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:15:56] [INFO ] [Nat]Absence check using 898 positive place invariants in 184 ms returned sat
[2023-03-20 01:15:57] [INFO ] After 899ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:15:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 01:15:57] [INFO ] After 92ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:15:57] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-20 01:15:58] [INFO ] After 1601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 57 ms.
Support contains 2 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1897/1897 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1900 transition count 1896
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 1899 transition count 1895
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 1899 transition count 1895
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1898 transition count 1894
Applied a total of 5 rules in 224 ms. Remains 1898 /1900 variables (removed 2) and now considering 1894/1897 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 1898/1900 places, 1894/1897 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 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101109 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101109 steps, saw 62615 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2023-03-20 01:16:01] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-20 01:16:01] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:16:02] [INFO ] [Nat]Absence check using 898 positive place invariants in 139 ms returned sat
[2023-03-20 01:16:03] [INFO ] After 899ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:16:03] [INFO ] After 1039ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-20 01:16:03] [INFO ] After 1480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 57 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 58 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-20 01:16:03] [INFO ] Invariant cache hit.
[2023-03-20 01:16:05] [INFO ] Implicit Places using invariants in 1774 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 3303 ms returned []
Implicit Place search using SMT with State Equation took 5093 ms to find 0 implicit places.
[2023-03-20 01:16:08] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-20 01:16:08] [INFO ] Invariant cache hit.
[2023-03-20 01:16:09] [INFO ] Dead Transitions using invariants and state equation in 1235 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6444 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1898 transition count 1894
Applied a total of 200 rules in 103 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2023-03-20 01:16:09] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:16:10] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:16:10] [INFO ] [Nat]Absence check using 898 positive place invariants in 170 ms returned sat
[2023-03-20 01:16:11] [INFO ] After 1066ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:16:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 01:16:11] [INFO ] After 86ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:16:11] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-20 01:16:11] [INFO ] After 1776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1900/1900 places, 1897/1897 transitions.
Applied a total of 0 rules in 49 ms. Remains 1900 /1900 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
// Phase 1: matrix 1897 rows 1900 cols
[2023-03-20 01:16:12] [INFO ] Computed 898 place invariants in 2 ms
[2023-03-20 01:16:14] [INFO ] Implicit Places using invariants in 1713 ms returned []
[2023-03-20 01:16:14] [INFO ] Invariant cache hit.
[2023-03-20 01:16:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 01:16:17] [INFO ] Implicit Places using invariants and state equation in 3093 ms returned []
Implicit Place search using SMT with State Equation took 4808 ms to find 0 implicit places.
[2023-03-20 01:16:17] [INFO ] Invariant cache hit.
[2023-03-20 01:16:18] [INFO ] Dead Transitions using invariants and state equation in 1403 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6262 ms. Remains : 1900/1900 places, 1897/1897 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:16:19] [INFO ] Invariant cache hit.
[2023-03-20 01:16:19] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:16:19] [INFO ] [Nat]Absence check using 898 positive place invariants in 150 ms returned sat
[2023-03-20 01:16:20] [INFO ] After 1027ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:16:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 01:16:21] [INFO ] After 107ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:16:21] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-20 01:16:21] [INFO ] After 1879ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 79 ms.
Support contains 2 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1897/1897 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1900 transition count 1896
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 1899 transition count 1895
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 1899 transition count 1895
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1898 transition count 1894
Applied a total of 5 rules in 208 ms. Remains 1898 /1900 variables (removed 2) and now considering 1894/1897 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 1898/1900 places, 1894/1897 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 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100502 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100502 steps, saw 62213 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2023-03-20 01:16:24] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:16:25] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:16:25] [INFO ] [Nat]Absence check using 898 positive place invariants in 162 ms returned sat
[2023-03-20 01:16:26] [INFO ] After 1107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:16:26] [INFO ] After 1270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-20 01:16:27] [INFO ] After 1826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 53 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 52 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 51 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-20 01:16:27] [INFO ] Invariant cache hit.
[2023-03-20 01:16:28] [INFO ] Implicit Places using invariants in 1511 ms returned []
[2023-03-20 01:16:28] [INFO ] Invariant cache hit.
[2023-03-20 01:16:32] [INFO ] Implicit Places using invariants and state equation in 3854 ms returned []
Implicit Place search using SMT with State Equation took 5391 ms to find 0 implicit places.
[2023-03-20 01:16:32] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-20 01:16:32] [INFO ] Invariant cache hit.
[2023-03-20 01:16:33] [INFO ] Dead Transitions using invariants and state equation in 1132 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6609 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1898 transition count 1894
Applied a total of 200 rules in 103 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2023-03-20 01:16:33] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:16:34] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:16:34] [INFO ] [Nat]Absence check using 898 positive place invariants in 157 ms returned sat
[2023-03-20 01:16:35] [INFO ] After 1038ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:16:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 01:16:35] [INFO ] After 101ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:16:35] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-20 01:16:36] [INFO ] After 1822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 270 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1294 ms.
Product exploration explored 100000 steps with 0 reset in 1757 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1900/1900 places, 1897/1897 transitions.
Applied a total of 0 rules in 98 ms. Remains 1900 /1900 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-20 01:16:40] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 1897 rows 1900 cols
[2023-03-20 01:16:40] [INFO ] Computed 898 place invariants in 3 ms
[2023-03-20 01:16:41] [INFO ] Dead Transitions using invariants and state equation in 1529 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1685 ms. Remains : 1900/1900 places, 1897/1897 transitions.
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1900/1900 places, 1897/1897 transitions.
Applied a total of 0 rules in 42 ms. Remains 1900 /1900 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
[2023-03-20 01:16:41] [INFO ] Invariant cache hit.
[2023-03-20 01:16:42] [INFO ] Implicit Places using invariants in 1165 ms returned []
[2023-03-20 01:16:42] [INFO ] Invariant cache hit.
[2023-03-20 01:16:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 01:16:46] [INFO ] Implicit Places using invariants and state equation in 3060 ms returned []
Implicit Place search using SMT with State Equation took 4256 ms to find 0 implicit places.
[2023-03-20 01:16:46] [INFO ] Invariant cache hit.
[2023-03-20 01:16:47] [INFO ] Dead Transitions using invariants and state equation in 1173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5472 ms. Remains : 1900/1900 places, 1897/1897 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-03 finished in 63216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : ShieldIIPt-PT-100B-LTLCardinality-05
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 5914 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5914/5914 places, 5414/5414 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1200 rules applied. Total rules applied 1200 place count 5913 transition count 4213
Reduce places removed 1200 places and 0 transitions.
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2400 place count 4713 transition count 4213
Performed 794 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 794 Pre rules applied. Total rules applied 2400 place count 4713 transition count 3419
Deduced a syphon composed of 794 places in 11 ms
Reduce places removed 794 places and 0 transitions.
Iterating global reduction 2 with 1588 rules applied. Total rules applied 3988 place count 3919 transition count 3419
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 3997 place count 3910 transition count 3410
Iterating global reduction 2 with 9 rules applied. Total rules applied 4006 place count 3910 transition count 3410
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4006 place count 3910 transition count 3404
Deduced a syphon composed of 6 places in 10 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 4018 place count 3904 transition count 3404
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 5 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7414 place count 2206 transition count 1706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7415 place count 2206 transition count 1705
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7417 place count 2205 transition count 1704
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 10 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7619 place count 2104 transition count 1769
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7821 place count 2003 transition count 1837
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 96 places in 6 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8013 place count 1907 transition count 1900
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8015 place count 1905 transition count 1898
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8017 place count 1903 transition count 1898
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8017 place count 1903 transition count 1897
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8019 place count 1902 transition count 1897
Applied a total of 8019 rules in 1809 ms. Remains 1902 /5914 variables (removed 4012) and now considering 1897/5414 (removed 3517) transitions.
// Phase 1: matrix 1897 rows 1902 cols
[2023-03-20 01:16:49] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-20 01:16:50] [INFO ] Implicit Places using invariants in 1551 ms returned [1891]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1553 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1901/5914 places, 1897/5414 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 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 102 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:16:51] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-20 01:16:52] [INFO ] Implicit Places using invariants in 1911 ms returned []
[2023-03-20 01:16:52] [INFO ] Invariant cache hit.
[2023-03-20 01:16:56] [INFO ] Implicit Places using invariants and state equation in 3181 ms returned []
Implicit Place search using SMT with State Equation took 5096 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1900/5914 places, 1896/5414 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 8560 ms. Remains : 1900/5914 places, 1896/5414 transitions.
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (EQ s539 0) (EQ s1425 1)) (OR (EQ s304 0) (EQ s1562 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1362 ms.
Product exploration explored 100000 steps with 0 reset in 1788 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 280 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 103234 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103234 steps, saw 61917 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:17:02] [INFO ] Invariant cache hit.
[2023-03-20 01:17:03] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:17:03] [INFO ] [Nat]Absence check using 898 positive place invariants in 177 ms returned sat
[2023-03-20 01:17:04] [INFO ] After 862ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:17:04] [INFO ] After 1001ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-20 01:17:04] [INFO ] After 1555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 88 ms.
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1896/1896 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1900 transition count 1895
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1900 transition count 1894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1899 transition count 1894
Applied a total of 3 rules in 106 ms. Remains 1899 /1900 variables (removed 1) and now considering 1894/1896 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 1899/1900 places, 1894/1896 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 99767 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99767 steps, saw 61782 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2023-03-20 01:17:08] [INFO ] Computed 898 place invariants in 8 ms
[2023-03-20 01:17:08] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:17:08] [INFO ] [Nat]Absence check using 898 positive place invariants in 167 ms returned sat
[2023-03-20 01:17:09] [INFO ] After 949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:17:10] [INFO ] After 1054ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-20 01:17:10] [INFO ] After 1579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 80 ms.
Support contains 4 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 66 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 62 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-20 01:17:10] [INFO ] Invariant cache hit.
[2023-03-20 01:17:12] [INFO ] Implicit Places using invariants in 1845 ms returned []
[2023-03-20 01:17:12] [INFO ] Invariant cache hit.
[2023-03-20 01:17:15] [INFO ] Implicit Places using invariants and state equation in 3691 ms returned []
Implicit Place search using SMT with State Equation took 5552 ms to find 0 implicit places.
[2023-03-20 01:17:15] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-20 01:17:15] [INFO ] Invariant cache hit.
[2023-03-20 01:17:17] [INFO ] Dead Transitions using invariants and state equation in 1648 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7324 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1899 transition count 1894
Applied a total of 199 rules in 102 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2023-03-20 01:17:17] [INFO ] Computed 898 place invariants in 4 ms
[2023-03-20 01:17:17] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:17:18] [INFO ] [Nat]Absence check using 898 positive place invariants in 143 ms returned sat
[2023-03-20 01:17:19] [INFO ] After 1275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:17:19] [INFO ] After 1435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-20 01:17:19] [INFO ] After 1941ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1900/1900 places, 1896/1896 transitions.
Applied a total of 0 rules in 83 ms. Remains 1900 /1900 variables (removed 0) and now considering 1896/1896 (removed 0) transitions.
// Phase 1: matrix 1896 rows 1900 cols
[2023-03-20 01:17:20] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-20 01:17:22] [INFO ] Implicit Places using invariants in 2199 ms returned []
[2023-03-20 01:17:22] [INFO ] Invariant cache hit.
[2023-03-20 01:17:25] [INFO ] Implicit Places using invariants and state equation in 3043 ms returned []
Implicit Place search using SMT with State Equation took 5254 ms to find 0 implicit places.
[2023-03-20 01:17:25] [INFO ] Invariant cache hit.
[2023-03-20 01:17:26] [INFO ] Dead Transitions using invariants and state equation in 1166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6520 ms. Remains : 1900/1900 places, 1896/1896 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101701 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101701 steps, saw 60965 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:17:30] [INFO ] Invariant cache hit.
[2023-03-20 01:17:30] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:17:31] [INFO ] [Nat]Absence check using 898 positive place invariants in 183 ms returned sat
[2023-03-20 01:17:32] [INFO ] After 967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:17:32] [INFO ] After 1114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-20 01:17:32] [INFO ] After 1719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 95 ms.
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1896/1896 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1900 transition count 1895
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1900 transition count 1894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1899 transition count 1894
Applied a total of 3 rules in 122 ms. Remains 1899 /1900 variables (removed 1) and now considering 1894/1896 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 1899/1900 places, 1894/1896 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 98696 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98696 steps, saw 61116 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2023-03-20 01:17:36] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:17:36] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:17:36] [INFO ] [Nat]Absence check using 898 positive place invariants in 166 ms returned sat
[2023-03-20 01:17:38] [INFO ] After 1529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:17:38] [INFO ] After 1669ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-20 01:17:38] [INFO ] After 2162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 67 ms.
Support contains 4 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 50 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 51 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-20 01:17:38] [INFO ] Invariant cache hit.
[2023-03-20 01:17:40] [INFO ] Implicit Places using invariants in 1500 ms returned []
[2023-03-20 01:17:40] [INFO ] Invariant cache hit.
[2023-03-20 01:17:42] [INFO ] Implicit Places using invariants and state equation in 2476 ms returned []
Implicit Place search using SMT with State Equation took 4000 ms to find 0 implicit places.
[2023-03-20 01:17:42] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-20 01:17:42] [INFO ] Invariant cache hit.
[2023-03-20 01:17:43] [INFO ] Dead Transitions using invariants and state equation in 1167 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5285 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1899 transition count 1894
Applied a total of 199 rules in 114 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2023-03-20 01:17:44] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:17:44] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:17:44] [INFO ] [Nat]Absence check using 898 positive place invariants in 175 ms returned sat
[2023-03-20 01:17:45] [INFO ] After 842ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:17:45] [INFO ] After 932ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-20 01:17:45] [INFO ] After 1497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1374 ms.
Product exploration explored 100000 steps with 0 reset in 1834 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1900/1900 places, 1896/1896 transitions.
Applied a total of 0 rules in 89 ms. Remains 1900 /1900 variables (removed 0) and now considering 1896/1896 (removed 0) transitions.
[2023-03-20 01:17:49] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 1896 rows 1900 cols
[2023-03-20 01:17:49] [INFO ] Computed 898 place invariants in 6 ms
[2023-03-20 01:17:51] [INFO ] Dead Transitions using invariants and state equation in 1157 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1290 ms. Remains : 1900/1900 places, 1896/1896 transitions.
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1900/1900 places, 1896/1896 transitions.
Applied a total of 0 rules in 41 ms. Remains 1900 /1900 variables (removed 0) and now considering 1896/1896 (removed 0) transitions.
[2023-03-20 01:17:51] [INFO ] Invariant cache hit.
[2023-03-20 01:17:52] [INFO ] Implicit Places using invariants in 1760 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 3275 ms returned []
Implicit Place search using SMT with State Equation took 5050 ms to find 0 implicit places.
[2023-03-20 01:17:56] [INFO ] Invariant cache hit.
[2023-03-20 01:17:57] [INFO ] Dead Transitions using invariants and state equation in 1452 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6543 ms. Remains : 1900/1900 places, 1896/1896 transitions.
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-05 finished in 70471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F((G(p2)||p1)))))'
[2023-03-20 01:17:58] [INFO ] Flatten gal took : 174 ms
[2023-03-20 01:17:58] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 01:17:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5914 places, 5414 transitions and 14028 arcs took 24 ms.
Total runtime 924874 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-100B
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
LTLCardinality

BK_STOP 1679275242563

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 1.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldIIPt-PT-100B-LTLCardinality-01
lola: time limit : 717 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-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 3/717 4/32 ShieldIIPt-PT-100B-LTLCardinality-01 179120 m, 35824 m/sec, 262185 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 8/717 10/32 ShieldIIPt-PT-100B-LTLCardinality-01 522143 m, 68604 m/sec, 773581 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 13/717 16/32 ShieldIIPt-PT-100B-LTLCardinality-01 870501 m, 69671 m/sec, 1293850 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 18/717 23/32 ShieldIIPt-PT-100B-LTLCardinality-01 1221398 m, 70179 m/sec, 1815921 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 23/717 29/32 ShieldIIPt-PT-100B-LTLCardinality-01 1573666 m, 70453 m/sec, 2339932 t fired, .

Time elapsed: 34 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 1 (type EXCL) for ShieldIIPt-PT-100B-LTLCardinality-01 (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-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 39 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 10 (type EXCL) for 9 ShieldIIPt-PT-100B-LTLCardinality-05
lola: time limit : 890 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-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/890 7/32 ShieldIIPt-PT-100B-LTLCardinality-05 72925 m, 14585 m/sec, 185347 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/890 12/32 ShieldIIPt-PT-100B-LTLCardinality-05 129621 m, 11339 m/sec, 377204 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/890 18/32 ShieldIIPt-PT-100B-LTLCardinality-05 186112 m, 11298 m/sec, 568120 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/890 23/32 ShieldIIPt-PT-100B-LTLCardinality-05 240097 m, 10797 m/sec, 759453 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 25/890 28/32 ShieldIIPt-PT-100B-LTLCardinality-05 286243 m, 9229 m/sec, 951806 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 30/890 32/32 ShieldIIPt-PT-100B-LTLCardinality-05 332577 m, 9266 m/sec, 1143977 t fired, .

Time elapsed: 69 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 10 (type EXCL) for ShieldIIPt-PT-100B-LTLCardinality-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-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 74 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldIIPt-PT-100B-LTLCardinality-03
lola: time limit : 1175 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-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1175 7/32 ShieldIIPt-PT-100B-LTLCardinality-03 73344 m, 14668 m/sec, 186902 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1175 12/32 ShieldIIPt-PT-100B-LTLCardinality-03 130095 m, 11350 m/sec, 378661 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1175 18/32 ShieldIIPt-PT-100B-LTLCardinality-03 186426 m, 11266 m/sec, 569365 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1175 23/32 ShieldIIPt-PT-100B-LTLCardinality-03 240398 m, 10794 m/sec, 760564 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1175 28/32 ShieldIIPt-PT-100B-LTLCardinality-03 286533 m, 9227 m/sec, 952999 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/1175 32/32 ShieldIIPt-PT-100B-LTLCardinality-03 332824 m, 9258 m/sec, 1145161 t fired, .

Time elapsed: 104 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 7 (type EXCL) for ShieldIIPt-PT-100B-LTLCardinality-03 (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-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 109 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldIIPt-PT-100B-LTLCardinality-02
lola: time limit : 1745 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-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1745 7/32 ShieldIIPt-PT-100B-LTLCardinality-02 73238 m, 14647 m/sec, 186431 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1745 12/32 ShieldIIPt-PT-100B-LTLCardinality-02 129850 m, 11322 m/sec, 378013 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1745 18/32 ShieldIIPt-PT-100B-LTLCardinality-02 186204 m, 11270 m/sec, 568442 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1745 23/32 ShieldIIPt-PT-100B-LTLCardinality-02 239977 m, 10754 m/sec, 758984 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1745 28/32 ShieldIIPt-PT-100B-LTLCardinality-02 286012 m, 9207 m/sec, 950851 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1745 32/32 ShieldIIPt-PT-100B-LTLCardinality-02 332167 m, 9231 m/sec, 1142011 t fired, .

Time elapsed: 139 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 4 (type EXCL) for ShieldIIPt-PT-100B-LTLCardinality-02 (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-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 144 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 13 (type EXCL) for 12 ShieldIIPt-PT-100B-LTLCardinality-15
lola: time limit : 3456 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-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 5/3456 10/32 ShieldIIPt-PT-100B-LTLCardinality-15 347328 m, 69465 m/sec, 543565 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 10/3456 21/32 ShieldIIPt-PT-100B-LTLCardinality-15 715077 m, 73549 m/sec, 1097228 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-100B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 15/3456 30/32 ShieldIIPt-PT-100B-LTLCardinality-15 1018320 m, 60648 m/sec, 1622885 t fired, .

Time elapsed: 159 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 13 (type EXCL) for ShieldIIPt-PT-100B-LTLCardinality-15 (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-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-100B-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-100B-LTLCardinality-01: LTL unknown AGGR
ShieldIIPt-PT-100B-LTLCardinality-02: LTL unknown AGGR
ShieldIIPt-PT-100B-LTLCardinality-03: LTL unknown AGGR
ShieldIIPt-PT-100B-LTLCardinality-05: LTL unknown AGGR
ShieldIIPt-PT-100B-LTLCardinality-15: LTL unknown AGGR


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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldIIPt-PT-100B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715200347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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