About the Execution of LTSMin+red for DoubleExponent-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 979.367 | 1299252.00 | 1438986.00 | 4091.40 | FTTTFTFFF?FT?TFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r137-smll-167819418600483.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 DoubleExponent-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418600483
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 13:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 340K Mar 5 18:22 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 DoubleExponent-PT-020-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678877991270
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=DoubleExponent-PT-020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 10:59:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 10:59:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:59:55] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2023-03-15 10:59:55] [INFO ] Transformed 1064 places.
[2023-03-15 10:59:55] [INFO ] Transformed 998 transitions.
[2023-03-15 10:59:55] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 473 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-020-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1060 transition count 998
Applied a total of 4 rules in 263 ms. Remains 1060 /1064 variables (removed 4) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 10:59:56] [INFO ] Invariants computation overflowed in 279 ms
[2023-03-15 10:59:57] [INFO ] Implicit Places using invariants in 1650 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 10:59:57] [INFO ] Invariants computation overflowed in 230 ms
[2023-03-15 10:59:59] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 3310 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 10:59:59] [INFO ] Invariants computation overflowed in 142 ms
[2023-03-15 11:00:00] [INFO ] Dead Transitions using invariants and state equation in 1136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1060/1064 places, 998/998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4714 ms. Remains : 1060/1064 places, 998/998 transitions.
Support contains 47 out of 1060 places after structural reductions.
[2023-03-15 11:00:00] [INFO ] Flatten gal took : 204 ms
[2023-03-15 11:00:01] [INFO ] Flatten gal took : 159 ms
[2023-03-15 11:00:01] [INFO ] Input system was already deterministic with 998 transitions.
Support contains 43 out of 1060 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 338 resets, run finished after 980 ms. (steps per millisecond=10 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 77010 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{13=1, 18=1}
Probabilistic random walk after 77010 steps, saw 38511 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :2
Running SMT prover for 23 properties.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:00:06] [INFO ] Invariants computation overflowed in 143 ms
[2023-03-15 11:00:07] [INFO ] After 1092ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-15 11:00:24] [INFO ] After 15119ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :20
[2023-03-15 11:00:25] [INFO ] Deduced a trap composed of 67 places in 666 ms of which 8 ms to minimize.
[2023-03-15 11:00:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 880 ms
[2023-03-15 11:00:26] [INFO ] Deduced a trap composed of 103 places in 615 ms of which 4 ms to minimize.
[2023-03-15 11:00:26] [INFO ] Deduced a trap composed of 110 places in 498 ms of which 3 ms to minimize.
[2023-03-15 11:00:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1448 ms
[2023-03-15 11:00:27] [INFO ] Deduced a trap composed of 210 places in 367 ms of which 3 ms to minimize.
[2023-03-15 11:00:28] [INFO ] Deduced a trap composed of 187 places in 406 ms of which 2 ms to minimize.
[2023-03-15 11:00:28] [INFO ] Deduced a trap composed of 185 places in 366 ms of which 1 ms to minimize.
[2023-03-15 11:00:28] [INFO ] Deduced a trap composed of 173 places in 395 ms of which 1 ms to minimize.
[2023-03-15 11:00:29] [INFO ] Deduced a trap composed of 201 places in 427 ms of which 2 ms to minimize.
[2023-03-15 11:00:29] [INFO ] Deduced a trap composed of 199 places in 411 ms of which 3 ms to minimize.
[2023-03-15 11:00:30] [INFO ] Deduced a trap composed of 163 places in 519 ms of which 1 ms to minimize.
[2023-03-15 11:00:31] [INFO ] Deduced a trap composed of 243 places in 488 ms of which 2 ms to minimize.
[2023-03-15 11:00:32] [INFO ] Deduced a trap composed of 192 places in 490 ms of which 1 ms to minimize.
[2023-03-15 11:00:32] [INFO ] Deduced a trap composed of 151 places in 515 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.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-15 11:00:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 11:00:32] [INFO ] After 25352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:23
Fused 23 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 27288 ms.
Support contains 36 out of 1060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 202 rules applied. Total rules applied 203 place count 1057 transition count 797
Reduce places removed 199 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 213 rules applied. Total rules applied 416 place count 858 transition count 783
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 430 place count 844 transition count 783
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 430 place count 844 transition count 743
Deduced a syphon composed of 40 places in 19 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 510 place count 804 transition count 743
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 26 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 3 with 350 rules applied. Total rules applied 860 place count 629 transition count 568
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 33 places in 7 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 926 place count 596 transition count 568
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1006 place count 596 transition count 488
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 3 with 80 rules applied. Total rules applied 1086 place count 516 transition count 488
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 4 with 81 rules applied. Total rules applied 1167 place count 516 transition count 488
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1168 place count 515 transition count 487
Applied a total of 1168 rules in 482 ms. Remains 515 /1060 variables (removed 545) and now considering 487/998 (removed 511) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 483 ms. Remains : 515/1060 places, 487/998 transitions.
Incomplete random walk after 10000 steps, including 1230 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 148680 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{17=1}
Probabilistic random walk after 148680 steps, saw 74370 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :1
Running SMT prover for 19 properties.
// Phase 1: matrix 487 rows 515 cols
[2023-03-15 11:01:04] [INFO ] Computed 100 place invariants in 78 ms
[2023-03-15 11:01:04] [INFO ] After 304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-15 11:01:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 11:01:05] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 50 ms returned sat
[2023-03-15 11:01:07] [INFO ] After 2245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-15 11:01:07] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 11:01:12] [INFO ] After 4941ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-03-15 11:01:12] [INFO ] Deduced a trap composed of 18 places in 257 ms of which 1 ms to minimize.
[2023-03-15 11:01:13] [INFO ] Deduced a trap composed of 10 places in 396 ms of which 1 ms to minimize.
[2023-03-15 11:01:13] [INFO ] Deduced a trap composed of 8 places in 396 ms of which 1 ms to minimize.
[2023-03-15 11:01:14] [INFO ] Deduced a trap composed of 22 places in 288 ms of which 1 ms to minimize.
[2023-03-15 11:01:14] [INFO ] Deduced a trap composed of 43 places in 303 ms of which 1 ms to minimize.
[2023-03-15 11:01:14] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 1 ms to minimize.
[2023-03-15 11:01:14] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 1 ms to minimize.
[2023-03-15 11:01:15] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 0 ms to minimize.
[2023-03-15 11:01:15] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 1 ms to minimize.
[2023-03-15 11:01:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3109 ms
[2023-03-15 11:01:18] [INFO ] Deduced a trap composed of 13 places in 522 ms of which 2 ms to minimize.
[2023-03-15 11:01:18] [INFO ] Deduced a trap composed of 153 places in 518 ms of which 1 ms to minimize.
[2023-03-15 11:01:19] [INFO ] Deduced a trap composed of 172 places in 521 ms of which 1 ms to minimize.
[2023-03-15 11:01:19] [INFO ] Deduced a trap composed of 160 places in 516 ms of which 1 ms to minimize.
[2023-03-15 11:01:20] [INFO ] Deduced a trap composed of 159 places in 490 ms of which 1 ms to minimize.
[2023-03-15 11:01:21] [INFO ] Deduced a trap composed of 160 places in 529 ms of which 2 ms to minimize.
[2023-03-15 11:01:21] [INFO ] Deduced a trap composed of 25 places in 529 ms of which 1 ms to minimize.
[2023-03-15 11:01:22] [INFO ] Deduced a trap composed of 162 places in 532 ms of which 1 ms to minimize.
[2023-03-15 11:01:23] [INFO ] Deduced a trap composed of 170 places in 505 ms of which 1 ms to minimize.
[2023-03-15 11:01:23] [INFO ] Deduced a trap composed of 156 places in 519 ms of which 1 ms to minimize.
[2023-03-15 11:01:24] [INFO ] Deduced a trap composed of 172 places in 505 ms of which 2 ms to minimize.
[2023-03-15 11:01:24] [INFO ] Deduced a trap composed of 178 places in 502 ms of which 1 ms to minimize.
[2023-03-15 11:01:25] [INFO ] Deduced a trap composed of 164 places in 485 ms of which 1 ms to minimize.
[2023-03-15 11:01:25] [INFO ] Deduced a trap composed of 178 places in 530 ms of which 1 ms to minimize.
[2023-03-15 11:01:26] [INFO ] Deduced a trap composed of 160 places in 503 ms of which 1 ms to minimize.
[2023-03-15 11:01:26] [INFO ] Deduced a trap composed of 164 places in 509 ms of which 1 ms to minimize.
[2023-03-15 11:01:27] [INFO ] Deduced a trap composed of 181 places in 502 ms of which 1 ms to minimize.
[2023-03-15 11:01:28] [INFO ] Deduced a trap composed of 170 places in 495 ms of which 1 ms to minimize.
[2023-03-15 11:01:28] [INFO ] Deduced a trap composed of 172 places in 492 ms of which 1 ms to minimize.
[2023-03-15 11:01:29] [INFO ] Deduced a trap composed of 169 places in 460 ms of which 1 ms to minimize.
[2023-03-15 11:01:29] [INFO ] Deduced a trap composed of 174 places in 480 ms of which 1 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-15 11:01:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 11:01:29] [INFO ] After 25088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:19
Parikh walk visited 0 properties in 30000 ms.
Support contains 35 out of 515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 487/487 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 515 transition count 484
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 512 transition count 484
Applied a total of 6 rules in 69 ms. Remains 512 /515 variables (removed 3) and now considering 484/487 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 512/515 places, 484/487 transitions.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA DoubleExponent-PT-020-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 49 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:02:00] [INFO ] Invariants computation overflowed in 103 ms
[2023-03-15 11:02:00] [INFO ] Implicit Places using invariants in 688 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:02:00] [INFO ] Invariants computation overflowed in 126 ms
[2023-03-15 11:02:02] [INFO ] Implicit Places using invariants and state equation in 1230 ms returned []
Implicit Place search using SMT with State Equation took 1922 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:02:02] [INFO ] Invariants computation overflowed in 86 ms
[2023-03-15 11:02:03] [INFO ] Dead Transitions using invariants and state equation in 1093 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3069 ms. Remains : 1060/1060 places, 998/998 transitions.
Stuttering acceptance computed with spot in 320 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GT s454 s813), p0:(LEQ s724 s291)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-00 finished in 3512 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(F(p0))))'
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 57 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:02:03] [INFO ] Invariants computation overflowed in 109 ms
[2023-03-15 11:02:04] [INFO ] Implicit Places using invariants in 831 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:02:04] [INFO ] Invariants computation overflowed in 114 ms
[2023-03-15 11:02:05] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:02:05] [INFO ] Invariants computation overflowed in 89 ms
[2023-03-15 11:02:06] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3053 ms. Remains : 1060/1060 places, 998/998 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-05 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}]], initial=2, aps=[p0:(LEQ s464 s310)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1057 ms.
Product exploration explored 100000 steps with 33333 reset in 910 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 54 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLCardinality-05 finished in 5296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X((X(p1)&&F(p2))))))'
Support contains 6 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 60 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:02:09] [INFO ] Invariants computation overflowed in 141 ms
[2023-03-15 11:02:09] [INFO ] Implicit Places using invariants in 856 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:02:09] [INFO ] Invariants computation overflowed in 85 ms
[2023-03-15 11:02:11] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:02:11] [INFO ] Invariants computation overflowed in 89 ms
[2023-03-15 11:02:12] [INFO ] Dead Transitions using invariants and state equation in 1155 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3328 ms. Remains : 1060/1060 places, 998/998 transitions.
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s742 s234), p2:(GT s767 s223), p1:(GT s686 s796)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 28 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-06 finished in 3751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 63 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:02:12] [INFO ] Invariants computation overflowed in 107 ms
[2023-03-15 11:02:13] [INFO ] Implicit Places using invariants in 902 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:02:13] [INFO ] Invariants computation overflowed in 89 ms
[2023-03-15 11:02:14] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:02:14] [INFO ] Invariants computation overflowed in 88 ms
[2023-03-15 11:02:15] [INFO ] Dead Transitions using invariants and state equation in 1177 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3252 ms. Remains : 1060/1060 places, 998/998 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s489)], 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]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-07 finished in 3363 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 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 46 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:02:16] [INFO ] Invariants computation overflowed in 85 ms
[2023-03-15 11:02:16] [INFO ] Implicit Places using invariants in 843 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:02:17] [INFO ] Invariants computation overflowed in 136 ms
[2023-03-15 11:02:18] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 2115 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:02:18] [INFO ] Invariants computation overflowed in 88 ms
[2023-03-15 11:02:19] [INFO ] Dead Transitions using invariants and state equation in 1144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3307 ms. Remains : 1060/1060 places, 998/998 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-08 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:(GT s507 s553)], 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 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-08 finished in 3429 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)&&F(G(p1)))))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 236 rules applied. Total rules applied 236 place count 1059 transition count 761
Reduce places removed 236 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 237 rules applied. Total rules applied 473 place count 823 transition count 760
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 474 place count 822 transition count 760
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 474 place count 822 transition count 720
Deduced a syphon composed of 40 places in 11 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 554 place count 782 transition count 720
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 4 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 918 place count 600 transition count 538
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 994 place count 562 transition count 538
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 995 place count 562 transition count 538
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 996 place count 561 transition count 537
Applied a total of 996 rules in 170 ms. Remains 561 /1060 variables (removed 499) and now considering 537/998 (removed 461) transitions.
// Phase 1: matrix 537 rows 561 cols
[2023-03-15 11:02:19] [INFO ] Computed 101 place invariants in 80 ms
[2023-03-15 11:02:20] [INFO ] Implicit Places using invariants in 754 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 756 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 559/1060 places, 537/998 transitions.
Graph (complete) has 1748 edges and 559 vertex of which 558 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 555 transition count 533
Applied a total of 7 rules in 40 ms. Remains 555 /559 variables (removed 4) and now considering 533/537 (removed 4) transitions.
// Phase 1: matrix 533 rows 555 cols
[2023-03-15 11:02:20] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 11:02:20] [INFO ] Implicit Places using invariants in 583 ms returned []
// Phase 1: matrix 533 rows 555 cols
[2023-03-15 11:02:20] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-15 11:02:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 11:02:42] [INFO ] Implicit Places using invariants and state equation in 21143 ms returned []
Implicit Place search using SMT with State Equation took 21730 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 555/1060 places, 533/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22697 ms. Remains : 555/1060 places, 533/998 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s416 s541), p1:(LEQ s50 s62)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 13808 reset in 227 ms.
Product exploration explored 100000 steps with 13912 reset in 377 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1744 edges and 555 vertex of which 554 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 276 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 1429 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 824 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 811 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 246685 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{1=1}
Probabilistic random walk after 246685 steps, saw 123414 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 533 rows 555 cols
[2023-03-15 11:02:46] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-15 11:02:46] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:02:47] [INFO ] After 777ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:02:47] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 11:02:49] [INFO ] After 1392ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:02:49] [INFO ] After 1449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-15 11:02:49] [INFO ] After 2420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 2 out of 555 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 555/555 places, 533/533 transitions.
Graph (complete) has 1666 edges and 555 vertex of which 554 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 554 transition count 530
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 83 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 160 place count 475 transition count 453
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 3 with 79 rules applied. Total rules applied 239 place count 475 transition count 453
Applied a total of 239 rules in 99 ms. Remains 475 /555 variables (removed 80) and now considering 453/533 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 475/555 places, 453/533 transitions.
Incomplete random walk after 10000 steps, including 1306 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 322962 steps, run timeout after 3002 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322962 steps, saw 161565 distinct states, run finished after 3004 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:02:54] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-15 11:02:54] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:02:55] [INFO ] After 975ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:02:55] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-15 11:02:56] [INFO ] After 1127ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:02:56] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 2 ms to minimize.
[2023-03-15 11:02:57] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 0 ms to minimize.
[2023-03-15 11:02:57] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 2 ms to minimize.
[2023-03-15 11:02:57] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 1 ms to minimize.
[2023-03-15 11:02:57] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 0 ms to minimize.
[2023-03-15 11:02:57] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 1 ms to minimize.
[2023-03-15 11:02:58] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 2 ms to minimize.
[2023-03-15 11:02:58] [INFO ] Deduced a trap composed of 26 places in 251 ms of which 1 ms to minimize.
[2023-03-15 11:02:58] [INFO ] Deduced a trap composed of 70 places in 262 ms of which 1 ms to minimize.
[2023-03-15 11:02:59] [INFO ] Deduced a trap composed of 45 places in 273 ms of which 1 ms to minimize.
[2023-03-15 11:02:59] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 1 ms to minimize.
[2023-03-15 11:02:59] [INFO ] Deduced a trap composed of 22 places in 283 ms of which 1 ms to minimize.
[2023-03-15 11:03:00] [INFO ] Deduced a trap composed of 18 places in 291 ms of which 2 ms to minimize.
[2023-03-15 11:03:00] [INFO ] Deduced a trap composed of 20 places in 298 ms of which 1 ms to minimize.
[2023-03-15 11:03:00] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 0 ms to minimize.
[2023-03-15 11:03:01] [INFO ] Deduced a trap composed of 17 places in 287 ms of which 1 ms to minimize.
[2023-03-15 11:03:01] [INFO ] Deduced a trap composed of 16 places in 298 ms of which 1 ms to minimize.
[2023-03-15 11:03:01] [INFO ] Deduced a trap composed of 13 places in 297 ms of which 1 ms to minimize.
[2023-03-15 11:03:02] [INFO ] Deduced a trap composed of 11 places in 321 ms of which 1 ms to minimize.
[2023-03-15 11:03:02] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5504 ms
[2023-03-15 11:03:02] [INFO ] After 6694ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-15 11:03:02] [INFO ] After 7805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 15 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 15 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:03:04] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 11:03:05] [INFO ] Implicit Places using invariants in 971 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:03:05] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-15 11:03:05] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-15 11:03:35] [INFO ] Performed 383/475 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-15 11:03:39] [INFO ] Implicit Places using invariants and state equation in 33747 ms returned [281, 412, 418, 440, 445, 449, 467, 473]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 34725 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 467/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 467 transition count 450
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 464 transition count 450
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 464 transition count 450
Applied a total of 8 rules in 73 ms. Remains 464 /467 variables (removed 3) and now considering 450/453 (removed 3) transitions.
// Phase 1: matrix 450 rows 464 cols
[2023-03-15 11:03:39] [INFO ] Computed 91 place invariants in 89 ms
[2023-03-15 11:03:41] [INFO ] Implicit Places using invariants in 2828 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 285, 305, 310, 331, 336, 358, 364, 385, 387, 391]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 2831 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 434/475 places, 450/453 transitions.
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 434 transition count 434
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 32 place count 418 transition count 434
Applied a total of 32 rules in 30 ms. Remains 418 /434 variables (removed 16) and now considering 434/450 (removed 16) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:03:42] [INFO ] Invariants computation overflowed in 96 ms
[2023-03-15 11:03:42] [INFO ] Implicit Places using invariants in 607 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:03:42] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-15 11:03:42] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-15 11:04:11] [INFO ] Implicit Places using invariants and state equation in 28411 ms returned []
Implicit Place search using SMT with State Equation took 29020 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 418/475 places, 434/453 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 66697 ms. Remains : 418/475 places, 434/453 transitions.
Incomplete random walk after 10000 steps, including 1462 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 896 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 339072 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 339072 steps, saw 169565 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:04:14] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 11:04:14] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:04:15] [INFO ] After 849ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:04:15] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-15 11:04:15] [INFO ] After 452ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:04:15] [INFO ] After 493ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-15 11:04:15] [INFO ] After 1450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1742 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 30 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 418/418 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 17 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:04:17] [INFO ] Invariants computation overflowed in 64 ms
[2023-03-15 11:04:18] [INFO ] Implicit Places using invariants in 655 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:04:18] [INFO ] Invariants computation overflowed in 74 ms
[2023-03-15 11:04:18] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-15 11:04:47] [INFO ] Implicit Places using invariants and state equation in 29143 ms returned []
Implicit Place search using SMT with State Equation took 29804 ms to find 0 implicit places.
[2023-03-15 11:04:47] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:04:47] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 11:04:47] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30225 ms. Remains : 418/418 places, 434/434 transitions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 217 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 555 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 555/555 places, 533/533 transitions.
Applied a total of 0 rules in 27 ms. Remains 555 /555 variables (removed 0) and now considering 533/533 (removed 0) transitions.
// Phase 1: matrix 533 rows 555 cols
[2023-03-15 11:04:48] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-15 11:04:48] [INFO ] Implicit Places using invariants in 678 ms returned []
// Phase 1: matrix 533 rows 555 cols
[2023-03-15 11:04:48] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-15 11:04:49] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 11:05:08] [INFO ] Implicit Places using invariants and state equation in 19729 ms returned []
Implicit Place search using SMT with State Equation took 20418 ms to find 0 implicit places.
[2023-03-15 11:05:08] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 533 rows 555 cols
[2023-03-15 11:05:08] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 11:05:09] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21048 ms. Remains : 555/555 places, 533/533 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1744 edges and 555 vertex of which 554 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 1403 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 801 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 274275 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{1=1}
Probabilistic random walk after 274275 steps, saw 137208 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 533 rows 555 cols
[2023-03-15 11:05:13] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 11:05:13] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:05:14] [INFO ] After 824ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:05:14] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 11:05:15] [INFO ] After 1557ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:05:16] [INFO ] After 1617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-15 11:05:16] [INFO ] After 2634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 555 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 555/555 places, 533/533 transitions.
Graph (complete) has 1666 edges and 555 vertex of which 554 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 554 transition count 530
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 83 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 160 place count 475 transition count 453
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 3 with 79 rules applied. Total rules applied 239 place count 475 transition count 453
Applied a total of 239 rules in 62 ms. Remains 475 /555 variables (removed 80) and now considering 453/533 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 475/555 places, 453/533 transitions.
Incomplete random walk after 10000 steps, including 1261 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 314631 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 314631 steps, saw 157419 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:05:21] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 11:05:21] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:05:22] [INFO ] After 1168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:05:22] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-15 11:05:23] [INFO ] After 1349ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:05:24] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 1 ms to minimize.
[2023-03-15 11:05:24] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 3 ms to minimize.
[2023-03-15 11:05:24] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 6 ms to minimize.
[2023-03-15 11:05:24] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 2 ms to minimize.
[2023-03-15 11:05:24] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 0 ms to minimize.
[2023-03-15 11:05:25] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 0 ms to minimize.
[2023-03-15 11:05:25] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 1 ms to minimize.
[2023-03-15 11:05:25] [INFO ] Deduced a trap composed of 26 places in 263 ms of which 0 ms to minimize.
[2023-03-15 11:05:26] [INFO ] Deduced a trap composed of 70 places in 283 ms of which 1 ms to minimize.
[2023-03-15 11:05:26] [INFO ] Deduced a trap composed of 45 places in 257 ms of which 1 ms to minimize.
[2023-03-15 11:05:26] [INFO ] Deduced a trap composed of 25 places in 264 ms of which 1 ms to minimize.
[2023-03-15 11:05:26] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 1 ms to minimize.
[2023-03-15 11:05:27] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 1 ms to minimize.
[2023-03-15 11:05:27] [INFO ] Deduced a trap composed of 20 places in 293 ms of which 2 ms to minimize.
[2023-03-15 11:05:27] [INFO ] Deduced a trap composed of 15 places in 297 ms of which 1 ms to minimize.
[2023-03-15 11:05:28] [INFO ] Deduced a trap composed of 17 places in 304 ms of which 1 ms to minimize.
[2023-03-15 11:05:28] [INFO ] Deduced a trap composed of 16 places in 313 ms of which 0 ms to minimize.
[2023-03-15 11:05:29] [INFO ] Deduced a trap composed of 13 places in 322 ms of which 1 ms to minimize.
[2023-03-15 11:05:29] [INFO ] Deduced a trap composed of 11 places in 330 ms of which 1 ms to minimize.
[2023-03-15 11:05:29] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5541 ms
[2023-03-15 11:05:29] [INFO ] After 6954ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-15 11:05:29] [INFO ] After 8261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 16 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 13 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:05:31] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 11:05:32] [INFO ] Implicit Places using invariants in 799 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:05:32] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-15 11:05:32] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-15 11:06:00] [INFO ] Implicit Places using invariants and state equation in 28110 ms returned [68, 146, 306, 332, 337, 359, 365, 386, 388, 392, 412, 418, 440, 445, 449, 467, 473]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 28915 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 458/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 458 transition count 446
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 451 transition count 446
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 451 transition count 446
Applied a total of 17 rules in 58 ms. Remains 451 /458 variables (removed 7) and now considering 446/453 (removed 7) transitions.
// Phase 1: matrix 446 rows 451 cols
[2023-03-15 11:06:00] [INFO ] Computed 82 place invariants in 130 ms
[2023-03-15 11:06:03] [INFO ] Implicit Places using invariants in 2828 ms returned [42, 48, 72, 93, 98, 118, 124, 149, 150, 170, 175, 196, 202, 209, 223, 228, 251, 257, 279, 284, 308]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 2833 ms to find 21 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 430/475 places, 446/453 transitions.
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 430 transition count 434
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 418 transition count 434
Applied a total of 24 rules in 36 ms. Remains 418 /430 variables (removed 12) and now considering 434/446 (removed 12) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:06:03] [INFO ] Invariants computation overflowed in 75 ms
[2023-03-15 11:06:04] [INFO ] Implicit Places using invariants in 765 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:06:04] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-15 11:06:04] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-15 11:06:25] [INFO ] Implicit Places using invariants and state equation in 20819 ms returned []
Implicit Place search using SMT with State Equation took 21585 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 418/475 places, 434/453 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 53441 ms. Remains : 418/475 places, 434/453 transitions.
Incomplete random walk after 10000 steps, including 1439 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 911 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 345030 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 345030 steps, saw 172543 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:06:28] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 11:06:28] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:06:29] [INFO ] After 1050ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:06:29] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-15 11:06:29] [INFO ] After 372ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:06:29] [INFO ] After 419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-15 11:06:29] [INFO ] After 1602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1357 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 418/418 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:06:31] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 11:06:31] [INFO ] Implicit Places using invariants in 673 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:06:31] [INFO ] Invariants computation overflowed in 74 ms
[2023-03-15 11:06:32] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-15 11:06:52] [INFO ] Implicit Places using invariants and state equation in 21048 ms returned []
Implicit Place search using SMT with State Equation took 21723 ms to find 0 implicit places.
[2023-03-15 11:06:52] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:06:52] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 11:06:53] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22310 ms. Remains : 418/418 places, 434/434 transitions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 298 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 13855 reset in 218 ms.
Product exploration explored 100000 steps with 13924 reset in 245 ms.
Support contains 4 out of 555 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 555/555 places, 533/533 transitions.
Applied a total of 0 rules in 24 ms. Remains 555 /555 variables (removed 0) and now considering 533/533 (removed 0) transitions.
// Phase 1: matrix 533 rows 555 cols
[2023-03-15 11:06:54] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-15 11:06:55] [INFO ] Implicit Places using invariants in 751 ms returned []
// Phase 1: matrix 533 rows 555 cols
[2023-03-15 11:06:55] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-15 11:06:56] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 11:07:21] [INFO ] Implicit Places using invariants and state equation in 26196 ms returned []
Implicit Place search using SMT with State Equation took 26950 ms to find 0 implicit places.
[2023-03-15 11:07:21] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 533 rows 555 cols
[2023-03-15 11:07:21] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:07:22] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27531 ms. Remains : 555/555 places, 533/533 transitions.
Treatment of property DoubleExponent-PT-020-LTLCardinality-09 finished in 303131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1059 transition count 760
Reduce places removed 237 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 238 rules applied. Total rules applied 475 place count 822 transition count 759
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 476 place count 821 transition count 759
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 476 place count 821 transition count 718
Deduced a syphon composed of 41 places in 15 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 558 place count 780 transition count 718
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 6 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 920 place count 599 transition count 537
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 5 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 994 place count 562 transition count 537
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 995 place count 562 transition count 537
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 996 place count 561 transition count 536
Applied a total of 996 rules in 206 ms. Remains 561 /1060 variables (removed 499) and now considering 536/998 (removed 462) transitions.
// Phase 1: matrix 536 rows 561 cols
[2023-03-15 11:07:22] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-15 11:07:23] [INFO ] Implicit Places using invariants in 496 ms returned []
// Phase 1: matrix 536 rows 561 cols
[2023-03-15 11:07:23] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-15 11:07:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 11:07:53] [INFO ] Performed 109/561 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-15 11:08:24] [INFO ] Performed 384/561 implicitness test of which 1 returned IMPLICIT in 60 seconds.
[2023-03-15 11:08:44] [INFO ] Implicit Places using invariants and state equation in 81404 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 81906 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 560/1060 places, 536/998 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 558 transition count 534
Applied a total of 4 rules in 25 ms. Remains 558 /560 variables (removed 2) and now considering 534/536 (removed 2) transitions.
// Phase 1: matrix 534 rows 558 cols
[2023-03-15 11:08:44] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-15 11:08:45] [INFO ] Implicit Places using invariants in 711 ms returned []
// Phase 1: matrix 534 rows 558 cols
[2023-03-15 11:08:45] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 11:08:45] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 11:09:05] [INFO ] Implicit Places using invariants and state equation in 20298 ms returned []
Implicit Place search using SMT with State Equation took 21013 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 558/1060 places, 534/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103151 ms. Remains : 558/1060 places, 534/998 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT 3 s205) (GT 1 s485) (GT s202 s18))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-10 finished in 103269 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||F(p1)))))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 73 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:09:06] [INFO ] Invariants computation overflowed in 156 ms
[2023-03-15 11:09:06] [INFO ] Implicit Places using invariants in 1027 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:09:07] [INFO ] Invariants computation overflowed in 96 ms
[2023-03-15 11:09:30] [INFO ] Implicit Places using invariants and state equation in 23166 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 24204 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 197 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:09:30] [INFO ] Invariants computation overflowed in 142 ms
[2023-03-15 11:09:31] [INFO ] Implicit Places using invariants in 799 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:09:31] [INFO ] Invariants computation overflowed in 232 ms
[2023-03-15 11:09:32] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 2218 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26694 ms. Remains : 1057/1060 places, 997/998 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s598 s396), p1:(LEQ s1030 s724)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3334 reset in 230 ms.
Product exploration explored 100000 steps with 3293 reset in 233 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 365 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 332 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 289 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 116735 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116735 steps, saw 58381 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:09:37] [INFO ] Invariants computation overflowed in 227 ms
[2023-03-15 11:09:37] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 11:09:41] [INFO ] After 3199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 11:09:42] [INFO ] Deduced a trap composed of 155 places in 279 ms of which 1 ms to minimize.
[2023-03-15 11:09:43] [INFO ] Deduced a trap composed of 149 places in 472 ms of which 1 ms to minimize.
[2023-03-15 11:09:43] [INFO ] Deduced a trap composed of 158 places in 503 ms of which 1 ms to minimize.
[2023-03-15 11:09:44] [INFO ] Deduced a trap composed of 125 places in 538 ms of which 1 ms to minimize.
[2023-03-15 11:09:45] [INFO ] Deduced a trap composed of 139 places in 516 ms of which 1 ms to minimize.
[2023-03-15 11:09:45] [INFO ] Deduced a trap composed of 127 places in 564 ms of which 1 ms to minimize.
[2023-03-15 11:09:46] [INFO ] Deduced a trap composed of 101 places in 593 ms of which 2 ms to minimize.
[2023-03-15 11:09:47] [INFO ] Deduced a trap composed of 103 places in 630 ms of which 1 ms to minimize.
[2023-03-15 11:09:47] [INFO ] Deduced a trap composed of 115 places in 603 ms of which 1 ms to minimize.
[2023-03-15 11:09:48] [INFO ] Deduced a trap composed of 156 places in 467 ms of which 2 ms to minimize.
[2023-03-15 11:09:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 6065 ms
[2023-03-15 11:09:50] [INFO ] Deduced a trap composed of 144 places in 306 ms of which 1 ms to minimize.
[2023-03-15 11:09:51] [INFO ] Deduced a trap composed of 137 places in 457 ms of which 1 ms to minimize.
[2023-03-15 11:09:52] [INFO ] Deduced a trap composed of 161 places in 479 ms of which 1 ms to minimize.
[2023-03-15 11:09:52] [INFO ] Deduced a trap composed of 202 places in 507 ms of which 1 ms to minimize.
[2023-03-15 11:09:53] [INFO ] Deduced a trap composed of 223 places in 329 ms of which 1 ms to minimize.
[2023-03-15 11:09:53] [INFO ] Deduced a trap composed of 221 places in 309 ms of which 1 ms to minimize.
[2023-03-15 11:09:53] [INFO ] Deduced a trap composed of 235 places in 308 ms of which 0 ms to minimize.
[2023-03-15 11:09:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3388 ms
[2023-03-15 11:09:54] [INFO ] After 16062ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-03-15 11:09:54] [INFO ] After 16567ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2001 ms.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 1055 transition count 755
Reduce places removed 240 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 483 place count 815 transition count 754
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 484 place count 814 transition count 754
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 484 place count 814 transition count 714
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 564 place count 774 transition count 714
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 4 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 930 place count 591 transition count 531
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 1004 place count 554 transition count 531
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1082 place count 554 transition count 453
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 3 with 78 rules applied. Total rules applied 1160 place count 476 transition count 453
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 4 with 81 rules applied. Total rules applied 1241 place count 476 transition count 453
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1242 place count 475 transition count 452
Applied a total of 1242 rules in 144 ms. Remains 475 /1057 variables (removed 582) and now considering 452/997 (removed 545) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 475/1057 places, 452/997 transitions.
Incomplete random walk after 10000 steps, including 1285 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 323933 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 323933 steps, saw 162059 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 452 rows 475 cols
[2023-03-15 11:09:59] [INFO ] Computed 99 place invariants in 47 ms
[2023-03-15 11:09:59] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:09:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 11:09:59] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 70 ms returned sat
[2023-03-15 11:10:00] [INFO ] After 468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:10:00] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-15 11:10:02] [INFO ] After 1928ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:10:02] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2023-03-15 11:10:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-15 11:10:02] [INFO ] After 2107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-15 11:10:02] [INFO ] After 2776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 12 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 475/475 places, 452/452 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 12 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
[2023-03-15 11:10:04] [INFO ] Invariant cache hit.
[2023-03-15 11:10:07] [INFO ] Implicit Places using invariants in 3199 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 281, 286, 306, 311, 332, 337, 358, 364, 385, 387, 391, 411, 417, 439, 444, 448, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 3202 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 437/475 places, 452/452 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 437 transition count 433
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 418 transition count 433
Applied a total of 38 rules in 34 ms. Remains 418 /437 variables (removed 19) and now considering 433/452 (removed 19) transitions.
// Phase 1: matrix 433 rows 418 cols
[2023-03-15 11:10:07] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-15 11:10:08] [INFO ] Implicit Places using invariants in 845 ms returned []
// Phase 1: matrix 433 rows 418 cols
[2023-03-15 11:10:08] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-15 11:10:08] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-15 11:10:34] [INFO ] Implicit Places using invariants and state equation in 26603 ms returned []
Implicit Place search using SMT with State Equation took 27449 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/475 places, 433/452 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30697 ms. Remains : 418/475 places, 433/452 transitions.
Incomplete random walk after 10000 steps, including 1432 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 346467 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 346467 steps, saw 173260 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 433 rows 418 cols
[2023-03-15 11:10:38] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 11:10:38] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:10:39] [INFO ] After 1198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:10:39] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-15 11:10:40] [INFO ] After 1130ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:10:40] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 0 ms to minimize.
[2023-03-15 11:10:40] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 0 ms to minimize.
[2023-03-15 11:10:40] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2023-03-15 11:10:41] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 0 ms to minimize.
[2023-03-15 11:10:41] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 1 ms to minimize.
[2023-03-15 11:10:41] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 0 ms to minimize.
[2023-03-15 11:10:41] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 0 ms to minimize.
[2023-03-15 11:10:41] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 1 ms to minimize.
[2023-03-15 11:10:41] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 1 ms to minimize.
[2023-03-15 11:10:42] [INFO ] Deduced a trap composed of 67 places in 150 ms of which 1 ms to minimize.
[2023-03-15 11:10:42] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 2 ms to minimize.
[2023-03-15 11:10:42] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 1 ms to minimize.
[2023-03-15 11:10:42] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 0 ms to minimize.
[2023-03-15 11:10:43] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 1 ms to minimize.
[2023-03-15 11:10:44] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2023-03-15 11:10:44] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2023-03-15 11:10:44] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
[2023-03-15 11:10:44] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 0 ms to minimize.
[2023-03-15 11:10:44] [INFO ] Deduced a trap composed of 72 places in 164 ms of which 0 ms to minimize.
[2023-03-15 11:10:44] [INFO ] Deduced a trap composed of 58 places in 197 ms of which 1 ms to minimize.
[2023-03-15 11:10:45] [INFO ] Deduced a trap composed of 77 places in 192 ms of which 1 ms to minimize.
[2023-03-15 11:10:45] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 0 ms to minimize.
[2023-03-15 11:10:45] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 1 ms to minimize.
[2023-03-15 11:10:45] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 1 ms to minimize.
[2023-03-15 11:10:46] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2023-03-15 11:10:46] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 1 ms to minimize.
[2023-03-15 11:10:46] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 0 ms to minimize.
[2023-03-15 11:10:47] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 7063 ms
[2023-03-15 11:10:47] [INFO ] After 8237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-15 11:10:47] [INFO ] After 9616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 9 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 418/418 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 10 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 418 cols
[2023-03-15 11:10:49] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 11:10:50] [INFO ] Implicit Places using invariants in 752 ms returned []
// Phase 1: matrix 433 rows 418 cols
[2023-03-15 11:10:50] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-15 11:10:50] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-15 11:11:21] [INFO ] Performed 405/418 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:11:21] [INFO ] Implicit Places using invariants and state equation in 31175 ms returned []
Implicit Place search using SMT with State Equation took 31930 ms to find 0 implicit places.
[2023-03-15 11:11:21] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 433 rows 418 cols
[2023-03-15 11:11:21] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-15 11:11:22] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32428 ms. Remains : 418/418 places, 433/433 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLCardinality-11 finished in 136618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1059 transition count 757
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 819 transition count 757
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 819 transition count 717
Deduced a syphon composed of 40 places in 15 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 779 transition count 717
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 6 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 2 with 362 rules applied. Total rules applied 922 place count 598 transition count 536
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 5 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 998 place count 560 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 999 place count 559 transition count 535
Applied a total of 999 rules in 153 ms. Remains 559 /1060 variables (removed 501) and now considering 535/998 (removed 463) transitions.
// Phase 1: matrix 535 rows 559 cols
[2023-03-15 11:11:22] [INFO ] Invariants computation overflowed in 88 ms
[2023-03-15 11:11:23] [INFO ] Implicit Places using invariants in 699 ms returned []
// Phase 1: matrix 535 rows 559 cols
[2023-03-15 11:11:23] [INFO ] Invariants computation overflowed in 82 ms
[2023-03-15 11:11:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:11:59] [INFO ] Performed 287/559 implicitness test of which 2 returned IMPLICIT in 35 seconds.
[2023-03-15 11:12:29] [INFO ] Performed 516/559 implicitness test of which 2 returned IMPLICIT in 65 seconds.
[2023-03-15 11:12:32] [INFO ] Implicit Places using invariants and state equation in 68741 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 69452 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 557/1060 places, 535/998 transitions.
Graph (complete) has 1744 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 553 transition count 531
Applied a total of 7 rules in 25 ms. Remains 553 /557 variables (removed 4) and now considering 531/535 (removed 4) transitions.
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:12:32] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 11:12:32] [INFO ] Implicit Places using invariants in 528 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:12:32] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 11:12:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:13:01] [INFO ] Implicit Places using invariants and state equation in 29047 ms returned []
Implicit Place search using SMT with State Equation took 29576 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 553/1060 places, 531/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 99206 ms. Remains : 553/1060 places, 531/998 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s256)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13853 reset in 122 ms.
Product exploration explored 100000 steps with 13980 reset in 196 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1427 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 284318 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 284318 steps, saw 142209 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:13:05] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 11:13:06] [INFO ] After 667ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 11:13:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:13:06] [INFO ] After 341ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 11:13:06] [INFO ] After 401ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-15 11:13:06] [INFO ] After 1195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1660 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 236 place count 475 transition count 453
Applied a total of 236 rules in 43 ms. Remains 475 /553 variables (removed 78) and now considering 453/531 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 475/553 places, 453/531 transitions.
Incomplete random walk after 10000 steps, including 1294 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 331206 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 331206 steps, saw 165692 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:13:09] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-15 11:13:10] [INFO ] After 376ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 11:13:10] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:13:10] [INFO ] After 447ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 11:13:10] [INFO ] After 495ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-15 11:13:10] [INFO ] After 988ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 12 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 12 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:13:10] [INFO ] Invariants computation overflowed in 67 ms
[2023-03-15 11:13:11] [INFO ] Implicit Places using invariants in 906 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:13:11] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-15 11:13:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:13:42] [INFO ] Performed 312/475 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:13:53] [INFO ] Implicit Places using invariants and state equation in 42063 ms returned [473]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 42971 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 474/475 places, 453/453 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 474 transition count 453
Applied a total of 1 rules in 23 ms. Remains 474 /474 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 474 cols
[2023-03-15 11:13:53] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-15 11:13:55] [INFO ] Implicit Places using invariants in 1235 ms returned []
// Phase 1: matrix 453 rows 474 cols
[2023-03-15 11:13:55] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-15 11:13:55] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:14:18] [INFO ] Implicit Places using invariants and state equation in 23603 ms returned [255, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 24842 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 456/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 456 transition count 444
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 447 transition count 444
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 447 transition count 444
Applied a total of 19 rules in 32 ms. Remains 447 /456 variables (removed 9) and now considering 444/453 (removed 9) transitions.
// Phase 1: matrix 444 rows 447 cols
[2023-03-15 11:14:18] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 11:14:19] [INFO ] Implicit Places using invariants in 751 ms returned []
// Phase 1: matrix 444 rows 447 cols
[2023-03-15 11:14:19] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 11:14:19] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:14:49] [INFO ] Implicit Places using invariants and state equation in 30047 ms returned [99, 151, 172, 198, 204, 211, 227, 260]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 30800 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 439/475 places, 444/453 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 439 transition count 441
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 436 transition count 441
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 436 transition count 441
Applied a total of 9 rules in 30 ms. Remains 436 /439 variables (removed 3) and now considering 441/444 (removed 3) transitions.
// Phase 1: matrix 441 rows 436 cols
[2023-03-15 11:14:49] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-15 11:14:50] [INFO ] Implicit Places using invariants in 753 ms returned []
// Phase 1: matrix 441 rows 436 cols
[2023-03-15 11:14:50] [INFO ] Invariants computation overflowed in 69 ms
[2023-03-15 11:14:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:15:11] [INFO ] Implicit Places using invariants and state equation in 21269 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 22025 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 435/475 places, 441/453 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 435 transition count 441
Applied a total of 1 rules in 19 ms. Remains 435 /435 variables (removed 0) and now considering 441/441 (removed 0) transitions.
// Phase 1: matrix 441 rows 435 cols
[2023-03-15 11:15:11] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-15 11:15:12] [INFO ] Implicit Places using invariants in 791 ms returned []
// Phase 1: matrix 441 rows 435 cols
[2023-03-15 11:15:12] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-15 11:15:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:15:42] [INFO ] Performed 413/435 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2023-03-15 11:15:45] [INFO ] Implicit Places using invariants and state equation in 32944 ms returned [42, 68]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 33737 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 433/475 places, 441/453 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 433 transition count 441
Applied a total of 2 rules in 20 ms. Remains 433 /433 variables (removed 0) and now considering 441/441 (removed 0) transitions.
// Phase 1: matrix 441 rows 433 cols
[2023-03-15 11:15:45] [INFO ] Invariants computation overflowed in 72 ms
[2023-03-15 11:15:46] [INFO ] Implicit Places using invariants in 751 ms returned []
// Phase 1: matrix 441 rows 433 cols
[2023-03-15 11:15:46] [INFO ] Invariants computation overflowed in 104 ms
[2023-03-15 11:15:46] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:16:18] [INFO ] Performed 431/433 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2023-03-15 11:16:18] [INFO ] Implicit Places using invariants and state equation in 32057 ms returned []
Implicit Place search using SMT with State Equation took 32809 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 433/475 places, 441/453 transitions.
Finished structural reductions in REACHABILITY mode , in 6 iterations and 187320 ms. Remains : 433/475 places, 441/453 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 20 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:16:18] [INFO ] Invariants computation overflowed in 69 ms
[2023-03-15 11:16:19] [INFO ] Implicit Places using invariants in 832 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:16:19] [INFO ] Invariants computation overflowed in 70 ms
[2023-03-15 11:16:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:16:40] [INFO ] Implicit Places using invariants and state equation in 21085 ms returned []
Implicit Place search using SMT with State Equation took 21920 ms to find 0 implicit places.
[2023-03-15 11:16:40] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:16:40] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-15 11:16:40] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22310 ms. Remains : 553/553 places, 531/531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1401 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 800 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 289253 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289253 steps, saw 144678 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:16:43] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-15 11:16:44] [INFO ] After 642ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 11:16:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:16:45] [INFO ] After 331ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 11:16:45] [INFO ] After 385ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-15 11:16:45] [INFO ] After 1153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1660 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 236 place count 475 transition count 453
Applied a total of 236 rules in 40 ms. Remains 475 /553 variables (removed 78) and now considering 453/531 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 475/553 places, 453/531 transitions.
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 342815 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 342815 steps, saw 171497 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:16:48] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-15 11:16:48] [INFO ] After 264ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 11:16:48] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:16:49] [INFO ] After 388ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 11:16:49] [INFO ] After 436ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-15 11:16:49] [INFO ] After 811ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 12 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 11 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:16:49] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 11:16:50] [INFO ] Implicit Places using invariants in 997 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:16:50] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-15 11:16:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:17:20] [INFO ] Performed 268/475 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-15 11:17:35] [INFO ] Implicit Places using invariants and state equation in 45180 ms returned [42, 387]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 46179 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 473/475 places, 453/453 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 473 transition count 453
Applied a total of 2 rules in 22 ms. Remains 473 /473 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 473 cols
[2023-03-15 11:17:35] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-15 11:17:36] [INFO ] Implicit Places using invariants in 787 ms returned []
// Phase 1: matrix 453 rows 473 cols
[2023-03-15 11:17:36] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-15 11:17:36] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:18:06] [INFO ] Performed 295/473 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:18:11] [INFO ] Implicit Places using invariants and state equation in 35379 ms returned [359, 365, 387, 391, 411, 417, 439, 444, 465, 471]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 36168 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 463/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 463 transition count 448
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 458 transition count 448
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 458 transition count 448
Applied a total of 11 rules in 35 ms. Remains 458 /463 variables (removed 5) and now considering 448/453 (removed 5) transitions.
// Phase 1: matrix 448 rows 458 cols
[2023-03-15 11:18:11] [INFO ] Computed 87 place invariants in 47 ms
[2023-03-15 11:18:14] [INFO ] Implicit Places using invariants in 3034 ms returned [47, 67, 72, 93, 98, 118, 124, 145, 150, 151, 171, 176, 197, 203, 210, 226, 231, 254, 260, 282, 287, 307, 312, 333, 338, 436]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 3037 ms to find 26 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 432/475 places, 448/453 transitions.
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 432 transition count 434
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 28 place count 418 transition count 434
Applied a total of 28 rules in 34 ms. Remains 418 /432 variables (removed 14) and now considering 434/448 (removed 14) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:18:14] [INFO ] Computed 61 place invariants in 89 ms
[2023-03-15 11:18:15] [INFO ] Implicit Places using invariants in 1025 ms returned []
[2023-03-15 11:18:15] [INFO ] Invariant cache hit.
[2023-03-15 11:18:16] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:18:35] [INFO ] Implicit Places using invariants and state equation in 20078 ms returned []
Implicit Place search using SMT with State Equation took 21107 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 418/475 places, 434/453 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 106594 ms. Remains : 418/475 places, 434/453 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13855 reset in 123 ms.
Product exploration explored 100000 steps with 13850 reset in 140 ms.
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 11 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:18:36] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-15 11:18:36] [INFO ] Implicit Places using invariants in 462 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:18:36] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 11:18:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:18:49] [INFO ] Implicit Places using invariants and state equation in 13119 ms returned []
Implicit Place search using SMT with State Equation took 13582 ms to find 0 implicit places.
[2023-03-15 11:18:49] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:18:49] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-15 11:18:50] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13993 ms. Remains : 553/553 places, 531/531 transitions.
Treatment of property DoubleExponent-PT-020-LTLCardinality-12 finished in 448033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G((G(p1)||X(p2)))))))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 67 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:18:50] [INFO ] Invariants computation overflowed in 148 ms
[2023-03-15 11:18:51] [INFO ] Implicit Places using invariants in 899 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:18:51] [INFO ] Invariants computation overflowed in 93 ms
[2023-03-15 11:19:17] [INFO ] Implicit Places using invariants and state equation in 26550 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 27451 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 87 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:19:18] [INFO ] Invariants computation overflowed in 137 ms
[2023-03-15 11:19:18] [INFO ] Implicit Places using invariants in 808 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:19:19] [INFO ] Invariants computation overflowed in 140 ms
[2023-03-15 11:19:43] [INFO ] Implicit Places using invariants and state equation in 24128 ms returned []
Implicit Place search using SMT with State Equation took 24936 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52543 ms. Remains : 1057/1060 places, 997/998 transitions.
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s65 s19), p1:(GT 2 s482), p2:(GT 1 s1045)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1304 ms.
Product exploration explored 100000 steps with 50000 reset in 1102 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLCardinality-13 finished in 55342 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)) U (p1&&F(p2))))'
Support contains 5 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 42 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:19:45] [INFO ] Invariants computation overflowed in 103 ms
[2023-03-15 11:19:46] [INFO ] Implicit Places using invariants in 661 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:19:46] [INFO ] Invariants computation overflowed in 92 ms
[2023-03-15 11:20:08] [INFO ] Implicit Places using invariants and state equation in 22211 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 22875 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 86 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:20:08] [INFO ] Invariants computation overflowed in 145 ms
[2023-03-15 11:20:09] [INFO ] Implicit Places using invariants in 742 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:20:09] [INFO ] Invariants computation overflowed in 138 ms
[2023-03-15 11:20:31] [INFO ] Implicit Places using invariants and state equation in 22157 ms returned []
Implicit Place search using SMT with State Equation took 22900 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45904 ms. Remains : 1057/1060 places, 997/998 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2), true]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s127), p2:(LEQ s577 s1043), p0:(GT s287 s897)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-14 finished in 46079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1059 transition count 760
Reduce places removed 237 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 238 rules applied. Total rules applied 475 place count 822 transition count 759
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 476 place count 821 transition count 759
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 476 place count 821 transition count 720
Deduced a syphon composed of 39 places in 11 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 554 place count 782 transition count 720
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 5 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 918 place count 600 transition count 538
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 992 place count 563 transition count 538
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 993 place count 562 transition count 537
Applied a total of 993 rules in 112 ms. Remains 562 /1060 variables (removed 498) and now considering 537/998 (removed 461) transitions.
// Phase 1: matrix 537 rows 562 cols
[2023-03-15 11:20:32] [INFO ] Computed 101 place invariants in 73 ms
[2023-03-15 11:20:32] [INFO ] Implicit Places using invariants in 682 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 683 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 560/1060 places, 537/998 transitions.
Graph (complete) has 1741 edges and 560 vertex of which 559 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 556 transition count 533
Applied a total of 7 rules in 25 ms. Remains 556 /560 variables (removed 4) and now considering 533/537 (removed 4) transitions.
// Phase 1: matrix 533 rows 556 cols
[2023-03-15 11:20:32] [INFO ] Computed 99 place invariants in 57 ms
[2023-03-15 11:20:33] [INFO ] Implicit Places using invariants in 617 ms returned []
[2023-03-15 11:20:33] [INFO ] Invariant cache hit.
[2023-03-15 11:20:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:21:03] [INFO ] Performed 329/556 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:21:27] [INFO ] Implicit Places using invariants and state equation in 54077 ms returned []
Implicit Place search using SMT with State Equation took 54695 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 556/1060 places, 533/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55517 ms. Remains : 556/1060 places, 533/998 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s161 s105)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-15 finished in 55574 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)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-15 11:21:27] [INFO ] Flatten gal took : 54 ms
[2023-03-15 11:21:27] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-15 11:21:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1060 places, 998 transitions and 2810 arcs took 9 ms.
Total runtime 1293100 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1837/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1837/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DoubleExponent-PT-020-LTLCardinality-09
Could not compute solution for formula : DoubleExponent-PT-020-LTLCardinality-12
BK_STOP 1678879290522
--------------------
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 DoubleExponent-PT-020-LTLCardinality-09
ltl formula formula --ltl=/tmp/1837/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 1060 places, 998 transitions and 2810 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.340 real 0.060 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1837/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1837/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1837/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1837/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name DoubleExponent-PT-020-LTLCardinality-12
ltl formula formula --ltl=/tmp/1837/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 1060 places, 998 transitions and 2810 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.430 real 0.050 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1837/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1837/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1837/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1837/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
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="DoubleExponent-PT-020"
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 DoubleExponent-PT-020, 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 r137-smll-167819418600483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;