Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 ShieldIIPs-PT-100B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-100B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679431767467

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 20:49:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 20:49:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 20:49:29] [INFO ] Load time of PNML (sax parser for PT used): 260 ms
[2023-03-21 20:49:29] [INFO ] Transformed 6003 places.
[2023-03-21 20:49:29] [INFO ] Transformed 5903 transitions.
[2023-03-21 20:49:29] [INFO ] Found NUPN structural information;
[2023-03-21 20:49:30] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 735 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 6003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Discarding 695 places :
Symmetric choice reduction at 0 with 695 rule applications. Total rules 695 place count 5308 transition count 5208
Iterating global reduction 0 with 695 rules applied. Total rules applied 1390 place count 5308 transition count 5208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1391 place count 5307 transition count 5207
Iterating global reduction 0 with 1 rules applied. Total rules applied 1392 place count 5307 transition count 5207
Applied a total of 1392 rules in 2061 ms. Remains 5307 /6003 variables (removed 696) and now considering 5207/5903 (removed 696) transitions.
// Phase 1: matrix 5207 rows 5307 cols
[2023-03-21 20:49:32] [INFO ] Computed 901 place invariants in 88 ms
[2023-03-21 20:49:35] [INFO ] Implicit Places using invariants in 3302 ms returned []
[2023-03-21 20:49:35] [INFO ] Invariant cache hit.
[2023-03-21 20:49:38] [INFO ] Implicit Places using invariants and state equation in 2308 ms returned []
Implicit Place search using SMT with State Equation took 5667 ms to find 0 implicit places.
[2023-03-21 20:49:38] [INFO ] Invariant cache hit.
[2023-03-21 20:49:42] [INFO ] Dead Transitions using invariants and state equation in 4545 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5307/6003 places, 5207/5903 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12301 ms. Remains : 5307/6003 places, 5207/5903 transitions.
Support contains 27 out of 5307 places after structural reductions.
[2023-03-21 20:49:43] [INFO ] Flatten gal took : 303 ms
[2023-03-21 20:49:43] [INFO ] Flatten gal took : 258 ms
[2023-03-21 20:49:43] [INFO ] Input system was already deterministic with 5207 transitions.
Support contains 25 out of 5307 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) 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 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 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
Running SMT prover for 9 properties.
[2023-03-21 20:49:44] [INFO ] Invariant cache hit.
[2023-03-21 20:49:46] [INFO ] After 1311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 20:49:48] [INFO ] [Nat]Absence check using 901 positive place invariants in 576 ms returned sat
[2023-03-21 20:49:55] [INFO ] After 5949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 20:49:57] [INFO ] Deduced a trap composed of 24 places in 2087 ms of which 12 ms to minimize.
[2023-03-21 20:50:00] [INFO ] Deduced a trap composed of 22 places in 2324 ms of which 4 ms to minimize.
[2023-03-21 20:50:02] [INFO ] Deduced a trap composed of 16 places in 2158 ms of which 3 ms to minimize.
[2023-03-21 20:50:04] [INFO ] Deduced a trap composed of 23 places in 2107 ms of which 21 ms to minimize.
[2023-03-21 20:50:07] [INFO ] Deduced a trap composed of 27 places in 2299 ms of which 3 ms to minimize.
[2023-03-21 20:50:09] [INFO ] Deduced a trap composed of 13 places in 2273 ms of which 3 ms to minimize.
[2023-03-21 20:50:12] [INFO ] Deduced a trap composed of 27 places in 1999 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 20:50:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:50:12] [INFO ] After 25782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 3 properties in 2262 ms.
Support contains 11 out of 5307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5307 transition count 4707
Reduce places removed 500 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 501 rules applied. Total rules applied 1001 place count 4807 transition count 4706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1002 place count 4806 transition count 4706
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1002 place count 4806 transition count 4206
Deduced a syphon composed of 500 places in 20 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2002 place count 4306 transition count 4206
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 2005 place count 4303 transition count 4203
Iterating global reduction 3 with 3 rules applied. Total rules applied 2008 place count 4303 transition count 4203
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2008 place count 4303 transition count 4201
Deduced a syphon composed of 2 places in 19 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2012 place count 4301 transition count 4201
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 13 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 3 with 3584 rules applied. Total rules applied 5596 place count 2509 transition count 2409
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 693 times.
Drop transitions removed 693 transitions
Iterating global reduction 3 with 693 rules applied. Total rules applied 6289 place count 2509 transition count 2409
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6290 place count 2508 transition count 2408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6291 place count 2507 transition count 2408
Applied a total of 6291 rules in 1925 ms. Remains 2507 /5307 variables (removed 2800) and now considering 2408/5207 (removed 2799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1925 ms. Remains : 2507/5307 places, 2408/5207 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2408 rows 2507 cols
[2023-03-21 20:50:17] [INFO ] Computed 900 place invariants in 136 ms
[2023-03-21 20:50:17] [INFO ] After 679ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 20:50:18] [INFO ] [Nat]Absence check using 897 positive place invariants in 322 ms returned sat
[2023-03-21 20:50:18] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 20:50:21] [INFO ] After 2005ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 20:50:21] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2023-03-21 20:50:21] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2023-03-21 20:50:22] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 1 ms to minimize.
[2023-03-21 20:50:22] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2023-03-21 20:50:22] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 1 ms to minimize.
[2023-03-21 20:50:22] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 0 ms to minimize.
[2023-03-21 20:50:23] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 0 ms to minimize.
[2023-03-21 20:50:23] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 1 ms to minimize.
[2023-03-21 20:50:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2134 ms
[2023-03-21 20:50:24] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2023-03-21 20:50:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2023-03-21 20:50:24] [INFO ] After 5187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 581 ms.
[2023-03-21 20:50:25] [INFO ] After 7093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 453 ms.
Support contains 9 out of 2507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2507/2507 places, 2408/2408 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2506 transition count 2407
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2506 transition count 2407
Applied a total of 4 rules in 223 ms. Remains 2506 /2507 variables (removed 1) and now considering 2407/2408 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 2506/2507 places, 2407/2408 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 84072 steps, run timeout after 3008 ms. (steps per millisecond=27 ) properties seen :{2=1}
Probabilistic random walk after 84072 steps, saw 83225 distinct states, run finished after 3010 ms. (steps per millisecond=27 ) properties seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 2407 rows 2506 cols
[2023-03-21 20:50:29] [INFO ] Computed 900 place invariants in 17 ms
[2023-03-21 20:50:30] [INFO ] After 512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 20:50:31] [INFO ] [Nat]Absence check using 897 positive place invariants in 340 ms returned sat
[2023-03-21 20:50:31] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 20:50:33] [INFO ] After 1866ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 20:50:33] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 1 ms to minimize.
[2023-03-21 20:50:33] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2023-03-21 20:50:33] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2023-03-21 20:50:34] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 26 ms to minimize.
[2023-03-21 20:50:34] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 13 ms to minimize.
[2023-03-21 20:50:35] [INFO ] Deduced a trap composed of 18 places in 304 ms of which 0 ms to minimize.
[2023-03-21 20:50:35] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 0 ms to minimize.
[2023-03-21 20:50:35] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 1 ms to minimize.
[2023-03-21 20:50:35] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 0 ms to minimize.
[2023-03-21 20:50:36] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2023-03-21 20:50:36] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 1 ms to minimize.
[2023-03-21 20:50:36] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3252 ms
[2023-03-21 20:50:37] [INFO ] After 5912ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 500 ms.
[2023-03-21 20:50:37] [INFO ] After 7464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 264 ms.
Support contains 7 out of 2506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2407/2407 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2505 transition count 2406
Applied a total of 2 rules in 147 ms. Remains 2505 /2506 variables (removed 1) and now considering 2406/2407 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 2505/2506 places, 2406/2407 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 92012 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92012 steps, saw 91128 distinct states, run finished after 3017 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2406 rows 2505 cols
[2023-03-21 20:50:41] [INFO ] Computed 900 place invariants in 19 ms
[2023-03-21 20:50:42] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 20:50:42] [INFO ] [Nat]Absence check using 897 positive place invariants in 213 ms returned sat
[2023-03-21 20:50:42] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 20:50:44] [INFO ] After 1935ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 20:50:45] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 1 ms to minimize.
[2023-03-21 20:50:45] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2023-03-21 20:50:45] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2023-03-21 20:50:46] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2023-03-21 20:50:46] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 0 ms to minimize.
[2023-03-21 20:50:46] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 26 ms to minimize.
[2023-03-21 20:50:47] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 0 ms to minimize.
[2023-03-21 20:50:47] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 0 ms to minimize.
[2023-03-21 20:50:47] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 0 ms to minimize.
[2023-03-21 20:50:48] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 0 ms to minimize.
[2023-03-21 20:50:48] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 14 ms to minimize.
[2023-03-21 20:50:48] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2023-03-21 20:50:48] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 0 ms to minimize.
[2023-03-21 20:50:49] [INFO ] Deduced a trap composed of 17 places in 451 ms of which 1 ms to minimize.
[2023-03-21 20:50:49] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2023-03-21 20:50:49] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2023-03-21 20:50:50] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2023-03-21 20:50:50] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 1 ms to minimize.
[2023-03-21 20:50:50] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5496 ms
[2023-03-21 20:50:50] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 1 ms to minimize.
[2023-03-21 20:50:51] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2023-03-21 20:50:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 625 ms
[2023-03-21 20:50:52] [INFO ] Deduced a trap composed of 11 places in 942 ms of which 0 ms to minimize.
[2023-03-21 20:50:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1197 ms
[2023-03-21 20:50:52] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2023-03-21 20:50:53] [INFO ] Deduced a trap composed of 11 places in 515 ms of which 0 ms to minimize.
[2023-03-21 20:50:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 972 ms
[2023-03-21 20:50:53] [INFO ] After 10618ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 462 ms.
[2023-03-21 20:50:54] [INFO ] After 11769ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 438 ms.
Support contains 7 out of 2505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2505/2505 places, 2406/2406 transitions.
Applied a total of 0 rules in 96 ms. Remains 2505 /2505 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 2505/2505 places, 2406/2406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2505/2505 places, 2406/2406 transitions.
Applied a total of 0 rules in 99 ms. Remains 2505 /2505 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
[2023-03-21 20:50:54] [INFO ] Invariant cache hit.
[2023-03-21 20:50:57] [INFO ] Implicit Places using invariants in 2630 ms returned []
[2023-03-21 20:50:57] [INFO ] Invariant cache hit.
[2023-03-21 20:51:02] [INFO ] Implicit Places using invariants and state equation in 5305 ms returned []
Implicit Place search using SMT with State Equation took 7938 ms to find 0 implicit places.
[2023-03-21 20:51:02] [INFO ] Redundant transitions in 175 ms returned []
[2023-03-21 20:51:02] [INFO ] Invariant cache hit.
[2023-03-21 20:51:04] [INFO ] Dead Transitions using invariants and state equation in 1638 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9871 ms. Remains : 2505/2505 places, 2406/2406 transitions.
Applied a total of 0 rules in 106 ms. Remains 2505 /2505 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-21 20:51:04] [INFO ] Invariant cache hit.
[2023-03-21 20:51:05] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 20:51:05] [INFO ] [Nat]Absence check using 897 positive place invariants in 317 ms returned sat
[2023-03-21 20:51:05] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 20:51:07] [INFO ] After 1781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 20:51:08] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2023-03-21 20:51:08] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 1 ms to minimize.
[2023-03-21 20:51:08] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 6 ms to minimize.
[2023-03-21 20:51:08] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 1 ms to minimize.
[2023-03-21 20:51:08] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2023-03-21 20:51:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1138 ms
[2023-03-21 20:51:09] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2023-03-21 20:51:09] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 1 ms to minimize.
[2023-03-21 20:51:09] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 0 ms to minimize.
[2023-03-21 20:51:09] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 0 ms to minimize.
[2023-03-21 20:51:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1041 ms
[2023-03-21 20:51:10] [INFO ] After 4438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 381 ms.
[2023-03-21 20:51:10] [INFO ] After 5781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 1202 stabilizing places and 1202 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' '!(X(F(p0)))'
Support contains 2 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 5303 transition count 5203
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 5303 transition count 5203
Applied a total of 8 rules in 1270 ms. Remains 5303 /5307 variables (removed 4) and now considering 5203/5207 (removed 4) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-21 20:51:12] [INFO ] Computed 901 place invariants in 20 ms
[2023-03-21 20:51:14] [INFO ] Implicit Places using invariants in 2116 ms returned []
[2023-03-21 20:51:14] [INFO ] Invariant cache hit.
[2023-03-21 20:51:15] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 2671 ms to find 0 implicit places.
[2023-03-21 20:51:15] [INFO ] Invariant cache hit.
[2023-03-21 20:51:18] [INFO ] Dead Transitions using invariants and state equation in 3666 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5307 places, 5203/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7611 ms. Remains : 5303/5307 places, 5203/5207 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-01 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 s2221 0) (EQ s183 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 2858 ms.
Product exploration explored 100000 steps with 50000 reset in 2628 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 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 100 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-01 finished in 13659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F(p0)))))))'
Support contains 2 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 5302 transition count 5202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 5302 transition count 5202
Applied a total of 10 rules in 1347 ms. Remains 5302 /5307 variables (removed 5) and now considering 5202/5207 (removed 5) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-21 20:51:26] [INFO ] Computed 901 place invariants in 25 ms
[2023-03-21 20:51:28] [INFO ] Implicit Places using invariants in 1882 ms returned []
[2023-03-21 20:51:28] [INFO ] Invariant cache hit.
[2023-03-21 20:51:30] [INFO ] Implicit Places using invariants and state equation in 1992 ms returned []
Implicit Place search using SMT with State Equation took 3898 ms to find 0 implicit places.
[2023-03-21 20:51:30] [INFO ] Invariant cache hit.
[2023-03-21 20:51:33] [INFO ] Dead Transitions using invariants and state equation in 3883 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5307 places, 5202/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9131 ms. Remains : 5302/5307 places, 5202/5207 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(AND (NEQ s2658 0) (NEQ s3608 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]]
Stuttering criterion allowed to conclude after 12363 steps with 0 reset in 205 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-03 finished in 9686 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 2 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 5303 transition count 5203
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 5303 transition count 5203
Applied a total of 8 rules in 1350 ms. Remains 5303 /5307 variables (removed 4) and now considering 5203/5207 (removed 4) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-21 20:51:35] [INFO ] Computed 901 place invariants in 22 ms
[2023-03-21 20:51:38] [INFO ] Implicit Places using invariants in 2182 ms returned []
[2023-03-21 20:51:38] [INFO ] Invariant cache hit.
[2023-03-21 20:51:40] [INFO ] Implicit Places using invariants and state equation in 2091 ms returned []
Implicit Place search using SMT with State Equation took 4296 ms to find 0 implicit places.
[2023-03-21 20:51:40] [INFO ] Invariant cache hit.
[2023-03-21 20:51:44] [INFO ] Dead Transitions using invariants and state equation in 3895 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5307 places, 5203/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9545 ms. Remains : 5303/5307 places, 5203/5207 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-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:(OR (EQ s3879 0) (EQ s2205 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]]
Entered a terminal (fully accepting) state of product in 928 steps with 0 reset in 17 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-05 finished in 9779 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&&F(G(((p1 U X(p2)) U p0))))))'
Support contains 6 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 5303 transition count 5203
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 5303 transition count 5203
Applied a total of 8 rules in 1335 ms. Remains 5303 /5307 variables (removed 4) and now considering 5203/5207 (removed 4) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-21 20:51:45] [INFO ] Computed 901 place invariants in 18 ms
[2023-03-21 20:51:47] [INFO ] Implicit Places using invariants in 2034 ms returned []
[2023-03-21 20:51:47] [INFO ] Invariant cache hit.
[2023-03-21 20:51:50] [INFO ] Implicit Places using invariants and state equation in 2486 ms returned []
Implicit Place search using SMT with State Equation took 4529 ms to find 0 implicit places.
[2023-03-21 20:51:50] [INFO ] Invariant cache hit.
[2023-03-21 20:51:54] [INFO ] Dead Transitions using invariants and state equation in 4699 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5307 places, 5203/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10567 ms. Remains : 5303/5307 places, 5203/5207 transitions.
Stuttering acceptance computed with spot in 350 ms :[(NOT p0), (NOT p0), true, (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(NOT p0), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s428 0) (EQ s4955 1)), p1:(OR (EQ s1065 0) (EQ s4769 1)), p2:(OR (EQ s3476 0) (EQ s2102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 1788 ms.
Product exploration explored 100000 steps with 8 reset in 2035 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 571 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 4 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 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 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 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 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 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 81539 steps, run timeout after 3002 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81539 steps, saw 80477 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-21 20:52:03] [INFO ] Invariant cache hit.
[2023-03-21 20:52:05] [INFO ] After 1577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 20:52:07] [INFO ] [Nat]Absence check using 901 positive place invariants in 589 ms returned sat
[2023-03-21 20:52:15] [INFO ] After 6935ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 20:52:17] [INFO ] Deduced a trap composed of 14 places in 1865 ms of which 4 ms to minimize.
[2023-03-21 20:52:20] [INFO ] Deduced a trap composed of 35 places in 2396 ms of which 3 ms to minimize.
[2023-03-21 20:52:22] [INFO ] Deduced a trap composed of 11 places in 2394 ms of which 3 ms to minimize.
[2023-03-21 20:52:25] [INFO ] Deduced a trap composed of 27 places in 2355 ms of which 5 ms to minimize.
[2023-03-21 20:52:27] [INFO ] Deduced a trap composed of 18 places in 1950 ms of which 6 ms to minimize.
[2023-03-21 20:52:29] [INFO ] Deduced a trap composed of 20 places in 1827 ms of which 3 ms to minimize.
[2023-03-21 20:52:31] [INFO ] Deduced a trap composed of 16 places in 2088 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 20:52:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:52:31] [INFO ] After 26338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 1517 ms.
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5303 transition count 4703
Reduce places removed 500 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 501 rules applied. Total rules applied 1001 place count 4803 transition count 4702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1002 place count 4802 transition count 4702
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1002 place count 4802 transition count 4202
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2002 place count 4302 transition count 4202
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 12 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 3 with 3594 rules applied. Total rules applied 5596 place count 2505 transition count 2405
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 3 with 695 rules applied. Total rules applied 6291 place count 2505 transition count 2405
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6292 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6293 place count 2503 transition count 2404
Applied a total of 6293 rules in 1086 ms. Remains 2503 /5303 variables (removed 2800) and now considering 2404/5203 (removed 2799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1086 ms. Remains : 2503/5303 places, 2404/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2404 rows 2503 cols
[2023-03-21 20:52:35] [INFO ] Computed 900 place invariants in 14 ms
[2023-03-21 20:52:36] [INFO ] After 815ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 20:52:37] [INFO ] [Nat]Absence check using 898 positive place invariants in 472 ms returned sat
[2023-03-21 20:52:37] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-21 20:52:40] [INFO ] After 2649ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 20:52:40] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2023-03-21 20:52:41] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 0 ms to minimize.
[2023-03-21 20:52:41] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 0 ms to minimize.
[2023-03-21 20:52:41] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 1 ms to minimize.
[2023-03-21 20:52:41] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2023-03-21 20:52:42] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2023-03-21 20:52:42] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2023-03-21 20:52:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1709 ms
[2023-03-21 20:52:43] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 1 ms to minimize.
[2023-03-21 20:52:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
[2023-03-21 20:52:44] [INFO ] Deduced a trap composed of 18 places in 260 ms of which 0 ms to minimize.
[2023-03-21 20:52:44] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 0 ms to minimize.
[2023-03-21 20:52:44] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2023-03-21 20:52:44] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2023-03-21 20:52:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1166 ms
[2023-03-21 20:52:44] [INFO ] After 7021ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 698 ms.
[2023-03-21 20:52:45] [INFO ] After 9126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 413 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 98 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 78036 steps, run timeout after 3003 ms. (steps per millisecond=25 ) properties seen :{1=1, 2=1, 4=1, 5=1, 6=1}
Probabilistic random walk after 78036 steps, saw 77218 distinct states, run finished after 3004 ms. (steps per millisecond=25 ) properties seen :5
Running SMT prover for 2 properties.
[2023-03-21 20:52:50] [INFO ] Invariant cache hit.
[2023-03-21 20:52:50] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 20:52:51] [INFO ] [Nat]Absence check using 898 positive place invariants in 181 ms returned sat
[2023-03-21 20:52:51] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-21 20:52:53] [INFO ] After 1632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 20:52:53] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2023-03-21 20:52:53] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 0 ms to minimize.
[2023-03-21 20:52:54] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 0 ms to minimize.
[2023-03-21 20:52:54] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2023-03-21 20:52:54] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2023-03-21 20:52:54] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2023-03-21 20:52:54] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2023-03-21 20:52:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1942 ms
[2023-03-21 20:52:55] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2023-03-21 20:52:55] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 0 ms to minimize.
[2023-03-21 20:52:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 691 ms
[2023-03-21 20:52:55] [INFO ] After 4393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 300 ms.
[2023-03-21 20:52:56] [INFO ] After 5242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 123 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 144 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 108007 steps, run timeout after 3004 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 108007 steps, saw 107038 distinct states, run finished after 3004 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 20:52:59] [INFO ] Invariant cache hit.
[2023-03-21 20:53:00] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 20:53:00] [INFO ] [Nat]Absence check using 898 positive place invariants in 285 ms returned sat
[2023-03-21 20:53:00] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 15 ms returned sat
[2023-03-21 20:53:02] [INFO ] After 1483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 20:53:02] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2023-03-21 20:53:03] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 1 ms to minimize.
[2023-03-21 20:53:03] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 2 ms to minimize.
[2023-03-21 20:53:03] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2023-03-21 20:53:04] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2023-03-21 20:53:04] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2023-03-21 20:53:04] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2023-03-21 20:53:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2048 ms
[2023-03-21 20:53:04] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2023-03-21 20:53:05] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2023-03-21 20:53:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 558 ms
[2023-03-21 20:53:05] [INFO ] After 4244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 269 ms.
[2023-03-21 20:53:05] [INFO ] After 5361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 199 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 119 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 169 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
[2023-03-21 20:53:06] [INFO ] Invariant cache hit.
[2023-03-21 20:53:08] [INFO ] Implicit Places using invariants in 2270 ms returned []
[2023-03-21 20:53:08] [INFO ] Invariant cache hit.
[2023-03-21 20:53:12] [INFO ] Implicit Places using invariants and state equation in 4450 ms returned []
Implicit Place search using SMT with State Equation took 6725 ms to find 0 implicit places.
[2023-03-21 20:53:12] [INFO ] Redundant transitions in 114 ms returned []
[2023-03-21 20:53:12] [INFO ] Invariant cache hit.
[2023-03-21 20:53:14] [INFO ] Dead Transitions using invariants and state equation in 1488 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8539 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 108 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-21 20:53:14] [INFO ] Invariant cache hit.
[2023-03-21 20:53:14] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 20:53:15] [INFO ] [Nat]Absence check using 898 positive place invariants in 164 ms returned sat
[2023-03-21 20:53:15] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 20:53:17] [INFO ] After 1673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 20:53:17] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 1 ms to minimize.
[2023-03-21 20:53:17] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 0 ms to minimize.
[2023-03-21 20:53:18] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2023-03-21 20:53:18] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 0 ms to minimize.
[2023-03-21 20:53:18] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2023-03-21 20:53:18] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 0 ms to minimize.
[2023-03-21 20:53:19] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2023-03-21 20:53:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1946 ms
[2023-03-21 20:53:19] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2023-03-21 20:53:19] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
[2023-03-21 20:53:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 556 ms
[2023-03-21 20:53:19] [INFO ] After 4351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-21 20:53:20] [INFO ] After 5125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p2) p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 564 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Applied a total of 0 rules in 620 ms. Remains 5303 /5303 variables (removed 0) and now considering 5203/5203 (removed 0) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-21 20:53:21] [INFO ] Computed 901 place invariants in 57 ms
[2023-03-21 20:53:23] [INFO ] Implicit Places using invariants in 2195 ms returned []
[2023-03-21 20:53:23] [INFO ] Invariant cache hit.
[2023-03-21 20:53:25] [INFO ] Implicit Places using invariants and state equation in 2063 ms returned []
Implicit Place search using SMT with State Equation took 4272 ms to find 0 implicit places.
[2023-03-21 20:53:26] [INFO ] Invariant cache hit.
[2023-03-21 20:53:31] [INFO ] Dead Transitions using invariants and state equation in 5566 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10470 ms. Remains : 5303/5303 places, 5203/5203 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1315 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 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 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 26 ms. (steps per millisecond=384 ) 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 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 88205 steps, run timeout after 3002 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88205 steps, saw 87023 distinct states, run finished after 3002 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-21 20:53:36] [INFO ] Invariant cache hit.
[2023-03-21 20:53:38] [INFO ] After 1507ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 20:53:40] [INFO ] [Nat]Absence check using 901 positive place invariants in 553 ms returned sat
[2023-03-21 20:53:47] [INFO ] After 5689ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 20:53:49] [INFO ] Deduced a trap composed of 14 places in 1898 ms of which 3 ms to minimize.
[2023-03-21 20:53:51] [INFO ] Deduced a trap composed of 35 places in 1825 ms of which 3 ms to minimize.
[2023-03-21 20:53:53] [INFO ] Deduced a trap composed of 11 places in 2245 ms of which 4 ms to minimize.
[2023-03-21 20:53:56] [INFO ] Deduced a trap composed of 27 places in 2354 ms of which 3 ms to minimize.
[2023-03-21 20:53:58] [INFO ] Deduced a trap composed of 18 places in 2179 ms of which 3 ms to minimize.
[2023-03-21 20:54:00] [INFO ] Deduced a trap composed of 20 places in 2010 ms of which 4 ms to minimize.
[2023-03-21 20:54:04] [INFO ] Deduced a trap composed of 16 places in 3376 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 20:54:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:54:04] [INFO ] After 26050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 2142 ms.
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5303 transition count 4703
Reduce places removed 500 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 501 rules applied. Total rules applied 1001 place count 4803 transition count 4702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1002 place count 4802 transition count 4702
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1002 place count 4802 transition count 4202
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2002 place count 4302 transition count 4202
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 16 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 3 with 3594 rules applied. Total rules applied 5596 place count 2505 transition count 2405
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 3 with 695 rules applied. Total rules applied 6291 place count 2505 transition count 2405
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6292 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6293 place count 2503 transition count 2404
Applied a total of 6293 rules in 1171 ms. Remains 2503 /5303 variables (removed 2800) and now considering 2404/5203 (removed 2799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1171 ms. Remains : 2503/5303 places, 2404/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2404 rows 2503 cols
[2023-03-21 20:54:09] [INFO ] Computed 900 place invariants in 38 ms
[2023-03-21 20:54:09] [INFO ] After 663ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 20:54:10] [INFO ] [Nat]Absence check using 898 positive place invariants in 226 ms returned sat
[2023-03-21 20:54:10] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 20:54:13] [INFO ] After 2242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 20:54:13] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2023-03-21 20:54:13] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2023-03-21 20:54:14] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 0 ms to minimize.
[2023-03-21 20:54:14] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 0 ms to minimize.
[2023-03-21 20:54:14] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 1 ms to minimize.
[2023-03-21 20:54:14] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2023-03-21 20:54:15] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2023-03-21 20:54:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1993 ms
[2023-03-21 20:54:16] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2023-03-21 20:54:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 410 ms
[2023-03-21 20:54:17] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 0 ms to minimize.
[2023-03-21 20:54:17] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2023-03-21 20:54:17] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 1 ms to minimize.
[2023-03-21 20:54:17] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2023-03-21 20:54:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1296 ms
[2023-03-21 20:54:18] [INFO ] After 7183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 816 ms.
[2023-03-21 20:54:18] [INFO ] After 9156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 516 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 104 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 63193 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{1=1, 2=1, 4=1, 5=1}
Probabilistic random walk after 63193 steps, saw 62448 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :4
Running SMT prover for 3 properties.
[2023-03-21 20:54:23] [INFO ] Invariant cache hit.
[2023-03-21 20:54:24] [INFO ] After 417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 20:54:25] [INFO ] [Nat]Absence check using 898 positive place invariants in 418 ms returned sat
[2023-03-21 20:54:25] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 20:54:27] [INFO ] After 2424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 20:54:28] [INFO ] Deduced a trap composed of 8 places in 533 ms of which 1 ms to minimize.
[2023-03-21 20:54:28] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 0 ms to minimize.
[2023-03-21 20:54:29] [INFO ] Deduced a trap composed of 8 places in 318 ms of which 16 ms to minimize.
[2023-03-21 20:54:29] [INFO ] Deduced a trap composed of 9 places in 299 ms of which 3 ms to minimize.
[2023-03-21 20:54:29] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 1 ms to minimize.
[2023-03-21 20:54:30] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 1 ms to minimize.
[2023-03-21 20:54:30] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 1 ms to minimize.
[2023-03-21 20:54:30] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 1 ms to minimize.
[2023-03-21 20:54:31] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 2 ms to minimize.
[2023-03-21 20:54:31] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 2 ms to minimize.
[2023-03-21 20:54:31] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 0 ms to minimize.
[2023-03-21 20:54:32] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 0 ms to minimize.
[2023-03-21 20:54:32] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2023-03-21 20:54:32] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4601 ms
[2023-03-21 20:54:32] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2023-03-21 20:54:34] [INFO ] Deduced a trap composed of 8 places in 1427 ms of which 1 ms to minimize.
[2023-03-21 20:54:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1936 ms
[2023-03-21 20:54:34] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 0 ms to minimize.
[2023-03-21 20:54:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 466 ms
[2023-03-21 20:54:35] [INFO ] After 9729ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 483 ms.
[2023-03-21 20:54:35] [INFO ] After 11307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 134 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 103 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 115256 steps, run timeout after 3013 ms. (steps per millisecond=38 ) properties seen :{2=1}
Probabilistic random walk after 115256 steps, saw 114225 distinct states, run finished after 3013 ms. (steps per millisecond=38 ) properties seen :1
Running SMT prover for 2 properties.
[2023-03-21 20:54:39] [INFO ] Invariant cache hit.
[2023-03-21 20:54:39] [INFO ] After 353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 20:54:40] [INFO ] [Nat]Absence check using 898 positive place invariants in 184 ms returned sat
[2023-03-21 20:54:40] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 20:54:42] [INFO ] After 1920ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 20:54:42] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2023-03-21 20:54:42] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 1 ms to minimize.
[2023-03-21 20:54:43] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 1 ms to minimize.
[2023-03-21 20:54:43] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2023-03-21 20:54:43] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2023-03-21 20:54:43] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2023-03-21 20:54:43] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2023-03-21 20:54:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1666 ms
[2023-03-21 20:54:44] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2023-03-21 20:54:44] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-21 20:54:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 509 ms
[2023-03-21 20:54:44] [INFO ] After 4234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-21 20:54:44] [INFO ] After 5028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 130 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 97 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 113859 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113859 steps, saw 112841 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 20:54:48] [INFO ] Invariant cache hit.
[2023-03-21 20:54:48] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 20:54:49] [INFO ] [Nat]Absence check using 898 positive place invariants in 235 ms returned sat
[2023-03-21 20:54:49] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-21 20:54:50] [INFO ] After 1446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 20:54:51] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 1 ms to minimize.
[2023-03-21 20:54:51] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2023-03-21 20:54:51] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 0 ms to minimize.
[2023-03-21 20:54:52] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2023-03-21 20:54:52] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2023-03-21 20:54:52] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 1 ms to minimize.
[2023-03-21 20:54:52] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2023-03-21 20:54:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1924 ms
[2023-03-21 20:54:53] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2023-03-21 20:54:53] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 0 ms to minimize.
[2023-03-21 20:54:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 667 ms
[2023-03-21 20:54:53] [INFO ] After 4216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 239 ms.
[2023-03-21 20:54:54] [INFO ] After 5094ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 131 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 127 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 119 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
[2023-03-21 20:54:54] [INFO ] Invariant cache hit.
[2023-03-21 20:54:56] [INFO ] Implicit Places using invariants in 2136 ms returned []
[2023-03-21 20:54:56] [INFO ] Invariant cache hit.
[2023-03-21 20:55:01] [INFO ] Implicit Places using invariants and state equation in 5226 ms returned []
Implicit Place search using SMT with State Equation took 7368 ms to find 0 implicit places.
[2023-03-21 20:55:01] [INFO ] Redundant transitions in 158 ms returned []
[2023-03-21 20:55:01] [INFO ] Invariant cache hit.
[2023-03-21 20:55:03] [INFO ] Dead Transitions using invariants and state equation in 1854 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9536 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 100 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-21 20:55:03] [INFO ] Invariant cache hit.
[2023-03-21 20:55:04] [INFO ] After 304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 20:55:04] [INFO ] [Nat]Absence check using 898 positive place invariants in 186 ms returned sat
[2023-03-21 20:55:04] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 20:55:06] [INFO ] After 1698ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 20:55:06] [INFO ] Deduced a trap composed of 9 places in 365 ms of which 0 ms to minimize.
[2023-03-21 20:55:07] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2023-03-21 20:55:07] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 1 ms to minimize.
[2023-03-21 20:55:07] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 0 ms to minimize.
[2023-03-21 20:55:07] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2023-03-21 20:55:08] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2023-03-21 20:55:08] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2023-03-21 20:55:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1976 ms
[2023-03-21 20:55:09] [INFO ] Deduced a trap composed of 4 places in 565 ms of which 1 ms to minimize.
[2023-03-21 20:55:10] [INFO ] Deduced a trap composed of 9 places in 855 ms of which 2 ms to minimize.
[2023-03-21 20:55:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1734 ms
[2023-03-21 20:55:10] [INFO ] After 5544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 232 ms.
[2023-03-21 20:55:10] [INFO ] After 6339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p2) p0 (NOT p1)))]
Knowledge based reduction with 20 factoid took 1455 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 8 reset in 1733 ms.
Product exploration explored 100000 steps with 9 reset in 2092 ms.
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Applied a total of 0 rules in 759 ms. Remains 5303 /5303 variables (removed 0) and now considering 5203/5203 (removed 0) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-21 20:55:17] [INFO ] Computed 901 place invariants in 52 ms
[2023-03-21 20:55:19] [INFO ] Implicit Places using invariants in 2135 ms returned []
[2023-03-21 20:55:19] [INFO ] Invariant cache hit.
[2023-03-21 20:55:21] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned []
Implicit Place search using SMT with State Equation took 3875 ms to find 0 implicit places.
[2023-03-21 20:55:21] [INFO ] Invariant cache hit.
[2023-03-21 20:55:28] [INFO ] Dead Transitions using invariants and state equation in 6896 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11546 ms. Remains : 5303/5303 places, 5203/5203 transitions.
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-07 finished in 224438 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((X(p0)||(G(p1) U G(p2)))))'
Support contains 6 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 5303 transition count 5203
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 5303 transition count 5203
Applied a total of 8 rules in 1309 ms. Remains 5303 /5307 variables (removed 4) and now considering 5203/5207 (removed 4) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-21 20:55:30] [INFO ] Computed 901 place invariants in 44 ms
[2023-03-21 20:55:32] [INFO ] Implicit Places using invariants in 2012 ms returned []
[2023-03-21 20:55:32] [INFO ] Invariant cache hit.
[2023-03-21 20:55:33] [INFO ] Implicit Places using invariants and state equation in 1772 ms returned []
Implicit Place search using SMT with State Equation took 3801 ms to find 0 implicit places.
[2023-03-21 20:55:33] [INFO ] Invariant cache hit.
[2023-03-21 20:55:38] [INFO ] Dead Transitions using invariants and state equation in 4156 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5307 places, 5203/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9268 ms. Remains : 5303/5307 places, 5203/5207 transitions.
Stuttering acceptance computed with spot in 455 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (AND p2 (NOT p1)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p2 p1), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(OR (EQ s236 0) (EQ s589 1)), p1:(OR (EQ s3203 0) (EQ s3347 1)), p0:(OR (EQ s1525 0) (EQ s3139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33291 reset in 2063 ms.
Product exploration explored 100000 steps with 33361 reset in 2043 ms.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), true, (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 1210 ms. Reduced automaton from 9 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 489 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p0) p1), true, (AND (NOT p1) p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-21 20:55:45] [INFO ] Invariant cache hit.
[2023-03-21 20:55:46] [INFO ] After 1386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 20:55:48] [INFO ] [Nat]Absence check using 901 positive place invariants in 561 ms returned sat
[2023-03-21 20:55:54] [INFO ] After 5446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 20:55:56] [INFO ] Deduced a trap composed of 24 places in 1957 ms of which 3 ms to minimize.
[2023-03-21 20:55:58] [INFO ] Deduced a trap composed of 20 places in 2075 ms of which 3 ms to minimize.
[2023-03-21 20:56:01] [INFO ] Deduced a trap composed of 16 places in 2044 ms of which 3 ms to minimize.
[2023-03-21 20:56:03] [INFO ] Deduced a trap composed of 28 places in 1884 ms of which 2 ms to minimize.
[2023-03-21 20:56:05] [INFO ] Deduced a trap composed of 22 places in 2064 ms of which 3 ms to minimize.
[2023-03-21 20:56:07] [INFO ] Deduced a trap composed of 25 places in 2167 ms of which 4 ms to minimize.
[2023-03-21 20:56:10] [INFO ] Deduced a trap composed of 23 places in 2089 ms of which 3 ms to minimize.
[2023-03-21 20:56:12] [INFO ] Deduced a trap composed of 18 places in 2197 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 20:56:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:56:12] [INFO ] After 26235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 1 properties in 1657 ms.
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5303 transition count 4702
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4802 transition count 4702
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1002 place count 4802 transition count 4202
Deduced a syphon composed of 500 places in 20 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2002 place count 4302 transition count 4202
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 12 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 5590 place count 2508 transition count 2408
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 697 times.
Drop transitions removed 697 transitions
Iterating global reduction 2 with 697 rules applied. Total rules applied 6287 place count 2508 transition count 2408
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6288 place count 2507 transition count 2407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6289 place count 2506 transition count 2407
Applied a total of 6289 rules in 1159 ms. Remains 2506 /5303 variables (removed 2797) and now considering 2407/5203 (removed 2796) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1159 ms. Remains : 2506/5303 places, 2407/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Interrupted probabilistic random walk after 79120 steps, run timeout after 3003 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79120 steps, saw 78310 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2407 rows 2506 cols
[2023-03-21 20:56:19] [INFO ] Computed 900 place invariants in 15 ms
[2023-03-21 20:56:20] [INFO ] After 501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 20:56:21] [INFO ] [Nat]Absence check using 898 positive place invariants in 211 ms returned sat
[2023-03-21 20:56:21] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-21 20:56:24] [INFO ] After 2376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 20:56:24] [INFO ] Deduced a trap composed of 5 places in 308 ms of which 1 ms to minimize.
[2023-03-21 20:56:24] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 1 ms to minimize.
[2023-03-21 20:56:25] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2023-03-21 20:56:25] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 1 ms to minimize.
[2023-03-21 20:56:25] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2023-03-21 20:56:26] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2023-03-21 20:56:26] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2023-03-21 20:56:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2316 ms
[2023-03-21 20:56:26] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2023-03-21 20:56:27] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 1 ms to minimize.
[2023-03-21 20:56:27] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2023-03-21 20:56:27] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2023-03-21 20:56:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1230 ms
[2023-03-21 20:56:28] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 0 ms to minimize.
[2023-03-21 20:56:28] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 0 ms to minimize.
[2023-03-21 20:56:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 614 ms
[2023-03-21 20:56:28] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2023-03-21 20:56:29] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 1 ms to minimize.
[2023-03-21 20:56:29] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2023-03-21 20:56:29] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
[2023-03-21 20:56:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1057 ms
[2023-03-21 20:56:29] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 0 ms to minimize.
[2023-03-21 20:56:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2023-03-21 20:56:30] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2023-03-21 20:56:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2023-03-21 20:56:31] [INFO ] After 9336ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 943 ms.
[2023-03-21 20:56:31] [INFO ] After 11519ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 736 ms.
Support contains 6 out of 2506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2407/2407 transitions.
Applied a total of 0 rules in 115 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 2506/2506 places, 2407/2407 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2407/2407 transitions.
Applied a total of 0 rules in 105 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
[2023-03-21 20:56:32] [INFO ] Invariant cache hit.
[2023-03-21 20:56:34] [INFO ] Implicit Places using invariants in 1598 ms returned []
[2023-03-21 20:56:34] [INFO ] Invariant cache hit.
[2023-03-21 20:56:39] [INFO ] Implicit Places using invariants and state equation in 4643 ms returned []
Implicit Place search using SMT with State Equation took 6257 ms to find 0 implicit places.
[2023-03-21 20:56:39] [INFO ] Redundant transitions in 93 ms returned []
[2023-03-21 20:56:39] [INFO ] Invariant cache hit.
[2023-03-21 20:56:41] [INFO ] Dead Transitions using invariants and state equation in 1898 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8380 ms. Remains : 2506/2506 places, 2407/2407 transitions.
Applied a total of 0 rules in 104 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-21 20:56:41] [INFO ] Invariant cache hit.
[2023-03-21 20:56:41] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 20:56:42] [INFO ] [Nat]Absence check using 898 positive place invariants in 215 ms returned sat
[2023-03-21 20:56:42] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-21 20:56:45] [INFO ] After 2309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 20:56:46] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 1 ms to minimize.
[2023-03-21 20:56:46] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 0 ms to minimize.
[2023-03-21 20:56:46] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2023-03-21 20:56:46] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2023-03-21 20:56:47] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 0 ms to minimize.
[2023-03-21 20:56:47] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 1 ms to minimize.
[2023-03-21 20:56:47] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 1 ms to minimize.
[2023-03-21 20:56:48] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 0 ms to minimize.
[2023-03-21 20:56:48] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 0 ms to minimize.
[2023-03-21 20:56:48] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2023-03-21 20:56:48] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2023-03-21 20:56:48] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 0 ms to minimize.
[2023-03-21 20:56:49] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2023-03-21 20:56:49] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2023-03-21 20:56:49] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 0 ms to minimize.
[2023-03-21 20:56:49] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4294 ms
[2023-03-21 20:56:50] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2023-03-21 20:56:50] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 1 ms to minimize.
[2023-03-21 20:56:51] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 0 ms to minimize.
[2023-03-21 20:56:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 961 ms
[2023-03-21 20:56:51] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2023-03-21 20:56:51] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 1 ms to minimize.
[2023-03-21 20:56:52] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2023-03-21 20:56:52] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2023-03-21 20:56:52] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 4 ms to minimize.
[2023-03-21 20:56:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1506 ms
[2023-03-21 20:56:53] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
[2023-03-21 20:56:53] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2023-03-21 20:56:53] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 0 ms to minimize.
[2023-03-21 20:56:54] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 1 ms to minimize.
[2023-03-21 20:56:54] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2023-03-21 20:56:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1411 ms
[2023-03-21 20:56:54] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2023-03-21 20:56:55] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2023-03-21 20:56:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 656 ms
[2023-03-21 20:56:55] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2023-03-21 20:56:55] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2023-03-21 20:56:56] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 1 ms to minimize.
[2023-03-21 20:56:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1031 ms
[2023-03-21 20:56:56] [INFO ] After 13042ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 922 ms.
[2023-03-21 20:56:57] [INFO ] After 15360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), true, (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT p0)), (F (NOT (AND p1 p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 15 factoid took 1394 ms. Reduced automaton from 8 states, 23 edges and 3 AP (stutter insensitive) to 8 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 532 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p0) p1), true, (AND (NOT p1) p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 481 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p0) p1), true, (AND (NOT p1) p2), (NOT p2), (NOT p2)]
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5302 transition count 4701
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4801 transition count 4701
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1002 place count 4801 transition count 4201
Deduced a syphon composed of 500 places in 25 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2002 place count 4301 transition count 4201
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 16 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 5586 place count 2509 transition count 2409
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5588 place count 2507 transition count 2407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5589 place count 2506 transition count 2407
Applied a total of 5589 rules in 1452 ms. Remains 2506 /5303 variables (removed 2797) and now considering 2407/5203 (removed 2796) transitions.
// Phase 1: matrix 2407 rows 2506 cols
[2023-03-21 20:57:01] [INFO ] Computed 900 place invariants in 14 ms
[2023-03-21 20:57:03] [INFO ] Implicit Places using invariants in 2273 ms returned []
[2023-03-21 20:57:03] [INFO ] Invariant cache hit.
[2023-03-21 20:57:07] [INFO ] Implicit Places using invariants and state equation in 3989 ms returned []
Implicit Place search using SMT with State Equation took 6265 ms to find 0 implicit places.
[2023-03-21 20:57:08] [INFO ] Redundant transitions in 645 ms returned [2406]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2406 rows 2506 cols
[2023-03-21 20:57:08] [INFO ] Computed 900 place invariants in 3 ms
[2023-03-21 20:57:17] [INFO ] Dead Transitions using invariants and state equation in 9445 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2506/5303 places, 2406/5203 transitions.
Applied a total of 0 rules in 227 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18047 ms. Remains : 2506/5303 places, 2406/5203 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 17 factoid took 2680 ms. Reduced automaton from 8 states, 23 edges and 3 AP (stutter insensitive) to 8 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 468 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p0) p1), true, (AND (NOT p1) p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-21 20:57:22] [INFO ] Invariant cache hit.
[2023-03-21 20:57:23] [INFO ] After 692ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 20:57:24] [INFO ] [Nat]Absence check using 900 positive place invariants in 234 ms returned sat
[2023-03-21 20:57:27] [INFO ] After 2368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 20:57:27] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-03-21 20:57:27] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2023-03-21 20:57:27] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2023-03-21 20:57:28] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2023-03-21 20:57:28] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2023-03-21 20:57:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1168 ms
[2023-03-21 20:57:29] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2023-03-21 20:57:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-21 20:57:29] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-21 20:57:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2023-03-21 20:57:30] [INFO ] After 5343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 995 ms.
[2023-03-21 20:57:31] [INFO ] After 7601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 1063 ms.
Support contains 6 out of 2506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2406/2406 transitions.
Partial Free-agglomeration rule applied 600 times.
Drop transitions removed 600 transitions
Iterating global reduction 0 with 600 rules applied. Total rules applied 600 place count 2506 transition count 2406
Applied a total of 600 rules in 248 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 2506/2506 places, 2406/2406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=18 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 7) 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 7) seen :0
Interrupted probabilistic random walk after 70125 steps, run timeout after 3003 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70125 steps, saw 69360 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2406 rows 2506 cols
[2023-03-21 20:57:37] [INFO ] Computed 900 place invariants in 13 ms
[2023-03-21 20:57:37] [INFO ] After 548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 20:57:38] [INFO ] [Nat]Absence check using 900 positive place invariants in 225 ms returned sat
[2023-03-21 20:57:41] [INFO ] After 2307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 20:57:41] [INFO ] Deduced a trap composed of 3 places in 627 ms of which 1 ms to minimize.
[2023-03-21 20:57:43] [INFO ] Deduced a trap composed of 8 places in 937 ms of which 7 ms to minimize.
[2023-03-21 20:57:43] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 0 ms to minimize.
[2023-03-21 20:57:43] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 0 ms to minimize.
[2023-03-21 20:57:43] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 14 ms to minimize.
[2023-03-21 20:57:43] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2023-03-21 20:57:44] [INFO ] Deduced a trap composed of 17 places in 487 ms of which 1 ms to minimize.
[2023-03-21 20:57:44] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2023-03-21 20:57:44] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2023-03-21 20:57:45] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 1 ms to minimize.
[2023-03-21 20:57:45] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2023-03-21 20:57:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4341 ms
[2023-03-21 20:57:45] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2023-03-21 20:57:46] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2023-03-21 20:57:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 486 ms
[2023-03-21 20:57:46] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 0 ms to minimize.
[2023-03-21 20:57:47] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2023-03-21 20:57:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 705 ms
[2023-03-21 20:57:47] [INFO ] After 9049ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 936 ms.
[2023-03-21 20:57:48] [INFO ] After 11280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 706 ms.
Support contains 6 out of 2506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2406/2406 transitions.
Applied a total of 0 rules in 100 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 2506/2506 places, 2406/2406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2406/2406 transitions.
Applied a total of 0 rules in 98 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
[2023-03-21 20:57:49] [INFO ] Invariant cache hit.
[2023-03-21 20:57:52] [INFO ] Implicit Places using invariants in 2940 ms returned []
[2023-03-21 20:57:52] [INFO ] Invariant cache hit.
[2023-03-21 20:58:01] [INFO ] Implicit Places using invariants and state equation in 8643 ms returned []
Implicit Place search using SMT with State Equation took 11624 ms to find 0 implicit places.
[2023-03-21 20:58:01] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-21 20:58:01] [INFO ] Invariant cache hit.
[2023-03-21 20:58:03] [INFO ] Dead Transitions using invariants and state equation in 1998 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13823 ms. Remains : 2506/2506 places, 2406/2406 transitions.
Applied a total of 0 rules in 123 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-21 20:58:03] [INFO ] Invariant cache hit.
[2023-03-21 20:58:04] [INFO ] After 637ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 20:58:05] [INFO ] [Nat]Absence check using 900 positive place invariants in 227 ms returned sat
[2023-03-21 20:58:08] [INFO ] After 2596ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 20:58:08] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 27 ms to minimize.
[2023-03-21 20:58:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2023-03-21 20:58:08] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2023-03-21 20:58:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2023-03-21 20:58:09] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2023-03-21 20:58:09] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2023-03-21 20:58:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 548 ms
[2023-03-21 20:58:10] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-21 20:58:10] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-03-21 20:58:10] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2023-03-21 20:58:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 679 ms
[2023-03-21 20:58:11] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 0 ms to minimize.
[2023-03-21 20:58:11] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2023-03-21 20:58:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 461 ms
[2023-03-21 20:58:11] [INFO ] After 5953ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 946 ms.
[2023-03-21 20:58:12] [INFO ] After 8050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT p0)), (F (NOT (AND p1 p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 17 factoid took 2438 ms. Reduced automaton from 8 states, 23 edges and 3 AP (stutter insensitive) to 8 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 511 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p0) p1), true, (AND (NOT p1) p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 545 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p0) p1), true, (AND (NOT p1) p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 549 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p0) p1), true, (AND (NOT p1) p2), (NOT p2), (NOT p2)]
Entered a terminal (fully accepting) state of product in 5023 steps with 1 reset in 93 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-08 finished in 167842 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))||(X(F(p1))&&F(p2))))'
Support contains 3 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 5302 transition count 5202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 5302 transition count 5202
Applied a total of 10 rules in 1352 ms. Remains 5302 /5307 variables (removed 5) and now considering 5202/5207 (removed 5) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-21 20:58:18] [INFO ] Computed 901 place invariants in 63 ms
[2023-03-21 20:58:21] [INFO ] Implicit Places using invariants in 3165 ms returned []
[2023-03-21 20:58:21] [INFO ] Invariant cache hit.
[2023-03-21 20:58:24] [INFO ] Implicit Places using invariants and state equation in 2857 ms returned []
Implicit Place search using SMT with State Equation took 6038 ms to find 0 implicit places.
[2023-03-21 20:58:24] [INFO ] Invariant cache hit.
[2023-03-21 20:58:28] [INFO ] Dead Transitions using invariants and state equation in 4151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5307 places, 5202/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11542 ms. Remains : 5302/5307 places, 5202/5207 transitions.
Stuttering acceptance computed with spot in 329 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1610 0) (EQ s626 1)), p2:(OR (EQ s626 0) (EQ s1610 1)), p1:(EQ s954 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25 reset in 1387 ms.
Product exploration explored 100000 steps with 25 reset in 1562 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 608 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 207796 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{0=1}
Probabilistic random walk after 207796 steps, saw 203522 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-21 20:58:35] [INFO ] Invariant cache hit.
[2023-03-21 20:58:36] [INFO ] [Real]Absence check using 901 positive place invariants in 490 ms returned sat
[2023-03-21 20:58:41] [INFO ] After 5234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:58:42] [INFO ] [Nat]Absence check using 901 positive place invariants in 644 ms returned sat
[2023-03-21 20:58:49] [INFO ] After 7465ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 20:58:52] [INFO ] Deduced a trap composed of 16 places in 2174 ms of which 4 ms to minimize.
[2023-03-21 20:58:54] [INFO ] Deduced a trap composed of 25 places in 2083 ms of which 3 ms to minimize.
[2023-03-21 20:58:57] [INFO ] Deduced a trap composed of 16 places in 2975 ms of which 4 ms to minimize.
[2023-03-21 20:59:00] [INFO ] Deduced a trap composed of 20 places in 2228 ms of which 3 ms to minimize.
[2023-03-21 20:59:02] [INFO ] Deduced a trap composed of 23 places in 2182 ms of which 3 ms to minimize.
[2023-03-21 20:59:04] [INFO ] Deduced a trap composed of 16 places in 2120 ms of which 7 ms to minimize.
[2023-03-21 20:59:07] [INFO ] Deduced a trap composed of 20 places in 2285 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 20:59:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:59:07] [INFO ] After 26421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 101 ms.
Support contains 1 out of 5302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5302 transition count 4701
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4801 transition count 4701
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4801 transition count 4200
Deduced a syphon composed of 501 places in 20 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4300 transition count 4200
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 14 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 5600 place count 2502 transition count 2402
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 698 times.
Drop transitions removed 698 transitions
Iterating global reduction 2 with 698 rules applied. Total rules applied 6298 place count 2502 transition count 2402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6299 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6300 place count 2500 transition count 2401
Applied a total of 6300 rules in 1200 ms. Remains 2500 /5302 variables (removed 2802) and now considering 2401/5202 (removed 2801) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1200 ms. Remains : 2500/5302 places, 2401/5202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) 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
Finished probabilistic random walk after 71291 steps, run visited all 1 properties in 1358 ms. (steps per millisecond=52 )
Probabilistic random walk after 71291 steps, saw 70509 distinct states, run finished after 1359 ms. (steps per millisecond=52 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 9 factoid took 494 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 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-21 20:59:11] [INFO ] Invariant cache hit.
[2023-03-21 20:59:20] [INFO ] [Real]Absence check using 901 positive place invariants in 3771 ms returned sat
[2023-03-21 20:59:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 20:59:26] [INFO ] [Real]Absence check using state equation in 6297 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 5302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Applied a total of 0 rules in 832 ms. Remains 5302 /5302 variables (removed 0) and now considering 5202/5202 (removed 0) transitions.
[2023-03-21 20:59:27] [INFO ] Invariant cache hit.
[2023-03-21 20:59:29] [INFO ] Implicit Places using invariants in 2318 ms returned []
[2023-03-21 20:59:29] [INFO ] Invariant cache hit.
[2023-03-21 20:59:31] [INFO ] Implicit Places using invariants and state equation in 2141 ms returned []
Implicit Place search using SMT with State Equation took 4476 ms to find 0 implicit places.
[2023-03-21 20:59:31] [INFO ] Invariant cache hit.
[2023-03-21 20:59:36] [INFO ] Dead Transitions using invariants and state equation in 5140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10464 ms. Remains : 5302/5302 places, 5202/5202 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 437 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 20:59:37] [INFO ] Invariant cache hit.
[2023-03-21 20:59:39] [INFO ] [Real]Absence check using 901 positive place invariants in 599 ms returned sat
[2023-03-21 20:59:43] [INFO ] After 5447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:59:45] [INFO ] [Nat]Absence check using 901 positive place invariants in 1860 ms returned sat
[2023-03-21 20:59:50] [INFO ] After 4385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 20:59:52] [INFO ] Deduced a trap composed of 16 places in 2041 ms of which 6 ms to minimize.
[2023-03-21 20:59:54] [INFO ] Deduced a trap composed of 25 places in 2081 ms of which 4 ms to minimize.
[2023-03-21 20:59:57] [INFO ] Deduced a trap composed of 16 places in 2150 ms of which 3 ms to minimize.
[2023-03-21 21:00:00] [INFO ] Deduced a trap composed of 20 places in 2406 ms of which 3 ms to minimize.
[2023-03-21 21:00:03] [INFO ] Deduced a trap composed of 23 places in 3075 ms of which 2 ms to minimize.
[2023-03-21 21:00:05] [INFO ] Deduced a trap composed of 16 places in 2084 ms of which 3 ms to minimize.
[2023-03-21 21:00:08] [INFO ] Deduced a trap composed of 20 places in 2337 ms of which 5 ms to minimize.
[2023-03-21 21:00:10] [INFO ] Deduced a trap composed of 17 places in 2495 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 21:00:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 21:00:10] [INFO ] After 27425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 110 ms.
Support contains 1 out of 5302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5302 transition count 4701
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4801 transition count 4701
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4801 transition count 4200
Deduced a syphon composed of 501 places in 22 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4300 transition count 4200
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 12 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 5600 place count 2502 transition count 2402
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 698 times.
Drop transitions removed 698 transitions
Iterating global reduction 2 with 698 rules applied. Total rules applied 6298 place count 2502 transition count 2402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6299 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6300 place count 2500 transition count 2401
Applied a total of 6300 rules in 1122 ms. Remains 2500 /5302 variables (removed 2802) and now considering 2401/5202 (removed 2801) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1122 ms. Remains : 2500/5302 places, 2401/5202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 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 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Finished probabilistic random walk after 71291 steps, run visited all 1 properties in 1463 ms. (steps per millisecond=48 )
Probabilistic random walk after 71291 steps, saw 70509 distinct states, run finished after 1477 ms. (steps per millisecond=48 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 5 factoid took 293 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 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-21 21:00:14] [INFO ] Invariant cache hit.
[2023-03-21 21:00:27] [INFO ] [Real]Absence check using 901 positive place invariants in 5551 ms returned sat
[2023-03-21 21:00:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:00:29] [INFO ] [Real]Absence check using state equation in 2315 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 26 reset in 1334 ms.
Product exploration explored 100000 steps with 25 reset in 1629 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 5302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Performed 499 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5302 transition count 5202
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 499 place count 5302 transition count 5204
Deduced a syphon composed of 700 places in 28 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 700 place count 5302 transition count 5204
Performed 2096 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2796 places in 11 ms
Iterating global reduction 1 with 2096 rules applied. Total rules applied 2796 place count 5302 transition count 5204
Renaming transitions due to excessive name length > 1024 char.
Discarding 699 places :
Symmetric choice reduction at 1 with 699 rule applications. Total rules 3495 place count 4603 transition count 4505
Deduced a syphon composed of 2097 places in 9 ms
Iterating global reduction 1 with 699 rules applied. Total rules applied 4194 place count 4603 transition count 4505
Deduced a syphon composed of 2097 places in 10 ms
Applied a total of 4194 rules in 5036 ms. Remains 4603 /5302 variables (removed 699) and now considering 4505/5202 (removed 697) transitions.
[2023-03-21 21:00:38] [INFO ] Redundant transitions in 758 ms returned [4504]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 4504 rows 4603 cols
[2023-03-21 21:00:38] [INFO ] Computed 901 place invariants in 132 ms
[2023-03-21 21:00:44] [INFO ] Dead Transitions using invariants and state equation in 6038 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4603/5302 places, 4504/5202 transitions.
Deduced a syphon composed of 2097 places in 12 ms
Applied a total of 0 rules in 300 ms. Remains 4603 /4603 variables (removed 0) and now considering 4504/4504 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12167 ms. Remains : 4603/5302 places, 4504/5202 transitions.
Support contains 3 out of 5302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Applied a total of 0 rules in 484 ms. Remains 5302 /5302 variables (removed 0) and now considering 5202/5202 (removed 0) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-21 21:00:45] [INFO ] Computed 901 place invariants in 22 ms
[2023-03-21 21:00:47] [INFO ] Implicit Places using invariants in 2239 ms returned []
[2023-03-21 21:00:47] [INFO ] Invariant cache hit.
[2023-03-21 21:00:49] [INFO ] Implicit Places using invariants and state equation in 2086 ms returned []
Implicit Place search using SMT with State Equation took 4326 ms to find 0 implicit places.
[2023-03-21 21:00:49] [INFO ] Invariant cache hit.
[2023-03-21 21:00:54] [INFO ] Dead Transitions using invariants and state equation in 4607 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9447 ms. Remains : 5302/5302 places, 5202/5202 transitions.
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-11 finished in 158244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(!p1)))))'
Support contains 4 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 5303 transition count 5203
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 5303 transition count 5203
Applied a total of 8 rules in 1203 ms. Remains 5303 /5307 variables (removed 4) and now considering 5203/5207 (removed 4) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-21 21:00:56] [INFO ] Computed 901 place invariants in 49 ms
[2023-03-21 21:00:58] [INFO ] Implicit Places using invariants in 2153 ms returned []
[2023-03-21 21:00:58] [INFO ] Invariant cache hit.
[2023-03-21 21:01:00] [INFO ] Implicit Places using invariants and state equation in 2339 ms returned []
Implicit Place search using SMT with State Equation took 4508 ms to find 0 implicit places.
[2023-03-21 21:01:00] [INFO ] Invariant cache hit.
[2023-03-21 21:01:04] [INFO ] Dead Transitions using invariants and state equation in 4203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5307 places, 5203/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9916 ms. Remains : 5303/5307 places, 5203/5207 transitions.
Stuttering acceptance computed with spot in 259 ms :[true, true, (NOT p0), p1, true]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s4444 0) (EQ s1455 1)), p0:(OR (EQ s5115 0) (EQ s4829 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 938 steps with 0 reset in 11 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-14 finished in 10284 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&&F(G(((p1 U X(p2)) U p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(X(F(p1))&&F(p2))))'
Found a Shortening insensitive property : ShieldIIPs-PT-100B-LTLCardinality-11
Stuttering acceptance computed with spot in 331 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5306 transition count 4706
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4806 transition count 4706
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1000 place count 4806 transition count 4206
Deduced a syphon composed of 500 places in 20 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2000 place count 4306 transition count 4206
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2005 place count 4301 transition count 4201
Iterating global reduction 2 with 5 rules applied. Total rules applied 2010 place count 4301 transition count 4201
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2010 place count 4301 transition count 4199
Deduced a syphon composed of 2 places in 24 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2014 place count 4299 transition count 4199
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 12 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 5598 place count 2507 transition count 2407
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5600 place count 2505 transition count 2405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5601 place count 2504 transition count 2405
Applied a total of 5601 rules in 1652 ms. Remains 2504 /5307 variables (removed 2803) and now considering 2405/5207 (removed 2802) transitions.
// Phase 1: matrix 2405 rows 2504 cols
[2023-03-21 21:01:07] [INFO ] Computed 900 place invariants in 10 ms
[2023-03-21 21:01:10] [INFO ] Implicit Places using invariants in 2710 ms returned []
[2023-03-21 21:01:10] [INFO ] Invariant cache hit.
[2023-03-21 21:01:14] [INFO ] Implicit Places using invariants and state equation in 4263 ms returned []
Implicit Place search using SMT with State Equation took 7003 ms to find 0 implicit places.
[2023-03-21 21:01:14] [INFO ] Invariant cache hit.
[2023-03-21 21:01:15] [INFO ] Dead Transitions using invariants and state equation in 1313 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2504/5307 places, 2405/5207 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9981 ms. Remains : 2504/5307 places, 2405/5207 transitions.
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s731 0) (EQ s253 1)), p2:(OR (EQ s253 0) (EQ s731 1)), p1:(EQ s412 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 40213 steps with 20 reset in 577 ms.
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-11 finished in 11001 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-21 21:01:16] [INFO ] Flatten gal took : 151 ms
[2023-03-21 21:01:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-21 21:01:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5307 places, 5207 transitions and 16414 arcs took 35 ms.
Total runtime 707234 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2985/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2985/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPs-PT-100B-LTLCardinality-07
Could not compute solution for formula : ShieldIIPs-PT-100B-LTLCardinality-11

BK_STOP 1679432484926

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPs-PT-100B-LTLCardinality-07
ltl formula formula --ltl=/tmp/2985/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5307 places, 5207 transitions and 16414 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.760 real 0.230 user 0.300 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2985/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2985/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2985/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2985/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5565ec30f3f4]
1: pnml2lts-mc(+0xa2496) [0x5565ec30f496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fa39016e140]
3: pnml2lts-mc(+0x405be5) [0x5565ec672be5]
4: pnml2lts-mc(+0x16b3f9) [0x5565ec3d83f9]
5: pnml2lts-mc(+0x164ac4) [0x5565ec3d1ac4]
6: pnml2lts-mc(+0x272e0a) [0x5565ec4dfe0a]
7: pnml2lts-mc(+0xb61f0) [0x5565ec3231f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fa38ffc14d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fa38ffc167a]
10: pnml2lts-mc(+0xa1581) [0x5565ec30e581]
11: pnml2lts-mc(+0xa1910) [0x5565ec30e910]
12: pnml2lts-mc(+0xa32a2) [0x5565ec3102a2]
13: pnml2lts-mc(+0xa50f4) [0x5565ec3120f4]
14: pnml2lts-mc(+0xa516b) [0x5565ec31216b]
15: pnml2lts-mc(+0x3f34b3) [0x5565ec6604b3]
16: pnml2lts-mc(+0x7c63d) [0x5565ec2e963d]
17: pnml2lts-mc(+0x67d86) [0x5565ec2d4d86]
18: pnml2lts-mc(+0x60a8a) [0x5565ec2cda8a]
19: pnml2lts-mc(+0x5eb15) [0x5565ec2cbb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fa38ffa9d0a]
21: pnml2lts-mc(+0x6075e) [0x5565ec2cd75e]
ltl formula name ShieldIIPs-PT-100B-LTLCardinality-11
ltl formula formula --ltl=/tmp/2985/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5307 places, 5207 transitions and 16414 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2985/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2985/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.490 real 0.370 user 0.620 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2985/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2985/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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