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.r521-tall-167987246400260.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 EisenbergMcGuire-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 31 16:48 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 EisenbergMcGuire-PT-08-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680845702026

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 05:35:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 05:35:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 05:35:07] [INFO ] Load time of PNML (sax parser for PT used): 346 ms
[2023-04-07 05:35:07] [INFO ] Transformed 712 places.
[2023-04-07 05:35:08] [INFO ] Transformed 2816 transitions.
[2023-04-07 05:35:08] [INFO ] Found NUPN structural information;
[2023-04-07 05:35:08] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 717 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 660 transition count 2400
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 660 transition count 2400
Applied a total of 104 rules in 271 ms. Remains 660 /712 variables (removed 52) and now considering 2400/2816 (removed 416) transitions.
[2023-04-07 05:35:08] [INFO ] Flow matrix only has 952 transitions (discarded 1448 similar events)
// Phase 1: matrix 952 rows 660 cols
[2023-04-07 05:35:08] [INFO ] Computed 25 invariants in 40 ms
[2023-04-07 05:35:11] [INFO ] Implicit Places using invariants in 2418 ms returned []
[2023-04-07 05:35:11] [INFO ] Flow matrix only has 952 transitions (discarded 1448 similar events)
[2023-04-07 05:35:11] [INFO ] Invariant cache hit.
[2023-04-07 05:35:11] [INFO ] State equation strengthened by 312 read => feed constraints.
[2023-04-07 05:35:15] [INFO ] Implicit Places using invariants and state equation in 4387 ms returned []
Implicit Place search using SMT with State Equation took 6903 ms to find 0 implicit places.
[2023-04-07 05:35:15] [INFO ] Flow matrix only has 952 transitions (discarded 1448 similar events)
[2023-04-07 05:35:15] [INFO ] Invariant cache hit.
[2023-04-07 05:35:17] [INFO ] Dead Transitions using invariants and state equation in 1986 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 660/712 places, 2400/2816 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9184 ms. Remains : 660/712 places, 2400/2816 transitions.
Support contains 47 out of 660 places after structural reductions.
[2023-04-07 05:35:18] [INFO ] Flatten gal took : 328 ms
[2023-04-07 05:35:18] [INFO ] Flatten gal took : 263 ms
[2023-04-07 05:35:19] [INFO ] Input system was already deterministic with 2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 29) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2023-04-07 05:35:20] [INFO ] Flow matrix only has 952 transitions (discarded 1448 similar events)
[2023-04-07 05:35:20] [INFO ] Invariant cache hit.
[2023-04-07 05:35:21] [INFO ] [Real]Absence check using 17 positive place invariants in 66 ms returned sat
[2023-04-07 05:35:21] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 38 ms returned sat
[2023-04-07 05:35:22] [INFO ] After 2110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-04-07 05:35:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 134 ms returned sat
[2023-04-07 05:35:23] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 31 ms returned sat
[2023-04-07 05:35:27] [INFO ] After 3505ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :21
[2023-04-07 05:35:27] [INFO ] State equation strengthened by 312 read => feed constraints.
[2023-04-07 05:35:29] [INFO ] After 1594ms SMT Verify possible using 312 Read/Feed constraints in natural domain returned unsat :1 sat :21
[2023-04-07 05:35:29] [INFO ] Deduced a trap composed of 3 places in 526 ms of which 55 ms to minimize.
[2023-04-07 05:35:31] [INFO ] Deduced a trap composed of 3 places in 1845 ms of which 1 ms to minimize.
[2023-04-07 05:35:32] [INFO ] Deduced a trap composed of 63 places in 464 ms of which 43 ms to minimize.
[2023-04-07 05:35:39] [INFO ] Deduced a trap composed of 24 places in 7720 ms of which 30 ms to minimize.
[2023-04-07 05:35:41] [INFO ] Deduced a trap composed of 3 places in 1912 ms of which 22 ms to minimize.
[2023-04-07 05:35:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 12889 ms
[2023-04-07 05:35:42] [INFO ] Deduced a trap composed of 3 places in 375 ms of which 0 ms to minimize.
[2023-04-07 05:35:43] [INFO ] Deduced a trap composed of 3 places in 348 ms of which 1 ms to minimize.
[2023-04-07 05:35:43] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 6 ms to minimize.
[2023-04-07 05:35:43] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 1 ms to minimize.
[2023-04-07 05:35:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1529 ms
[2023-04-07 05:35:44] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 1 ms to minimize.
[2023-04-07 05:35:44] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2023-04-07 05:35:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 427 ms
[2023-04-07 05:35:44] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 0 ms to minimize.
[2023-04-07 05:35:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2023-04-07 05:35:45] [INFO ] Deduced a trap composed of 41 places in 351 ms of which 2 ms to minimize.
[2023-04-07 05:35:45] [INFO ] Deduced a trap composed of 69 places in 373 ms of which 1 ms to minimize.
[2023-04-07 05:35:45] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 0 ms to minimize.
[2023-04-07 05:35:50] [INFO ] Deduced a trap composed of 26 places in 4895 ms of which 28 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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-04-07 05:35:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-04-07 05:35:50] [INFO ] After 28539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:22
Fused 22 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 770 ms.
Support contains 37 out of 660 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 652 transition count 2193
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 453 transition count 2193
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 416 place count 451 transition count 2177
Iterating global reduction 2 with 2 rules applied. Total rules applied 418 place count 451 transition count 2177
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 4 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 530 place count 395 transition count 2121
Applied a total of 530 rules in 628 ms. Remains 395 /660 variables (removed 265) and now considering 2121/2400 (removed 279) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 663 ms. Remains : 395/660 places, 2121/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 124677 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{6=1, 20=1}
Probabilistic random walk after 124677 steps, saw 80285 distinct states, run finished after 3012 ms. (steps per millisecond=41 ) properties seen :2
Running SMT prover for 19 properties.
[2023-04-07 05:35:55] [INFO ] Flow matrix only has 673 transitions (discarded 1448 similar events)
// Phase 1: matrix 673 rows 395 cols
[2023-04-07 05:35:55] [INFO ] Computed 25 invariants in 9 ms
[2023-04-07 05:35:56] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2023-04-07 05:35:56] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2023-04-07 05:35:56] [INFO ] After 741ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-07 05:35:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-04-07 05:35:56] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:35:58] [INFO ] After 987ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-07 05:35:58] [INFO ] State equation strengthened by 298 read => feed constraints.
[2023-04-07 05:35:59] [INFO ] After 1382ms SMT Verify possible using 298 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-07 05:36:04] [INFO ] Deduced a trap composed of 3 places in 4425 ms of which 0 ms to minimize.
[2023-04-07 05:36:04] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 0 ms to minimize.
[2023-04-07 05:36:04] [INFO ] Deduced a trap composed of 3 places in 320 ms of which 1 ms to minimize.
[2023-04-07 05:36:04] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 1 ms to minimize.
[2023-04-07 05:36:09] [INFO ] Deduced a trap composed of 3 places in 4313 ms of which 13 ms to minimize.
[2023-04-07 05:36:09] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 35 ms to minimize.
[2023-04-07 05:36:09] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 0 ms to minimize.
[2023-04-07 05:36:10] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2023-04-07 05:36:10] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 1 ms to minimize.
[2023-04-07 05:36:10] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 1 ms to minimize.
[2023-04-07 05:36:10] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 0 ms to minimize.
[2023-04-07 05:36:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 11049 ms
[2023-04-07 05:36:10] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 0 ms to minimize.
[2023-04-07 05:36:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-04-07 05:36:11] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 0 ms to minimize.
[2023-04-07 05:36:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-04-07 05:36:13] [INFO ] Deduced a trap composed of 20 places in 2691 ms of which 24 ms to minimize.
[2023-04-07 05:36:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2770 ms
[2023-04-07 05:36:14] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2023-04-07 05:36:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-04-07 05:36:14] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 0 ms to minimize.
[2023-04-07 05:36:15] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 0 ms to minimize.
[2023-04-07 05:36:15] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 1 ms to minimize.
[2023-04-07 05:36:15] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 9 ms to minimize.
[2023-04-07 05:36:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 901 ms
[2023-04-07 05:36:15] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 0 ms to minimize.
[2023-04-07 05:36:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-04-07 05:36:16] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 0 ms to minimize.
[2023-04-07 05:36:17] [INFO ] Deduced a trap composed of 17 places in 1631 ms of which 22 ms to minimize.
[2023-04-07 05:36:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1925 ms
[2023-04-07 05:36:18] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 0 ms to minimize.
[2023-04-07 05:36:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-04-07 05:36:18] [INFO ] After 20318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 794 ms.
[2023-04-07 05:36:19] [INFO ] After 22498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 352 ms.
Support contains 35 out of 395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 2121/2121 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 395 transition count 2120
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 394 transition count 2120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 393 transition count 2112
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 393 transition count 2112
Applied a total of 4 rules in 208 ms. Remains 393 /395 variables (removed 2) and now considering 2112/2121 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 393/395 places, 2112/2121 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 91836 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91836 steps, saw 59428 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 19 properties.
[2023-04-07 05:36:23] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2023-04-07 05:36:23] [INFO ] Computed 25 invariants in 3 ms
[2023-04-07 05:36:23] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-04-07 05:36:23] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 33 ms returned sat
[2023-04-07 05:36:23] [INFO ] After 632ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-07 05:36:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-04-07 05:36:24] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2023-04-07 05:36:25] [INFO ] After 769ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-07 05:36:25] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-07 05:36:26] [INFO ] After 936ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-07 05:36:26] [INFO ] Deduced a trap composed of 3 places in 321 ms of which 0 ms to minimize.
[2023-04-07 05:36:26] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 1 ms to minimize.
[2023-04-07 05:36:26] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 0 ms to minimize.
[2023-04-07 05:36:29] [INFO ] Deduced a trap composed of 23 places in 2366 ms of which 20 ms to minimize.
[2023-04-07 05:36:29] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 1 ms to minimize.
[2023-04-07 05:36:29] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 35 ms to minimize.
[2023-04-07 05:36:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3770 ms
[2023-04-07 05:36:30] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2023-04-07 05:36:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-04-07 05:36:31] [INFO ] Deduced a trap composed of 3 places in 1230 ms of which 0 ms to minimize.
[2023-04-07 05:36:31] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 0 ms to minimize.
[2023-04-07 05:36:31] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 1 ms to minimize.
[2023-04-07 05:36:31] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2023-04-07 05:36:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1936 ms
[2023-04-07 05:36:32] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 0 ms to minimize.
[2023-04-07 05:36:32] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 1 ms to minimize.
[2023-04-07 05:36:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 463 ms
[2023-04-07 05:36:32] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 0 ms to minimize.
[2023-04-07 05:36:33] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 1 ms to minimize.
[2023-04-07 05:36:33] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 8 ms to minimize.
[2023-04-07 05:36:33] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 1 ms to minimize.
[2023-04-07 05:36:33] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 1 ms to minimize.
[2023-04-07 05:36:34] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 0 ms to minimize.
[2023-04-07 05:36:34] [INFO ] Deduced a trap composed of 17 places in 400 ms of which 34 ms to minimize.
[2023-04-07 05:36:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1945 ms
[2023-04-07 05:36:34] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 1 ms to minimize.
[2023-04-07 05:36:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-04-07 05:36:36] [INFO ] Deduced a trap composed of 33 places in 1304 ms of which 1 ms to minimize.
[2023-04-07 05:36:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1365 ms
[2023-04-07 05:36:38] [INFO ] Deduced a trap composed of 27 places in 1788 ms of which 27 ms to minimize.
[2023-04-07 05:36:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1848 ms
[2023-04-07 05:36:38] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2023-04-07 05:36:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-04-07 05:36:38] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 1 ms to minimize.
[2023-04-07 05:36:38] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 2 ms to minimize.
[2023-04-07 05:36:39] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2023-04-07 05:36:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 563 ms
[2023-04-07 05:36:39] [INFO ] Deduced a trap composed of 26 places in 289 ms of which 9 ms to minimize.
[2023-04-07 05:36:39] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 0 ms to minimize.
[2023-04-07 05:36:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 633 ms
[2023-04-07 05:36:40] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2023-04-07 05:36:40] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2023-04-07 05:36:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2023-04-07 05:36:40] [INFO ] After 15556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 1002 ms.
[2023-04-07 05:36:41] [INFO ] After 17777ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 159 ms.
Support contains 35 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 126 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 393/393 places, 2112/2112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 74 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2023-04-07 05:36:42] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2023-04-07 05:36:42] [INFO ] Invariant cache hit.
[2023-04-07 05:36:49] [INFO ] Implicit Places using invariants in 7172 ms returned []
[2023-04-07 05:36:49] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2023-04-07 05:36:49] [INFO ] Invariant cache hit.
[2023-04-07 05:36:49] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-07 05:36:51] [INFO ] Implicit Places using invariants and state equation in 2616 ms returned []
Implicit Place search using SMT with State Equation took 9847 ms to find 0 implicit places.
[2023-04-07 05:36:52] [INFO ] Redundant transitions in 171 ms returned []
[2023-04-07 05:36:52] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2023-04-07 05:36:52] [INFO ] Invariant cache hit.
[2023-04-07 05:36:53] [INFO ] Dead Transitions using invariants and state equation in 1513 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11643 ms. Remains : 393/393 places, 2112/2112 transitions.
Graph (trivial) has 1628 edges and 393 vertex of which 64 / 393 are part of one of the 8 SCC in 11 ms
Free SCC test removed 56 places
Drop transitions removed 214 transitions
Ensure Unique test removed 1407 transitions
Reduce isomorphic transitions removed 1621 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 337 transition count 427
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 273 transition count 427
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 129 place count 273 transition count 411
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 168 place count 250 transition count 411
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 366 place count 151 transition count 312
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 399 place count 151 transition count 279
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 415 place count 151 transition count 263
Free-agglomeration rule applied 72 times.
Iterating global reduction 3 with 72 rules applied. Total rules applied 487 place count 151 transition count 191
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 3 with 72 rules applied. Total rules applied 559 place count 79 transition count 191
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 568 place count 79 transition count 191
Applied a total of 568 rules in 76 ms. Remains 79 /393 variables (removed 314) and now considering 191/2112 (removed 1921) transitions.
Running SMT prover for 19 properties.
// Phase 1: matrix 191 rows 79 cols
[2023-04-07 05:36:53] [INFO ] Computed 18 invariants in 1 ms
[2023-04-07 05:36:54] [INFO ] [Real]Absence check using 17 positive place invariants in 92 ms returned sat
[2023-04-07 05:36:54] [INFO ] [Real]Absence check using 17 positive and 1 generalized place invariants in 26 ms returned sat
[2023-04-07 05:36:55] [INFO ] After 1706ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-07 05:36:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-04-07 05:36:55] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 05:36:55] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-07 05:36:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-04-07 05:36:56] [INFO ] After 165ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-07 05:36:56] [INFO ] Deduced a trap composed of 2 places in 97 ms of which 0 ms to minimize.
[2023-04-07 05:36:56] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-07 05:36:56] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-07 05:36:56] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2023-04-07 05:36:56] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-07 05:36:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 419 ms
[2023-04-07 05:36:56] [INFO ] After 964ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 367 ms.
[2023-04-07 05:36:57] [INFO ] After 1745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 5 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 652 transition count 2193
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 453 transition count 2193
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 418 place count 449 transition count 2161
Iterating global reduction 2 with 4 rules applied. Total rules applied 422 place count 449 transition count 2161
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 534 place count 393 transition count 2105
Applied a total of 534 rules in 377 ms. Remains 393 /660 variables (removed 267) and now considering 2105/2400 (removed 295) transitions.
[2023-04-07 05:36:58] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-07 05:36:58] [INFO ] Computed 25 invariants in 3 ms
[2023-04-07 05:37:04] [INFO ] Implicit Places using invariants in 6238 ms returned []
[2023-04-07 05:37:04] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:37:04] [INFO ] Invariant cache hit.
[2023-04-07 05:37:04] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:37:07] [INFO ] Implicit Places using invariants and state equation in 3008 ms returned []
Implicit Place search using SMT with State Equation took 9260 ms to find 0 implicit places.
[2023-04-07 05:37:07] [INFO ] Redundant transitions in 216 ms returned []
[2023-04-07 05:37:07] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:37:07] [INFO ] Invariant cache hit.
[2023-04-07 05:37:08] [INFO ] Dead Transitions using invariants and state equation in 1374 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 393/660 places, 2105/2400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11316 ms. Remains : 393/660 places, 2105/2400 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s29 1) (EQ s285 1)), p0:(AND (EQ s28 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 477 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-00 finished in 12253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 652 transition count 2192
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 452 transition count 2192
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 420 place count 448 transition count 2160
Iterating global reduction 2 with 4 rules applied. Total rules applied 424 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 536 place count 392 transition count 2104
Applied a total of 536 rules in 294 ms. Remains 392 /660 variables (removed 268) and now considering 2104/2400 (removed 296) transitions.
[2023-04-07 05:37:10] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 05:37:10] [INFO ] Computed 25 invariants in 2 ms
[2023-04-07 05:37:14] [INFO ] Implicit Places using invariants in 3882 ms returned []
[2023-04-07 05:37:14] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:37:14] [INFO ] Invariant cache hit.
[2023-04-07 05:37:14] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:37:16] [INFO ] Implicit Places using invariants and state equation in 2241 ms returned []
Implicit Place search using SMT with State Equation took 6126 ms to find 0 implicit places.
[2023-04-07 05:37:16] [INFO ] Redundant transitions in 33 ms returned []
[2023-04-07 05:37:16] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:37:16] [INFO ] Invariant cache hit.
[2023-04-07 05:37:17] [INFO ] Dead Transitions using invariants and state equation in 1337 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 392/660 places, 2104/2400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7873 ms. Remains : 392/660 places, 2104/2400 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s8 1) (EQ s252 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 495 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-01 finished in 8473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 84 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-07 05:37:18] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2023-04-07 05:37:18] [INFO ] Computed 25 invariants in 4 ms
[2023-04-07 05:37:30] [INFO ] Implicit Places using invariants in 12270 ms returned []
[2023-04-07 05:37:30] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:37:30] [INFO ] Invariant cache hit.
[2023-04-07 05:37:31] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:37:36] [INFO ] Implicit Places using invariants and state equation in 5510 ms returned []
Implicit Place search using SMT with State Equation took 17826 ms to find 0 implicit places.
[2023-04-07 05:37:36] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:37:36] [INFO ] Invariant cache hit.
[2023-04-07 05:37:37] [INFO ] Dead Transitions using invariants and state equation in 1662 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19605 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s24 0) (EQ s137 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1144 ms.
Product exploration explored 100000 steps with 50000 reset in 955 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-02 finished in 22020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))||(F(p0)&&X(G(p1)))))))'
Support contains 7 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 27 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-07 05:37:40] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:37:40] [INFO ] Invariant cache hit.
[2023-04-07 05:37:41] [INFO ] Implicit Places using invariants in 678 ms returned []
[2023-04-07 05:37:41] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:37:41] [INFO ] Invariant cache hit.
[2023-04-07 05:37:41] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:37:46] [INFO ] Implicit Places using invariants and state equation in 5090 ms returned []
Implicit Place search using SMT with State Equation took 5802 ms to find 0 implicit places.
[2023-04-07 05:37:46] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:37:46] [INFO ] Invariant cache hit.
[2023-04-07 05:37:47] [INFO ] Dead Transitions using invariants and state equation in 1636 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7489 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (EQ s4 1) (EQ s20 1) (EQ s449 1)) (AND (EQ s7 1) (EQ s30 1) (EQ s482 1))), p1:(NEQ s293 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 254 ms.
Stack based approach found an accepted trace after 1282 steps with 0 reset with depth 1283 and stack size 1268 in 25 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-03 finished in 8144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(F(p1) U p2))))'
Support contains 9 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 41 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-07 05:37:48] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:37:48] [INFO ] Invariant cache hit.
[2023-04-07 05:38:04] [INFO ] Implicit Places using invariants in 15644 ms returned []
[2023-04-07 05:38:04] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:38:04] [INFO ] Invariant cache hit.
[2023-04-07 05:38:04] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:38:09] [INFO ] Implicit Places using invariants and state equation in 5224 ms returned []
Implicit Place search using SMT with State Equation took 20912 ms to find 0 implicit places.
[2023-04-07 05:38:09] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:38:09] [INFO ] Invariant cache hit.
[2023-04-07 05:38:11] [INFO ] Dead Transitions using invariants and state equation in 1604 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22598 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s3 1) (EQ s17 1) (EQ s433 1)), p1:(AND (EQ s4 1) (EQ s22 1) (EQ s436 1)), p0:(AND (EQ s2 1) (EQ s16 1) (EQ s466 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-05 finished in 23111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 31 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-07 05:38:11] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:38:11] [INFO ] Invariant cache hit.
[2023-04-07 05:38:12] [INFO ] Implicit Places using invariants in 798 ms returned []
[2023-04-07 05:38:12] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:38:12] [INFO ] Invariant cache hit.
[2023-04-07 05:38:12] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:38:21] [INFO ] Implicit Places using invariants and state equation in 9012 ms returned []
Implicit Place search using SMT with State Equation took 9861 ms to find 0 implicit places.
[2023-04-07 05:38:21] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:38:21] [INFO ] Invariant cache hit.
[2023-04-07 05:38:23] [INFO ] Dead Transitions using invariants and state equation in 1671 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11597 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s11 1) (NEQ s333 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 212 ms.
Product exploration explored 100000 steps with 0 reset in 449 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 248 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6226 steps, run visited all 1 properties in 47 ms. (steps per millisecond=132 )
Probabilistic random walk after 6226 steps, saw 5373 distinct states, run finished after 65 ms. (steps per millisecond=95 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Applied a total of 0 rules in 11 ms. Remains 656 /656 variables (removed 0) and now considering 2368/2368 (removed 0) transitions.
[2023-04-07 05:38:25] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:38:25] [INFO ] Invariant cache hit.
[2023-04-07 05:38:25] [INFO ] Implicit Places using invariants in 677 ms returned []
[2023-04-07 05:38:25] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:38:25] [INFO ] Invariant cache hit.
[2023-04-07 05:38:31] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:38:38] [INFO ] Implicit Places using invariants and state equation in 12364 ms returned []
Implicit Place search using SMT with State Equation took 13087 ms to find 0 implicit places.
[2023-04-07 05:38:38] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:38:38] [INFO ] Invariant cache hit.
[2023-04-07 05:38:39] [INFO ] Dead Transitions using invariants and state equation in 1601 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14719 ms. Remains : 656/656 places, 2368/2368 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6226 steps, run visited all 1 properties in 115 ms. (steps per millisecond=54 )
Probabilistic random walk after 6226 steps, saw 5373 distinct states, run finished after 131 ms. (steps per millisecond=47 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 248 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 320 ms.
Product exploration explored 100000 steps with 0 reset in 273 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 313 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2368
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 191 Pre rules applied. Total rules applied 8 place count 656 transition count 2686
Deduced a syphon composed of 199 places in 2 ms
Iterating global reduction 1 with 191 rules applied. Total rules applied 199 place count 656 transition count 2686
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 263 places in 1 ms
Iterating global reduction 1 with 64 rules applied. Total rules applied 263 place count 656 transition count 2686
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 271 place count 648 transition count 2678
Deduced a syphon composed of 255 places in 2 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 279 place count 648 transition count 2678
Deduced a syphon composed of 255 places in 1 ms
Applied a total of 279 rules in 362 ms. Remains 648 /656 variables (removed 8) and now considering 2678/2368 (removed -310) transitions.
[2023-04-07 05:38:43] [INFO ] Redundant transitions in 101 ms returned []
[2023-04-07 05:38:43] [INFO ] Flow matrix only has 1071 transitions (discarded 1607 similar events)
// Phase 1: matrix 1071 rows 648 cols
[2023-04-07 05:38:43] [INFO ] Computed 25 invariants in 4 ms
[2023-04-07 05:38:54] [INFO ] Dead Transitions using invariants and state equation in 10842 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 648/656 places, 2678/2368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11384 ms. Remains : 648/656 places, 2678/2368 transitions.
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Applied a total of 0 rules in 38 ms. Remains 656 /656 variables (removed 0) and now considering 2368/2368 (removed 0) transitions.
[2023-04-07 05:38:54] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2023-04-07 05:38:54] [INFO ] Computed 25 invariants in 3 ms
[2023-04-07 05:38:57] [INFO ] Implicit Places using invariants in 3082 ms returned []
[2023-04-07 05:38:57] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:38:57] [INFO ] Invariant cache hit.
[2023-04-07 05:38:57] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:39:02] [INFO ] Implicit Places using invariants and state equation in 5455 ms returned []
Implicit Place search using SMT with State Equation took 8582 ms to find 0 implicit places.
[2023-04-07 05:39:02] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:39:02] [INFO ] Invariant cache hit.
[2023-04-07 05:39:04] [INFO ] Dead Transitions using invariants and state equation in 1701 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10347 ms. Remains : 656/656 places, 2368/2368 transitions.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-07 finished in 53345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(!p1) U (!p2&&G(!p1))))||p0)))'
Support contains 6 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 48 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-07 05:39:05] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:39:05] [INFO ] Invariant cache hit.
[2023-04-07 05:39:07] [INFO ] Implicit Places using invariants in 2727 ms returned []
[2023-04-07 05:39:07] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:39:07] [INFO ] Invariant cache hit.
[2023-04-07 05:39:08] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:39:13] [INFO ] Implicit Places using invariants and state equation in 5770 ms returned []
Implicit Place search using SMT with State Equation took 8540 ms to find 0 implicit places.
[2023-04-07 05:39:13] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:39:13] [INFO ] Invariant cache hit.
[2023-04-07 05:39:15] [INFO ] Dead Transitions using invariants and state equation in 1612 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10215 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 383 ms :[p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p2 p1)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=p1, acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (EQ s7 1) (EQ s29 1) (EQ s456 1)), p0:(OR (NEQ s0 1) (NEQ s9 1) (NEQ s448 1)), p2:(AND (EQ s0 1) (EQ s9 1) (EQ s448 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 715 ms.
Product exploration explored 100000 steps with 50000 reset in 997 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X p0), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-08 finished in 12493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(F(!p1))||(F(!p1)&&F(p2)))))'
Support contains 6 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 657 transition count 2376
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 657 transition count 2376
Applied a total of 6 rules in 37 ms. Remains 657 /660 variables (removed 3) and now considering 2376/2400 (removed 24) transitions.
[2023-04-07 05:39:17] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
// Phase 1: matrix 928 rows 657 cols
[2023-04-07 05:39:17] [INFO ] Computed 25 invariants in 7 ms
[2023-04-07 05:39:18] [INFO ] Implicit Places using invariants in 716 ms returned []
[2023-04-07 05:39:18] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2023-04-07 05:39:18] [INFO ] Invariant cache hit.
[2023-04-07 05:39:18] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-07 05:39:22] [INFO ] Implicit Places using invariants and state equation in 4636 ms returned []
Implicit Place search using SMT with State Equation took 5379 ms to find 0 implicit places.
[2023-04-07 05:39:22] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2023-04-07 05:39:22] [INFO ] Invariant cache hit.
[2023-04-07 05:39:24] [INFO ] Dead Transitions using invariants and state equation in 1933 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 657/660 places, 2376/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7363 ms. Remains : 657/660 places, 2376/2400 transitions.
Stuttering acceptance computed with spot in 408 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p1:(AND (EQ s0 1) (EQ s9 1) (EQ s466 1)), p2:(NEQ s172 1), p0:(AND (EQ s4 1) (EQ s168 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 762 ms.
Product exploration explored 100000 steps with 50000 reset in 740 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 305 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-09 finished in 9705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!X((!X(G((X(p1)&&!p2)))&&p0))) U p3))'
Support contains 10 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 652 transition count 2193
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 453 transition count 2193
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 417 place count 450 transition count 2169
Iterating global reduction 2 with 3 rules applied. Total rules applied 420 place count 450 transition count 2169
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 532 place count 394 transition count 2113
Applied a total of 532 rules in 206 ms. Remains 394 /660 variables (removed 266) and now considering 2113/2400 (removed 287) transitions.
[2023-04-07 05:39:27] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
// Phase 1: matrix 665 rows 394 cols
[2023-04-07 05:39:27] [INFO ] Computed 25 invariants in 2 ms
[2023-04-07 05:39:36] [INFO ] Implicit Places using invariants in 9497 ms returned []
[2023-04-07 05:39:36] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
[2023-04-07 05:39:36] [INFO ] Invariant cache hit.
[2023-04-07 05:39:37] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-07 05:39:39] [INFO ] Implicit Places using invariants and state equation in 2640 ms returned []
Implicit Place search using SMT with State Equation took 12185 ms to find 0 implicit places.
[2023-04-07 05:39:39] [INFO ] Redundant transitions in 36 ms returned []
[2023-04-07 05:39:39] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
[2023-04-07 05:39:39] [INFO ] Invariant cache hit.
[2023-04-07 05:39:40] [INFO ] Dead Transitions using invariants and state equation in 1253 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 394/660 places, 2113/2400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13693 ms. Remains : 394/660 places, 2113/2400 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p3), (OR (NOT p3) (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p0), acceptance={} source=1 dest: 2}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s0 1) (EQ s46 1)), p0:(AND (EQ s1 1) (EQ s12 1) (EQ s291 1)), p2:(AND (EQ s24 1) (EQ s112 1)), p1:(AND (EQ s6 1) (EQ s28 1) (EQ s277 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 10983 reset in 412 ms.
Stack based approach found an accepted trace after 39 steps with 3 reset with depth 15 and stack size 15 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-10 finished in 14388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0&&G(!p1)) U !p2)))'
Support contains 9 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 26 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-07 05:39:41] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2023-04-07 05:39:41] [INFO ] Computed 25 invariants in 3 ms
[2023-04-07 05:39:42] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-04-07 05:39:42] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:39:42] [INFO ] Invariant cache hit.
[2023-04-07 05:39:42] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:39:46] [INFO ] Implicit Places using invariants and state equation in 4876 ms returned []
Implicit Place search using SMT with State Equation took 5387 ms to find 0 implicit places.
[2023-04-07 05:39:46] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:39:46] [INFO ] Invariant cache hit.
[2023-04-07 05:39:48] [INFO ] Dead Transitions using invariants and state equation in 1645 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7095 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 155 ms :[p2, p2, true, p1]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s0 1) (EQ s9 1) (EQ s493 1)), p0:(AND (EQ s4 1) (EQ s20 1) (EQ s478 1)), p1:(AND (EQ s7 1) (EQ s29 1) (EQ s480 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 767 ms.
Product exploration explored 100000 steps with 50000 reset in 745 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (OR (AND p2 p0) (AND p2 p1)))), true, (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 48 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-11 finished in 8871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 57 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-07 05:39:50] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:39:50] [INFO ] Invariant cache hit.
[2023-04-07 05:39:55] [INFO ] Implicit Places using invariants in 5116 ms returned []
[2023-04-07 05:39:55] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:39:55] [INFO ] Invariant cache hit.
[2023-04-07 05:39:56] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:40:00] [INFO ] Implicit Places using invariants and state equation in 4738 ms returned []
Implicit Place search using SMT with State Equation took 9906 ms to find 0 implicit places.
[2023-04-07 05:40:00] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:40:00] [INFO ] Invariant cache hit.
[2023-04-07 05:40:01] [INFO ] Dead Transitions using invariants and state equation in 963 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10948 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s1 1) (NEQ s11 1) (NEQ s460 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 248 ms.
Product exploration explored 100000 steps with 0 reset in 390 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 448074 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 448074 steps, saw 312041 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:40:05] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:40:05] [INFO ] Invariant cache hit.
[2023-04-07 05:40:05] [INFO ] [Real]Absence check using 17 positive place invariants in 19 ms returned sat
[2023-04-07 05:40:05] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2023-04-07 05:40:05] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:40:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2023-04-07 05:40:05] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 05:40:06] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:40:06] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:40:06] [INFO ] After 117ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:40:06] [INFO ] Deduced a trap composed of 6 places in 296 ms of which 1 ms to minimize.
[2023-04-07 05:40:06] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 0 ms to minimize.
[2023-04-07 05:40:07] [INFO ] Deduced a trap composed of 3 places in 285 ms of which 1 ms to minimize.
[2023-04-07 05:40:07] [INFO ] Deduced a trap composed of 72 places in 231 ms of which 0 ms to minimize.
[2023-04-07 05:40:07] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 0 ms to minimize.
[2023-04-07 05:40:08] [INFO ] Deduced a trap composed of 66 places in 164 ms of which 1 ms to minimize.
[2023-04-07 05:40:08] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 0 ms to minimize.
[2023-04-07 05:40:08] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 1 ms to minimize.
[2023-04-07 05:40:08] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 1 ms to minimize.
[2023-04-07 05:40:09] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 0 ms to minimize.
[2023-04-07 05:40:09] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 0 ms to minimize.
[2023-04-07 05:40:09] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2023-04-07 05:40:09] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 0 ms to minimize.
[2023-04-07 05:40:09] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3241 ms
[2023-04-07 05:40:09] [INFO ] After 3406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-04-07 05:40:09] [INFO ] After 3921ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 99 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 392/656 places, 2104/2368 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 507321 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 507321 steps, saw 265931 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:40:12] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 05:40:12] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 05:40:13] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:40:13] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:40:13] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:40:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-04-07 05:40:13] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:40:13] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:40:13] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:40:13] [INFO ] After 74ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:40:13] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 0 ms to minimize.
[2023-04-07 05:40:14] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 0 ms to minimize.
[2023-04-07 05:40:14] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 0 ms to minimize.
[2023-04-07 05:40:14] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 1 ms to minimize.
[2023-04-07 05:40:14] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2023-04-07 05:40:14] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 0 ms to minimize.
[2023-04-07 05:40:15] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 0 ms to minimize.
[2023-04-07 05:40:15] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 0 ms to minimize.
[2023-04-07 05:40:15] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 0 ms to minimize.
[2023-04-07 05:40:15] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2023-04-07 05:40:15] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2023-04-07 05:40:16] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 0 ms to minimize.
[2023-04-07 05:40:16] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2470 ms
[2023-04-07 05:40:16] [INFO ] After 2582ms 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-04-07 05:40:16] [INFO ] After 2899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 82 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 58 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-07 05:40:16] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:40:16] [INFO ] Invariant cache hit.
[2023-04-07 05:40:16] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-04-07 05:40:16] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:40:16] [INFO ] Invariant cache hit.
[2023-04-07 05:40:16] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:40:18] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 2075 ms to find 0 implicit places.
[2023-04-07 05:40:18] [INFO ] Redundant transitions in 35 ms returned []
[2023-04-07 05:40:18] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:40:18] [INFO ] Invariant cache hit.
[2023-04-07 05:40:19] [INFO ] Dead Transitions using invariants and state equation in 847 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3049 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 25 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2023-04-07 05:40:19] [INFO ] Computed 17 invariants in 1 ms
[2023-04-07 05:40:19] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-04-07 05:40:19] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:40:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-07 05:40:19] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:40:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 05:40:19] [INFO ] After 19ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:40:19] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 05:40:19] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 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 :[true, (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0)]
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 99 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
[2023-04-07 05:40:19] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 05:40:19] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 05:40:20] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-04-07 05:40:20] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:40:20] [INFO ] Invariant cache hit.
[2023-04-07 05:40:20] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:40:38] [INFO ] Implicit Places using invariants and state equation in 17850 ms returned []
Implicit Place search using SMT with State Equation took 18279 ms to find 0 implicit places.
[2023-04-07 05:40:38] [INFO ] Redundant transitions in 37 ms returned []
[2023-04-07 05:40:38] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:40:38] [INFO ] Invariant cache hit.
[2023-04-07 05:40:39] [INFO ] Dead Transitions using invariants and state equation in 1377 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 392/656 places, 2104/2368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19875 ms. Remains : 392/656 places, 2104/2368 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 244 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 97 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 497520 steps, run timeout after 3061 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 497520 steps, saw 261111 distinct states, run finished after 3061 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:40:43] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:40:43] [INFO ] Invariant cache hit.
[2023-04-07 05:40:43] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-04-07 05:40:43] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 05:40:43] [INFO ] After 438ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:40:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-04-07 05:40:43] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:40:43] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:40:43] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:40:44] [INFO ] After 92ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:40:44] [INFO ] Deduced a trap composed of 3 places in 296 ms of which 1 ms to minimize.
[2023-04-07 05:40:44] [INFO ] Deduced a trap composed of 3 places in 297 ms of which 1 ms to minimize.
[2023-04-07 05:40:45] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 0 ms to minimize.
[2023-04-07 05:40:45] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 0 ms to minimize.
[2023-04-07 05:40:45] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 0 ms to minimize.
[2023-04-07 05:40:45] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 1 ms to minimize.
[2023-04-07 05:40:46] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 0 ms to minimize.
[2023-04-07 05:40:46] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 1 ms to minimize.
[2023-04-07 05:40:46] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 0 ms to minimize.
[2023-04-07 05:40:46] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 0 ms to minimize.
[2023-04-07 05:40:47] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 0 ms to minimize.
[2023-04-07 05:40:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2984 ms
[2023-04-07 05:40:47] [INFO ] After 3137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-04-07 05:40:47] [INFO ] After 3640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 105 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 514161 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{}
Probabilistic random walk after 514161 steps, saw 267586 distinct states, run finished after 3013 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:40:50] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:40:50] [INFO ] Invariant cache hit.
[2023-04-07 05:40:50] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-04-07 05:40:50] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 05:40:50] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:40:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:40:50] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 05:40:51] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:40:51] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:40:51] [INFO ] After 84ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:40:51] [INFO ] Deduced a trap composed of 3 places in 283 ms of which 0 ms to minimize.
[2023-04-07 05:40:51] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 1 ms to minimize.
[2023-04-07 05:40:52] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 1 ms to minimize.
[2023-04-07 05:40:52] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 0 ms to minimize.
[2023-04-07 05:40:52] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 15 ms to minimize.
[2023-04-07 05:40:53] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 1 ms to minimize.
[2023-04-07 05:40:53] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 0 ms to minimize.
[2023-04-07 05:40:55] [INFO ] Deduced a trap composed of 3 places in 2562 ms of which 25 ms to minimize.
[2023-04-07 05:40:56] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 1 ms to minimize.
[2023-04-07 05:40:56] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2023-04-07 05:40:56] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 0 ms to minimize.
[2023-04-07 05:40:56] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5208 ms
[2023-04-07 05:40:56] [INFO ] After 5334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-04-07 05:40:56] [INFO ] After 5822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 52 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 77 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-07 05:40:56] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:40:56] [INFO ] Invariant cache hit.
[2023-04-07 05:40:57] [INFO ] Implicit Places using invariants in 712 ms returned []
[2023-04-07 05:40:57] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:40:57] [INFO ] Invariant cache hit.
[2023-04-07 05:40:57] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:41:00] [INFO ] Implicit Places using invariants and state equation in 2574 ms returned []
Implicit Place search using SMT with State Equation took 3304 ms to find 0 implicit places.
[2023-04-07 05:41:00] [INFO ] Redundant transitions in 34 ms returned []
[2023-04-07 05:41:00] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:41:00] [INFO ] Invariant cache hit.
[2023-04-07 05:41:01] [INFO ] Dead Transitions using invariants and state equation in 1414 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4860 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 3 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 27 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2023-04-07 05:41:01] [INFO ] Computed 17 invariants in 1 ms
[2023-04-07 05:41:01] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-07 05:41:01] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:41:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-04-07 05:41:01] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:41:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 05:41:01] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:41:01] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-07 05:41:01] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 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 129 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 240 ms.
Product exploration explored 100000 steps with 0 reset in 539 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 61 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-07 05:41:03] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 05:41:03] [INFO ] Computed 25 invariants in 1 ms
[2023-04-07 05:41:03] [INFO ] Implicit Places using invariants in 716 ms returned []
[2023-04-07 05:41:03] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:41:04] [INFO ] Invariant cache hit.
[2023-04-07 05:41:04] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:41:06] [INFO ] Implicit Places using invariants and state equation in 2531 ms returned []
Implicit Place search using SMT with State Equation took 3280 ms to find 0 implicit places.
[2023-04-07 05:41:06] [INFO ] Redundant transitions in 46 ms returned []
[2023-04-07 05:41:06] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:41:06] [INFO ] Invariant cache hit.
[2023-04-07 05:41:07] [INFO ] Dead Transitions using invariants and state equation in 1311 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4745 ms. Remains : 392/392 places, 2104/2104 transitions.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-12 finished in 77888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 35 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-07 05:41:08] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2023-04-07 05:41:08] [INFO ] Computed 25 invariants in 3 ms
[2023-04-07 05:41:09] [INFO ] Implicit Places using invariants in 832 ms returned []
[2023-04-07 05:41:09] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:41:09] [INFO ] Invariant cache hit.
[2023-04-07 05:41:09] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:41:16] [INFO ] Implicit Places using invariants and state equation in 7808 ms returned []
Implicit Place search using SMT with State Equation took 8692 ms to find 0 implicit places.
[2023-04-07 05:41:17] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 05:41:17] [INFO ] Invariant cache hit.
[2023-04-07 05:41:18] [INFO ] Dead Transitions using invariants and state equation in 1643 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10386 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s31 1) (EQ s478 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 249 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-14 finished in 10876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1||X(F(p2)))&&p0))))'
Support contains 6 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 652 transition count 2193
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 453 transition count 2193
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 417 place count 450 transition count 2169
Iterating global reduction 2 with 3 rules applied. Total rules applied 420 place count 450 transition count 2169
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 532 place count 394 transition count 2113
Applied a total of 532 rules in 262 ms. Remains 394 /660 variables (removed 266) and now considering 2113/2400 (removed 287) transitions.
[2023-04-07 05:41:19] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
// Phase 1: matrix 665 rows 394 cols
[2023-04-07 05:41:19] [INFO ] Computed 25 invariants in 2 ms
[2023-04-07 05:41:20] [INFO ] Implicit Places using invariants in 695 ms returned []
[2023-04-07 05:41:20] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
[2023-04-07 05:41:20] [INFO ] Invariant cache hit.
[2023-04-07 05:41:20] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-07 05:41:22] [INFO ] Implicit Places using invariants and state equation in 2680 ms returned []
Implicit Place search using SMT with State Equation took 3412 ms to find 0 implicit places.
[2023-04-07 05:41:22] [INFO ] Redundant transitions in 52 ms returned []
[2023-04-07 05:41:22] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
[2023-04-07 05:41:22] [INFO ] Invariant cache hit.
[2023-04-07 05:41:24] [INFO ] Dead Transitions using invariants and state equation in 1376 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 394/660 places, 2113/2400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5149 ms. Remains : 394/660 places, 2113/2400 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s29 1) (EQ s256 1)), p1:(EQ s192 1), p2:(AND (EQ s6 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 262 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-15 finished in 5739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-08-LTLFireability-07
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 652 transition count 2193
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 453 transition count 2193
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 418 place count 449 transition count 2161
Iterating global reduction 2 with 4 rules applied. Total rules applied 422 place count 449 transition count 2161
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 534 place count 393 transition count 2105
Applied a total of 534 rules in 135 ms. Remains 393 /660 variables (removed 267) and now considering 2105/2400 (removed 295) transitions.
[2023-04-07 05:41:25] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-07 05:41:25] [INFO ] Computed 25 invariants in 1 ms
[2023-04-07 05:41:26] [INFO ] Implicit Places using invariants in 796 ms returned []
[2023-04-07 05:41:26] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:41:26] [INFO ] Invariant cache hit.
[2023-04-07 05:41:26] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:41:29] [INFO ] Implicit Places using invariants and state equation in 3100 ms returned []
Implicit Place search using SMT with State Equation took 3918 ms to find 0 implicit places.
[2023-04-07 05:41:29] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:41:29] [INFO ] Invariant cache hit.
[2023-04-07 05:41:31] [INFO ] Dead Transitions using invariants and state equation in 1507 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 393/660 places, 2105/2400 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5581 ms. Remains : 393/660 places, 2105/2400 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s11 1) (NEQ s176 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 269 ms.
Product exploration explored 100000 steps with 0 reset in 299 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 301 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Finished Best-First random walk after 6607 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1321 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 200 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 7 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-07 05:41:33] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:41:33] [INFO ] Invariant cache hit.
[2023-04-07 05:41:33] [INFO ] Implicit Places using invariants in 587 ms returned []
[2023-04-07 05:41:33] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:41:33] [INFO ] Invariant cache hit.
[2023-04-07 05:41:34] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:41:36] [INFO ] Implicit Places using invariants and state equation in 2855 ms returned []
Implicit Place search using SMT with State Equation took 3507 ms to find 0 implicit places.
[2023-04-07 05:41:36] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:41:36] [INFO ] Invariant cache hit.
[2023-04-07 05:41:37] [INFO ] Dead Transitions using invariants and state equation in 1377 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4904 ms. Remains : 393/393 places, 2105/2105 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3219 steps, run visited all 1 properties in 37 ms. (steps per millisecond=87 )
Probabilistic random walk after 3219 steps, saw 2702 distinct states, run finished after 37 ms. (steps per millisecond=87 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 307 ms.
Product exploration explored 100000 steps with 0 reset in 285 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 81 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-07 05:41:40] [INFO ] Redundant transitions in 69 ms returned []
[2023-04-07 05:41:40] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:41:40] [INFO ] Invariant cache hit.
[2023-04-07 05:41:42] [INFO ] Dead Transitions using invariants and state equation in 1448 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1652 ms. Remains : 393/393 places, 2105/2105 transitions.
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 21 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-07 05:41:42] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:41:42] [INFO ] Invariant cache hit.
[2023-04-07 05:41:42] [INFO ] Implicit Places using invariants in 603 ms returned []
[2023-04-07 05:41:42] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:41:42] [INFO ] Invariant cache hit.
[2023-04-07 05:41:43] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:41:46] [INFO ] Implicit Places using invariants and state equation in 4115 ms returned []
Implicit Place search using SMT with State Equation took 4754 ms to find 0 implicit places.
[2023-04-07 05:41:46] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:41:46] [INFO ] Invariant cache hit.
[2023-04-07 05:41:48] [INFO ] Dead Transitions using invariants and state equation in 1349 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6128 ms. Remains : 393/393 places, 2105/2105 transitions.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-07 finished in 23428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-08-LTLFireability-12
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 652 transition count 2192
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 452 transition count 2192
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 420 place count 448 transition count 2160
Iterating global reduction 2 with 4 rules applied. Total rules applied 424 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 536 place count 392 transition count 2104
Applied a total of 536 rules in 62 ms. Remains 392 /660 variables (removed 268) and now considering 2104/2400 (removed 296) transitions.
[2023-04-07 05:41:48] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 05:41:48] [INFO ] Computed 25 invariants in 2 ms
[2023-04-07 05:41:49] [INFO ] Implicit Places using invariants in 617 ms returned []
[2023-04-07 05:41:49] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:41:49] [INFO ] Invariant cache hit.
[2023-04-07 05:41:49] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:41:51] [INFO ] Implicit Places using invariants and state equation in 2649 ms returned []
Implicit Place search using SMT with State Equation took 3290 ms to find 0 implicit places.
[2023-04-07 05:41:51] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:41:51] [INFO ] Invariant cache hit.
[2023-04-07 05:41:53] [INFO ] Dead Transitions using invariants and state equation in 1436 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 392/660 places, 2104/2400 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4793 ms. Remains : 392/660 places, 2104/2400 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s1 1) (NEQ s11 1) (NEQ s265 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 195 ms.
Product exploration explored 100000 steps with 0 reset in 230 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 511731 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 511731 steps, saw 267342 distinct states, run finished after 3008 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:41:57] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:41:57] [INFO ] Invariant cache hit.
[2023-04-07 05:41:57] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-04-07 05:41:57] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2023-04-07 05:41:57] [INFO ] After 409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:41:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-04-07 05:41:57] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 05:41:57] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:41:57] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:41:58] [INFO ] After 94ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:41:58] [INFO ] Deduced a trap composed of 3 places in 332 ms of which 1 ms to minimize.
[2023-04-07 05:41:58] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 1 ms to minimize.
[2023-04-07 05:41:59] [INFO ] Deduced a trap composed of 3 places in 250 ms of which 1 ms to minimize.
[2023-04-07 05:41:59] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 0 ms to minimize.
[2023-04-07 05:41:59] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 0 ms to minimize.
[2023-04-07 05:41:59] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2023-04-07 05:42:00] [INFO ] Deduced a trap composed of 31 places in 212 ms of which 1 ms to minimize.
[2023-04-07 05:42:02] [INFO ] Deduced a trap composed of 3 places in 2222 ms of which 3 ms to minimize.
[2023-04-07 05:42:02] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 0 ms to minimize.
[2023-04-07 05:42:02] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 0 ms to minimize.
[2023-04-07 05:42:02] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2023-04-07 05:42:02] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4897 ms
[2023-04-07 05:42:03] [INFO ] After 5059ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-04-07 05:42:03] [INFO ] After 5544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 55 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 524025 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :{}
Probabilistic random walk after 524025 steps, saw 272335 distinct states, run finished after 3008 ms. (steps per millisecond=174 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:42:06] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:42:06] [INFO ] Invariant cache hit.
[2023-04-07 05:42:06] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-04-07 05:42:06] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 81 ms returned sat
[2023-04-07 05:42:09] [INFO ] After 2870ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:42:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:42:09] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 12 ms returned sat
[2023-04-07 05:42:12] [INFO ] After 3251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:42:12] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:42:12] [INFO ] After 108ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:42:12] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 0 ms to minimize.
[2023-04-07 05:42:13] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 1 ms to minimize.
[2023-04-07 05:42:13] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 0 ms to minimize.
[2023-04-07 05:42:13] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 0 ms to minimize.
[2023-04-07 05:42:17] [INFO ] Deduced a trap composed of 27 places in 3314 ms of which 32 ms to minimize.
[2023-04-07 05:42:17] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 1 ms to minimize.
[2023-04-07 05:42:17] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 0 ms to minimize.
[2023-04-07 05:42:17] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 1 ms to minimize.
[2023-04-07 05:42:17] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 0 ms to minimize.
[2023-04-07 05:42:18] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2023-04-07 05:42:18] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2023-04-07 05:42:18] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5799 ms
[2023-04-07 05:42:18] [INFO ] After 5977ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-04-07 05:42:18] [INFO ] After 9414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 91 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 97 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-07 05:42:18] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:42:18] [INFO ] Invariant cache hit.
[2023-04-07 05:42:29] [INFO ] Implicit Places using invariants in 10895 ms returned []
[2023-04-07 05:42:29] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:42:29] [INFO ] Invariant cache hit.
[2023-04-07 05:42:29] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:42:32] [INFO ] Implicit Places using invariants and state equation in 2729 ms returned []
Implicit Place search using SMT with State Equation took 13679 ms to find 0 implicit places.
[2023-04-07 05:42:32] [INFO ] Redundant transitions in 45 ms returned []
[2023-04-07 05:42:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:42:32] [INFO ] Invariant cache hit.
[2023-04-07 05:42:41] [INFO ] Dead Transitions using invariants and state equation in 8819 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22659 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 52 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2023-04-07 05:42:41] [INFO ] Computed 17 invariants in 0 ms
[2023-04-07 05:42:41] [INFO ] [Real]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-07 05:42:41] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:42:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-07 05:42:41] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:42:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 05:42:41] [INFO ] After 10ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:42:41] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-07 05:42:41] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 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 70 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0)]
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 125 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-07 05:42:42] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 05:42:42] [INFO ] Computed 25 invariants in 2 ms
[2023-04-07 05:42:42] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-04-07 05:42:42] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:42:42] [INFO ] Invariant cache hit.
[2023-04-07 05:42:42] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:42:45] [INFO ] Implicit Places using invariants and state equation in 2724 ms returned []
Implicit Place search using SMT with State Equation took 3226 ms to find 0 implicit places.
[2023-04-07 05:42:45] [INFO ] Redundant transitions in 43 ms returned []
[2023-04-07 05:42:45] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:42:45] [INFO ] Invariant cache hit.
[2023-04-07 05:42:46] [INFO ] Dead Transitions using invariants and state equation in 1460 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4913 ms. Remains : 392/392 places, 2104/2104 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 195 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 112 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 495090 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 495090 steps, saw 259859 distinct states, run finished after 3016 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:42:50] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:42:50] [INFO ] Invariant cache hit.
[2023-04-07 05:42:50] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-04-07 05:42:50] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 65 ms returned sat
[2023-04-07 05:42:51] [INFO ] After 1314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:42:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-04-07 05:42:51] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 05:42:52] [INFO ] After 319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:42:52] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:42:52] [INFO ] After 95ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:42:52] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 1 ms to minimize.
[2023-04-07 05:42:52] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 1 ms to minimize.
[2023-04-07 05:42:53] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 0 ms to minimize.
[2023-04-07 05:42:53] [INFO ] Deduced a trap composed of 3 places in 258 ms of which 0 ms to minimize.
[2023-04-07 05:42:53] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 0 ms to minimize.
[2023-04-07 05:42:53] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2023-04-07 05:42:54] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 0 ms to minimize.
[2023-04-07 05:42:54] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 1 ms to minimize.
[2023-04-07 05:42:54] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 1 ms to minimize.
[2023-04-07 05:42:54] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 1 ms to minimize.
[2023-04-07 05:42:55] [INFO ] Deduced a trap composed of 19 places in 953 ms of which 1 ms to minimize.
[2023-04-07 05:42:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3727 ms
[2023-04-07 05:42:55] [INFO ] After 3881ms 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-04-07 05:42:55] [INFO ] After 4428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 92 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 497664 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :{}
Probabilistic random walk after 497664 steps, saw 261175 distinct states, run finished after 3016 ms. (steps per millisecond=165 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 05:42:59] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:42:59] [INFO ] Invariant cache hit.
[2023-04-07 05:42:59] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-04-07 05:42:59] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2023-04-07 05:42:59] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:42:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-04-07 05:42:59] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:43:00] [INFO ] After 301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:43:00] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:43:00] [INFO ] After 114ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:43:00] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 0 ms to minimize.
[2023-04-07 05:43:00] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 0 ms to minimize.
[2023-04-07 05:43:01] [INFO ] Deduced a trap composed of 3 places in 295 ms of which 0 ms to minimize.
[2023-04-07 05:43:01] [INFO ] Deduced a trap composed of 3 places in 305 ms of which 0 ms to minimize.
[2023-04-07 05:43:01] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 0 ms to minimize.
[2023-04-07 05:43:02] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 0 ms to minimize.
[2023-04-07 05:43:02] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 0 ms to minimize.
[2023-04-07 05:43:02] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 0 ms to minimize.
[2023-04-07 05:43:02] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 1 ms to minimize.
[2023-04-07 05:43:03] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2023-04-07 05:43:03] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 0 ms to minimize.
[2023-04-07 05:43:03] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3012 ms
[2023-04-07 05:43:03] [INFO ] After 3206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-04-07 05:43:03] [INFO ] After 3766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 52 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-07 05:43:03] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:43:03] [INFO ] Invariant cache hit.
[2023-04-07 05:43:03] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-04-07 05:43:03] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:43:03] [INFO ] Invariant cache hit.
[2023-04-07 05:43:04] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:43:06] [INFO ] Implicit Places using invariants and state equation in 2852 ms returned []
Implicit Place search using SMT with State Equation took 3370 ms to find 0 implicit places.
[2023-04-07 05:43:06] [INFO ] Redundant transitions in 46 ms returned []
[2023-04-07 05:43:06] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:43:06] [INFO ] Invariant cache hit.
[2023-04-07 05:43:08] [INFO ] Dead Transitions using invariants and state equation in 1455 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4976 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 43 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2023-04-07 05:43:08] [INFO ] Computed 17 invariants in 2 ms
[2023-04-07 05:43:08] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-07 05:43:08] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:43:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-04-07 05:43:08] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:43:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 05:43:08] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:43:08] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-07 05:43:08] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 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 95 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 200 ms.
Product exploration explored 100000 steps with 0 reset in 335 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 53 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-07 05:43:09] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 05:43:09] [INFO ] Computed 25 invariants in 2 ms
[2023-04-07 05:43:10] [INFO ] Implicit Places using invariants in 655 ms returned []
[2023-04-07 05:43:10] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:43:10] [INFO ] Invariant cache hit.
[2023-04-07 05:43:13] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:43:15] [INFO ] Implicit Places using invariants and state equation in 4691 ms returned []
Implicit Place search using SMT with State Equation took 5386 ms to find 0 implicit places.
[2023-04-07 05:43:15] [INFO ] Redundant transitions in 36 ms returned []
[2023-04-07 05:43:15] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:43:15] [INFO ] Invariant cache hit.
[2023-04-07 05:43:16] [INFO ] Dead Transitions using invariants and state equation in 1451 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6981 ms. Remains : 392/392 places, 2104/2104 transitions.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-12 finished in 88589 ms.
[2023-04-07 05:43:17] [INFO ] Flatten gal took : 188 ms
[2023-04-07 05:43:17] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-04-07 05:43:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 660 places, 2400 transitions and 11776 arcs took 34 ms.
Total runtime 489922 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2114/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2114/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : EisenbergMcGuire-PT-08-LTLFireability-07
Could not compute solution for formula : EisenbergMcGuire-PT-08-LTLFireability-12

BK_STOP 1680846200865

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name EisenbergMcGuire-PT-08-LTLFireability-07
ltl formula formula --ltl=/tmp/2114/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 660 places, 2400 transitions and 11776 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2114/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.580 real 0.080 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2114/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2114/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2114/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 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)
ltl formula name EisenbergMcGuire-PT-08-LTLFireability-12
ltl formula formula --ltl=/tmp/2114/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 660 places, 2400 transitions and 11776 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.590 real 0.050 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2114/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2114/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2114/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2114/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 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="EisenbergMcGuire-PT-08"
export BK_EXAMINATION="LTLFireability"
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 EisenbergMcGuire-PT-08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r521-tall-167987246400260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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