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.r489-tall-167912706800460.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 Szymanski-PT-b04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706800460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 8.4K Feb 26 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 205K Feb 26 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 26 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679249705957

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=Szymanski-PT-b04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 18:15:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 18:15:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 18:15:07] [INFO ] Load time of PNML (sax parser for PT used): 305 ms
[2023-03-19 18:15:07] [INFO ] Transformed 568 places.
[2023-03-19 18:15:07] [INFO ] Transformed 8320 transitions.
[2023-03-19 18:15:07] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 460 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 305 transition count 7936
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 305 transition count 7936
Applied a total of 4 rules in 164 ms. Remains 305 /308 variables (removed 3) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 18:15:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 18:15:08] [INFO ] Computed 1 place invariants in 49 ms
[2023-03-19 18:15:08] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-19 18:15:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:15:08] [INFO ] Invariant cache hit.
[2023-03-19 18:15:09] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:15:15] [INFO ] Implicit Places using invariants and state equation in 6127 ms returned []
Implicit Place search using SMT with State Equation took 6760 ms to find 0 implicit places.
[2023-03-19 18:15:15] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:15:15] [INFO ] Invariant cache hit.
[2023-03-19 18:15:17] [INFO ] Dead Transitions using invariants and state equation in 2199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/308 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9127 ms. Remains : 305/308 places, 7936/8064 transitions.
Support contains 41 out of 305 places after structural reductions.
[2023-03-19 18:15:18] [INFO ] Flatten gal took : 552 ms
[2023-03-19 18:15:18] [INFO ] Flatten gal took : 276 ms
[2023-03-19 18:15:19] [INFO ] Input system was already deterministic with 7936 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-19 18:15:19] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:15:19] [INFO ] Invariant cache hit.
[2023-03-19 18:15:19] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-19 18:15:32] [INFO ] After 12460ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3 real:11
[2023-03-19 18:15:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:15:41] [INFO ] After 9330ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :1 sat :0 real:14
[2023-03-19 18:15:41] [INFO ] After 22107ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2023-03-19 18:15:41] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:16:06] [INFO ] After 24748ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 18:16:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 18:16:06] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:14
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 381 ms.
Support contains 28 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 339 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 305/305 places, 7936/7936 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 118510 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118510 steps, saw 49892 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 13 properties.
[2023-03-19 18:16:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:16:11] [INFO ] Invariant cache hit.
[2023-03-19 18:16:11] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:16:24] [INFO ] After 13100ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:12
[2023-03-19 18:16:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:16:25] [INFO ] After 744ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-19 18:16:25] [INFO ] After 14097ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-19 18:16:25] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:16:47] [INFO ] After 21971ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 18:16:50] [INFO ] After 2875ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 18:16:50] [INFO ] After 2875ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-19 18:16:50] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 242 ms.
Support contains 26 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 221 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 305/305 places, 7936/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-19 18:16:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:16:51] [INFO ] Invariant cache hit.
[2023-03-19 18:16:51] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 18:16:57] [INFO ] After 6558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 18:16:57] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 18:17:17] [INFO ] After 19719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 18:17:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:17:22] [INFO ] After 5130ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-19 18:17:22] [INFO ] After 5131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 18:17:22] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 157 ms.
Support contains 21 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 305 transition count 7879
Applied a total of 57 rules in 335 ms. Remains 305 /305 variables (removed 0) and now considering 7879/7936 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 335 ms. Remains : 305/305 places, 7879/7936 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Szymanski-PT-b04-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 2304 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((F(p1)&&F(G(p0))))))))'
Support contains 2 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 362 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:17:24] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:17:24] [INFO ] Invariant cache hit.
[2023-03-19 18:17:24] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-19 18:17:24] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:17:24] [INFO ] Invariant cache hit.
[2023-03-19 18:17:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:17:32] [INFO ] Implicit Places using invariants and state equation in 8183 ms returned []
Implicit Place search using SMT with State Equation took 8681 ms to find 0 implicit places.
[2023-03-19 18:17:33] [INFO ] Redundant transitions in 880 ms returned []
[2023-03-19 18:17:33] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:17:33] [INFO ] Invariant cache hit.
[2023-03-19 18:17:35] [INFO ] Dead Transitions using invariants and state equation in 2250 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12184 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s29 1) (GEQ s260 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 566 ms.
Stack based approach found an accepted trace after 57 steps with 0 reset with depth 58 and stack size 58 in 2 ms.
FORMULA Szymanski-PT-b04-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-00 finished in 13056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 34 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:17:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:17:36] [INFO ] Invariant cache hit.
[2023-03-19 18:17:37] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-19 18:17:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:17:37] [INFO ] Invariant cache hit.
[2023-03-19 18:17:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:17:44] [INFO ] Implicit Places using invariants and state equation in 7714 ms returned []
Implicit Place search using SMT with State Equation took 8240 ms to find 0 implicit places.
[2023-03-19 18:17:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:17:44] [INFO ] Invariant cache hit.
[2023-03-19 18:17:47] [INFO ] Dead Transitions using invariants and state equation in 2378 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10663 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s3 1) (GEQ s300 1))) (GEQ s87 1) (GEQ s301 1)), p0:(AND (GEQ s124 1) (GEQ s258 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-01 finished in 10860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 30 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:17:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:17:47] [INFO ] Invariant cache hit.
[2023-03-19 18:17:48] [INFO ] Implicit Places using invariants in 454 ms returned []
[2023-03-19 18:17:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:17:48] [INFO ] Invariant cache hit.
[2023-03-19 18:17:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:17:55] [INFO ] Implicit Places using invariants and state equation in 7852 ms returned []
Implicit Place search using SMT with State Equation took 8311 ms to find 0 implicit places.
[2023-03-19 18:17:55] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:17:55] [INFO ] Invariant cache hit.
[2023-03-19 18:17:58] [INFO ] Dead Transitions using invariants and state equation in 2142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10488 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s24 1) (GEQ s282 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-04 finished in 10649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 198 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:17:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:17:58] [INFO ] Invariant cache hit.
[2023-03-19 18:17:58] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-19 18:17:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:17:58] [INFO ] Invariant cache hit.
[2023-03-19 18:17:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:18:07] [INFO ] Implicit Places using invariants and state equation in 8315 ms returned []
Implicit Place search using SMT with State Equation took 8757 ms to find 0 implicit places.
[2023-03-19 18:18:08] [INFO ] Redundant transitions in 866 ms returned []
[2023-03-19 18:18:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:18:08] [INFO ] Invariant cache hit.
[2023-03-19 18:18:10] [INFO ] Dead Transitions using invariants and state equation in 2081 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11919 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s114 1) (GEQ s282 1)) (AND (GEQ s64 1) (GEQ s259 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]]
Stuttering criterion allowed to conclude after 269 steps with 1 reset in 3 ms.
FORMULA Szymanski-PT-b04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-05 finished in 11984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (G(p0)&&p1)))'
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 30 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:18:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:18:10] [INFO ] Invariant cache hit.
[2023-03-19 18:18:10] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-19 18:18:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:18:10] [INFO ] Invariant cache hit.
[2023-03-19 18:18:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:18:18] [INFO ] Implicit Places using invariants and state equation in 7380 ms returned []
Implicit Place search using SMT with State Equation took 7802 ms to find 0 implicit places.
[2023-03-19 18:18:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:18:18] [INFO ] Invariant cache hit.
[2023-03-19 18:18:20] [INFO ] Dead Transitions using invariants and state equation in 2074 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9907 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s19 1) (GEQ s274 1)), p0:(AND (GEQ s58 1) (GEQ s274 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-06 finished in 10028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 206 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:18:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:18:20] [INFO ] Invariant cache hit.
[2023-03-19 18:18:20] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-19 18:18:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:18:20] [INFO ] Invariant cache hit.
[2023-03-19 18:18:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:18:28] [INFO ] Implicit Places using invariants and state equation in 7959 ms returned []
Implicit Place search using SMT with State Equation took 8410 ms to find 0 implicit places.
[2023-03-19 18:18:29] [INFO ] Redundant transitions in 688 ms returned []
[2023-03-19 18:18:29] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:18:29] [INFO ] Invariant cache hit.
[2023-03-19 18:18:31] [INFO ] Dead Transitions using invariants and state equation in 2121 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11444 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s41 1) (GEQ s260 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]]
Stuttering criterion allowed to conclude after 214 steps with 0 reset in 2 ms.
FORMULA Szymanski-PT-b04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-07 finished in 11505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 192 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:18:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:18:31] [INFO ] Invariant cache hit.
[2023-03-19 18:18:32] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-19 18:18:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:18:32] [INFO ] Invariant cache hit.
[2023-03-19 18:18:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:18:39] [INFO ] Implicit Places using invariants and state equation in 7438 ms returned []
Implicit Place search using SMT with State Equation took 7873 ms to find 0 implicit places.
[2023-03-19 18:18:40] [INFO ] Redundant transitions in 659 ms returned []
[2023-03-19 18:18:40] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:18:40] [INFO ] Invariant cache hit.
[2023-03-19 18:18:42] [INFO ] Dead Transitions using invariants and state equation in 2111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10845 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s77 1) (GEQ s257 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 490 ms.
Stack based approach found an accepted trace after 77 steps with 0 reset with depth 78 and stack size 78 in 1 ms.
FORMULA Szymanski-PT-b04-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-08 finished in 11395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F((p1||G(p2))))))))'
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:18:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:18:43] [INFO ] Invariant cache hit.
[2023-03-19 18:18:43] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-19 18:18:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:18:43] [INFO ] Invariant cache hit.
[2023-03-19 18:18:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:18:51] [INFO ] Implicit Places using invariants and state equation in 7782 ms returned []
Implicit Place search using SMT with State Equation took 8197 ms to find 0 implicit places.
[2023-03-19 18:18:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:18:51] [INFO ] Invariant cache hit.
[2023-03-19 18:18:53] [INFO ] Dead Transitions using invariants and state equation in 2119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10349 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s126 1) (GEQ s261 1)), p1:(AND (GEQ s32 1) (GEQ s279 1)), p2:(OR (LT s99 1) (LT s304 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 552 ms.
Product exploration explored 100000 steps with 0 reset in 557 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 252 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 139440 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{1=1}
Probabilistic random walk after 139440 steps, saw 60230 distinct states, run finished after 3002 ms. (steps per millisecond=46 ) properties seen :1
Running SMT prover for 2 properties.
[2023-03-19 18:18:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:18:58] [INFO ] Invariant cache hit.
[2023-03-19 18:18:58] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:19:07] [INFO ] After 9051ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 18:19:07] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 18:19:12] [INFO ] After 5501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 18:19:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:19:24] [INFO ] After 11560ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:24] [INFO ] After 11937ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 253 ms.
[2023-03-19 18:19:25] [INFO ] After 17776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 232 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 18:19:25] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2023-03-19 18:19:25] [INFO ] Computed 2 place invariants in 27 ms
[2023-03-19 18:19:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:19:26] [INFO ] After 965ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:19:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:19:27] [INFO ] After 1297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:19:35] [INFO ] After 8101ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:36] [INFO ] After 8246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 209 ms.
[2023-03-19 18:19:36] [INFO ] After 9847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 183 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 305/305 places, 7809/7809 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 202736 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 202736 steps, saw 70351 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 18:19:39] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 18:19:39] [INFO ] Invariant cache hit.
[2023-03-19 18:19:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 18:19:40] [INFO ] After 1063ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:19:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:19:41] [INFO ] After 1237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:41] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:19:50] [INFO ] After 8100ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:19:50] [INFO ] After 8232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-19 18:19:50] [INFO ] After 9725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 202 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 201 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2023-03-19 18:19:50] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 18:19:50] [INFO ] Invariant cache hit.
[2023-03-19 18:19:51] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-19 18:19:51] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 18:19:51] [INFO ] Invariant cache hit.
[2023-03-19 18:19:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:19:58] [INFO ] Implicit Places using invariants and state equation in 6793 ms returned []
Implicit Place search using SMT with State Equation took 7285 ms to find 0 implicit places.
[2023-03-19 18:19:58] [INFO ] Redundant transitions in 697 ms returned []
[2023-03-19 18:19:58] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 18:19:58] [INFO ] Invariant cache hit.
[2023-03-19 18:20:00] [INFO ] Dead Transitions using invariants and state equation in 2148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10345 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4912 edges and 305 vertex of which 18 / 305 are part of one of the 8 SCC in 5 ms
Free SCC test removed 10 places
Drop transitions removed 1920 transitions
Ensure Unique test removed 3304 transitions
Reduce isomorphic transitions removed 5224 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 295 transition count 2583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 293 transition count 2583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 293 transition count 2577
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 287 transition count 2577
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 284 transition count 2574
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 284 transition count 2572
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 284 transition count 2570
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 282 transition count 2570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 282 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 281 transition count 2569
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 281 transition count 2569
Applied a total of 33 rules in 308 ms. Remains 281 /305 variables (removed 24) and now considering 2569/7809 (removed 5240) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2569 rows 281 cols
[2023-03-19 18:20:01] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-19 18:20:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 18:20:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:20:02] [INFO ] After 931ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:20:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 18:20:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:20:03] [INFO ] After 834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:20:03] [INFO ] After 1146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 669 ms.
[2023-03-19 18:20:04] [INFO ] After 1876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 286 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 33 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:20:04] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 18:20:04] [INFO ] Computed 1 place invariants in 24 ms
[2023-03-19 18:20:05] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-19 18:20:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:20:05] [INFO ] Invariant cache hit.
[2023-03-19 18:20:05] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:20:12] [INFO ] Implicit Places using invariants and state equation in 7596 ms returned []
Implicit Place search using SMT with State Equation took 8056 ms to find 0 implicit places.
[2023-03-19 18:20:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:20:12] [INFO ] Invariant cache hit.
[2023-03-19 18:20:14] [INFO ] Dead Transitions using invariants and state equation in 2151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10244 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 326 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 18:20:15] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:20:15] [INFO ] Invariant cache hit.
[2023-03-19 18:20:15] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:20:24] [INFO ] After 9007ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 18:20:24] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:20:30] [INFO ] After 5615ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 18:20:30] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:20:42] [INFO ] After 12349ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:20:43] [INFO ] After 12977ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 216 ms.
[2023-03-19 18:20:43] [INFO ] After 18893ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 221 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 18:20:43] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2023-03-19 18:20:43] [INFO ] Computed 2 place invariants in 24 ms
[2023-03-19 18:20:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 18:20:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:20:44] [INFO ] After 991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:20:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 18:20:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:20:46] [INFO ] After 1297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:20:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:20:54] [INFO ] After 8235ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:20:54] [INFO ] After 8369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 182 ms.
[2023-03-19 18:20:54] [INFO ] After 9920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 305/305 places, 7809/7809 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 196216 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 196216 steps, saw 67742 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 18:20:57] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 18:20:57] [INFO ] Invariant cache hit.
[2023-03-19 18:20:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 18:20:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 18:20:58] [INFO ] After 996ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:20:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 18:20:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:21:00] [INFO ] After 1286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:21:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:21:08] [INFO ] After 8285ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:21:08] [INFO ] After 8418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-19 18:21:08] [INFO ] After 9959ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 203 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2023-03-19 18:21:09] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 18:21:09] [INFO ] Invariant cache hit.
[2023-03-19 18:21:09] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-19 18:21:09] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 18:21:09] [INFO ] Invariant cache hit.
[2023-03-19 18:21:10] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:21:17] [INFO ] Implicit Places using invariants and state equation in 7554 ms returned []
Implicit Place search using SMT with State Equation took 8029 ms to find 0 implicit places.
[2023-03-19 18:21:18] [INFO ] Redundant transitions in 656 ms returned []
[2023-03-19 18:21:18] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 18:21:18] [INFO ] Invariant cache hit.
[2023-03-19 18:21:20] [INFO ] Dead Transitions using invariants and state equation in 2084 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10981 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4912 edges and 305 vertex of which 18 / 305 are part of one of the 8 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 1920 transitions
Ensure Unique test removed 3304 transitions
Reduce isomorphic transitions removed 5224 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 295 transition count 2583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 293 transition count 2583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 293 transition count 2577
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 287 transition count 2577
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 284 transition count 2574
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 284 transition count 2572
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 284 transition count 2570
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 282 transition count 2570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 282 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 281 transition count 2569
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 281 transition count 2569
Applied a total of 33 rules in 225 ms. Remains 281 /305 variables (removed 24) and now considering 2569/7809 (removed 5240) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2569 rows 281 cols
[2023-03-19 18:21:20] [INFO ] Computed 2 place invariants in 19 ms
[2023-03-19 18:21:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 18:21:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:21:21] [INFO ] After 957ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:21:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 18:21:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:21:22] [INFO ] After 867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:21:22] [INFO ] After 1206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 646 ms.
[2023-03-19 18:21:23] [INFO ] After 1911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 361 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 562 ms.
Product exploration explored 100000 steps with 2 reset in 531 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 236 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:21:26] [INFO ] Redundant transitions in 700 ms returned []
[2023-03-19 18:21:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 18:21:26] [INFO ] Computed 1 place invariants in 21 ms
[2023-03-19 18:21:28] [INFO ] Dead Transitions using invariants and state equation in 2037 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2984 ms. Remains : 305/305 places, 7936/7936 transitions.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:21:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:21:28] [INFO ] Invariant cache hit.
[2023-03-19 18:21:28] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-19 18:21:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:21:28] [INFO ] Invariant cache hit.
[2023-03-19 18:21:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:21:36] [INFO ] Implicit Places using invariants and state equation in 7625 ms returned []
Implicit Place search using SMT with State Equation took 8101 ms to find 0 implicit places.
[2023-03-19 18:21:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:21:36] [INFO ] Invariant cache hit.
[2023-03-19 18:21:38] [INFO ] Dead Transitions using invariants and state equation in 2055 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10187 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b04-LTLFireability-10 finished in 175895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 34 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:21:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:21:39] [INFO ] Invariant cache hit.
[2023-03-19 18:21:39] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-19 18:21:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:21:39] [INFO ] Invariant cache hit.
[2023-03-19 18:21:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:21:46] [INFO ] Implicit Places using invariants and state equation in 7013 ms returned []
Implicit Place search using SMT with State Equation took 7433 ms to find 0 implicit places.
[2023-03-19 18:21:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:21:46] [INFO ] Invariant cache hit.
[2023-03-19 18:21:48] [INFO ] Dead Transitions using invariants and state equation in 2092 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9560 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s21 1) (GEQ s292 1)), p0:(AND (GEQ s97 1) (GEQ s290 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-11 finished in 9685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:21:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:21:48] [INFO ] Invariant cache hit.
[2023-03-19 18:21:49] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-19 18:21:49] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:21:49] [INFO ] Invariant cache hit.
[2023-03-19 18:21:49] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:21:57] [INFO ] Implicit Places using invariants and state equation in 8011 ms returned []
Implicit Place search using SMT with State Equation took 8465 ms to find 0 implicit places.
[2023-03-19 18:21:57] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:21:57] [INFO ] Invariant cache hit.
[2023-03-19 18:21:59] [INFO ] Dead Transitions using invariants and state equation in 2288 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10788 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s110 1) (GEQ s265 1)), p0:(AND (GEQ s67 1) (GEQ s280 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 505 ms.
Stack based approach found an accepted trace after 75 steps with 0 reset with depth 76 and stack size 76 in 1 ms.
FORMULA Szymanski-PT-b04-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-13 finished in 11454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:22:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:22:00] [INFO ] Invariant cache hit.
[2023-03-19 18:22:00] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-19 18:22:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:22:00] [INFO ] Invariant cache hit.
[2023-03-19 18:22:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:22:08] [INFO ] Implicit Places using invariants and state equation in 7479 ms returned []
Implicit Place search using SMT with State Equation took 7921 ms to find 0 implicit places.
[2023-03-19 18:22:08] [INFO ] Redundant transitions in 682 ms returned []
[2023-03-19 18:22:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:22:08] [INFO ] Invariant cache hit.
[2023-03-19 18:22:11] [INFO ] Dead Transitions using invariants and state equation in 2217 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11039 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s83 1) (GEQ s285 1)), p1:(AND (GEQ s74 1) (GEQ s260 1)), p2:(AND (GEQ s84 1) (GEQ s295 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 346 steps with 0 reset in 3 ms.
FORMULA Szymanski-PT-b04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b04-LTLFireability-15 finished in 11239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F((p1||G(p2))))))))'
Found a Lengthening insensitive property : Szymanski-PT-b04-LTLFireability-10
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 47 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:22:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:22:11] [INFO ] Invariant cache hit.
[2023-03-19 18:22:12] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-19 18:22:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:22:12] [INFO ] Invariant cache hit.
[2023-03-19 18:22:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:22:18] [INFO ] Implicit Places using invariants and state equation in 6850 ms returned []
Implicit Place search using SMT with State Equation took 7304 ms to find 0 implicit places.
[2023-03-19 18:22:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:22:18] [INFO ] Invariant cache hit.
[2023-03-19 18:22:21] [INFO ] Dead Transitions using invariants and state equation in 2175 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9546 ms. Remains : 305/305 places, 7936/7936 transitions.
Running random walk in product with property : Szymanski-PT-b04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s126 1) (GEQ s261 1)), p1:(AND (GEQ s32 1) (GEQ s279 1)), p2:(OR (LT s99 1) (LT s304 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 482 ms.
Product exploration explored 100000 steps with 0 reset in 473 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 242 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10003 steps, including 3 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 18:22:22] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:22:22] [INFO ] Invariant cache hit.
[2023-03-19 18:22:22] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 18:22:24] [INFO ] After 1673ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:22:24] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:22:26] [INFO ] After 2377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:22:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:22:31] [INFO ] After 4874ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:22:33] [INFO ] After 6466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1837 ms.
[2023-03-19 18:22:35] [INFO ] After 10750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 211 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 197103 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197103 steps, saw 67834 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 18:22:38] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2023-03-19 18:22:38] [INFO ] Computed 2 place invariants in 21 ms
[2023-03-19 18:22:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 18:22:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:22:39] [INFO ] After 933ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:22:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 18:22:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:22:40] [INFO ] After 1273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:22:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:22:48] [INFO ] After 8172ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:22:48] [INFO ] After 8295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 182 ms.
[2023-03-19 18:22:49] [INFO ] After 9824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2023-03-19 18:22:49] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 18:22:49] [INFO ] Invariant cache hit.
[2023-03-19 18:22:50] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-19 18:22:50] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 18:22:50] [INFO ] Invariant cache hit.
[2023-03-19 18:22:50] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:22:59] [INFO ] Implicit Places using invariants and state equation in 9452 ms returned []
Implicit Place search using SMT with State Equation took 9920 ms to find 0 implicit places.
[2023-03-19 18:23:00] [INFO ] Redundant transitions in 669 ms returned []
[2023-03-19 18:23:00] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 18:23:00] [INFO ] Invariant cache hit.
[2023-03-19 18:23:02] [INFO ] Dead Transitions using invariants and state equation in 2194 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13009 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4912 edges and 305 vertex of which 18 / 305 are part of one of the 8 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions removed 1920 transitions
Ensure Unique test removed 3304 transitions
Reduce isomorphic transitions removed 5224 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 295 transition count 2583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 293 transition count 2583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 293 transition count 2577
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 287 transition count 2577
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 284 transition count 2574
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 284 transition count 2572
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 284 transition count 2570
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 282 transition count 2570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 282 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 281 transition count 2569
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 281 transition count 2569
Applied a total of 33 rules in 218 ms. Remains 281 /305 variables (removed 24) and now considering 2569/7809 (removed 5240) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2569 rows 281 cols
[2023-03-19 18:23:02] [INFO ] Computed 2 place invariants in 21 ms
[2023-03-19 18:23:02] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 18:23:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:23:03] [INFO ] After 906ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:23:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 18:23:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-19 18:23:04] [INFO ] After 872ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:23:04] [INFO ] After 1175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 632 ms.
[2023-03-19 18:23:05] [INFO ] After 1897ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 258 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 32 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:23:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 18:23:05] [INFO ] Computed 1 place invariants in 23 ms
[2023-03-19 18:23:06] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-19 18:23:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:23:06] [INFO ] Invariant cache hit.
[2023-03-19 18:23:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:23:13] [INFO ] Implicit Places using invariants and state equation in 7123 ms returned []
Implicit Place search using SMT with State Equation took 7565 ms to find 0 implicit places.
[2023-03-19 18:23:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:23:13] [INFO ] Invariant cache hit.
[2023-03-19 18:23:15] [INFO ] Dead Transitions using invariants and state equation in 2188 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9788 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 322 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 18:23:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:23:16] [INFO ] Invariant cache hit.
[2023-03-19 18:23:16] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:23:17] [INFO ] After 1604ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:23:17] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:23:20] [INFO ] After 2335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:23:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:23:25] [INFO ] After 4908ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:23:26] [INFO ] After 6515ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1833 ms.
[2023-03-19 18:23:28] [INFO ] After 10749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 198 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 204641 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 204641 steps, saw 71685 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 18:23:31] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2023-03-19 18:23:31] [INFO ] Computed 2 place invariants in 22 ms
[2023-03-19 18:23:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 18:23:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:23:32] [INFO ] After 958ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:23:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 18:23:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:23:34] [INFO ] After 1346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:23:34] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:23:42] [INFO ] After 7962ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 18:23:42] [INFO ] After 8089ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-19 18:23:42] [INFO ] After 9697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 184 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2023-03-19 18:23:42] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 18:23:42] [INFO ] Invariant cache hit.
[2023-03-19 18:23:43] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-19 18:23:43] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 18:23:43] [INFO ] Invariant cache hit.
[2023-03-19 18:23:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:23:52] [INFO ] Implicit Places using invariants and state equation in 9114 ms returned []
Implicit Place search using SMT with State Equation took 9585 ms to find 0 implicit places.
[2023-03-19 18:23:53] [INFO ] Redundant transitions in 642 ms returned []
[2023-03-19 18:23:53] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 18:23:53] [INFO ] Invariant cache hit.
[2023-03-19 18:23:55] [INFO ] Dead Transitions using invariants and state equation in 2196 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12631 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 4912 edges and 305 vertex of which 18 / 305 are part of one of the 8 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 1920 transitions
Ensure Unique test removed 3304 transitions
Reduce isomorphic transitions removed 5224 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 295 transition count 2583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 293 transition count 2583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 293 transition count 2577
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 287 transition count 2577
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 284 transition count 2574
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 284 transition count 2572
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 284 transition count 2570
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 282 transition count 2570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 282 transition count 2569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 281 transition count 2569
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 281 transition count 2569
Applied a total of 33 rules in 226 ms. Remains 281 /305 variables (removed 24) and now considering 2569/7809 (removed 5240) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2569 rows 281 cols
[2023-03-19 18:23:55] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-19 18:23:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-19 18:23:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 18:23:56] [INFO ] After 885ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 18:23:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 18:23:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 18:23:57] [INFO ] After 803ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 18:23:57] [INFO ] After 1106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 615 ms.
[2023-03-19 18:23:58] [INFO ] After 1802ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 345 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5 reset in 448 ms.
Product exploration explored 100000 steps with 1 reset in 424 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:24:01] [INFO ] Redundant transitions in 665 ms returned []
[2023-03-19 18:24:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 18:24:01] [INFO ] Computed 1 place invariants in 15 ms
[2023-03-19 18:24:03] [INFO ] Dead Transitions using invariants and state equation in 2264 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3157 ms. Remains : 305/305 places, 7936/7936 transitions.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 26 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 18:24:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:24:03] [INFO ] Invariant cache hit.
[2023-03-19 18:24:03] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-19 18:24:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:24:03] [INFO ] Invariant cache hit.
[2023-03-19 18:24:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 18:24:11] [INFO ] Implicit Places using invariants and state equation in 7364 ms returned []
Implicit Place search using SMT with State Equation took 7795 ms to find 0 implicit places.
[2023-03-19 18:24:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 18:24:11] [INFO ] Invariant cache hit.
[2023-03-19 18:24:13] [INFO ] Dead Transitions using invariants and state equation in 1968 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9791 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b04-LTLFireability-10 finished in 122068 ms.
[2023-03-19 18:24:13] [INFO ] Flatten gal took : 217 ms
[2023-03-19 18:24:13] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 18:24:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7936 transitions and 31616 arcs took 43 ms.
Total runtime 546272 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1405/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Szymanski-PT-b04-LTLFireability-10

BK_STOP 1679250256520

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Szymanski-PT-b04-LTLFireability-10
ltl formula formula --ltl=/tmp/1405/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 305 places, 7936 transitions and 31616 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1405/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.390 real 0.290 user 0.330 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1405/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1405/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1405/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
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="Szymanski-PT-b04"
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 Szymanski-PT-b04, 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 r489-tall-167912706800460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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